Classic olympiad problem · Number Theory
Prove that consecutive integers are always coprime: gcd(n, n+1) = 1…
Prove that consecutive integers are always coprime: for every integer .
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.
Train it on Lemma
This problem sits in the Olympiad Set — 81 real competition problems with progressive hints, full walkthroughs and marking rubrics. 78 lessons, 624 curated problems and unlimited generated practice at six difficulties. Free to start — no card, no trial clock.
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 81 problems →