Problems with Combined Events
Solving problems on combined events: "at least one" by 1 − P(none), "at most" and "exactly one", stages that depend on the stage before, and choosing a possibility diagram, a tree diagram or a calculation.
What You Should Already Know
- From lesson 2.3: since and "not " are complementary. Add for "or" only when the events are mutually exclusive.
- From lessons 2.4 and 2.5: multiply for "and" when the events are independent; without replacement, the later branches of a tree change. For two fair dice,
"At Least One"
When two dice are rolled, "at least one 6" means one 6 or two 6s. Every outcome either has at least one 6 or has no 6 at all, and not both: the two events are complementary. "None" is a single case, found with one product, so find it and take it from 1.
"At least one"
"At least one" and "none" are complementary events, so their probabilities add up to 1.
Example 1: At least one 6 with two dice
Two fair dice are rolled. Find the probability of getting at least one 6. Check your answer on a possibility diagram.
Solution
The dice are independent, and for each.
Check: shade the cells with a 6 on the first die and ring those with a 6 on the second.
The cells with at least one 6 are the 6 shaded and the 6 ringed, with (6, 6) counted once: cells of 36. The other 25 cells have no 6.
Example 2: Checking light bulbs
The probability that a light bulb made in a factory is faulty is 0.02. An inspector picks 3 bulbs at random, and whether one is faulty does not affect another. Find the probability that (a) all 3 bulbs are good; (b) at least one bulb is faulty. Give your answers correct to 3 significant figures.
Solution
for each bulb.
(a)
(b) "At least one faulty" is the complement of "all good" (no faulty bulb).
Use the unrounded 0.941192 here: has lost a figure.
(a) 0.941; (b) 0.0588.
Example 3: Four rolls
A fair die is rolled 4 times. Find the probability of getting at least one 6, correct to 3 significant figures.
Solution
The rolls are independent.
Adding the cases of one, two, three and four 6s would take many paths of a tree; the complement takes one.
.
"Exactly One" and "At Most"
"Exactly one" leaves out the outcomes with more than one: list its paths (or cells) and add them. "At most" means that number or fewer: add the cases, or take the rest from 1.
Example 4: Exactly one 6
Two fair dice are rolled. Find the probability of getting exactly one 6.
Solution
Exactly one 6: a 6 then not a 6, or not a 6 then a 6. These cannot both happen, so add:
Check on the diagram of Example 1: the 11 cells with at least one 6, less (6, 6), which has two: 10 cells.
less than
Example 5: At most one head
Three fair coins are tossed. Find the probability of getting (a) at most one head; (b) at least one head.
Solution
(a) At most one head means no heads or exactly one head: TTT, or HTT, THT and TTH.
Or by the complement: at most one head is "not two or more heads", and two or more is HHT, HTH, THH or HHH, . .
(b)
(a) ; (b) .
When the Second Stage Depends on the First
In some problems the first stage decides how the second is done: which box a ball is taken from, or which bag. The branches of the second stage then differ from path to path. Multiply along each path and add the paths, as always.
Example 6: Two boxes
Box A holds 3 red and 2 blue marbles. Box B holds 2 red and 4 blue marbles. A box is chosen at random, and then a marble is taken at random from that box. Find the probability that the marble is red.
Solution
Each box is chosen with probability . From box A, ; from box B, .
Box A and red: Box B and red: .
Only one path happens, so add:
The answer is not , the 5 red marbles over all 11: the boxes are equally likely, but the marbles are not: each marble in box A has probability and each in box B
.
Choosing a Method
Every problem of this chapter is solved with a diagram, a rule, or both. Choose by the stages and by the events asked for.
Which diagram, which rule
Two stages with equally likely outcomes (two dice, a coin and a die, numbered cards): a possibility diagram; count the cells. Two cards taken without replacement fit one too, with the cells that take one card twice crossed out (lesson 2.5).
Stages with different probabilities, three stages or more, or draws without replacement by colour or kind (red or blue, good or faulty): a tree diagram; multiply along each path, add the paths that give the event.
"And": multiply only when the events are independent, or along a path of a tree. "Or": add only when the events are mutually exclusive, or for separate paths of a tree.
"At least one": . "At most": add the cases, or take the rest from 1.
Check that the probabilities of all the outcomes add up to 1.
Not a rule: "and" means multiply, "or" means add
On one roll of a fair die, not and not . The words alone do not decide: ask whether the events are independent, or mutually exclusive.
Example 7: Faulty bulbs without replacement
A box holds 9 light bulbs, 3 of which are faulty. Two bulbs are taken at random without replacement. Find the probability that (a) at least one bulb is faulty; (b) exactly one bulb is faulty.
Solution
The draws are without replacement, so use a tree with changing branches. Let G stand for good and F for faulty.
(a) None faulty is the path GG:
(b) Exactly one faulty: GF or FG.
Check: (b) and FF, make up (a):
(a) ; (b) .
Common Mistakes
- Adding to find "at least one". With two dice, is not a 6 on the first die and a 6 on the second are not mutually exclusive, and (6, 6) is counted twice. The answer is .
- Mixing up "at least one" and "exactly one". At least one 6 includes (6, 6): ; exactly one 6 does not: .
- Taking the wrong complement. "At least one" is , not
- Using "and → multiply, or → add" as a rule. It holds only for independent events (multiply) and mutually exclusive events (add), or along and across the paths of a tree.
- Rounding too early. is 0.0588, from ; rounding first, , has lost a figure.
Practice
Try each question first, then open the solution to check your working.
Question 1
Two fair coins are tossed. Find the probability of getting at least one head (a) by listing the outcomes; (b) by using .
ShowHide solution
(a) The outcomes are HH, HT, TH and TT, equally likely. At least one head: HH, HT and TH, so .
(b) None is TT: .
both ways.
Question 2
A fair die is rolled three times. Find the probability of getting (a) no 6; (b) at least one 6; (c) exactly one 6.
ShowHide solution
Let N stand for "not a 6". Each roll: , .
(a)
(b) one subtraction in place of the seven amber paths.
(c) 6NN, N6N or NN6, each
(a) ; (b) ; (c) .
Question 3
Hana says: "When two fair dice are rolled, the probability that at least one die shows a 5 or a 6 is ." Explain her mistake and find the correct probability.
ShowHide solution
She added the probabilities of "a 5 or 6 on the first die" and "a 5 or 6 on the second die", but these can happen together: (5, 5), (5, 6), (6, 5) and (6, 6). They are not mutually exclusive, so adding counts these 4 outcomes twice.
Neither die shows a 5 or a 6 when each shows 1 to 4: not .
The 4 outcomes with a 5 or 6 on both dice are counted twice; the probability is .
Question 4
The probability that a seed grows is 0.85, and one seed does not affect another. Three seeds are planted. Find the probability that at least one seed grows, correct to 3 significant figures.
ShowHide solution
0.997.
Question 5
Amir and Ben each try a puzzle on their own. The probability that Amir solves it is 0.7 and that Ben solves it is 0.5. Find the probability that (a) the puzzle is solved (by at least one of them); (b) exactly one of them solves it.
ShowHide solution
The two tries are independent.
(a) Not solved means both fail: .
(b) Amir only, or Ben only:
(a) 0.85; (b) 0.5.
Question 6
A coin is biased so that . It is tossed three times, and one toss does not affect another. Find the probability of getting (a) at most two heads; (b) at least two heads.
ShowHide solution
at every toss.
(a) At most two heads is every outcome except HHH: so
(b) At least two heads is HHH, or exactly two heads: HHT, HTH or THH, each
(a) 0.936; (b) 0.352.
Question 7
Two pupils are chosen at random from a group of 6 boys and 4 girls. Find the probability that at least one girl is chosen.
ShowHide solution
Without replacement. None a girl means both boys:
.
Question 8
Bag X holds 4 red and 1 white ball. Bag Y holds 2 red and 3 white balls. A fair die is rolled: if it shows 1 or 2, a ball is taken at random from bag X; otherwise a ball is taken at random from bag Y. Find the probability that the ball is (a) red; (b) white.
ShowHide solution
and .
(a)
(b) Check: .
(a) ; (b) .
Question 9
At a carnival game, Jia Hui throws a ball at a target until she hits it, with at most three throws. The probability that she hits with any throw is 0.4, and throws do not affect one another. Find the probability that she hits the target.
ShowHide solution
Let H stand for a hit and M for a miss. A path stops at the first hit.
She fails only if she misses all three, the amber path MMM: . This path is taken away from 1:
Check by adding the paths that end in a hit:
0.784.
Question 10
A tray holds 10 eggs, 2 of which are cracked. Three eggs are taken at random without replacement. Find the probability that at least one of them is cracked.
ShowHide solution
None cracked: all three from the 8 good eggs.
.
Question 11
A fair coin is tossed times. Find the least value of for which the probability of getting at least one head is more than 0.99.
ShowHide solution
so
This is more than 0.99 when is less than 0.01.
too big; less than 0.01.
.
Key Points
- "at least one" and "none" are complementary.
- "Exactly one": list its paths or cells and add them. "At most": add the cases, or take the rest from 1.
- When the first stage decides the second (which box), multiply along each path of the tree and add the paths.
- Use a possibility diagram for two equally likely stages (two cards without replacement too, the cells that take one card twice crossed out), a tree diagram for unequal stages, three stages or draws without replacement by colour or kind.
- Multiply for "and" only for independent events or along a path; add for "or" only for mutually exclusive events or separate paths.