Maths Olympiad Prep

Library / /298 of 520

Number theory Difficulty 6.2 National olympiad Prove it

Lemma 1 The primitive solutions x,y,zx, y, z of the indeterminate equation (1) must satisfy the conditions:
(x,y)=(y,z)=(z,x)=1,2x+y.\begin{aligned} (x, y)= & (y, z)=(z, x)=1, \\ & 2 \nmid x+y . \end{aligned}

Solution

Prove that if x,yx, y are not coprime, then there exists a prime pp such that px,pyp \mid x, p \mid y. By (1), we know pz2p \mid z^{2}. From this and Theorem 1 of Chapter 1, §5, we conclude pzp \mid z. However, this contradicts (x,y,z)=1(x, y, z)=1. Similarly, we can prove (y,z)=1(y, z)=1 and (z,x)=1(z, x)=1. By (x,y)=1(x, y)=1, we know that x,yx, y cannot both be even. x,yx, y cannot both be odd either. Because if they were both odd, it would imply 4x2+y24 \nmid x^{2}+y^{2} and zz would be even. But by (1), we know
4z2=x2+y24 \mid z^{2}=x^{2}+y^{2}

which is a contradiction. Therefore, x,yx, y must be one odd and one even, i.e., equation (5) 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.