Maths Olympiad Prep

Library / /22 of 65

Number theory Difficulty 5.4 AIME, harder Prove it Romania

Prove that the equation x2+y2+z2=x+y+z+1x^2 + y^2 + z^2 = x + y + z + 1 has no rational solutions.

Solution

The equation can be written equivalently as (2x1)2+(2y1)2+(2z1)2=7(2x - 1)^2 + (2y - 1)^2 + (2z - 1)^2 = 7.

If (x,y,z)(x, y, z) would be a solution of this equation with rational components, denoting 2x1=a1b12x - 1 = \frac{a_1}{b_1}, 2y1=a2b22y - 1 = \frac{a_2}{b_2}, 2z1=a3b32z - 1 = \frac{a_3}{b_3}, one would have integers a1,b1,a2,b2,a3,b3a_1, b_1, a_2, b_2, a_3, b_3 satisfying the equality (a1b2b3)2+(b1a2b3)2+(b1b2a3)2=7(b1b2b3)2(a_1 b_2 b_3)^2 + (b_1 a_2 b_3)^2 + (b_1 b_2 a_3)^2 = 7 (b_1 b_2 b_3)^2.

This would lead to the existence of four integers a,b,c,da, b, c, d such that a2+b2+c2=7d2a^2 + b^2 + c^2 = 7d^2. If the greatest common divisor of a,b,c,da, b, c, d is kk, dividing by k2k^2 one would obtain a solution (a,b,c,d)Z4(a, b, c, d) \in \mathbb{Z}^4 of the equation a2+b2+c2=7d2a^2 + b^2 + c^2 = 7d^2 with gcd(a,b,c,d)=1\gcd(a, b, c, d) = 1. Then a,b,c,da, b, c, d cannot all be even.

But a perfect square is congruent to either 00, 11, or 44 modulo 88, so the left hand side can only be 11, 22, 33, 55 or 66 modulo 88, while the right hand side, 7d27d^2, is 00, 44 or 77 modulo 88. In conclusion, the equality cannot hold.

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.