How many integer solutions does this equation have?
.
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.
Given: 6 x 2 + 2 = y 3
Clearly, y ≥ 2 since the L.H.S. is always > 1 . Further, we may also assume that x > 0 since x 2 is an even function.
⟹ 2 ∣ y 3 ⟹ y = 2 a ; a ≥ 1
⟹ 3 x 2 + 1 = 4 a 3
If x is even ⟹ L.H.S. is odd and we will have a contradiction.
⟹ x is odd.
Let x = 2 b + 1 ; b ≥ 0
⟹ 3 b 2 + 3 b + 1 = a 3
⟹ ( b + 1 ) 3 − b 3 = a 3
⟹ a 3 + b 3 = ( b + 1 ) 3
By Fermat's Last Theorem , the above equation has no solution in positive integers . But, since b ≥ 0 , it can have solutions in whole numbers.
So, putting b = 0 , we find that a = 1 which gives y = 2 and x = 1 and since x 2 is an even function, x = − 1 is also a solution.
So, the solutions are ( 1 , 2 ) and ( − 1 , 2 ) .