Classic (mutilated chessboard) · Combinatorics
Mutilated chessboard
Two opposite corners are removed from an chessboard. Prove that the remaining 62 squares cannot be tiled by 31 dominoes.
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 2024 Problem 1: solution, and the three ways a pair gets stuckA full solution to EGMO 2024 Problem 1: which starting pairs reach every integer, the three ways a pair gets stuck, 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.
- 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.
- What a complete olympiad solution actually looks likeA complete solution is not a longer one. The four beats every finished proof moves through, the five gaps that quietly lose marks, and a self-check.
- 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
- Handshake lemmaClassic (handshake lemma) · difficulty 2/6
- Erdős–SzekeresClassic (Erdős–Szekeres) · difficulty 5/6
- All 89 problems →