Find the number of integer pairs satisfying the equation above.
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.
y 2 ( 5 x 2 + 1 ) ⟹ y 2 = 2 5 ( 2 x 2 + 1 3 ) = 5 2 ⋅ 5 x 2 + 1 2 x 2 + 1 3
Since the LHS is a perfect square, the RHS must also be a perfect square and hence 5 x 2 + 1 2 x 2 + 1 3 is also a perfect square and let it be m 2 , where m is an integer.
5 x 2 + 1 2 x 2 + 1 3 ⟹ x 2 = m 2 = 5 m 2 − 2 1 3 − m 2 Rearranging
Considering the non-negative m , we note that the RHS < 0 for m ≥ 4 and hence no solution for x because the LHS ≥ 0 . For m = 0 , 1 , 2 , 3 , there is only a solution for m = 1 when x 2 = 4 ⟹ x = ± 2 . Putting this back in the following equation:
y 2 ⟹ y = 5 2 ⋅ 5 ( 4 ) + 1 2 ( 4 ) + 1 3 = 5 2 = ± 5
Therefore, there are 4 integer pairs ( − 2 , − 5 ) , ( − 2 , 5 ) , ( 2 , − 5 ) , ( 2 , 5 ) satisfying the equation.