Find the number of (unordered) integer solutions to the equation:
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 u = x y + 2 and v = x + y + 1 . Substituting in, the equation becomes 2 u 2 − 6 ( v − 1 ) 2 = ( v − 2 ) 3 − 6 .
Expanding both sides, 2 u 2 − 6 v 2 + 1 2 v − 6 = v 3 − 6 v 2 + 1 2 v − 8 − 6 . Cancelling terms, we're left with 2 u 2 = v 3 − 8 .
Clearly, v must be even; put v = 2 b to get 2 u 2 = 8 b 3 − 8 , or u 2 = 4 b 3 − 4 .
Again, u must be even; put u = 2 a and divide through by 4 to get a 2 = b 3 − 1
This is an example of Mordell's equation. It can be shown* that this equation has exactly one solution in integers, namely a = 0 , b = 1 . Substituting back through the above, we find x y = − 2 and x + y = 1 , so that the only solutions are ( x , y ) = ( − 2 , 1 ) and ( x , y ) = ( 1 , − 2 ) , ie there is exactly 1 solution to the original equation ignoring ordering.
* proofs of this can be found here (using factorisation over Gaussian integers) or here (using elementary number theory). Alternatively, the existence of a unique integer solution is a consequence of Catalan's conjecture.