First, list every­thing

Before you can work out any prob­a­bil­ity, you have to write down every­thing that could hap­pen, com­pletely and with no repeats. That list is called the sam­ple space. In this les­son you will learn the rules for writ­ing one and see that an event is just a part of it. Then we meet the tree dia­gram, the depend­able way to list every out­come of an exper­i­ment that hap­pens in stages.

The sam­ple space

The sam­ple space SS of a ran­dom exper­i­ment is the set of all its pos­si­ble out­comes. When you write one, fol­low two rules.

  • every pos­si­ble out­come must be included;
  • no out­come may appear twice.

The num­ber of out­comes is writ­ten n(S)n(S).

Exper­i­ment SS n(S)n(S)
Toss a coin {H,T}\{H, T\} 22
Roll a die {1,2,3,4,5,6}\{1, 2, 3, 4, 5, 6\} 66
A match {win,draw,lose}\{\text{win}, \text{draw}, \text{lose}\} 33
Toss two coins {HH,HT,TH,TT}\{HH, HT, TH, TT\} 44
Pick a whole num­ber from 11 to 2020 {1,2,…,20}\{1, 2, \ldots, 20\} 2020

The sam­ple space should fit the ques­tion being asked. For "will it rain?", {rain,no rain}\{\text{rain}, \text{no rain}\} is enough. But if you want to tell a driz­zle from a down­pour, you need {none,drizzle,light,heavy}\{\text{none}, \text{drizzle}, \text{light}, \text{heavy}\}.

Two coins. HTHT and THTH are dif­fer­ent out­comes. In one, the first coin shows heads and the sec­ond tails, and in the other it is the other way round. If you write {HH,HT,TT}\{HH, HT, TT\}, you lose an out­come, and the three that remain look equally likely when they are not.

A die and a coin together. Each of the six faces can pair with each of the two sides, giv­ing {1H,1T,2H,2T,…,6H,6T}\{1H, 1T, 2H, 2T, \ldots, 6H, 6T\}, n(S)=12n(S) = 12.

A bag of 33 green and 55 red balls. For one draw, the sam­ple space is the eight balls. It is best writ­ten {G1,G2,G3,R1,…,R5}\{G_1, G_2, G_3, R_1, \ldots, R_5\} and not {G,R}\{G, R\}, because the eight balls are equally likely while the two colours are not.

Events

An event is a col­lec­tion of out­comes, which means it is a sub­set of the sam­ple space. "The die shows more than 44" is the event {5,6}\{5, 6\}. "At least one head in two tosses" is the event {HH,HT,TH}\{HH, HT, TH\}.

When the out­comes are equally likely, the prob­a­bil­ity is a sim­ple count:

P(E)=n(E)n(S)\displaystyle P(E) = \frac{n(E)}{n(S)}

Exam­ple 1. With two coins, P(at least one head)=34\displaystyle P(\text{at least one head}) = \dfrac{3}{4}; P(exactly one head)=24=12\displaystyle P(\text{exactly one head}) = \dfrac{2}{4} = \dfrac{1}{2}; P(two tails)=14\displaystyle P(\text{two tails}) = \dfrac{1}{4}.

Exam­ple 2. With a die and a coin, P(even number and a head)=312=14\displaystyle P(\text{even number and a head}) = \dfrac{3}{12} = \dfrac{1}{4}.

Exam­ple 3. A stall at a fair sells three snacks, samosa, vada and idli, and two drinks, tea or lassi. A vis­i­tor chooses one of each at ran­dom. Then SS has 3×2=63 \times 2 = 6 pairs. The event "chooses vada" is {(vada,tea),(vada,lassi)}\{(\text{vada}, \text{tea}), (\text{vada}, \text{lassi})\}, so its prob­a­bil­ity is 26=13\displaystyle \dfrac{2}{6} = \dfrac{1}{3}.

Exam­ple 4. A whole num­ber from −4-4 to 44 is cho­sen at ran­dom. S={−4,−3,…,4}S = \{-4, -3, \ldots, 4\}, n(S)=9n(S) = 9. P(negative)=49\displaystyle P(\text{negative}) = \dfrac{4}{9}; P(a perfect square)=P({0,1,4})=39=13\displaystyle P(\text{a perfect square}) = P(\{0, 1, 4\}) = \dfrac{3}{9} = \dfrac{1}{3}. Be care­ful here: −4-4 and −1-1 are not squares.

Tree dia­grams

Some exper­i­ments hap­pen in stages. You toss a coin, then toss again. Or you pick from one bas­ket, then from another. The out­comes are then sequences, and it is easy to miss one. A tree dia­gram lists them all for you. From a start­ing point, draw one branch for each out­come of the first stage. From the end of each of those, draw one branch for each out­come of the sec­ond stage, and so on. Each com­plete path from the root to a tip is one out­come, and all the tips together make the sam­ple space.

Exam­ple 5. Toss a fair coin twice.

The first stage gives HH or TT. From each of these, the sec­ond stage again gives HH or TT. That makes four paths: HH,HT,TH,TTHH, HT, TH, TT. If we write 12\displaystyle \dfrac{1}{2} on every branch, each path has prob­a­bil­ity 12×12=14\displaystyle \dfrac{1}{2} \times \dfrac{1}{2} = \dfrac{1}{4}. So P(one head and one tail)=P(HT)+P(TH)=12\displaystyle P(\text{one head and one tail}) = P(HT) + P(TH) = \dfrac{1}{2}.

Tree diagram for two tosses of a fair coin: each branch H or T is labelled 1/2, and the four paths HH, HT, TH and TT each have probability 1/2 times 1/2 = 1/4.
Exam­ple 5: four equally likely paths.

Exam­ple 6. Bas­ket A holds one apple and two oranges; bas­ket B holds one banana and one mango. One fruit is taken from each.

From the root there are three branches (A1A_1, O1O_1, O2O_2), and from each of those, two more (BB, MM). That gives six paths. P(apple and banana)=16\displaystyle P(\text{apple and banana}) = \dfrac{1}{6}. P(an orange and a mango)=26=13\displaystyle P(\text{an orange and a mango}) = \dfrac{2}{6} = \dfrac{1}{3}.

Tree diagram: from the root three branches for basket A (apple A1, oranges O1 and O2), then from each two branches for basket B (banana B, mango M), giving six paths.
Exam­ple 6: six paths, one fruit from each bas­ket.

Exam­ple 7. A box has 22 red and 33 black pens. You pick one, note its colour and put it back, and then a friend picks one. As colours, the out­comes are RR,RB,BR,BBRR, RB, BR, BB, but watch out, because these are not equally likely. If we count pens instead, there are 5×5=255 \times 5 = 25 equally likely paths. RRRR cov­ers 2×2=42 \times 2 = 4 of them, and BBBB cov­ers 3×3=93 \times 3 = 9. So P(same colour)=4+925=1325\displaystyle P(\text{same colour}) = \dfrac{4 + 9}{25} = \dfrac{13}{25}.

Here is the rule of thumb for trees. Along a path, mul­ti­ply: P(RR)=25×25=425\displaystyle P(RR) = \dfrac{2}{5} \times \dfrac{2}{5} = \dfrac{4}{25}. Across dif­fer­ent paths, add.

Exam­ple 8. Now take three coins. The tree has 2×2×2=82 \times 2 \times 2 = 8 tips: HHH,HHT,HTH,HTT,THH,THT,TTH,TTTHHH, HHT, HTH, HTT, THH, THT, TTH, TTT. P(exactly two heads)=38\displaystyle P(\text{exactly two heads}) = \dfrac{3}{8}.

Tree diagram for three coin tosses with eight paths from HHH to TTT; the three paths with exactly two heads, HHT, HTH and THH, are ticked.
Exam­ple 8: exactly two heads on 3 of the 8 paths.

Prac­tice

  1. Write the sam­ple space and n(S)n(S) for: (a) rolling a die and not­ing whether the result is odd or even; (b) choos­ing a month of the year at ran­dom; (c) draw­ing one ball from a bag of 44 white and 66 black balls.
  2. A child has 22 shirts (red, blue) and 33 trousers (jeans, khaki, shorts). List the sam­ple space of out­fits as a table, and find the prob­a­bil­ity that a ran­dom out­fit includes the red shirt and shorts.
  3. Two coins are tossed. Find P(no heads)P(\text{no heads}) and P(at most one head)P(\text{at most one head}).
  4. A die is rolled and a coin tossed. Find the prob­a­bil­ity of (a) a 66 and a tail; (b) an odd num­ber; (c) a num­ber less than 33 with a head.
  5. Draw a tree dia­gram for toss­ing a coin three times. Find P(at least two tails)P(\text{at least two tails}) and P(all the same)P(\text{all the same}).
  6. Bag P has 11 red and 22 blue mar­bles; bag Q has 22 red and 11 blue. One mar­ble is taken from each. Use a tree to find P(both red)P(\text{both red}) and P(different colours)P(\text{different colours}).
  7. A spin­ner with three equal sec­tors, 11, 22, 33, is spun twice. List all out­comes and find the prob­a­bil­ity that the two num­bers add to 44.
  8. A card is drawn from ten cards num­bered 11 to 1010, replaced, and a sec­ond card drawn. Find P(both even)P(\text{both even}) and P(sum is 20)P(\text{sum is } 20).

Answers

Show answers
  1. (a) {odd,even}\{\text{odd}, \text{even}\}, 22. (b) {January,…,December}\{\text{January}, \ldots, \text{December}\}, 1212. (c) The ten balls, 1010.
  2. Six out­fits: (red, jeans), (red, khaki), (red, shorts), (blue, jeans), (blue, khaki), (blue, shorts). P=16\displaystyle P = \dfrac{1}{6}.
  3. 14\displaystyle \dfrac{1}{4}; {TT,HT,TH}\{TT, HT, TH\}: 34\displaystyle \dfrac{3}{4}.
  4. n(S)=12n(S) = 12. (a) 112\displaystyle \dfrac{1}{12}. (b) 612=12\displaystyle \dfrac{6}{12} = \dfrac{1}{2}. (c) 1H,2H1H, 2H: 212=16\displaystyle \dfrac{2}{12} = \dfrac{1}{6}.
  5. Eight paths. At least two tails: HTT,THT,TTH,TTTHTT, THT, TTH, TTT: 48=12\displaystyle \dfrac{4}{8} = \dfrac{1}{2}. All the same: HHH,TTTHHH, TTT: 14\displaystyle \dfrac{1}{4}.
  6. Nine equally likely paths. Both red: 1×2=21 \times 2 = 2: 29\displaystyle \dfrac{2}{9}. Dif­fer­ent colours: red-then-blue 1×1=11 \times 1 = 1, blue-then-red 2×2=42 \times 2 = 4: 59\displaystyle \dfrac{5}{9}.
  7. Nine out­comes (1,1),(1,2),…,(3,3)(1,1), (1,2), \ldots, (3,3). Sum 44: (1,3),(2,2),(3,1)(1,3), (2,2), (3,1): 39=13\displaystyle \dfrac{3}{9} = \dfrac{1}{3}.
  8. 100100 out­comes. Both even: 5×5=255 \times 5 = 25: 14\displaystyle \dfrac{1}{4}. Sum 2020: only (10,10)(10, 10): 1100\displaystyle \dfrac{1}{100}.