Example 14: Independent A, B: at least one is
If A and B are two independent events, then the probability of occurrence of at least one of A and B is given by
Since and are independent, .
By the addition theorem of probability,
Writing ,
P(at least one of A and B) , as . Hence proved.
Want the reason behind every step, the basics and the checks?
"At least one of and " is the event . The addition theorem gives its probability; independence turns the overlap term into the product ; and some factoring with complements gives the neat form .
The form makes sense: at least one happens unless neither happens, and "neither" has probability for independent events.
- Given
- and are independent: .
- To show
- P(at least one of , ) .
- Plan
- Write "at least one" as ; use the addition theorem; replace by ; factor, and write as and as .
Basics you need
" or or both happen" is the event . Basics: events as sets
: add, but do not count the overlap twice. Basics: rules of probability
; and then and are independent too (Note after Example 13). Lesson: independent events
, so also . Basics: rules of probability
Solution
Write "at least one" as a union and use the addition theorem
"At least one of and " means happens, or happens, or both: that is the union. Adding and counts the outcomes in both events twice, so is subtracted once.The addition theorem. Basics: rules of probabilityUse independence
Since and are independent, . So
This is the only place where independence is used. For events that are not independent the overlap term cannot be written as a product, and the final formula would be false.Definition 3, Section 13.4. Lesson: independent eventsFactor out P(B), then use complements
This is the required result.
Line 1 takes out of the last two terms. Line 2 writes as . Line 3 writes the first term as , so that appears twice. Line 4 takes out of the two terms that contain it, so becomes . Line 5 writes as . These are the book's lines, one change per line.Complement rule: . Basics: rules of probabilityA shorter way: "at least one" fails only when neither happens
The shaded region is , "at least one". Everything else in is , "neither". So . "At least one of , " is the complement of "neither nor ", which is . Since and are independent, so are and (Note after Example 13). Hence
This is the same result in two lines. It shows where the formula comes from: is the chance that both fail, and "at least one" is everything else. It relies on the Note after Example 13; the algebra of Steps 1 to 3, which is the book's method, does not need it.(De Morgan's law). Basics: Venn diagrams
For independent events and , P(at least one of , ) . Hence proved.
(Textbook answer: P(at least one of A and B) = 1 − P(A′) P(B′).)
A die. Throw a fair die; let and . They are independent: .
At least one happens for the faces in , so .
The formula gives , which is . The two agree.
- Writing . That is only for mutually exclusive events; independent events with nonzero probabilities do overlap, and the overlap must be subtracted.
- Writing . is the probability that not both happen. "At least one" is , with the complements.
- Using the formula without independence. needs and independent.
- For independent events, , and is a product of complements. The same idea works for three or more independent events.
- Questions that say "the problem is solved" (by at least one person) use this formula; see Exercise 13.2, Question 14 and Question 12.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| "At least one" is | Step 1 | Class XI, Probability (Basics: events as sets) |
| Step 1 | Class XI, Probability (Basics: rules of probability) | |
| Independent: | Step 2 | Definition 3, Section 13.4 (Lesson: independent events) |
| Step 3 | Class XI, Probability (Basics: rules of probability) | |
| and independent when , are | Step 4 | Note after Example 13, Section 13.4 |
| Step 4 | De Morgan's law, Class XI, Sets (Basics: Venn diagrams) |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →