Maths Olympiad Prep

Library / /493 of 520

Number theory Difficulty 7.3 National olympiad, round 2 Prove it

Example 1 Let (x,y,z)(x, y, z) be an integer solution of the Pythagorean equation (1). Prove: xx, yy, zz must include one number that is a multiple of 3, one number that is a multiple of 4, and one number that is a multiple of 5.

Solution

Prove that using the fact that perfect squares 0,1(mod3)\equiv 0,1(\bmod 3), if xx and yy are not multiples of 3, then

this leads to
x2+y22(mod3)z22(mod3)\begin{array}{c} x^{2}+y^{2} \equiv 2(\bmod 3) \\ z^{2} \equiv 2(\bmod 3) \end{array}

which is a contradiction. Hence, one of xx or yy must be a multiple of 3.
If xx, yy, and zz are not multiples of 5, then
x2+y20,2 or 3(mod5),x^{2}+y^{2} \equiv 0,2 \text { or } 3(\bmod 5),

while
z21 or 4(mod5),z^{2} \equiv 1 \text { or } 4(\bmod 5),

which is a contradiction. Hence, one of xx, yy, or zz must be a multiple of 5.
If xx, yy, and zz are all even, then divide both sides of (1) by 4 until one of xx or yy is odd. Suppose xx is odd, then yy must be even (otherwise z2=x2+y21+12(mod4)z^{2}=x^{2}+y^{2} \equiv 1+1 \equiv 2(\bmod 4), which is a contradiction), in this case zz is odd. Taking both sides of (1) modulo 8, we find that y20(mod8)y^{2} \equiv 0(\bmod 8), hence 4y4 \mid y.

In summary, the proposition holds.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.