Maths WorkshopMaths problems with full solutions
Exercise 621Number theory › Diophantine equationsOlympiadAdded 4 Nov 2026

x² + y² = 3z² has no non-trivial solution

#infinite descent#squares modulo 3#Diophantine equations

Statement

Prove that the only integer solution of x2+y2=3z2x^2+y^2=3z^2 is x=y=z=0x=y=z=0.

Hint

Squares modulo 33 are 00 or 11. What does the equation say modulo 33?

Show solutionHide solution

Solution

Idea. Descent: from a non-zero solution build a strictly smaller one.

Proof. Suppose there is a solution other than (0,0,0)(0,0,0), and choose one with ∣z∣|z| smallest positive (if z=0z=0 then x2+y2=0x^2+y^2=0 forces x=y=0x=y=0).

Modulo 33. x2+y2≡0(mod3)x^2+y^2\equiv0\pmod3. Since squares are 00 or 11 modulo 33, the sum is 00 only if both are 00, so 3∣x3\mid x and 3∣y3\mid y. Write x=3x1x=3x_1, y=3y1y=3y_1:
9(x12+y12)=3z2 ⟹ z2=3(x12+y12),9(x_1^2+y_1^2)=3z^2\ \Longrightarrow\ z^2=3(x_1^2+y_1^2),
so 3∣z3\mid z; write z=3z1z=3z_1. Then 9z12=3(x12+y12)9z_1^2=3(x_1^2+y_1^2), i.e.
x12+y12=3z12,x_1^2+y_1^2=3z_1^2,
a solution with ∣z1∣=∣z∣/3<∣z∣|z_1|=|z|/3<|z| and z1≠0z_1\ne0. Contradiction with minimality.

Lesson. Infinite descent: reduce modulo a well-chosen number, show all variables are divisible by it, divide, and get a smaller solution.