Find the sum of all primes such that has less than 16 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.
If p = 2 , then p 2 + 2 5 4 3 = 2 5 4 7 = 3 2 × 2 8 3 has 6 positive divisors, satisfied.
If p = 3 , then p 2 + 2 5 4 3 = 2 5 5 2 = 2 3 × 1 1 × 2 9 has 1 6 positive divisors, not satisfied.
If p > 3 , we have p 2 ≡ 1 ( m o d 3 ) and p 2 ≡ 1 ( m o d 8 ) .
Thus, p 2 + 2 5 4 3 ≡ 0 ( m o d 3 ) and p 2 + 2 5 4 3 ≡ ( m o d 8 ) .
So, p 2 + 2 5 4 3 = 2 3 + α 1 . 3 1 + α 2 . p 3 α 3 … p k α k
Hence the number positive integers of p 2 + 2 5 4 3 is
( α 1 + 4 ) ( α 2 + 2 ) ( α 3 + 1 ) … ( α k + 1 ) ≥ 1 6 , a contradiction.
So, p = 2 is unique solution.