Given that x 1 + y 1 = 2 0 1 5 1 , x and y are both integers, and x > y , find the number of ordered pairs of ( x , y ) .
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.
The final calculation is somewhat slipshod. It doesn't follow immediately. Let me spell it out:
Exactly what I'm looking for! +1
How do we know x > y and you have not included negative solutions?
Log in to reply
I've added an explanation of how to reach this calculation properly.
Problem Loading...
Note Loading...
Set Loading...
x y x + y = 2 0 1 5 1 ⟹ x y − 2 0 1 5 x − 2 0 1 5 y + 2 0 1 5 2 = 2 0 1 5 2 .
Use SFFT, we have ( x − 2 0 1 5 ) ( y − 2 0 1 5 ) = 5 2 × 1 3 2 × 3 1 2 .
The number of ordered pairs: 3 × 3 × 3 − 1 = 2 6 .