Problem #9

If 12 p + 1 , p 2 12p+1, p^{2} have 3 (positive) factors, find the sum of all possible positive integer values of p p .

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


The answer is 2.

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.

1 solution

First, for p 2 p^{2} to have 3 3 positive factors it must be the case that p p is prime, (the 3 3 factors then being 1 , p 1, p and p 2 p^{2} ).

Next, for 12 p + 1 12p + 1 to have 3 3 factors we must have that 12 p + 1 = q 2 12p + 1 = q^{2} where q q is prime. Now p = 2 p = 2 gives us 12 p + 1 = 25 = 5 2 12p + 1 = 25 = 5^{2} , and since 5 5 is prime we have p = 2 p = 2 as one solution.

For p = 3 p = 3 we have 12 p + 1 = 37 12p + 1 = 37 which is not the square of a prime, (or of any number for that matter), so 3 3 is not a solution.

Now suppose p p is any prime greater than 3 3 , and that 12 p + 1 = q 2 12p + 1 = q^{2} for some prime q q , (also greater than 3 3 ). Then 12 p = q 2 1 = ( q 1 ) ( q + 1 ) 12p = q^{2} - 1 = (q - 1)(q + 1) . Now clearly q q will be odd so both q 1 q - 1 and q + 1 q + 1 will be even and hence both divisible by 2 2 . Also, since q 1 q - 1 and q + 1 q + 1 are consecutive even numbers, one of them will be divisible by 4 4 . Finally, since for any three consecutive integers one of them must be divisible by 3 3 , one of q 1 , q q - 1, q or q + 1 q + 1 must be divisible by 3 3 . But q q is a prime greater than 3 3 so cannot be divisible by 3 3 , and thus one of q 1 q - 1 or q + 1 q + 1 must be divisible by 3 3 .

This implies that ( q 1 ) ( q + 1 ) (q - 1)(q + 1) is divisible by 2 4 3 = 24 2*4*3 = 24 , i.e., that ( q 1 ) ( q + 1 ) = 24 n (q - 1)(q + 1) = 24n for some integer n n , and so 12 p = 24 n p = 2 n 12p = 24n \Longrightarrow p = 2n . But we assumed that p p was a prime greater than 3 3 and hence cannot be divisible by 2 2 . We thus have a contradiction, implying that no prime greater than 3 3 can be a solution to this problem.

We are thus left with p = 2 p = 2 as the only solution to this problem, and the desired sum is just 2 \boxed{2} .

@Joel Tan Nice set of problems. Thanks for posting them. :)

Brian Charlesworth - 6 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...