GCSE Maths Higher · AQA · Combined & conditional probability
AND events multiply along the branch
Along a branch of a probability tree, and means multiply, never add. Each stage keeps only a fraction of what survived the stage before, so the combined chance of two events is smaller than either part. For independent events , and for dependent ones . Adding the branch probabilities is the single biggest grade 7 to 9 mark-loser in tree questions.
The other half of the trap is the repeated event. The same event happening n times is that fraction raised to a power, , not the fraction multiplied by how many times. Three Heads in a row is , not . The count belongs in the exponent.
Already know this is your gap? Skip the diagnostic and jump straight into the targeted lesson.
How to spot it in your own work
- You added the branch probabilities for an and, when you should have multiplied them.
- Your both-events answer came out larger than one of the single branch probabilities, which is impossible.
- For a repeated event you wrote instead of .
- You found an expected frequency by adding the chances first, then scaling by the number of trials.
An exam question that triggers it
Here is the structure of JUN22 Paper 1 Question 12b:
A game uses two bags.
and .
A player wins only with a Yes on both bags. The game is played 450 times. Find the expected number of winners.
The misconception adds first, , then scales to . The fix: multiply first, , then .
Why students fall for this
Adding is met first and overlearned. Students see "this or that" problems where probabilities add, and the habit carries over to "this and that" without the switch to multiplying. The word and reads like a signal to combine, and combining feels like adding.
The shrink is counter-intuitive. It feels as though wanting two things should be a bigger demand and so a bigger number, when in fact a both-events chance is always smaller than either part. Students who add never run the sense-check that would catch the answer exceeding a single branch.
Repeats hide the power. A question asks for the same event n times, and a half-recalled rule reaches for because that is the simpler operation, missing that each extra and is another factor and so an exponent.
The fix: Walk one branch, multiply, then sense-check
Step 1: identify the and. Wanting one event and another, along a single branch of the tree, is a multiply, not an add.
Step 2: multiply the branch probabilities. for independent events, or when the second depends on the first.
Step 3: sense-check against the branches. A both-events answer must be smaller than every single probability it was built from. If it is larger, you added by mistake.
Step 4: for repeats, use a power. The same event n times is . To solve , write the target as a matching power and equate exponents.
Worked example
NOV23·3·10b structure: Bag A green with probability , Bag B green with probability . Find P(both green).
- And means multiply.
- Sense-check. is smaller than both and , as a both probability must be. Trap: , larger than .
JUN22·1·12b structure: two bags with and , win on both, 450 plays. Find the expected winners.
- Multiply for the and. .
- Scale by the trials. . Trap: adding first gives .
NOV23·2·11 structure: a fair event with probability repeated n times, . Find n.
- Write the target as a power. , so .
- Equate exponents. . Trap: treating the repeats linearly gives .
Find out if this is costing you marks
The 10-minute diagnostic checks for this pattern (and four others) using AQA-style GCSE Higher items. Free, no signup, anonymous.
Common questions
- Do you add or multiply for two events that both happen?
Multiply. Along a branch, and means multiply, so , and the answer is smaller than either part. Adding gives a value larger than a single branch, which is impossible.
- Two bags give green with chances and . What is P(both green)?
. The trap, , adds the chances and exceeds the branch.
- How do you solve ?
A repeated and is a power, so the count sits in the exponent. Since , , giving , not the linear answer 32.
Related misconceptions
- At least one uses the complement ruleP(at least one) = 1 minus P(none at all). The complement route is the standard Higher method and avoids double-counting the cases where more than one event occurs.
- Conditional denominator is the restricted setWhen a condition is stated or a draw is made without replacement, the denominator shrinks to the remaining or matching set, not the original total.