The above shows the first 4 pentagonal numbers , namely 1, 5, 12, 22.
How many points need to be added to the 3 6 th pentagonal number to get the 3 7 th pentagonal number?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice use of AP (+1)
Would you proof it? Pattern recognition is not a formal proof anyway.
Why is a = 1?
I did 2n + (n - 2) so (2 x 37) + (37 - 2) becomes 74 +35 and thus 109
I use the formula (n-1)*3+4=answer .Because we have n-1 3s,plus 4,5-1,to get it .
this is wrong. their is another sequence and i got answer has 35.boo
Relevant wiki: General Term Pattern Recognition
The pentagonal number general formula is: p n = 2 3 n 2 − n
Therefore, the number that has to be added to get a next one is:
p n + 1 − p n = 2 3 ( n + 1 ) 2 − ( n + 1 ) − 2 3 n 2 − n = 2 3 ( n 2 + 2 n + 1 ) − ( n + 1 ) − ( 3 n 2 − n ) = 2 3 n 2 + 6 n + 3 − n − 1 − 3 n 2 + n = 2 6 n + 2 = 3 n + 1
which n is the current pentagonal number, in this case, it's 3 6 ; n + 1 is the next pentagonal number we want to get, in this case is 37.
Apply the formula, n = 3 6 , therefore, the number of points we have to add to get the 37th pentagonal number is 3 × 3 6 + 1 = 1 0 9
Can you tell me how you derived that formula? I used arithmetic formula.
Log in to reply
On the Wiki they have that formula, you can try induction to prove that too
3n+1 ... so to get the 37th pentagonal number, you have to add 3(36) + 1 = 109 p0ints.
Or 3n-2. We see the number of dots added going 1,4,7,10...and so on. With n representing which pentagon we are on, solving for n=37 gives us 3(37)-2=109. So on the 37th pentagon we added 109 dots.
Observe that the n th pentagonal number is of the form n 2 + i = 1 ∑ n − 1 i .
So, the 3 6 th pentagonal number is 3 6 2 + i = 1 ∑ 3 5 i and the 3 7 th one is 3 7 2 + i = 1 ∑ 3 6 i
So, the number of points that have to be added is:-
3
7
2
+
i
=
1
∑
3
6
i
−
(
n
2
+
i
=
1
∑
n
−
1
i
)
=
3
7
2
−
3
6
2
+
2
3
6
×
3
7
−
2
3
5
×
3
6
=
(
3
6
+
3
7
)
(
3
7
−
3
6
)
+
1
8
(
3
7
−
3
5
)
=
7
3
+
1
8
×
2
=
7
3
+
3
6
=
1
0
9
Really beautiful solution actually!
Wow, cool formula derivation
Note that your LaTeX for n th is not showing properly
The 1st pentagon has a side of 1 (it's a degenerate pentagon of size 1). The 2nd pentagon has a side of 2, the 3rd a side of 3, etc. The number of points added follows a pattern for an n-sided pentagon from an (n-1)-sided pentagon of n+n+(n-2).
The 37th pentagon will have a side of 37, and the number of points added will need to be 37+37+(37-2) = 109.
Here each edge has n dots.Now for pink dots there are 3 edges from 3rd. By adding all those in 3 edges we get 3n.But 2 dots we count twice so 3n-2.
I think another solution is n+2(n-1) Here it is 37+2(37-1)=109
Since this pattern is pentagonal, you always add three sides on the top of the previous one to continue the pattern. Each side has n points, and these three sides share two vertices. When counting points on each side, you will repeat twice of these two vertices. Thus, the difference between n-1 th and n th = 3n - 2. when n=37, difference = 3 x 37 - 2=109.
math is like the lunch table (differences matter), so let's make a chart: let's explain the columns: n counts the pentagons, where n=1 is our first pentagon and n=36 is the one we're asked about; f(n) counts the dots in pentagon #n; f'(n) counts how many dots we added from the last pentagon, and f''(n) counts how many dots we added to f'(n)
n: | f(n): | f'(n): | f''(n): |
1 | 1 | 4 | 3 |
2 | 5 | 7 | 3 |
3 | 12 | 10 | ? |
4 | 22 | ? | ? |
5 | ? | ? | ? |
(goes on forever)
anyways, notice that the right column, f''(n) is constant for the first two. Let's assume that, if it was gonna change, it would've (theres 3 tries so being lazy is chill), which means f''(n)=3 (that's our conjecture, for now). If you've taken calculus, yk where this is going: you can integrate f''(n) to get f'(n)* and, if you do it right, you get f'(n)=3n+C, and we know f'(2)=7=3(2)+C, which means C is 1. So, we can write f'(n)=3n+1**which gives us the # of dots that are gonna get added as a function of n.
Plugging in n=36 (bc we wanna know what the jump is from 36 to 37), we get 3(36)+1=109, and that works! if you wanna challenge yourselves, find another way to interpret any of these columns (as a matrix or wtv idk), and take a look inside the centers of the pentagons.
*more specifically, you switch from n to x, where x varies over all real #s, not just whole ones, & integrate that. it's the same tho.
Each of the n-th figure has n sized boundary sides. There are three slanted sides which are added in a new figure. In the newly added sides, 2 end points coincide for the middle side.
So, the number of additional points in the n-th figure is - (3*n)-2.
The n + 1 t h number in the sequence is equal to the n t h number plus 3 n + 1 .
Here we have n = 3 6 so calculating 3 ( 3 6 ) + 1 gives us 109.
You can use simple equation 4 + 3 ( n − 1 ) = x , n ≥ 1 , where:
n
- number of pentagonal, to which you want to add points to receive value of
n
+
1
;
x
- difference between
(
n
+
1
)
th
and
n
th
pentagonals.
Problem Loading...
Note Loading...
Set Loading...
Notice that for every figure, the pink colored dots represent the newly added dots, while the black color dots represent the dots from the previous figure.
We notice that the added dots for the first 4 figures are 1 , 4 , 7 , 1 0
This implies that the number of dots added to each figure follow an arithmetic progression where a = 1 , d = 3
Therefore, the number of dots added to the 3 7 th figure = 1 + ( 3 7 − 1 ) ( 3 ) = 1 + 3 6 ( 3 ) = 1 + 1 0 8 = 1 0 9