Double Counting
Count it twice, set the answers equal.
Choose a set, count it in two different ways, and equate. The identity that falls out is often one you could never have guessed directly. This is how most combinatorial identities are really proved.
The standard incarnation is counting incidences: sum the degrees of a graph's vertices and you get twice the number of edges. Counting pairs (person, handshake) gives the handshake lemma for free.
When a problem hands you a doubled quantity or an unexpected factor of two, double counting is usually lurking underneath.
Guides on Double Counting
- EGMO 2026 Problem 1: solution, and four rectangles that isolate a cellA full solution to EGMO 2026 Problem 1: the four-cell construction, the parity proof that every board beats it, 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.
- Constructive vs complementary counting: which one to reach forTwo ways to count the same set, and one question that tells you which is cheaper. The signals, the worked pair, and the trap where the obvious tell lies to you.
- How a double counting proof is actually builtDouble counting proofs are always the same three steps, and only one of them is hard. The skeleton, five worked examples, and where they go wrong.
Train it on Lemma
Double Counting unlocks at Level 4 of Lemma's eight-level ladder, with lessons that teach it and drills that make it stick. 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 techniques
- Constructive Counting & OvercountingBuild the object step by step, then divide by what you repeated.
- Modular ThinkingWhen the numbers are too big, shrink the universe.
- All 29 techniques →