Maths Olympiad Prep

Library / /8 of 16

Number theory Difficulty 5.4 AIME, harder Prove it JBMO

Problem:
Find all positive integers x,yx, y satisfying the equation
9(x2+y2+1)+2(3xy+2)=2005 9\left(x^{2}+y^{2}+1\right)+2(3 x y+2)=2005

Solution

Solution:
The given equation can be written into the form
2(x+y)2+(xy)2=664 2(x+y)^{2}+(x-y)^{2}=664
Therefore, both numbers x+yx+y and xyx-y are even.
Let x+y=2mx+y=2 m and xy=2tx-y=2 t, tZt \in \mathbb{Z}.
Now from (1) we have that tt and t2t^{2} are even and mm is odd.
So, if t=2kt=2 k, kZk \in \mathbb{Z} and m=2n+1m=2 n+1, nNn \in \mathbb{N}, then from (1) we get
k2=412n(n+1) k^{2}=41-2 n(n+1)
Thus 412n(n+1)041-2 n(n+1) \geq 0 or 2n2+2n4102 n^{2}+2 n-41 \leq 0. The last inequality is satisfied for the positive integers n=1,2,3,4n=1,2,3,4 and for n=0n=0.
However, only for n=4n=4, equation (2) gives a perfect square k2=1k=±1k^{2}=1 \Leftrightarrow k= \pm 1. Therefore the solutions are (x,y)=(11,7)(x, y)=(11,7) or (x,y)=(7,11)(x, y)=(7,11).

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.