Find the sum of all positive prime numbers such that has exactly distinct positive divisors.
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.
Note that:
1) Since p 2 + 1 1 has six divisors, it has to be of the form k 1 2 k 2 , where k 1 , k 2 are primes.
2) 3 is a solution, because 3 2 + 1 1 = 2 0 , which has six divisors ( 1 , 2 , 4 , 5 , 1 0 , 2 0 )
3) 2 is not a solution (easy to check), which implies p is odd, and when we add 1 1 , the number becomes even. Thus, we can conclude that either k 1 or k 2 is 2 .
Assume p = 3 . Then, p ≡ 1 ( m o d 3 ) or p ≡ 2 ( m o d 3 ) . Either way, p 2 ≡ 1 ( m o d 3 ) , and when summed to 1 1 , the result will be divisible by 3 . We can conclude that either k 1 or k 2 is 3 .
Since the pairs ( k 1 , k 2 ) = ( 2 , 3 ) and ( k 1 , k 2 ) = ( 3 , 2 ) don't yield any solutions in primes, we conclude that either k 1 or k 2 has to be 3 and 2 at the same time, which is absurd.
Thus, the only solution is p = 3 , and so, the sum of the solutions is also 3 .