Given that and are natural numbers and divides , is it possible for to be a prime number?
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.
Suppose that N ∈ N is such that there exist x , y ∈ N such that 1 + x y x 2 + y 2 = N ( ∗ ) If x = y then N = 1 . Suppose that N > 1 , so that x = y . Suppose for definiteness that x > y . Then x is a solution of the quadratic X 2 − N y X + ( y 2 − N ) = 0 and the other solution z = N y − x is an integer such that y > z (since x z < y 2 and x > y ) and 1 + y z y 2 + z 2 = N If z < 0 then 1 + y z ≤ 0 , which means that N is either infinite or negative. Thus we deduce that z ≥ 0 .
If z > 0 then we can repeat the process, coming up with another solution ( z , w ) of ( ∗ ) with z > w ≥ 0 . By induction, we can find a sequence of integers n 1 , n 2 , . . . , n K , n K + 1 defined by n 1 = x n 2 = y n k + 1 = N n k − n k − 1 2 ≤ k ≤ N where n 1 > n 2 > ⋯ > n K > n K + 1 = 0 (the sequence must terminate) such that 1 + n k n k + 1 n k 2 + n k + 1 2 = N 1 ≤ k ≤ K Putting k = K in this last identity we see that N = n K 2 is a perfect square.
Thus 1 + x y x 2 + y 2 is a perfect square whenever it is an integer, and hence cannot be prime.