Classic olympiad problem · Combinatorics
Prove that binomn0 + binomn1 + … + binomnn = 2^n by a counting…
Prove that by a counting argument, not by the binomial theorem.
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
- 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
This problem sits in the Olympiad Set: 89 proof problems (real IMO problems and the classics) with progressive hints, full walkthroughs and marking rubrics. 125 lessons, 1206 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and every 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 →