How many solutions exist for the above, such that both and are integers ?
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.
Relevant wiki: General Diophantine Equations - Problem Solving
Suppose that m , x are integers such that x + 2 0 1 6 0 − x − 2 0 1 6 0 = m . Then certainly x , m ∈ N , while x ≥ 2 0 1 6 0 and m ≤ 2 × 2 0 1 6 0 = 2 1 0 0 8 0 . Thus, on squaring, 2 x − 2 x 2 − 2 0 1 6 0 2 2 x − m 2 ( 2 x − m 2 ) 2 4 m 2 x = = = = m 2 2 x 2 − 2 0 1 6 0 2 4 [ x 2 − 2 0 1 6 0 2 ] m 4 + 4 × 2 0 1 6 0 2 Hence m 4 must be even, and so m must be even. Thus m = 2 n for some n ∈ N , and n 2 x = n 4 + 1 0 0 8 0 2 Thus n must divide 1 0 0 8 0 , and hence we must have x = n 2 + ( n 1 0 0 8 0 ) 2 m = 2 n for any positive integer divisor n of 1 0 0 8 0 for which n ≤ 1 0 0 8 0 . Since 1 0 0 8 0 = 2 5 × 3 2 × 5 × 7 , there are 6 × 3 × 2 × 2 = 7 2 positive integer divisors of 1 0 0 8 0 . Since 1 0 0 8 0 is not a perfect square, exactly half of these are less than or equal to 1 0 0 8 0 . Thus there are 2 7 2 = 3 6 solutions in integers to this equation.