Worked examples — Mutually exclusive events — addition rule
Every symbol used here is defined in the parent note. Quick refresher of the two workhorses:
The scenario matrix
Every addition-rule problem falls into exactly one of these case classes. The table lists them all, and the examples below are labelled with the cell they hit.
| Cell | Case class | What makes it tricky | Example |
|---|---|---|---|
| C1 | Disjoint events, just add | nothing — the friendly case | Ex 1 |
| C2 | Overlapping events, must subtract | the double-count trap | Ex 2 |
| C3 | Three+ pairwise-disjoint events | the sum | Ex 3 |
| C4 | Complement route () | "not" phrasing | Ex 4 |
| C5 | Degenerate: an impossible () or certain () event | zero / one edge inputs | Ex 5 |
| C6 | Impossibility check: | can they even be disjoint? | Ex 6 |
| C7 | Real-world word problem | translating words → sets | Ex 7 |
| C8 | Exam twist: solve backwards for an unknown overlap | rearranging the general rule | Ex 8 |
We use Venn diagrams throughout — two overlapping ovals inside a rectangle . See Venn diagrams in probability.

Example 1 — Disjoint, just add (Cell C1)
Step 1 — Write the events as sets. , . Why this step? Turning words into subsets of the sample space lets us see whether they overlap. See Probability — basic definitions & sample space.
Step 2 — Check the overlap. — no face is both a 1 and a 6. Why this step? This is the question the parent note begs us to ask: can both happen at once? No → the subtraction term is zero.
Step 3 — Add. Each face is equally likely, so , , and Why this step? With zero overlap the special rule applies — plain addition.
Example 2 — Overlapping, must subtract (Cell C2)
Step 1 — Name the events. , . Why this step? We need the sizes and, crucially, the overlap.
Step 2 — Find the overlap. Cards that are both a heart and a face card: the Jack, Queen, King of hearts — that's cards. So . Why this step? These three cards live in both ovals of the Venn diagram (Fig 1). Adding counts each of them twice.

Step 3 — Apply the general rule. Why this step? We add the pieces, then remove the double-counted overlap once — inclusion–exclusion. See General addition rule & inclusion–exclusion.
Example 3 — Three pairwise-disjoint events (Cell C3)
Step 1 — Confirm pairwise disjoint. A single spin gives exactly one colour, so no two colour-events can occur together: every pairwise intersection is . Why this step? The -event rule only applies when the events are pairwise mutually exclusive.
Step 2 — Sum the three probabilities. Why this step? With every overlap zero, every subtraction term vanishes — the union collapses to a plain sum.
Example 4 — The complement route (Cell C4)
Step 1 — Identify the event and its complement. Let , so . Why this step? "Not" phrasing screams complement. and are mutually exclusive and together fill (exhaustive). See Complementary events.
Step 2 — Use the complement corollary. Since , Why this step? Computing the four wrong options directly also works, but the complement is one clean subtraction — far less error-prone.
Example 5 — Degenerate inputs: zero and certain (Cell C5)
Step 1 — Assign the edge probabilities. No face shows 7, so and . Every face is , so and . Why this step? These are the boundary values probability allows: . They test whether the rule still behaves.
Step 2 — Union. Since , " or " is just : Check via the rule: , so ✓ Why this step? Adding an impossible event changes nothing — its probability contributes .
Step 3 — Intersection. , so . Why this step? An impossible event shares no outcome with anything, so and here are (trivially) mutually exclusive.
Example 6 — Can they be disjoint at all? (Cell C6)
Step 1 — Test the disjoint assumption. If mutually exclusive, . Why this step? Any probability, including a union, must satisfy . A value of is forbidden.
Step 2 — Conclude they must overlap. Because , they cannot be disjoint. Use the general rule with the constraint : Why this step? Rearranging the general rule turns the "" ceiling into a floor on the overlap.
Example 7 — Real-world word problem (Cell C7)
Step 1 — Translate to probabilities. With : Why this step? Equally-likely students mean probability = (count)/(30).
Step 2 — Apply the general rule (they overlap). Why this step? The 5 both-language students sit in the overlap of the Venn diagram; adding without subtracting would double-count them.

Step 3 — "Neither" via complement. Why this step? "Studies at least one" and "studies none" are complementary.
Example 8 — Exam twist: solve backwards (Cell C8)
Step 1 — Rearrange the general rule for the overlap. Why this step? The general rule has four quantities; given any three, algebra hands you the fourth. This is the exam's favourite move.
Step 2 — Mutually exclusive? No: , so there is an overlap. Why this step? Mutual exclusivity is exactly the statement ; a nonzero overlap rules it out.
Step 3 — Independent? For independence we would need . Check: . So they are not independent either. See Independent events — multiplication rule and Conditional probability. Why this step? Independence is a multiplication test on the intersection — a completely different condition from exclusivity (which is an addition-side condition).
Coverage check — did we hit every cell?
Recall Matrix cell → example
C1 disjoint add ::: Example 1 (die, 1 or 6) C2 overlapping subtract ::: Example 2 (heart or face card) C3 three pairwise-disjoint ::: Example 3 (spinner colours) C4 complement route ::: Example 4 (wrong guess) C5 degenerate 0 / 1 inputs ::: Example 5 (roll a 7 / roll ) C6 sum > 1 impossibility ::: Example 6 (rain & wind) C7 real-world word problem ::: Example 7 (French / Spanish) C8 exam twist, solve backwards ::: Example 8 (find the overlap)
Connections
- Mutually exclusive events — addition rule (parent)
- General addition rule & inclusion–exclusion
- Complementary events
- Independent events — multiplication rule
- Conditional probability
- Venn diagrams in probability
- Probability — basic definitions & sample space