Let and are non-negative integers less than or equal to 1000. Determine the number of pairs of solution to
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.
Consider n − m = k ⟹ n = m + k
Now equation becomes 2 m + k = k 2 ⟹ m = 2 k ( k − 1 )
So, n = k + 2 k ( k − 1 ) = 2 k ( k + 1 )
As m , n ≤ 1 0 0 0 So, 2 k ( k + 1 ) ≤ 1 0 0 0
A simple calculation gives k ≤ 4 4
So, total number of ordered pairs 2 ∗ 4 5 − 1 = 8 9 because ( 0 , 0 ) is counted twice.