Maths Olympiad Prep

Library / Saudi Arabian Mathematical Competitions /30 of 395

Saudi Arabian Mathematical Competitions

Number theory Difficulty 4.6 AIME Prove it Saudi Arabia

Let xx, yy and zz be odd positive integers such that gcd⁡(x,y,z)=1\gcd(x, y, z) = 1 and the sum x2+y2+z2x^2 + y^2 + z^2 is divisible by x+y+zx + y + z. Prove that x+y+z−2x + y + z - 2 is not divisible by 33.

Solution

Suppose there exists a prime divisor p≡2(mod3)p \equiv 2 \pmod{3} of x+y+zx + y + z. Since z≡−(x+y)(modp)z \equiv -(x + y) \pmod{p} we have 2(x2+y2+xy)≡0(modp)2(x^2 + y^2 + xy) \equiv 0 \pmod{p}. Multiplying by x−yx - y we get x3≡y3(mod3)x^3 \equiv y^3 \pmod{3} but this yields x≡y(modp)x \equiv y \pmod{p}, because gcd⁡(3,p−1)=1\gcd(3, p-1) = 1. Similarly x≡z(modp)x \equiv z \pmod{p} whence 3x≡0(modp)3x \equiv 0 \pmod{p} which means that xx, yy and zz are divisible by pp which contradicts gcd⁡(x,y,z)=1\gcd(x, y, z) = 1. Hence x+y+zx + y + z have no prime divisors which have a remainder 22 modulo 33 so x+y+z−2x + y + z - 2 is not divisible by 33.
□

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

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