Miscellaneous Diophantine Equations 

x^{2} + y^{2} = z^{4}, x + y = w^{2} 

In a letter to St. Martin and Frenicle on May 31, 1643, Fermat asked for a rational right triangle whose hypotenuse and the sum of whose legs are squares. In other words, he suggested the problem of finding a Pythagorean triple x,y,z with x^{2} + y^{2} = z^{2} such that x+y and z were both squares. He then gave the solution 

_{} 

and stated that it was the smallest possible. Dickson describes several solution methods, including the one used by Fermat, and another method by Euler. We seek two integers x,y such that x + y is a square and x^{2} + y^{2} is a fourth power. Euler noted that if we set x = p^{2}  q^{2} and y = 2pq then x^{2} + y^{2} is equal to the square (p^{2} + q^{2})^{2}, and we can make p^{2} + q^{2} a square by setting p = r^{2}  s^{2} and q = 2rs, which gives x^{2} + y^{2} = (r^{2} + s^{2})^{4}. This also gives 

_{} 

Dividing through the right hand polynomial by s^{4} and setting t = r/s, we seek a rational number t such that 

_{} 

is a rational square. (This is an elliptic curve.) Since the leading and trailing coefficients are squares, it’s easy to see that this polynomial differs from (t^{2} – 2t + 1)^{2} by 4t^{2}(2t  3), so we have the rational solution t = 3/2. However, we want the edge lengths x and y of our triangle to be positive, which requires p greater than q, which implies t must be greater than 2.414 or less than 0.414. The value t = 3/2 gives a negative value of x, so even though it is a solution, it doesn’t satisfy the implicit positivity requirement of Fermat’s original question. We therefore seek other solutions, to see if we can find one that gives positive values of x and y. To do this, suppose we set t = T + q in the above polynomial, where q is an arbitrary rational number. This gives 

_{} 

As before, it would be simple to find a rational value of T that makes this expression a square, provided the leading and trailing coefficients are squares. Notice that the trailing coefficient has the same form as the original polynomial in t, which we already know how to make into a square, by setting q = 3/2, which was our previous solution. When we make this substitution, the polynomial becomes 
_{} 

This differs from the square of (T^{2}  37T  1/4)^{2} by T^{2}(84T  1343), and hence a solution is T = 1343/84. Therefore, we have t = T + q = 1469/84, so we can take r = 1469 and s = 84, and compute x = 4565486027761 and y = 1061652293520. This the solution Fermat sent to Frenicle, and we can confirm that 

_{} 

We could continue to generate larger solutions by iterating the steps that took us from the original solution 3/2 to the next solution 1469/84. Presumably Fermat’s assertion that this is the smallest solution was based on his understanding that all the solutions can be generated in a similar way. This is equivalent to the “tangent and chord” method in the theory of elliptic curves. 


a^{4} + b^{3} = c^{2} 

There are infinitely many primitive solutions to the Diophantine equation 

_{} 

To prove this, factor the equation b^{3} = c^{2}  a^{4} as 
_{} 

If a and c have opposite parity the two factors on the right are coprime, so we have integers m,n such that 

_{} 

It follows that we have a solution if we can find integers a,c of the form 

_{} 

These values of a^{2} and c are clearly integers (since m and n are both odd), so the only constraint on m,n is that they make "a" an integer. There are several ways of constructing an infinite family with this property. For example, if we restrict ourselves to "twin" values of m and n, meaning that m = k+1 and n = k1, the above equation for a^{2} becomes 

_{} 

which is a Pell equation. By the usual methods we have the solutions given by k = 0, 1, 4, 15, 56, 209, 780, ... and in general by the recurrence 

_{} 

Obviously these values of k alternate between odd and even. The odd values give even values of m and n, so those correspond to nonprimitive solutions, such as 26^{4} + 224^{3} = 3420^{2}, whereas the even values of k give odd values of m and n, and the corresponding solutions of the original equation are primitive. For example, with k = 4 we have m = 5, n = 3, which gives the solution a = 7, b = 15, c = 76. The next primitive solution in this family is based on the Pell solution k = 56, which gives m = 57, n = 55 and so a = 97, b = 3135, c = 175784. The next such solution would be based on the even Pell solution k = 780, and so on. We can create other infinite families in a similar way by defining a linear relation between m and n. 


_{} 

Someone asked how to find the integer solutions of 

_{} 

This can be viewed as a Pell equation with an extra condition on the solution. Squaring both sides twice gives 

_{} 

which implies that n(kn+1) is a square. Since n and kn+1 have no common factor they must each be squares, so we know there exist integers x,y such that 

_{} 

Eliminating n from the first two equations gives the Pell equation 

_{} 

For any given k we're looking for solutions x,y such that x+y is a square. Of course, for any positive integer k there are infinitely many solutions to the Pell equation, but solutions with x + y = square are rare. For example, with k=8 the values of x+y such that x,y satisfy the Pell equation are 

_{} 

This gives the sequence 4, 23, 134, 781, 4552..., which satisfies the second order recurrence s[j] = 6s[j1]  s[j2]. The initial value 4 in this sequence corresponds to the solution n=1,k=8,m=2 of the original equation. The question is whether this sequence contains any squares after the initial value 4. 

So the problem reduces to finding the square terms of a general secondorder recurring sequence, like the Fibonacci sequence. It is known (but not entirely trivial to prove) that the only square Fibonacci numbers are 0, 1, and 144. Thus to fully characterize all the solutions of the original equation we would need to prove the analogous result for each of the general secondorder recurrence sequences arising as solutions of the Pell equation with all values of k. 


n! + 1 = x^{2} 

There are only three known solutions (in positive integers) of the equation n! + 1 = m^{2}, namely 

_{} 

Are there any others? The latest result I've seen is a paper by Berend and Osgood in J Num Thry (1992, vol 42), which gives a proof that for any polynomial P of degree > 1 the set of positive integers n for which P(x) = n! has an integer solution x is of zero density. However, the paper states that it is not known if the particular equation x^{2}  1 = n! has only finitely many solutions. Does anyone know of any further results? 
