A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • one year ago

The pentagonal numbers p1, p2, p3,....pk are the integers that count the number of dots in k nested pentagon, as shown in the figure ( in comment) Show that p1 =1 and \(p_k =p_{k-1}+ (3k -2) \) for \(k\geq 2\). Conclude that \(\sum_{k=1}^n (3k -2)\) and evaluate this sum to find a simple formula for \(p_n\) Please help

  • This Question is Closed
  1. Loser66
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0


  2. beginnersmind
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    If you look at the figure you can see that at every step you're basically lengthening the bottom edges by one, and adding 3 edges with k dots each. So at every step you add 2+3k-4 dots. The -4 represents the fact that we double counted the 4 vertices we added. This gives the rule p_k+1 = p_k + 3k-2. For evaluating the sum you can use the sum formula for arithmetic sequences.

  3. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...


  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.