Binomial probabilities
Recognise B(n, p), then translate the words
- In 15 of 20 recent exams
- 2% of the marks
- Paper 2, calculator
- 2 to 4 marks
How it is set in the exam
Paper 2 (calculator) only, 2–4 marks. Very common (15 of 20 exam versions, 21 parts). In 8 of those versions p comes from an earlier normal part.
Exam phrases to spot (6)
“find the probability that exactly r …”
“at least one”
“fewer than k”
“more than k”
“between a and b inclusive”
“n items are chosen at random”
In disguise (5)
- "a random sample of n is taken" from a large population with a known proportion: each member is a trial with the same p
- p is not a number in the question: it comes from an earlier part (a normal probability, a table, an earlier binomial)
- "no more than one of the remaining days": count the successes (or the failures) in the trials that are left
- E(X) and Var(X) are given, or linked, and p (or n) is asked for: np and np(1−p) give the equations
- n is the unknown, and a cumulative probability such as P(X≤k) is stated (rounded) instead of a target to pass: tabulate it against n, as for a least n, and give the n whose value is closest. There is no inequality and no rounding up (a markscheme may accept the neighbouring n as well)
Variants (5)
- asked = exactly, at most, fewer than, at least, more than, between (inclusive), at least one
- p from = given, a normal part, a table, an earlier binomial; n large (hundreds)
- count = successes or failures (either works)
- p from a relation between the mean and the variance
- n unknown, with at least k successes: a table over n
Looks like it, but isn't (6)
- draws without replacement from a small group: Tree diagrams and repeated draws
- , a few repeats of an experiment: Build the distribution from the experiment (count the orders)
- n unknown, and "at least one": Find n
- "given that": Given that X is in a range
- only the expected number, np: the expected number of occurrences
- a bracket of probability-like numbers raised to a power, where one term's number is asked and nothing is random: Expand, or find one term or coefficient (the same number as a binomial probability:
Several words in one question
An archer hits the target with probability 0.65 on each shot, independently of her other shots. She shoots 16 arrows. Find the probability that she hits the target
(a) exactly 11 times; [2]
(b) fewer than 9 times; [2]
(c) between 8 and 12 times inclusive. [2]
Try it yourself first, then compare.
Now try one like it
Write your working on paper or on screen. Paper Zero marks it step by step, like the worked example, and shows where each mark went. Free, with no account.
- P(exactly 11) =P(X=11)=0.201: one bar.
- X∼B(16,0.65): 17 bars, from 0 to 16, with mean np=10.4.
- Fewer than 9 leaves 9 out: the bars up to 8.
- Between 8 and 12 inclusive keeps both ends: up to 12 minus up to 7, not up to 8.
- The calculator's cdf adds the bars from 0, so every range is up to minus up to.
X counts whole numbers, so every phrase becomes a ≤ form before the GDC (binomial probabilities):
- exactly r
- Translation
- P(X=r)
- On the GDC
- at most k
- Translation
- P(X≤k)
- On the GDC
- cdf up to k
- fewer than k
- Translation
- P(X≤k−1)
- On the GDC
- cdf up to k−1
- at least k
- Translation
- P(X≥k)=1−P(X≤k−1)
- On the GDC
- 1− cdf up to k−1
- more than k
- Translation
- P(X≥k+1)=1−P(X≤k)
- On the GDC
- 1− cdf up to k
- a to b inclusive
- Translation
- P(a≤X≤b)=P(X≤b)−P(X≤a−1)
- On the GDC
- cdf up to b minus cdf up to a−1
- at least one
- Translation
- 1−P(X=0)=1−(1−p)n
- On the GDC
- pdf at 0
| The words | Translation | On the GDC |
|---|---|---|
| exactly r | P(X=r) | |
| at most k | P(X≤k) | cdf up to k |
| fewer than k | P(X≤k−1) | cdf up to k−1 |
| at least k | P(X≥k)=1−P(X≤k−1) | 1− cdf up to k−1 |
| more than k | P(X≥k+1)=1−P(X≤k) | 1− cdf up to k |
| a to b inclusive | P(a≤X≤b)=P(X≤b)−P(X≤a−1) | cdf up to b minus cdf up to a−1 |
| at least one | 1−P(X=0)=1−(1−p)n | pdf at 0 |
With n unknown: for at least one, 1−(1−p)n> target is Find n. For at least k with k≥2 there is no formula to solve: tabulate P(X≥k)=1−P(X≤k−1) against n (table of values), and give the least n that works, with the values for n−1 and n written down.
- 1
Check the model:
a fixed number of trials, two outcomes, the same p, independent trials. Say what a success is.
- 2
State X∼B(n,p) with the numbers.
This is the recognition mark: the word "binomial" can earn it (one markscheme accepts it even with wrong parameters), but n and p often carry a mark of their own and every later mark uses them, so write them; np on its own doesn't. A p from an earlier part goes in unrounded (markschemes also accept the answer that its 3 s.f. value gives, but the stored value is safe).
- 3
Translate the words
(table above) and write the probability statement.
- 4
GDC:
binomial probabilities. Round to 3 s.f., or to the accuracy asked.
- 5
Check:
the answer is between 0 and 1, and its size fits the mean np (a count far from np has a small probability).
Strict words read as non-strict
"fewer than 9" is X≤8, and "more than 20" is 1−P(X≤20), not 1−P(X≤19).
"At least k" as 1−P(X≤k)
that leaves out X=k itself. "At least 8" is 1−P(X≤7); the complement form has its own method mark.
"Between … inclusive" cut at the wrong place
P(8≤X≤12)=P(X≤12)−P(X≤7).
More mistakes (5)
No recognition
write "X∼B(16,0.65)" (or "binomial, n=16, p=0.65"). np alone doesn't show the model.
A binomial for draws without replacement
p changes after each draw. Markschemes then give only the mark for writing the first draw's probability, and nothing more (Tree diagrams and repeated draws).
Remaining trials
when some trials are over, only the ones left are random, and the successes so far reduce the number still needed.
Keeping an impossible p
a negative p, or p>1, must be rejected with the reason.
Calculator notation as the answer
write P(X≤8)=0.159, never the GDC's command.