Classic olympiad problem · Number Theory
Prove that n^5 - n is divisible by 30 for every integer n.
Prove that is divisible by 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 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 2025 Problem 1: solution, and the one pair that breaks the restA full solution to EGMO 2025 Problem 1: why every even N and every power of 3 works, the pair that breaks every other N, and the signal in the statement.
- How to build a problem-solving notebook that actually worksMost problem notebooks are copied solutions nobody reopens. Index yours by the clue in the statement, not by topic, and test it from the clue side.
- 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.
- How to get better at proofs when you can only computeComputation is not the wrong skill for proofs, it is an unfinished one. Five moves that turn arithmetic you can already do into an argument that holds.
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 →