Syllabus coverage
- Evaluate probabilities in simple cases by means of enumeration of equiprobable elementary events, or by calculation using permutations or combinations
- Use addition and multiplication of probabilities, as appropriate, in simple cases
- Understand the meaning of exclusive and independent events, including determination of whether events A and B are independent by comparing the values of and
- Calculate and use conditional probabilities in simple cases, including situations that can be represented by a sample space of equiprobable elementary events or by a tree diagram, and the use of
Part of the AS & A Level Maths syllabus 9709.
Events, complements and the sample space
A probability question is a question about a sample space: the list of everything that could happen. One item on the list is an outcome, a collection of outcomes is an event, and is the probability that event happens. The sample space is written , and the probability of the whole of it is 1.
The complement of , written , is everything in the sample space that is not in . Between them they cover every outcome, so and therefore . Every 'at least one' question is really a complement question: counting the outcomes where the event does not happen is quicker than counting the ones where it does.
Two events combine in two ways. is the intersection, read as 'A and B', and it holds the outcomes that are in both. is the union, read as 'A or B', and it holds the outcomes in at least one of them - the word 'or' in probability always includes the case where both happen.
| Notation | Read as | What it stands for |
|---|---|---|
| the probability of A | the outcomes in A as a fraction of the sample space | |
| the complement of A | every outcome that is not in A, with | |
| A and B | the outcomes that are in both A and B | |
| A or B | the outcomes in A, in B, or in both | |
| A given B | the probability of A when the sample space is restricted to B |
Equiprobable elementary events: counting is the whole method
When every outcome in the sample space is equally likely, a probability is nothing more than a count: . A fair die has six equally likely outcomes, a fair coin two, and a well-shuffled pack of cards fifty-two. Almost everything in this topic rests on that sentence, so the first move in any question is to decide what the equally likely outcomes are and how many of them there are.
Two fair dice give 36 equally likely outcomes, not 11. Writing the totals 2 to 12 down and treating them as equally likely is the single commonest mistake in the topic: a total of 7 can happen in six ways and a total of 2 in only one, so the totals are not equally likely even though each die is fair. Count pairs of faces, not totals, and the difficulty disappears.
Once the counts are written down the arithmetic is a fraction. , and . Write the fraction before you simplify it: the working is what the mark scheme follows, and a correct count that simplifies wrongly still scores the method mark.
| Total score | Number of ways | Probability |
|---|---|---|
| 2 | 1 | |
| 3 | 2 | |
| 4 | 3 | |
| 5 | 4 | |
| 6 | 5 | |
| 7 | 6 | |
| 8 | 5 | |
| 9 | 4 | |
| 10 | 3 | |
| 11 | 2 | |
| 12 | 1 |
Counting outcomes with permutations and combinations
When the sample space is too big to list, count it. The multiplication principle does most of the work: if a first choice can be made in ways and a second in ways, the two together can be made in ways. Three counters drawn one at a time from a bag of 10 give ordered selections, and two dice give outcomes - the same 36 you would have written out by hand.
The number of ways of arranging distinct objects in a line is , because there are choices for the first place, for the second, and so on down to 1. The number of ways of choosing objects from when the order does not matter is , and your calculator's nCr button computes it. For example committees of 3 can be chosen from 9 people, and pairs can be chosen from 4 women.
The one rule that must not be broken is that the top and the bottom of the fraction are counted the same way. If the sample space is a number of combinations - all the hands of 3 that could be chosen - then the event must be counted in combinations too. Mixing underneath with on top counts the same committee several times over, so the fraction that comes out is not the probability it looks like.
- Order matters (arrangements, finishing orders, passwords): count with or with the multiplication principle
- Order does not matter (committees, hands of cards, selections from a bag): count with
- The sample space of hands of 5 cards from 52 is
- The sample space of ordered selections of 3 counters from 10 is ; unordered it is
- A fraction whose top and bottom are counted in different ways is wrong however small the numbers are
Mutually exclusive events and the addition rule
Two events are mutually exclusive (or disjoint) when they cannot both happen. There is no outcome in both, so and . Throwing a head and throwing a tail with one coin are mutually exclusive; drawing a red counter and drawing a blue counter from a bag that holds only red and blue counters are mutually exclusive; scoring a total of 7 and scoring a total of 9 with two dice are mutually exclusive.
For mutually exclusive events the probabilities add: , and the same rule extends to any number of them. When the events are also exhaustive - between them they cover every outcome in the sample space - the probabilities add to exactly 1, which is a useful way to find a missing probability.
When events are not mutually exclusive you must not simply add, because the outcomes in both are then counted twice. The general formula takes the overlap out again. Explicit use of that formula is not required at 9709, but it is the safest check on a Venn diagram answer, and it explains why the addition rule needs the word 'exclusive' in front of it.
| The situation | The rule | An example |
|---|---|---|
| Mutually exclusive | a fair die shows 1 or 2: | |
| Mutually exclusive and exhaustive | the probabilities add to 1 | a fair die shows an odd number or an even number |
| Not mutually exclusive | subtract the overlap before adding | with , and , |
Independent events and the multiplication rule
Two events are independent when knowing that one of them has happened tells you nothing at all about the other. Tosses of a fair coin are independent, the faces of two separate dice are independent, and so are draws from a bag when each counter is put back before the next one is drawn.
For independent events the probabilities multiply: , and for three independent events the rule extends to . So the probability of three heads in three tosses is .
The distinction that decides most questions is with or without replacement. With replacement the bag is restored after each draw, so the probabilities never change and the draws are independent. Without replacement the first draw changes the contents of the bag, so the second probability is a conditional probability - and the multiplication rule becomes .
Take a bag holding 3 red and 2 blue counters and draw two. With replacement, . Without replacement one red counter has gone, so only 2 of the remaining 4 are red and . Both answers are smaller than the probability of the first counter being red, but they are different numbers, and that difference is the whole point of the topic.
Deciding whether two events are independent
Independence is decided by comparing two numbers: and . If the two are equal the events are independent; if they differ, even slightly, the events are dependent. Nothing else decides it - not the size of the probabilities, not the wording of the question, and not how plausible independence feels.
Suppose , and . Then , which equals , so A and B are independent. Now change to 0.3 and the same two events are dependent, because .
The same test works on a table of counts. In the group of 60 students used later on this page, and , so . But 18 students are boys who walk, so . The numbers are different, so being a boy and walking to school are not independent: boys are more likely than girls to walk.
There is a second, equivalent test which is often quicker in words: A and B are independent exactly when , that is when restricting attention to B leaves the probability of A unchanged. For the 60 students, , and . Those differ, which confirms what the first test said.
| The test | Independent when | Dependent when |
|---|---|---|
| against | the two values are equal | the two values are not equal |
| against | ||
| A mutually exclusive pair | never, unless one probability is 0 | always, when both probabilities are greater than 0 |
Conditional probability: restricting the sample space
is the probability that A happens given that B has happened. The phrase 'given that' is the whole of the definition: the sample space shrinks to B, and you count only the part of A that lies inside B. That gives , provided .
A table of counts makes this concrete. In a group of 60 students, 24 walk to school and the other 36 travel by bus. There are 30 boys in the group, and 18 of the boys walk to school, so 6 girls walk. Now ask for the probability that a student who walks to school is a boy. The condition 'walks to school' fixes the group at 24 students, and 18 of those are boys, so . The denominator is 24, not 60. Compare for a student chosen at random from the whole group: the condition has changed the probability, so the two events are not independent.
The formula and the counting must agree, and that is the check to use when a question gives probabilities instead of counts. Here and , so , the same . When only probabilities are given, that division is the only route.
Tree diagrams and the reverse conditional probability
A tree diagram handles dependent events cleanly. Each branch carries the probability of that outcome at that stage, the probability of a route through the tree is the product of the branches along it, and the branches leaving any point add to 1. The product along a route is the multiplication rule in its general form, , which is what makes trees correct without replacement as well as with it.
Take a bag holding 3 red and 2 blue counters and draw two without replacement. The first pair of branches is and . If red was taken first, 2 red and 2 blue remain, so the second branches are and ; if blue was taken first, 3 red and 1 blue remain, so they are and . Multiplying along each route gives , , and , and those four probabilities add to 1, which is the check that the tree is labelled correctly.
Adding routes answers the usual questions. The probability of at least one red counter is , and the complement does it in one line: . The probability that the two counters are the same colour is , since RR and BB are mutually exclusive routes.
The tree also answers a question asked backwards. Given that the second counter is red, what is the probability that the first was blue? Two routes end in red, RR and BR, and the given group is their total: . The shape of every answer like this is the same: the route you want on top, and the total of all routes that satisfy the condition underneath.
| Route | Calculation | Probability |
|---|---|---|
| RR | ||
| RB | ||
| BR | ||
| BB |
The exam standard: two counters from a bag
The standard 9709 question takes a bag, draws two or three counters without replacement, and asks for a probability. There are two correct routes and both earn method marks: the tree, where you multiply along the branches and add the routes you want, and the combinations count, where you count the selections that satisfy the condition over the total number of selections.
A bag holds 4 red and 6 blue counters and two are taken at random without replacement. By tree, the probability that they are different colours is . By combinations it is . Both routes give , which is the best possible check that the counting is right.
For three counters the tree has eight routes and the combinations count becomes the quicker of the two; for two counters the tree is usually clearer. Whichever route you take, write the fraction you are counting before simplifying it, because the mark scheme follows the count.
Questions asking for 'at least one' should be turned into complements. , and the route with no red is a single branch of the tree: , so the answer is . Counting the routes with at least one red directly needs three branches and invites an omission.
- Tree route: multiply along each route, then add the routes that make up the event
- Combination route: count the selections that satisfy the condition, over the total selections
- Same colour, different colour and exactly one of each are all 'add the routes' questions
- 'At least one' is always quicker as
- If the two routes disagree, the counting is wrong - find the disagreement before simplifying either answer
Key terms you must be able to define
- Event
- A collection of outcomes from a sample space. is the probability that event A happens.
- Sample space
- The set of all possible outcomes of an experiment, written . Its probability is 1.
- Equally likely outcomes
- Outcomes where none is more probable than another, so each has the same probability. A probability is then a count of outcomes divided by the size of the sample space.
- Complement
- , everything in the sample space that is not in A. .
- Mutually exclusive
- Events that cannot both happen, so and .
- Exhaustive
- Events that between them cover the whole sample space, so their probabilities add to 1.
- Intersection
- , the outcomes in both A and B. Read as 'A and B'.
- Union
- , the outcomes in A, in B, or in both. Read as 'A or B'.
- Independent events
- Events where ; knowing that one has happened does not change the probability of the other.
- Dependent events
- Events where the probability of one changes once the other is known, so .
- Conditional probability
- , the probability of A given that B has happened. The sample space is restricted to B.
- Tree diagram
- A diagram of successive events in which each branch is labelled with a probability. Multiply along a route and add the routes that make up the event.
- Two-way table
- A table of counts classified two ways, used to read off conditional probabilities by taking the row or column total as the denominator.
- With replacement
- Each item is returned before the next is taken, so the probabilities never change and the draws are independent.
- Without replacement
- Items are not returned, so every draw changes the sample space and the draws are dependent.
- At least one
- One or more. Handled by the complement: .
Applied
At AS & A Level the marks sit in the setup: choosing the model, stating the variable and writing the equation before any working. These show the shape of a full-mark answer, then you do the algebra yourself.
Calculate the probability that two fair dice score a total of 9. The sample space is the 36 pairs of faces. A total of 9 needs (3, 6), (4, 5), (5, 4) or (6, 3), so there are 4 ways and . Counting the 11 totals as equally likely would give and lose the mark.
A bag holds 4 red and 6 blue counters, and two are taken at random without replacement. Different colours can happen in two orders: and , so the answer is . The combination count agrees: .
In a group of 60 students, 30 are boys and 24 walk to school, and 18 of the students who walk are boys. Then , and , but . The values differ, so the events are not independent: a student who walks is more likely to be a boy than a student chosen at random.
Of 50 people, 18 own a cat but not a dog, 12 own both, 8 own a dog but not a cat and 12 own neither. Then , and . Since , owning a cat and owning a dog are independent here, and the conditional agrees: .
Four fair coins are tossed. The probability of at least one head is . Counting the routes with one, two, three and four heads directly needs four separate terms and gives the same answer, so the complement is worth looking for first.
Flashcards
Click a card to flip it. Mark honestly — the tracker uses this.
Exam-style questions
8 questions, 27 marks. Write your answer, then reveal the mark scheme and tick each point you actually made. Answering honestly here is what makes the rest of the site useful.
Mark scheme — tick each point you actually made
- M1
- A1not checked yet
Mark scheme — tick each point you actually made
- M1
- M1
- A1not checked yet
Mark scheme — tick each point you actually made
- B1
- B1
- B1so A and B are independentnot checked yet
Mark scheme — tick each point you actually made
- M1
- M1
- A1not checked yet
- A1not checked yet
Mark scheme — tick each point you actually made
- M1
- M1
- M1
- A1not checked yet
Mark scheme — tick each point you actually made
- M1
- M1
- A1
- A1
- A1
Mark scheme — tick each point you actually made
- B1
- B1
- B1
Mark scheme — tick each point you actually made
- M1
- M1
- A1not checked yet
Exam technique for this topic
- Decide what the equally likely outcomes are before calculating anything, and write the size of the sample space down. 'The 36 equally likely outcomes of two dice' is worth a mark by itself, and it stops you treating the 11 totals as equally likely.
- Ask whether the draws are with or without replacement. With replacement the probabilities never change; without replacement the second fraction is over one fewer, and its numerator depends on what was taken first.
- For a conditional probability, choose the denominator before doing any arithmetic. The group named after 'given' is the bottom of the fraction, and the top counts the members of that group which also satisfy the other condition.
- Never add probabilities unless the events are mutually exclusive, and never multiply unless the events are independent or the second factor is written as a conditional probability. If you are not told which, find and compare it with .
- Check the answer against 0 and 1, and check that the branches leaving any point of a tree diagram add to 1. An answer greater than 1 always means an outcome has been counted twice.