Primes

Number Theory Level pending

Find the sum of all positive prime numbers p p such that p 2 + 11 p^2+11 has exactly 6 6 distinct positive divisors.


The answer is 3.

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.

1 solution

Note that:

1) Since p 2 + 11 p^2+11 has six divisors, it has to be of the form k 1 2 k 2 k_1^2k_2 , where k 1 k_1 , k 2 k_2 are primes.

2) 3 3 is a solution, because 3 2 + 11 = 20 3^2+11=20 , which has six divisors ( 1 , 2 , 4 , 5 , 10 , 20 ) 1, 2, 4, 5, 10, 20)

3) 2 2 is not a solution (easy to check), which implies p p is odd, and when we add 11 11 , the number becomes even. Thus, we can conclude that either k 1 k_1 or k 2 k_2 is 2 2 .

Assume p 3 p\not=3 . Then, p 1 ( m o d 3 ) p\equiv1\pmod{3} or p 2 ( m o d 3 ) p\equiv2\pmod{3} . Either way, p 2 1 ( m o d 3 ) p^2\equiv1\pmod{3} , and when summed to 11 11 , the result will be divisible by 3 3 . We can conclude that either k 1 k_1 or k 2 k_2 is 3 3 .

Since the pairs ( k 1 , k 2 ) = ( 2 , 3 ) (k_1,k_2)=(2,3) and ( k 1 , k 2 ) = ( 3 , 2 ) (k_1,k_2)=(3,2) don't yield any solutions in primes, we conclude that either k 1 k_1 or k 2 k_2 has to be 3 3 and 2 2 at the same time, which is absurd.

Thus, the only solution is p = 3 p=3 , and so, the sum of the solutions is also 3 3 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...