In simple terms
A friendly intro before the formal notes — no formulas yet.
Mapping Out Chance
Probability turns a vague sense of 'likely' into a number between 0 and 1. Venn diagrams and tree diagrams are the two maps that make that number easy to find: one sorts a group by overlapping labels, the other traces a sequence of choices step by step.
Think about a class survey. A Venn diagram is like sorting everyone into overlapping hoops on the floor — one hoop for students who play football, one for those who play chess, and the overlap for the few who do both; the probability of a random student playing football is just the fraction of people standing in that hoop. A tree diagram is different: it maps a story that unfolds in stages, like drawing two sweets from a bag one after another, where each branch remembers what already happened and adjusts the odds for what comes next.
- 1
Name the sample space — the complete set of equally likely outcomes — and count it.
- 2
Decide the shape of the problem: a Venn diagram for one population with overlapping labels, a tree diagram for events that happen in sequence.
- 3
Fill the diagram carefully. For a Venn diagram start from the innermost overlap; for a tree diagram check whether the second stage is with or without replacement.
- 4
Read off the answer with the right rule — add along a union, multiply along a branch, divide for a conditional probability — and show the method that earns the marks.
Explore the concept
Use the live diagram, PhET or GeoGebra sim, and synced steps — play it, drag controls, or tap a step.
Step 1
Name the sample space — the complete set of equally likely outcomes — and count it.
Key formulas
Tap any symbol to reveal exactly what it means and its units.
Full topic notes
Formal explanation with the rigour you need for the exam.
Sample space, probability and the complement
An experiment's sample space, written , is the set of all possible outcomes. When those outcomes are equally likely, the probability of an event is the fraction of the sample space it fills: count the favourable outcomes and divide by the total. Every probability lies between 0 (impossible) and 1 (certain). The complement of , written , is the event that does not happen — and since and together make up the whole sample space, their probabilities add to 1.
Probability of an event: , with . \n Complement: .
Sample space : every possible outcome. On a Venn diagram it is the surrounding rectangle.
Probability: for equally likely outcomes, favourable outcomes over total outcomes.
Complement : 'not '. Use , especially for 'at least one' questions where the complement is 'none'.
Combined events, the addition rule and mutual exclusivity
Two events can be combined in two ways. Their intersection is 'A and B' — both happening. Their union is 'A or B or both'. If you simply add and you count the overlap twice, so the addition rule subtracts it back off. When two events cannot occur together they are mutually exclusive: their intersection is empty, , and the addition rule reduces to a plain sum.
Addition rule: . \n Mutually exclusive events: , so .
The single most common addition-rule slip is forgetting the term. Only drop it when you have checked the events are mutually exclusive. If the events overlap and you leave it out, your union exceeds its true value — and often exceeds 1, which should ring an alarm.
Venn diagrams: classifying a population
A Venn diagram is the right tool when one population is labelled by several attributes. A rectangle holds the sample space ; circles inside it hold the events; the overlap is the intersection and the region outside every circle is the complement of the union — 'neither'. The reliable way to fill one is to start at the innermost overlap and work outward, subtracting as you go so nothing is double-counted, then check that every region sums to the population total.
The rectangle is the sample space ; each circle is an event.
The overlap is the intersection ('A and B'); the combined region is the union ('A or B').
The region outside all circles is ('neither A nor B').
Fill from the innermost overlap outward, subtracting so each region is counted once.
Independent events
Two events are independent when one occurring does not change the probability of the other — successive coin flips, for instance. The defining test is that the probability of both equals the product of the separate probabilities. This is genuinely different from mutual exclusivity: mutually exclusive events are strongly linked because one rules the other out, whereas independent events ignore each other entirely. Two events with non-zero probability can never be both at once.
Test for independence: and are independent if and only if . \n Equivalently, .
Tree diagrams for successive events
When an experiment happens in stages — draw one, then another — a tree diagram lays out every path. Each stage sprouts a set of branches whose probabilities sum to 1, and the probability of a full sequence is the product along its path. The crucial detail is replacement. WITH replacement, the item returns and the second stage repeats the first, so the draws are independent. WITHOUT replacement, the total falls by one and so does the count of whatever was drawn, so the second-stage branches are conditional on the first — which is conditional probability in visual form.
Branches leaving a single point always sum to 1.
Multiply along a path to find the probability of that whole sequence.
Add the probabilities of the separate paths that give the required overall result.
Check with vs without replacement before writing the second-stage probabilities.
Read the words 'with replacement' or 'without replacement' — or infer it from the context — before you fill the second stage. Without replacement, the second-stage denominator drops by one and the drawn colour's numerator drops too. Getting this wrong is the single biggest source of lost marks in tree-diagram questions.
Common mistakes examiners penalise
Confusing mutually exclusive with independent — mutually exclusive means (cannot co-occur); independent means (no influence). They are different, and non-trivial events cannot be both.
Dropping the term — only omit it after confirming the events are mutually exclusive. Otherwise the union is overstated, sometimes above 1.
Inverting the conditional formula — it is , dividing by the given event's probability. Writing answers a different question.
Not changing the second-stage probabilities without replacement — reduce the total (and the relevant count) by one; reusing the first-stage fractions treats the draw as with replacement.
Forgetting the second order in 'one of each' — 'one green and one yellow' includes both G–Y and Y–G, so add both paths; using only one halves the answer.
Filling a Venn diagram from the outside in — start at the innermost overlap and subtract outward, or regions get double-counted and the total will not match the population.
Adding probabilities that should be multiplied — multiply ALONG a path (a sequence), add ACROSS separate paths (alternatives); mixing these is a frequent tree-diagram error.
Model answer — marked the way our engine marks it
On Paper 2 the marks are analytic: each is tied to a specific line of working — a method mark (M) or an accuracy mark (A) — and an accuracy mark depends on the method mark it follows. Follow-through (FT) means an earlier slip need not cost the marks that build on it, provided the later step is correct on your own figures. The engine also ignores subsequent working (ISW) once a correct answer appears, and accepts any equivalent form and any correctly-rounded value. That protection only exists if the method is on the page. Study how each mark below is earned by a specific line.
Where this leads
The ideas in 4.4 are the foundation of everything probabilistic that follows. The multiplication and addition you do along tree branches become the mechanics of discrete random variables and expected value; conditional probability and independence underpin the binomial and normal models, where 'trials' are assumed independent; and the habit of naming the sample space, choosing the right diagram and showing each rule is exactly the discipline every Paper 2 probability question rewards. Master the two maps — a Venn diagram for one population with overlapping labels, a tree diagram for events in sequence — and the rest of the probability course becomes variations on a picture you already know how to draw.
Worked examples
See the formulas applied — reveal one step at a time, like the exam.
In a year group of 120 students, 65 study Mathematics (M), 52 study Physics (P), and 20 study both. A student is chosen at random. \n (a) Draw a Venn diagram to represent this information. \n (b) Find the probability that the student studies Mathematics but not Physics. \n (c) Find the probability that the student studies neither subject. \n (d) Given that a student studies Mathematics, find the probability that they also study Physics. [7]
- 1
(a) Venn diagram. Draw the rectangle with two overlapping circles, M and P. Start at the overlap: . [M1]\nMaths only: . Physics only: . In circles: , so neither . [A1 for all four regions: 45, 20, 32, and 23 outside]\n\n**(b) Maths but not Physics.** That is the 45 students in the Maths-only region: . [A1]\n\n**(c) Neither subject.** The 23 students outside both circles: (3 s.f.). [A1]\n\n**(d) Given Maths, also Physics.** This is conditional: the sample space shrinks to the 65 Maths students, of whom 20 also study Physics.\n [M1]\n (3 s.f.). [A1]
For two events, , and . \n (a) Find . \n (b) Determine whether and are independent. \n (c) Find . [6]
- 1
(a) Intersection from the addition rule. Rearrange : [M1]\n. [A1]\n\n**(b) Test for independence.** Compare with : [M1]\n, which equals . Since they are equal, and ARE independent. [A1]\n\n**(c) Conditional probability.** . [M1][A1]\nAs a check, this equals , exactly what independence predicts.
A bag contains 7 green balls and 5 yellow balls. David picks a ball at random and does not replace it, then picks a second ball at random. \n (a) Draw a tree diagram to show the possible outcomes. \n (b) Find the probability that David picks two green balls. \n (c) Find the probability that David picks one ball of each colour. [6]
- 1
(a) Tree diagram. Total . First pick: , . After one ball is removed, 11 remain (without replacement). [M1: first-stage probabilities]\nSecond pick if first was Green: , .\nSecond pick if first was Yellow: , . [A1: correct second-stage conditional probabilities]\n\n**(b) Two green.** Multiply along the G–G path: [M1]\n (3 s.f.). [A1]\n\n**(c) One of each colour.** This happens two ways, G–Y or Y–G, so add the two paths: [M1]\n (3 s.f.). [A1]
A bag has 6 red and 4 blue counters. Two are drawn without replacement. Draw a tree diagram and find the probability that the two counters are different colours. [5]
- 1
Model answer — full working.\n\nThere are counters. First draw: , . Since the first counter is NOT replaced, 9 counters remain for the second draw.\n\nSecond-draw (conditional) branches:\nAfter red: , .\nAfter blue: , .\n\nDifferent colours happens two ways — red then blue (RB), or blue then red (BR):\n\n\nAdd the two paths:\n (3 s.f.).\n\n---\nHow our marking engine awards the 5 marks:\n\n- M1 — tree with correct without-replacement probabilities. Awarded for a tree whose second stage uses a denominator of 9 with the reduced counts (, after red; , after blue). Reusing denominators (treating it as with replacement) loses this mark.\n- M1 — identify the two paths RB and BR. A method mark for recognising that 'different colours' is achieved by red-then-blue OR blue-then-red, not a single path.\n- M1 — add the two products. Awarded for combining the paths by addition, . This is the structural step the engine checks: multiply along, add across.\n- A1 — . The first accuracy mark, for the correct unsimplified sum. It depends on the method marks above and follows through: a candidate with slightly different (but correctly conditional) branches who adds their own products correctly still earns it.\n- A1 — . The final accuracy mark for the simplified value (equivalently ). FT applies — a correctly simplified version of the candidate's own keeps this mark.\n\n**'Accept equivalent forms and correct rounding.'** The engine accepts , , or as the final answer, and accepts the two products written in either order. Once a correct final value appears, ISW means later restatements do not lose marks.\n\nBottom line: three of the five marks are method marks that survive an arithmetic slip, and the two accuracy marks are shielded by follow-through. A candidate who writes only '' with no tree and no paths risks losing up to 3 marks; a candidate who draws the tree, shows RB and BR, and adds the products keeps the method regardless of a slip in the final number.
How it all connects
The big idea sits in the middle — tap a linked idea to explore the link.
Tap a linked idea to see how it connects back to the main topic — that connection is what examiners reward.
Glossary
Try to recall each definition before you reveal it.
Quick check
Answer in your head first — then tap to check. No pressure.
Revision flashcards
Flip the card. Test yourself before the exam.
Sample space and probability of an event
The sample space is the set of all possible outcomes. For equally likely outcomes, — the number of outcomes in divided by the total. Every probability satisfies .
Key takeaways
Review these before you close the topic — retrieval beats re-reading.
- ✓
Sample space : every possible outcome. On a Venn diagram it is the surrounding rectangle.
- ✓
Probability: for equally likely outcomes, favourable outcomes over total outcomes.
- ✓
Complement : 'not '. Use , especially for 'at least one' questions where the complement is 'none'.
Practice — then mark it
The whole point: a real Cambridge question, marked mark-by-mark.
Get a Paper 2 probability question marked: draw the tree, show every path, and see the marks awarded
Get a Paper 2 probability question marked: draw the tree, show every path, and see the marks awarded
Extra simulations & links
PhET, GeoGebra and other curated tools — open in a new tab.
Frequently asked
Checkpoint
One marked question is worth ten re-reads — close the loop before you move on.
Reading it isn’t knowing it — prove it.
Before you move on: do Get a Paper 2 probability question marked: draw the tree, show every path, and see the marks awarded on paper, snap a photo, and get examiner-style feedback on exactly where you win and lose marks.