Classic (Euclid) · Number Theory
Euclid
Prove that there are infinitely many prime numbers.
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 2 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
- 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.
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. 125 lessons, 1206 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and every 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
- IrrationalityClassic (irrationality) · difficulty 2/6
- All 89 problems →