Classic olympiad problem · Number Theory
Prove that x^2 + y^2 = 3z^2 has no solutions in positive integers.
Prove that has no solutions in positive integers.
This is a proof problem. The answer is an argument, not a number. The solution is deliberately not posted here: reading a solution you didn't fight for teaches almost nothing. On Lemma you attempt it cold, take one of the 3 progressive hints only when genuinely stuck, then compare your proof against a full walkthrough and mark yourself with the same rubric a competition coordinator would use.
Guides that use this problem
- EGMO 2021 Problem 1: solution, and why you only need to halveA full solution to EGMO 2021 Problem 1: build a chain from m to 2m out of the given moves, then halve 2021^2021 all the way down to 1.
- EGMO 2023 Problem 1: solution, and why the ring has to closeA full solution to EGMO 2023 Problem 1: why the largest and smallest terms force every ratio to equal 2, and why the ring has to close.
- What separates a Level 5 problem from a Level 7, side by sideTwo IMO inequalities, both rated 5 out of 6, sit two rungs apart on the ladder. What actually separates a Level 5 problem from a Level 7, and how to cross.
- How to revise a topic you understand but keep missingRereading a topic you already understand fixes nothing. Find the one step that keeps breaking, revise that step, and test it cold. Worked on mods and bounds.
- Vieta jumping, explained simply: the jump and when to reach for itVieta jumping is four lines of algebra guarding one idea. The shape that triggers it, the jump itself, and the case that quietly loses marks.
- The extremal principle: how to choose which extreme to takeTaking the largest or the smallest is the easy half. The three signals that call for an extreme, and the one question that tells you if you picked the right one.
- Which modulus? The real trick in competition number theoryModular arithmetic tricks are one decision wearing many hats: which modulus. The residue table, how to read the modulus off the problem, and when it fails.
Train it on Lemma
This problem sits in the Olympiad Set: 89 proof problems (real IMO problems and the classics) with progressive hints, full walkthroughs and marking rubrics. 128 lessons, 1237 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and the paid plan opens with 3 free days.
Find your levelMore Number Theory problems
- IMO 1959, Problem 1IMO 1959, Problem 1 · difficulty 3/6
- IMO 1988, Problem 6IMO 1988, Problem 6 · difficulty 6/6
- EuclidClassic (Euclid) · difficulty 2/6
- All 89 problems →