How many ordered pairs of integers (x,y) are their which can satisfy 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.
If one solves the above Diophantine equation for y in terms of x, this yields:
y = 9 + x − 9 8 1 (i)
The numerator in (i) is 8 1 = 3 4 , which has 10 integer divisors: ± 1 , ± 3 , ± 9 , ± 2 7 , ± 8 1 . These in turn yield the integer pairs:
( x , y ) = ( 1 0 , 9 0 ) ; ( 9 0 , 1 0 ) ; ( 1 2 , 3 6 ) ; ( 3 6 , 1 2 ) ; ( 1 8 , 1 8 ) ; ( 8 , − 7 2 ) ; ( − 7 2 , 8 ) ; ( 6 , − 1 8 ) ; ( − 1 8 , 6 )
or 9 total pairs for x , y ∈ Z and x , y = 0 .