How many ordered pairs of integers are there such that ?
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.
( a − 2 0 0 ) ( b − 2 0 0 ) = 4 0 0 0 0 = 2 6 × 5 4
4 0 0 0 0 can distribute its factors to the first bracket, and then there's only 1 way to the second bracket. So we can count the number of factors.
Let a − 2 0 0 = ± 2 k × 5 m , then b − 2 0 0 = ± 2 6 − k × 5 4 − m
The number of ways = 2 × ( 7 × 5 ) = 7 0 ways. ( a , b can switch numbers together so that we can multiply by 2)
But for k = 3 , m = 2 , negative sign we get a = 0 , b = 0 which is impossible.
Therefore, the number of solutions = 7 0 − 1 = 6 9 ~!~!~