Find the sum of all positive integers which has exactly four positive divisors and that those four divisors sum to be a perfect square.
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.
* Edited solution. Thanks to Kushagra Sahni for his input. *
For a positive integer m to have exactly four positive divisors we must either have that (i) m = p 3 for some prime p or (ii) m = p q for distinct primes p , q .
In case (i), since m ≤ 1 2 0 the only possibilities to consider are for p = 2 and p = 3 , since 5 3 = 1 2 5 > 1 2 0 . For m = 2 3 = 8 the divisor sum is 1 + 2 + 4 + 8 = 1 5 , and for m = 3 3 = 2 7 the divisor sum is 1 + 3 + 9 + 2 7 = 4 0 . Since neither of these divisor sums is a perfect square, this case yields no solution values for m .
In case (ii), for the sum of the divisors to be a perfect square, we require that
1 + p + q + p q = n 2 ⟹ ( p + 1 ) ( q + 1 ) = n 2 for some (positive) integer n .
Now as p , q must be distinct we can assume without loss of generality that p < q . Then since 1 1 2 = 1 2 1 > 1 2 0 we must have that p ≤ 7 , for otherwise m = p q will exceed 1 2 0 . Thus we only need look at 2 , 3 , 5 , 7 as possible values for p .
With p = 2 we see that q ≤ 5 9 and that 3 ( q + 1 ) = n 2 ⟹ q + 1 = 3 a 2 ≤ 6 0 for some integer a > 1 . As 3 ∗ 5 2 = 7 5 > 6 0 the maximum value for a is then 4 . So checking the three possible remaining values for a , we find that ( a , q ) = ( 2 , 1 1 ) , ( 3 , 2 6 ) , ( 4 , 4 7 ) , where in only the first and last of these pairings is q prime. Thus ( p , q ) = ( 2 , 1 1 ) , ( 2 , 4 7 ) ⟹ 2 ∗ 1 1 = 2 2 , 2 ∗ 4 7 = 9 4 are solution values for m .
With p = 3 we see that q ≤ 3 7 and that 4 ( q + 1 ) = n 2 ⟹ q + 1 = a 2 for some integer a . But q = a 2 − 1 = ( a − 1 ) ( a + 1 ) implies that a = 2 in order for q to be prime, which in turn implies that q = 3 , which is not distinct from p . Hence there are no solutions for m with p = 3 .
With p = 5 we see that q ≤ 2 3 and that 6 ( q + 1 ) = n 2 ⟹ q + 1 = 6 a 2 for some integer a > 1 . As 6 ∗ 3 2 = 5 4 > 2 3 the only remaining possible value for a is 2 , which yields that q + 1 = 6 ∗ 2 2 ⟹ q = 2 3 , which is indeed prime. Thus m = p q = 5 ∗ 2 3 = 1 1 5 is another solution value.
Finally, with p = 7 we have that q ≤ 1 7 and that 8 ( q + 1 ) = n 2 ⟹ q + 1 = 2 a 2 for some integer a > 1 . The possible pairings for ( a , q ) are then ( 2 , 7 ) and ( 3 , 1 7 ) , with only the latter providing a distinct prime value for q . Thus m = p q = 7 ∗ 1 7 = 1 1 9 is our last solution.
The sum of the desired values for m is then 2 2 + 9 4 + 1 1 5 + 1 1 9 = 3 5 0 .