How many integer solutions are there to the following expression?
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.
Set x = k ( 2 k 2 + 1 ) , y = 2 k 2 + 1 , z = − k ( 2 k 2 + 1 ) for k = 0 , 1 , 2 , …
Since we only have to find infintely many solutions, not all of them, we can get rid of one variable and two cubes by taking z = − x . then we get the equation 2 x 2 + y 2 = y 3 , which we can rewrite as x 2 = 2 1 ( y − 1 ) y 2 or x = ± 2 y − 1 y .
So if 2 y − 1 is a perfect square, x is an integer. Thus, we take 2 y − 1 = k 2 which gives y = 2 k 2 + 1 , x = k ( 2 k 2 + 1 ) Remark: There certainly exist other solutions, e.g., x = 2 1 k ( k 2 − 1 ) + 1 , y = − 2 1 k ( k 2 − 1 ) + 1 , z = − k 2 + 1 for any k ∈ Z