The th polygonal number is a number that can be represented as dots or pebbles arranged in the shape of a -sided regular polygon, for some integer . Let be one of the many polygonal numbers, which satisfies: If is the sum of all possible values of that satisfy the given conditions of ; is the Euler totient function of ; and and are consecutive primes, then find the value of: Acknowledgements: Credits to my friends John Thomas Chuatak and Nathanael Joshua Balete for contributing to the problem formulation.
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.
Observe the following structure of polygonal numbers P ( s , n ) :
Source: http://i1.wp.com/mathandmultimedia.com/wp-content/uploads/2012/08/polygonal-numbers.png
The n th s -gonal number can be represented as a "polygon" with side length n , a single dot at one corner (red), s − 1 "sticks" of length n − 1 (blue), and s − 2 "triangles" of dimension n − 2 (yellow), where each triangle represents a triangular number.
Each triangular number of dimension n − 2 is the sum of the first n − 2 positive integers. Hence:
1 + 2 + 3 + ⋯ + n − 2 = 2 1 ( n − 2 ) ( n − 1 )
Therefore,
P ( s , n ) = 1 + N s t i c k s + N t r i a n g l e s = 1 + ( s − 1 ) ( n − 1 ) + ( s − 2 ) [ 2 1 ( n − 2 ) ( n − 1 ) ] = 2 ( s − 2 ) n 2 − ( s − 4 ) n
Since b prime min ( a + b ) ( a − b ) = 2 0 2 1 and a = P ( s , n ) ∈ Z + , then:
( a + b ) ( a − b ) ≥ 2 0 2 1
a 2 ≥ b 2 + 2 0 2 1
a ≥ b 2 + 2 0 2 1 > b > 0
Therefore, a + b > a − b ∈ Z + . We then convenient notice that 2 0 2 1 = 4 3 × 4 7 = 2 0 2 1 × 1 :
a + b = 4 7 a − b = 4 3 ( a , b ) = ( 4 5 , 2 )
a + b = 2 0 2 1 a − b = 1 ( a , b ) = ( 1 0 1 1 , 1 0 0 0 )
...in which the latter does not satisfy the condition of b being prime. Note as well that since a distinct solution exists that satisfies the given conditions, there can no longer be any other solution for ( a , b ) .
We then look at the possible values of s and n and yield the following solutions: P ( 3 , 9 ) , P ( 6 , 5 ) , P ( 1 6 , 3 ) , P ( 4 5 , 2 ) .
Therefore,
S = 3 + 6 + 1 6 + 4 5 = 7 0 Φ ( S ) = 7 0 ( 1 − 2 1 ) ( 1 − 5 1 ) ( 1 − 7 1 ) = 2 4 S + Φ ( S ) + Φ ( S ) = 9 8 . 8 9 9 …
i , j ≤ S + Φ ( S ) + Φ ( S ) ∑ i + j = i , j ≤ 9 8 . 8 9 9 … ∑ i + j = ( 2 + 3 ) + ( 3 + 5 ) + ⋯ + ( 8 3 + 8 9 ) + ( 8 9 + 9 7 ) = 2 0 2 1