A positive integer is funny if for each of its positive divisors , the number is prime . Find the sum of all funny numbers that have the most quantity of 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.
We have several observations:
Thus either n = 3 a or n = 3 a ( 3 p + 2 ) , where a is a nonnegative number and 3 p + 2 is prime. (If not, then n has more than one prime divisors that aren't 3; either some of them are 3 k + 1 , or all of them are 3 k + 2 and hence there are at least two of them.)
Observe that n = 1 3 5 = 3 3 ⋅ 5 satisfies this condition, with 8 positive divisors. Also observe that 3 5 + 2 = 2 4 5 is not prime (multiple of 5), so a ≤ 4 . Thus n = 3 a is impossible since it only has a + 1 < 8 positive divisors.
Now, n = 3 a ( 3 p + 2 ) has 2 ( a + 1 ) positive divisors, so we need a ≥ 3 . Thus 3 p + 2 , 3 ( 3 p + 2 ) , 9 ( 3 p + 2 ) , 2 7 ( 3 p + 2 ) are all divisors of n . Note that they are congruent to 3 p + 2 , 2 ( 3 p + 2 ) , 3 ( 3 p + 2 ) , 4 ( 3 p + 2 ) modulo 5. If 3 p + 2 = 5 , then 3 p + 2 is not divisible by 5, and thus these four form an almost complete congruence classes modulo 5 (they are 1, 2, 3, 4 modulo 5 in some order). Suppose 3 b ( 3 p + 2 ) ≡ 3 ( m o d 5 ) . Then 3 b ( 3 p + 2 ) + 2 ≡ 0 ( m o d 5 ) , and clearly since 3 p + 2 ≥ 5 , 3 b ( 3 p + 2 ) + 2 = 5 . Thus it is divisible by 5 and hence not prime.
Thus the assumption 3 p + 2 = 5 is false, so 3 p + 2 = 5 . It can be verified that 3 4 ⋅ 5 + 2 = 4 0 7 is not prime (multiple of 11), so the n with the most positive divisors is 3 3 ⋅ 5 = 1 3 5 .