Maths Olympiad Prep

Library / /22 of 101

Number theory Difficulty 5.5 AIME, harder Prove it Estonia

Find all triples (p,q,r)(p, q, r) of primes such that 2018(p2+q2)=r2+12018(p^2+q^2) = r^2+1.

Solution

Suppose that both pp and qq are odd. Then p2+q2p^2+q^2 is even and the l.h.s. of the equation is divisible by 4. Squares of integers are congruent to 0 or 1 modulo 4 whence the r.h.s. is congruent to 1 or 2 modulo 4. The contradiction shows that one of pp and qq equals 2; let w.l.o.g. p=2p = 2. Squares of integers are congruent to 0 or 1 modulo 3. Obviously r>3r > 3 as the l.h.s. is greater than 10. As rr is prime, rr is not divisible by 3. Thus r21(mod3)r^2 \equiv 1 \pmod 3, whence r2+12(mod3)r^2 + 1 \equiv 2 \pmod 3. Now 20182(mod3)2018 \equiv 2 \pmod 3 implies p2+q21(mod3)p^2 + q^2 \equiv 1 \pmod 3 and p2=41(mod3)p^2 = 4 \equiv 1 \pmod 3 in turn implies q20(mod3)q^2 \equiv 0 \pmod 3. Hence qq is divisible by 3, i.e., q=3q = 3. Therefore the l.h.s. is 2018132018 \cdot 13. As 20181333=94(mod5)2018 \cdot 13 \equiv 3 \cdot 3 = 9 \equiv 4 \pmod 5, we must have r23(mod5)r^2 \equiv 3 \pmod 5. But 3 is not a quadratic residue modulo 5.

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 and solution reproduced as published; topic and difficulty added by this site.