Find the sum of all primes such that has exactly six divisors (including 1 and itself)
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.
Taking mod 6 , we see that p 2 + 1 1 ≡ p 2 − 1 ( m o d 6 ) .
Now note that except for p = 2 , 3 , all primes p ≡ 1 , − 1 ( m o d 6 ) . Thus, p 2 − 1 ≡ ( − 1 or 1 ) 2 − 1 ≡ 0 ( m o d 6 ) .
Thus, 6 ∣ p 2 + 1 1 .
Now, notice that we must have that p cannot have any prime factors greater than 3 . Otherwise, p 2 + 1 1 has at least three distinct factors and the smallest possible number of factors is 2 × 2 × 2 = 8 > 6 .
Thus, p 2 + 1 1 = 2 2 × 3 = 1 2 or p 2 + 1 1 = 2 × 3 2 = 1 8 .
However, checking all primes p ≥ 5 , we see that p 2 + 1 1 ≥ 3 6 > 1 8 so there are no solutions with p ≥ 5 .
Now we check p = 2 , 3 . If p = 2 , then p 2 + 1 1 = 4 + 1 1 = 1 5 which has 4 factors.
We check p = 3 . p 2 + 1 1 = 2 0 which has three factors. Thus, our answer is 3 .