Counting looks easy until it is not. The hard part of combinatorics is rarely arithmetic. It is bookkeeping.
A good counting solution must answer two questions:
- Did we count every valid object?
- Did we count each object exactly once?
If either answer is no, the result may look clean and still be wrong.
The handshake problem
If 10 people are in a room and everyone shakes hands with everyone else once, how many handshakes occur?
One solution says each person shakes hands with 9 others, giving 10 · 9 = 90. But this counts every handshake twice: once from each person’s perspective. So the answer is 90 / 2 = 45.
The division by 2 is not a magic fix. It has a reason: each handshake has exactly two names attached to it.
This is the habit students need. Every multiplication, division, or case split should have an explanation.
Order matters, unless it does not
Arranging three books on a shelf is different from choosing three books for a bag. Shelf order matters. Bag order does not.
If students confuse arrangements with selections, combinatorics becomes a mess of memorized formulas. Instead, ask: would swapping two chosen objects create a new outcome?
If yes, order matters. If no, order does not.
This single question prevents many errors.
Complementary counting
Sometimes it is easier to count what we do not want and subtract from the total.
Suppose we want the number of 5-digit strings using digits 0 through 9 that contain at least one 7. Counting directly requires cases: exactly one 7, exactly two 7s, and so on. Instead, count all strings and subtract strings with no 7.
There are 10^5 total strings. There are 9^5 strings with no 7. So the answer is:
10^5 - 9^5
Complementary counting is useful when “at least one” creates many cases.
Bijections
A bijection pairs objects in one set with objects in another set, with no leftovers and no repeats. Bijections are powerful because they prove two sets have the same size without counting each separately.
For example, the number of subsets of a set with n elements is 2^n. Why? For each element, make a yes/no decision: include it or do not include it. Each subset corresponds to one binary string of length n, and each binary string corresponds to one subset.
That correspondence is a bijection.
Bijections are useful because they turn a confusing object into a familiar one.
Cases need boundaries
Casework fails when cases overlap or leave gaps. If we split by “small,” “medium,” and “large,” we need exact definitions. If a problem involves triangles, splitting by side length or angle type may help, but only if every triangle goes into exactly one case.
Students should write a quick test after casework:
- Are the cases mutually exclusive?
- Are the cases exhaustive?
Mutually exclusive means no object appears in two cases. Exhaustive means every object appears somewhere.
Symmetry
Symmetry can reduce counting, but it must be used carefully. If all positions or choices are truly equivalent, we can count one case and multiply. If they are not equivalent, symmetry may hide different behavior.
For example, in a square, all corners are symmetric. But in a rectangle with labeled sides or special restrictions, not all positions may behave the same way.
The danger is assuming symmetry because a diagram looks balanced.
A COSMO counting checklist
Before finalizing a counting solution, ask:
- What exactly is one outcome?
- Does order matter?
- Are repetitions allowed?
- Are there restrictions?
- Did my cases overlap?
- Did I count each object once?
- Is there a complement or bijection that makes the problem cleaner?
This checklist is more valuable than memorizing a table of formulas.
The core habit
Combinatorics teaches mathematical honesty. A wrong counting solution often feels right because the arithmetic is smooth. The only defense is structure: define the objects, control the cases, and explain why each object is counted exactly once.
Counting is not about getting a number. It is about building an argument that the number deserves to be trusted.