Two Ways to Count

Intro to Proofs · Axiom Academy

Discover why counting the same thing two different ways must give the same answer — the foundation of combinatorial proofs. Five students arrive at a classroom with only two seats available. The rest must stand. How many different ways can this happen? The surprise isn't the number — it's that there are two honest ways to count it, and they're forced to agree. Watch one fixed lineup of 5 students get read two ways. For each seating, the who sit light up on the left and the complementary who must stand light up on the right — in lockstep. Both tallies climb to the same total: . Same arrangements, two readings, one number — that lockstep is the whole idea of counting two ways. Here are all 10 seatings, one at a time. Drag through them: each choice of 2 students to sit automatically decides the 3 who stand . Choosing the sitters is choosing the standers — every arrangement is counted once on both sides at the very same time. Each pair of sitters pins down exactly one trio of standers, and vice versa — a perfect one-to-one match across all 10 . Change the numbers. Drag n students and k seats, and watch the two counts — choose k to sit , , and choose n-k to stand , — sit side by side. They stay equal no matter what you pick, because both count the very same seatings. That's the identity , proved by counting, not algebra. Choosing k people to sit is the same act as choosing n-k people to stand — so and can never disagree. The power of combinatorial proofs

This is the written version of the interactive lesson above. See the full Intro to Proofs course.