Classic olympiad problem · Combinatorics
A 5times5 grid has a token on each square. Every token must move to…
A grid has a token on each square. Every token must move to an orthogonally adjacent square. Prove this is impossible.
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
- How to prove something is impossible in a competitionFailing to find an example is not a proof that none exists. The five obstructions that rule out every attempt at once, ordered by what they cost you.
- Coloring arguments: how to know which coloring to useA coloring argument is only as good as the coloring. The signals that a combinatorics problem wants one, and how the piece decides the palette.
- When to use an invariant in a competition problemAn invariant proves impossibility, not possibility. The four signals that a problem wants one, the ladder of candidates to test, and the one-move test.
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 Combinatorics problems
- Ramsey, R(3,3)=6Classic (Ramsey, $R(3,3)=6$) · difficulty 4/6
- Mutilated chessboardClassic (mutilated chessboard) · difficulty 3/6
- Handshake lemmaClassic (handshake lemma) · difficulty 2/6
- All 89 problems →