Technique Encyclopedia
Complementary Counting
What it is
Complementary counting flips a counting problem around: instead of directly counting outcomes satisfying a condition, count the outcomes that fail it, and subtract from the total number of outcomes. This is especially powerful for "at least one" conditions, whose direct count often requires messy casework that the complement avoids entirely.
Signals that suggest using it
- The condition involves "at least one" or "not all" — direct counting would require summing over many overlapping cases.
- The complement of the condition is noticeably simpler to describe or count than the condition itself.
- A total count is easy to find, and the unwanted outcomes form a clean, countable set.
When it's effective
Best for "at least one" conditions, where the complement ("none") collapses a sprawling casework problem into a single clean count.
When it's not effective
If the complement is just as messy to count as the original condition, this technique adds a subtraction step without actually simplifying anything — check that the complement is genuinely easier before committing to it.
Simple example
Problem
How many two-digit numbers have at least one digit equal to 7?
Solution
Total two-digit numbers: 90. Numbers with no digit equal to 7: the tens digit has 8 choices (1–9, excluding 7) and the units digit has 9 choices (0–9, excluding 7), giving 8 × 9 = 72. Answer: 90-72=18.
AMC-style example
Problem
In how many ways can the letters A, B, C, D, E be arranged in a row so that A is not in the first position?
Solution
Total arrangements: 5!=120. Arrangements with A first: the remaining 4 letters fill the rest in 4!=24 ways. Answer: 120-24=96.