Maths Olympiad Prep

Library / /14 of 56

Number theory Difficulty 5.1 AIME, harder Prove it Singapore

Suppose pp is a prime number and x,y,zx, y, z are integers satisfying 0<x<y<z<p0 < x < y < z < p. If x3,y3,z3x^3, y^3, z^3 have equal remainders when divided by pp, prove that x2+y2+z2x^2 + y^2 + z^2 is divisible by x+y+zx + y + z.

Solution

Note that p>3p > 3 and px3y3=(xy)(x2+xy+y2)p \mid x^3 - y^3 = (x-y)(x^2 + xy + y^2). Since x,y<px, y < p, pxyp \nmid x-y. Therefore px2+xy+y2p \mid x^2 + xy + y^2. Similarly px2+xz+z2p \mid x^2 + xz + z^2, py2+yz+z2p \mid y^2 + yz + z^2.

Thus p(x2+xy+y2)(y2+yz+z2)=(xz)(x+y+z)p \mid (x^2 + xy + y^2) - (y^2 + yz + z^2) = (x-z)(x+y+z) and so px+y+zp \mid x+y+z.

Since x,y,z<px, y, z < p and pp is a prime, x+y+z=px+y+z = p or 2p2p.

Since the parity of x+y+zx+y+z and x2+y2+z2x^2+y^2+z^2 are the same, it suffices to prove that px2+y2+z2p \mid x^2+y^2+z^2.

Now px2+xy+y2=x(x+y+z)+y2xzp \mid x^2 + xy + y^2 = x(x+y+z) + y^2 - xz and so py2xzp \mid y^2 - xz. Therefore p(x2+xy+y2)+(y2xz)=x2+y2+z2p \mid (x^2 + xy + y^2) + (y^2 - xz) = x^2 + y^2 + z^2 and we are done.

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.