Mathematics 9709/61 — October/November 2012
Cambridge AS Level · Probability & Statistics 1 (S1) · worked solutions for every part, with the mark scheme
Topics Discrete Random Variables · Probability · Representation of Data · The Normal Distribution · Permutations and Combinations
Ashok has 3 green pens and 7 red pens. His friend Rod takes 3 of these pens at random, without replacement. Draw up a probability distribution table for the number of green pens Rod takes.
Approach
Let be the number of green pens Rod takes. Since Rod selects 3 pens from 10 (3 green, 7 red) without replacement, takes values . For each value, multiply the probabilities of the individual draws — the denominators decrease from 10 to 9 to 8 because pens are not replaced — and for mixed selections (1 or 2 green pens) multiply by the number of possible orderings of the colours. Present the results in a distribution table and confirm the probabilities sum to 1.
Working
For (all three pens are red):
For (one green, two red). The single green pen may occupy any of the 3 positions, so multiply by :
For (two green, one red). The single red pen may occupy any of the 3 positions, so multiply by :
For (all three pens are green):
Check that the probabilities sum to 1:
Probability distribution table:
| 0 | 1 | 2 | 3 | |
|---|---|---|---|---|
Answer
The probability distribution of the number of green pens is:
P(X=0)=7/24, P(X=1)=21/40, P(X=2)=7/40, P(X=3)=1/120
Walkthrough
The random variable we are interested in is , the number of green pens picked, which can only be 0, 1, 2 or 3. Because pens are drawn at random and without replacement, each probability is found by multiplying the individual draw probabilities, with the denominators dropping from 10 to 9 to 8.
For , every one of the three draws must be red, so we multiply . The numerator drops 7, 6, 5 as red pens are removed.
For , we need exactly one green and two red. The straightforward product assumes the green comes first. But the single green pen could equally be the second or third draw, so there are possible orderings — hence we multiply by 3.
For , we need two green and one red. The product assumes two greens then a red, but the red could sit in any of the three positions, so multiply by .
For , all three must be green: .
Finally, adding all four probabilities must give 1. This confirms the distribution is valid and is a good check against ordering or arithmetic slips.
Key Takeaways
- Drawing without replacement shrinks the pool, so denominators (and the matching numerators) decrease with each draw.
- When the desired selection can occur in several orders, multiply by the appropriate combination — the number of ways to choose the positions of the less frequent colour.
- A probability distribution table must list every possible value of the random variable with its probability, and the probabilities must sum to 1.
- This question is an example of a selection without replacement handled by direct enumeration.
Common Mistakes
- Omitting the ordering factor or for and , which makes the probabilities fail to sum to 1.
- Treating the draws as with replacement and using , etc.
- Leaving fractions unsimplified when the phrasing expects simplified forms (the mark scheme shows both forms).
- Presenting probabilities without a clear table format, losing clarity for the examiner.
Things to Be Careful About
- The denominators must be 10, 9, 8 — never constant — because the pens are not replaced.
- The combination factors count the position of the minority colour: for one green, for one red.
- Always sum the probabilities to check you get 1; any other total signals a missing ordering factor or an arithmetic error.
- Keep all working in fractions; decimal approximations can obscure the method and make it harder for the examiner to award the correct mark.
The rest of this paper
6 more questions- Q2Representation of Data5M
- Q3The Normal Distribution · Discrete Random Variables6M
- Q4Representation of Data · Probability7M
- Q5Discrete Random Variables7M
- Q6The Normal Distribution · Probability9M
- Q7Permutations and Combinations12M