If have 3 (positive) factors, find the sum of all possible positive integer values of .
Factors are also called divisors, and include 1 and itself. e.g. 7 has 2 factors.
This problem is part of the set Easy Problems
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.
First, for p 2 to have 3 positive factors it must be the case that p is prime, (the 3 factors then being 1 , p and p 2 ).
Next, for 1 2 p + 1 to have 3 factors we must have that 1 2 p + 1 = q 2 where q is prime. Now p = 2 gives us 1 2 p + 1 = 2 5 = 5 2 , and since 5 is prime we have p = 2 as one solution.
For p = 3 we have 1 2 p + 1 = 3 7 which is not the square of a prime, (or of any number for that matter), so 3 is not a solution.
Now suppose p is any prime greater than 3 , and that 1 2 p + 1 = q 2 for some prime q , (also greater than 3 ). Then 1 2 p = q 2 − 1 = ( q − 1 ) ( q + 1 ) . Now clearly q will be odd so both q − 1 and q + 1 will be even and hence both divisible by 2 . Also, since q − 1 and q + 1 are consecutive even numbers, one of them will be divisible by 4 . Finally, since for any three consecutive integers one of them must be divisible by 3 , one of q − 1 , q or q + 1 must be divisible by 3 . But q is a prime greater than 3 so cannot be divisible by 3 , and thus one of q − 1 or q + 1 must be divisible by 3 .
This implies that ( q − 1 ) ( q + 1 ) is divisible by 2 ∗ 4 ∗ 3 = 2 4 , i.e., that ( q − 1 ) ( q + 1 ) = 2 4 n for some integer n , and so 1 2 p = 2 4 n ⟹ p = 2 n . But we assumed that p was a prime greater than 3 and hence cannot be divisible by 2 . We thus have a contradiction, implying that no prime greater than 3 can be a solution to this problem.
We are thus left with p = 2 as the only solution to this problem, and the desired sum is just 2 .