Find the number of pairs of integers ( x , y ) satisfying 2 x + x y = y 2 + 1 3 .
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.
x = 2 + y y 2 + 1 3
⟹ g c d ( y 2 + 1 3 , ± ( 2 + y ) ) = 2 + y ⟹ g c d ( 2 y − 1 3 , ± ( 2 + y ) ) = 2 + y ⟹ g c d ( 1 7 , ± ( 2 + y ) ) = 2 + y
where 2 + y > 0 .
therefore
2 + y = ± 1 7 o r ± 1
There would be 4 possible pairs ( x , y ) then. ( 1 4 , 1 5 ) , ( − 2 2 , − 1 9 ) ( 1 4 , − 1 ) ( − 2 2 , − 3 )
Problem Loading...
Note Loading...
Set Loading...
We have y 2 − x y + 1 3 − 2 x = 0 , a quadratic in y . For integer solutions, the discriminant of this quadratic must be the square of an integer, that is
x 2 + 8 x − 5 2 = m 2
for some integer m .
Completing the square and rearranging, we have
( x + 4 ) 2 − m 2 = 6 8
We can factorise the difference of two squares to get
( x + 4 + m ) ( x + 4 − m ) = 6 8
So we just need to look at the divisors (positive and negative) of 6 8 . For a particular divisor d , we would need to solve x + 4 + m = d and x + 4 − m = d 6 8 . Adding these, we find 2 x + 8 = d + d 6 8 , so we are only interested in the cases when d and d 6 8 have the same parity. They can't both be odd, as 6 8 is even; so they must both be even. The cases are now easy to list:
It can easily be checked that these all lead to integer solutions for y ; the solution pairs ( x , y ) are ( − 2 2 , − 1 9 ) , ( − 2 2 , − 3 ) , ( 1 4 , − 1 ) and ( 1 4 , 1 5 ) , that is 4 in total.