Course contentsShow
← Mathematics
Lesson 2597 of 3,12152. CombinatoricsFree lesson

Complementary Counting with Combinations

Use the complement principle to count combinations by subtracting unwanted cases from the total.

Complementary Counting with Combinations

You'll learn how to count combinations more efficiently by calculating what you don't want and subtracting from the total.

The Core Idea

Sometimes counting the combinations you want directly is complicated or tedious. Complementary counting flips the problem: instead of counting the "good" outcomes, count the "bad" ones and subtract from the total possible outcomes.

The formula is simple:

Number of desired outcomes = Total outcomes − Unwanted outcomes

Think of it like cleaning a messy room. Instead of picking up each toy you want to keep (which might mean sorting through hundreds), you could remove the few broken toys you want to throw away—much faster!

When to Use It

Use complementary counting when:

  • The unwanted cases are easier to count than the wanted cases
  • You're asked "at least one," "at most," or dealing with restrictions that are simpler to state negatively

Example

Problem: From a group of 10 students, how many ways can you select a committee of 5 that includes at least one of two specific friends, Alice and Bob?

Direct approach: Messy—count committees with just Alice, just Bob, or both.

Complementary approach:

  • Total committees of 5 from 10: C(10,5) = 252
  • Unwanted: committees with neither Alice nor Bob = selecting 5 from the remaining 8 students: C(8,5) = 56
  • Answer: 252 − 56 = 196 committees

Much cleaner!

The Pattern

  1. Calculate total possibilities using C(n,r)
  2. Identify and count the unwanted cases (often simpler!)
  3. Subtract: wanted = total − unwanted

Key Takeaway: Complementary counting with combinations transforms hard counting problems into easier ones by focusing on what to exclude rather than what to include—subtract the "bad" from the "total" to find the "good."