INAIO Guide Stage 1 8Probability
8.5 Complements, inclusion-exclusion
Use complements for at-least-one questions and inclusion-exclusion to count unions of two or three overlapping sets.
“At least one” can be awkward to count directly. “None” is often much simpler. Likewise, adding the sizes or chances of overlapping sets counts some outcomes more than once. Complements and the principle of inclusion-exclusion (PIE) solve these two common paper-question patterns.
This is foundational to intermediate probability. Learn the addition rule, then practise three-set Venn diagrams. MIT's counting notes derive the three-set PIE formula.
A basic idea: count what is easier
For an event , the complement contains every outcome where does not happen. Together, and exhaust the sample space. For events and , the intersection is the overlap; the union contains every outcome in , in , or in both.
A complement is especially useful when the event we want has many ways to happen, but its opposite has only one or a few. For example, “at least one head in three coin tosses” covers seven different toss sequences. Its complement, “no heads,” is just . Three independent fair tosses give , so the chance of at least one head is . We replaced seven cases with one easier case. The two events cover every outcome without overlap, which is why subtracting from works.
A quick tour of formulas
If and are disjoint, is empty, so . For example, if 18 students join one club, 15 join another, and 7 join both, then join at least one.
For independent identical trials, with success probability , the probability of at least one success is . Independence is needed for the power .
Three overlapping sets
With three sets, add the three single-set totals, subtract the three pairwise overlaps, then add the three-way overlap back:
The centre belongs to all three single sets, so the first line counts it three times. It also belongs to all three pairwise intersections, so the second line removes it three times. Without the final addition, it would be counted zero times. The same formula works with probabilities in place of set sizes.
The animation uses 40 students in three clubs. Use Next to fill the seven regions inside the circles, then watch PIE recover the same union by adding, subtracting, and restoring the centre.
How to approach a three-set question
- Name the universe and the sets. Decide whether “both and ” includes members of ; unless the question says “exactly and ,” it does.
- Fill the centre first. Put in the three-way overlap.
- Fill each pair-only region. Subtract the centre from the corresponding pairwise intersection.
- Fill the single-only regions. Subtract the pair-only regions and the centre from each set total. A negative region signals inconsistent data or a counting mistake.
- Check the answer two ways. Add the seven regions inside the circles, then apply PIE. If the universe size is known, subtract the union to find how many are in none of the sets.
Application 1: three overlapping clubs
In a class of 40 students, club has 14 members, club has 14, and club has 12. The pairwise intersections have , , and members; one student is in all three. How many students are in at least one club, and how many are in none?
- Fill the centre and pair-only regions. The centre is . The pair-only counts are , , and .
- Fill the single-only regions. They are in only, in only, and in only.
- Count the union. The seven regions sum to . PIE checks this: .
- Count the outside. Of 40 students, belong to none of the clubs.
If a student is chosen uniformly from the class, the chance that they belong to at least one club is .
Application 2: at least one six
You roll a fair die four independent times. What is the probability of seeing at least one six?
- The complement is “no six on any roll.”
- Each roll has chance of no six; independence gives .
- The requested probability is .
The complement saves you from separately counting exactly one, two, three, and four sixes.
Resources
| Source | Title | Why read it |
|---|---|---|
| OpenStax | Two basic rules of probability | Learn the general addition rule. |
| OpenStax | Tree and Venn diagrams | See overlap and event complements visually. |
| OpenStax | Set operations with three sets | Practise reading the eight regions of a three-circle Venn diagram. |
| MIT OpenCourseWare | Lecture 17: More Counting | See the three-set inclusion-exclusion formula and why it works. |
Finished this module? Mark it done.
Comments
Stuck on something, spotted a mistake, or found a resource that helped you? Tell us below.
Loading comments