All revision notes topics

Probability Diagrams — Venn & Tree DiagramsEdexcel IGCSE Maths: Revision notes

Section 1

How do we describe a Venn diagram numerically?

A Venn diagram shows how events overlap. In IGCSE you rarely draw one — you work from a description or table of numbers placed in each region.

For two events AA and BB in a sample space of size n(ε)n(\varepsilon):

  • The intersection A∩BA \cap B is the region where both events happen.
  • The union A∪BA \cup B is everything in AA, BB, or both.
  • A′A' (the complement) is everything not in AA.

Key formula: P(A∪B)=P(A)+P(B)−P(A∩B)P(A \cup B) = P(A) + P(B) - P(A \cap B)

This subtracts the overlap once so it isn't double-counted.

When you're given raw frequencies (e.g. "12 students study French, 9 study Spanish, 4 study both, 30 students in total"), always fill in the intersection region first, then work outwards, then find the region outside both circles by subtracting from the total.

Key termssample spaceintersectionunioncomplement
Common mistake

Do NOT add P(A)+P(B)P(A)+P(B) without subtracting P(A∩B)P(A\cap B) — this double-counts the overlap unless the events are mutually exclusive.

Example

30 students; 12 like Maths, 9 like Art, 4 like both. Overlap region = 4. Maths-only = 12-4 = 8. Art-only = 9-4 = 5. Neither = 30-(8+5+4) = 13.

Section 2

How do we read probabilities off a Venn diagram?

Once the diagram (or table) is filled with frequencies, probability is just that region ÷ total.

  • P(A)=n(A)n(ε)P(A) = \dfrac{n(A)}{n(\varepsilon)}
  • P(A∩B)=n(A∩B)n(ε)P(A \cap B) = \dfrac{n(A \cap B)}{n(\varepsilon)}
  • P(A∣B)P(A \mid B) (conditional probability) =n(A∩B)n(B)= \dfrac{n(A \cap B)}{n(B)} — restrict the total to only the region BB, since we are told BB has already happened.

Conditional probability questions on Venn diagrams are a common higher-tier trap: students divide by n(ε)n(\varepsilon) instead of n(B)n(B).

Key termsconditional probability
Exam tip

Whenever a question says "given that", instantly narrow your total to the given condition's region, not the whole sample space.

Common mistake

Writing P(A∣B)=n(A∩B)n(ε)P(A|B) = \dfrac{n(A\cap B)}{n(\varepsilon)} is wrong — the denominator must be n(B)n(B).

Section 3

How do we build a probability tree diagram?

A tree diagram shows outcomes of two or more events happening in sequence. Each branch is labelled with a probability, and branches from the same point must sum to 1.

Structure:

  1. First event: branches for each outcome, probabilities sum to 1.
  2. Second event: a new set of branches drawn from the end of each first-event branch.
  3. Multiply along a branch (path) to get the probability of that combined outcome.
  4. Add separate paths that lead to the same overall result.

P(A then B)=P(A)×P(B given the branch taken)P(A \text{ then } B) = P(A) \times P(B \text{ given the branch taken})

Always check: probabilities on branches from the same node add to 1, and probabilities of all end-of-tree outcomes add to 1 — a fast way to self-check your diagram.

Key termsbranchpath
Exam tip

"Multiply along the branches, add across the different paths" — say this to yourself every time.

Common mistake

Forgetting that probabilities on second-event branches change if events are dependent (see next section) — copying the same numbers on every second-stage branch is a common error.

Section 4

Independent vs dependent events on a tree — what changes?

Independent events (e.g. with replacement): the probability doesn't change between draws. Second-stage branches are identical regardless of which first branch you followed.

P(A and B)=P(A)×P(B)P(A \text{ and } B) = P(A) \times P(B)

Dependent events (e.g. without replacement): the probability changes because the sample space shrinks or composition changes after the first event. The denominator (and sometimes numerator) of the second-stage branch depends on what happened first.

Example — a bag has 5 red, 3 blue counters (8 total), no replacement:

  • P(Red then Red)=58×47P(\text{Red then Red}) = \dfrac{5}{8} \times \dfrac{4}{7} (one fewer red, one fewer total)
  • P(Red then Blue)=58×37P(\text{Red then Blue}) = \dfrac{5}{8} \times \dfrac{3}{7} (total reduced, but blue count unchanged)

Always ask: "does the first outcome change what's left?" If yes → dependent → adjust the second-stage fractions.

Key termsindependent eventsdependent eventswith replacementwithout replacement
Think of it like this

Think of "without replacement" like eating sweets from a bag — once one is gone, both the bag total and that flavour's count drop, changing the odds for your next pick.

Common mistake

Using the same denominator (e.g. 8) for both draws when counters are NOT replaced — the second draw's total must be one less.

Section 5

How do we answer "at least one" questions efficiently?

"At least one" (e.g. at least one head, at least one defective item) is usually fastest via the complement:

P(at least one)=1−P(none)P(\text{at least one}) = 1 - P(\text{none})

Find P(none of the event happening)P(\text{none of the event happening}) by multiplying the "not happening" branches along the tree, then subtract from 1. This avoids adding up many separate paths (e.g. exactly one, exactly two, etc.).

Combined tree + Venn questions often ask you to find a probability from the tree, then use it to complete a two-way table or Venn diagram — read carefully which representation the question wants your final answer in.

Key termscomplement rule
Exam tip

Spot the phrase "at least one" and immediately plan to compute 1−P(none)1 - P(\text{none}) rather than listing every combination.

Example

P(at least one 6 in two dice rolls) = 1−(56)2=1−2536=11361 - \left(\dfrac{5}{6}\right)^2 = 1 - \dfrac{25}{36} = \dfrac{11}{36}.

Must Know

  • P(A∪B)=P(A)+P(B)−P(A∩B)P(A \cup B) = P(A) + P(B) - P(A \cap B)
  • Fill Venn diagrams from the intersection outwards, then find "neither" by subtracting from the total.
  • Conditional probability from a Venn diagram: P(A∣B)=n(A∩B)n(B)P(A|B) = \dfrac{n(A\cap B)}{n(B)}, NOT over n(ε)n(\varepsilon).
  • On tree diagrams: multiply along a path, add across different paths; branches from one point sum to 1.
  • Without replacement = dependent events = adjust the total (and relevant count) on the next set of branches.
  • "At least one" is usually quickest via 1−P(none)1 - P(\text{none}).

That's the notes covered.

Carry on to the next subtopic.