Number theoryDifficulty 4.6AIMEProve itSaudi Arabia
Let x, y and z be odd positive integers such that gcd(x,y,z)=1 and the sum x2+y2+z2 is divisible by x+y+z. Prove that x+y+z−2 is not divisible by 3.
Solution
Suppose there exists a prime divisor p≡2(mod3) of x+y+z. Since z≡−(x+y)(modp) we have 2(x2+y2+xy)≡0(modp). Multiplying by x−y we get x3≡y3(mod3) but this yields x≡y(modp), because gcd(3,p−1)=1. Similarly x≡z(modp) whence 3x≡0(modp) which means that x, y and z are divisible by p which contradicts gcd(x,y,z)=1. Hence x+y+z have no prime divisors which have a remainder 2 modulo 3 so x+y+z−2 is not divisible by 3. □
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.