Maths Olympiad Prep

Library / /197 of 740

, 2019

Algebra Difficulty 4.8 AIME Prove it United States

Problem:

Compute the number of ordered pairs of integers (x,y)(x, y) such that x2+y2<2019x^{2}+y^{2}<2019 and
x2+min(x,y)=y2+max(x,y) x^{2}+\min (x, y)=y^{2}+\max (x, y)

Solution

Solution:

We have
x2y2=max(x,y)min(x,y)=xy x^{2}-y^{2} = \max(x, y) - \min(x, y) = |x-y|
Now if xyx \neq y, we can divide by xyx-y to obtain x+y=±1x+y= \pm 1. Thus x=yx=y or x+y=±1x+y= \pm 1.

If x=yx=y, we see that 2019>x2+y2=2x22019 > x^{2} + y^{2} = 2x^{2}, so we see that 31x31-31 \leq x \leq 31. There are 63 ordered pairs in this case.

In the second case, note that xy|x| \geq |y| since x2y2=xy0x^{2} - y^{2} = |x-y| \geq 0. Since x+y=±1x+y= \pm 1, we cannot have xy>0xy > 0, so either x0,y0x \geq 0, y \leq 0, or x0,y0x \leq 0, y \geq 0. In the first case, x+y=1x+y=1; in the second case, x+y=1x+y=-1. Thus, the solutions for (x,y)(x, y) are of the form (k,1k)(k, 1-k) or (k,k1)(-k, k-1) for some k>0k>0. In either case, we must have k2+(k1)2<2019k^{2} + (k-1)^{2} < 2019, which holds true for any 1k321 \leq k \leq 32 but fails for k=33k=33. There are a total of 322=6432 \cdot 2 = 64 solutions in this case.

In summary, there are a total of 63+64=12763 + 64 = 127 integer solutions to the equation x2+min(x,y)=y2+max(x,y)x^{2} + \min(x, y) = y^{2} + \max(x, y) with x2+y2<2019x^{2} + y^{2} < 2019.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.