Outcomes, events and equally likely outcomes
“
evaluate probabilities in simple cases by means of enumeration of equiprobable elementary events, or by calculation using permutations or combinations
A few words are used in every question, so it is worth fixing them first.
- An experiment is anything with an uncertain result: throwing a die, spinning a spinner, drawing a counter from a bag, choosing a student at random.
- Each possible result is an outcome. Throwing one ordinary die has six outcomes: .
- The list of every possible outcome is the sample space.
- An event is a collection of outcomes you are interested in, named by a capital letter. For one throw of a die, = "the score is even" is the collection .
The notation used throughout this note:
- is the probability that happens. It is always between (impossible) and (certain).
- , read " dash" or "not ", is the complement of : every outcome that is not in .
- means " and ": the outcomes that are in both.
- means " or (or both)".
- (a capital letter for a number that depends on the outcome, such as "the number of heads") is a random variable, and means "the probability that comes out as ". Random variables are studied properly in the next note; here they are just a short way of naming an event.
- In working, means "which gives" and means "exactly when" (each statement implies the other).
Equally likely outcomes. When every outcome in the sample space has the same chance — a fair die, a fair spinner, an item chosen "at random" — a probability is nothing more than a count:
For the even score on a die, of the outcomes are in , so .
The complement rule. Every outcome is either in or in , never both. So if the sample space has outcomes and contains of them, contains the other , and
This is used constantly: when an event has many outcomes, it is often quicker to count the few outcomes not in it and subtract from .
The complement rule. Holds for every event, equally likely outcomes or not.
Count outcomes that really are equally likely
The counting formula only works if the outcomes you count are equally likely. When two dice are thrown, the totals are not equally likely: a total of can happen in six ways, a total of in only one. The fix is always the same — count at the level where outcomes genuinely are equally likely. For two dice that is the ordered pairs (first die, second die): and are different outcomes. For three dice it is the ordered triples.
Why are ordered pairs equally likely? Imagine one die is red and the other blue. The red die is fair, so each of its faces is equally likely; whatever it shows, the blue die's faces are equally likely too. So each of the (red, blue) pairs has the same chance, . The dice do not have to be different colours — it is just easier to see.
- 1
Decide what one outcome is, keeping order: (first die, second die), (first spinner, second spinner, third spinner).
Ordered outcomes are the ones that are equally likely.
- 2
Count all the outcomes. For several independent dice or spinners, multiply the numbers of faces: two dice give .
This is the denominator. A sample-space grid shows it at a glance for two dice or spinners.
- 3
List the outcomes in the event systematically (by first die, then second) and count them.
A system stops you missing or double-counting an outcome.
- 4
Divide, then simplify. If the event has many outcomes, count its complement instead and use .
The division is the definition of probability for equally likely outcomes.
A sample-space grid for two dice
Two fair four-sided dice, each numbered to , are thrown, and the two scores are added. Find the probability that the total is .
Show full working
Each of the 16 cells is one equally likely outcome (first die, second die), and shows its total. The four highlighted cells are the ones with total 5.
- 1
Decide what one outcome is. An outcome is an ordered pair (first die, second die), such as .
Ordered pairs are equally likely; the totals are not, so we must not count totals.
- 2
Count all the outcomes. Each die has faces, so there are equally likely outcomes — the cells of the grid.
For every one of the 4 results on the first die there are 4 results on the second.
- 3
List the outcomes with total , working through the first die in order: That is outcomes.
Going through the first die 1, 2, 3, 4 in turn guarantees none is missed. (1, 4) and (4, 1) are different outcomes and both count.
- 4
Divide the favourable count by the total count.
Favourable outcomes over total outcomes, because every outcome is equally likely.
- 5
Simplify.
Divide top and bottom by 4.
.
Using the complement to save counting
The same two fair four-sided dice are thrown. Find the probability that at least one of the dice shows a .
Show full working
- 1
Name the event and its complement. Let = "at least one die shows ". Then = "neither die shows ".
"At least one" covers three cases (first only, second only, both). Its complement is a single, simple case.
- 2
Count the outcomes in . If neither die shows , each die is , or :
Three choices for the first die, three for the second — the top-left 3 × 3 block of the grid.
- 3
Find .
9 of the 16 equally likely outcomes.
- 4
Use the complement rule.
Check by counting directly: the fourth row and fourth column of the grid hold 4 + 4 − 1 = 7 cells (the cell (4, 4) is in both).
.
Whenever you see "at least one", try the complement "none" first.
Listing ordered outcomes for three dice
Three fair six-sided dice, each with faces marked 1, 2, 3, 4, 5, 6, are thrown at the same time, repeatedly. For a single throw of the three dice, the score is the sum of the numbers on the top faces.
Find the probability that the score is 4 on a single throw of the three dice.
Show full working
- 1
Decide what one outcome is. An outcome is an ordered triple (first die, second die, third die).
Ordered triples are equally likely. A score is not.
- 2
Count all the outcomes.
Six results for each of the three dice.
- 3
Find which numbers can make a score of . Every die shows at least , so the three numbers are at least . To reach , exactly one die must show and the other two must show .
Reasoning about the smallest possible total finds every case quickly, rather than trying triples at random.
- 4
List the ordered triples. The can be on the first, second or third die: That is outcomes.
Forgetting that the 2 can be on any of the three dice (and writing only 1 outcome) is the usual slip here.
- 5
Divide.
Favourable over total.
- 6
Simplify.
Divide top and bottom by 3.
- 7
The mark scheme's version. Each particular triple has probability , and there are of them:
Same answer by the multiplication law of §04: the dice are independent, so one ordered triple has probability 1/6 × 1/6 × 1/6.
(or ).
Treating the totals of two dice as equally likely, and writing
Count ordered pairs: of the give , so
Only the ordered pairs are equally likely.
Counting and as one outcome
Keep order: they are two different outcomes of the two dice
Dropping order undercounts the favourable outcomes but not the total, so the probability comes out too small.
Listing "at least one" cases one by one and missing the overlap
Use the complement:
The complement is a single case, so nothing can be missed or double-counted.
Your turn
Write down what one outcome is before you count anything.
- 1
Two fair six-sided dice are thrown and their scores are added. Find the probability that the total is .
Stuck? Show hint
There are 36 ordered pairs. Go through the first die from 1 to 6 and ask what the second die must be.
Show solution
- 1
Total outcomes:
Ordered pairs (first die, second die).
- 2
Outcomes with total 8, first die in order: That is outcomes.
A first die of 1 would need a 7 on the second die, which is impossible.
- 3
Divide:
5 favourable out of 36. The fraction does not simplify.
Answer.
- 1
- 2
Three fair coins are thrown. Find the probability of obtaining exactly two heads.
Stuck? Show hint
List all ordered outcomes, such as HHT.
Show solution
- 1
All outcomes: That is equally likely outcomes.
Each coin has 2 results, and order matters.
- 2
Outcomes with exactly two heads: That is outcomes.
The single tail can be on any one of the three coins.
- 3
Divide:
3 of 8 equally likely outcomes.
Answer.
- 1
- 3
Two fair six-sided dice are thrown and the two scores are multiplied. Find the probability that the product is an even number.
Stuck? Show hint
A product is odd only when both numbers are odd. Find P(odd product) first.
Show solution
- 1
Name the complement. The product is odd only if both scores are odd. So "even product" has complement "both scores odd".
One even factor makes the whole product even, so the even case has many outcomes; the odd case has few.
- 2
Count the complement. Each die is , or :
Three odd faces on each die.
- 3
Find .
9 of the 36 ordered pairs.
- 4
Use the complement rule.
Even and odd products cover every outcome between them.
Answer.
- 1
- 49709/53 O/N 2022 Q4(a)3 marks
Three fair 4-sided spinners each have sides labelled 1, 2, 3, 4. The spinners are spun at the same time and the number on the side on which each spinner lands is recorded. The random variable denotes the highest number recorded.
Show that .
Stuck? Show hint
The highest number is 2 when every spinner shows 1 or 2, but not all three show 1.
Show solution
- 1
Count all the outcomes. equally likely ordered triples.
Four sides on each of three spinners.
- 2
Describe the event. The highest number is when every spinner shows or and at least one spinner shows .
If any spinner showed 3 or 4 the highest number would be bigger; if all showed 1 it would be 1.
- 3
List the triples made of 1s and 2s with at least one 2: That is outcomes.
One triple with three 2s, three with two 2s, three with one 2.
- 4
Divide. as required.
A 'show that' needs the listed outcomes and the total 64 visible — the answer alone earns nothing.
- 5
A quicker check (the mark scheme's method 3), part 1. All three spinners show 1 or 2: of the outcomes, so
Two allowed sides on each spinner. (The mark scheme writes this as (1/2)³, using the multiplication law of §04.)
- 6
Part 2. All three show 1: just outcome,
Only (1, 1, 1).
- 7
Part 3. Subtract:
"Highest is at most 2" minus "highest is 1" leaves "highest is exactly 2".
Answer.
- 1
The rest of this note
Can you do all of these?
Count ordered outcomes (pairs, triples) — they are equally likely; totals are not
For a random selection, divide the favourable count by ⁿCᵣ, counting each group separately and multiplying; count top and bottom the same way
To decide whether events are exclusive, give a reason: an outcome in both (not exclusive), or why they cannot happen together
For "at least one", find P(none) and subtract from 1
Add only for cases that cannot happen together; multiply only along one sequence of stages
For "one of each", multiply one order by the number of orders (3! for three different results)
When trials have different probabilities, list every case (HHT, HTH, THH) and work each out separately
Without replacement, update both numerator and denominator after every draw; use the number of arrangements of the colour letters as the multiplier
Put a probability on every branch you draw, including 1, and label every outcome; an impossible branch (0) may be drawn or left out
For a transfer between bags, write down the second bag's contents on each branch before its probabilities
In a process that depends on the previous stage, choose each factor from the stage before; end branches where the process stops
For P(A | B), the event after "given" goes in the denominator; from a table, divide by that row or column total
Reading a tree backwards: denominator = all paths ending in the condition; numerator = those that also pass through the other event
To test independence, find P(A ∩ B) from the table, grid or tree, compare it with P(A) × P(B), and write a conclusion
With an unknown, build the probability in terms of it, equate to the given value, solve, and reject any impossible root with a reason