Find the number of ordered pairs of distinct positive primes , ( ) such that is the square of an integer.
This problem is shared by Diganta B.
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.
Let p , q be primes such that p 2 + 7 p q + q 2 = m 2 for some positive integer m .
Then
5 p q = m 2 − ( p + q ) 2 = ( m + p + q ) ( m − p − q ) .
Then 5 , p , and q divide the product on the right hand side of the equation. We can immediately rule out the possibilities m + p + q = p , q , 5 , 1 (the case = 5 is ruled out since m > p , m > q and p , q are at least 2 ).
Consider the case m + p + q = 5 p and m − p − q = q . Eliminating m , we obtain 2 ( p + q ) = 5 p − q , or p = q .
Similarly, considering the case m + p + q = 5 q and m − p − q = p leads to p = q .
Consider the case m + p + q = p q and m − p − q = 5 . Eliminating m , we obtain 2 ( p + q ) = p q − 5 . This can be reduced to ( p − 2 ) ( q − 2 ) = 9 , with solutions p = q = 5 or ( p , q ) = ( 3 , 1 1 ) , ( 1 1 , 3 ) .
Finally consider the case m + p + q = 5 p q and m − p − q = 1 . Eliminating m , we obtain 2 ( p + q ) = 5 p q − 1 . This can be reduced to ( 5 p − 2 ) ( 5 q − 2 ) = 9 , which gives p = q = 1 , clearly not prime.
Thus, the set of solutions ( p , q ) with p = q is ( 3 , 1 1 ) , ( 1 1 , 3 ) .
Note: This problem is taken from RMO/2001/2 .