Part (i)
4 marks
Approach
The bag has balls in total: numbered , numbered , and numbered . Drawing balls without replacement, the possible values of come from pairing these three labels: , , or , , . We count the number of ways to get each sum and divide by the total number of ways to choose balls from .
The total number of ways to choose balls from the bag is
For each value of :
- : both balls numbered , giving way.
- : one numbered and one numbered , giving ways.
- : either both numbered ( ways) or one numbered and one numbered ( ways), giving ways.
- : one numbered and one numbered , giving ways.
- : both numbered , giving ways.
Dividing each by and simplifying to a common denominator ,
|
|
|
|
|
|
| To check your answer: summing the five numerators gives , matching the common denominator exactly, so the probabilities sum to for every . ✓ |
Part (ii)
1 mark
With there are balls in the bag, with only one ball numbered . Substituting into the formula for from (i),
Explanation: can only arise from drawing two balls both numbered . Since there is only one ball numbered in the bag when , it is impossible to draw two of them, so this outcome cannot occur.
, since the bag contains only one -numbered ball when , so two s cannot both be drawn.
Part (iii)
6 marks
Approach
We compute and directly from the distribution in (i), then use and combine everything over the common denominator (squared, where needed) to match the required form.
Using the distribution from (i),
The numerator has as a factor:
For the variance, we first find :
Writing both terms over the common denominator ,
By GC, the numerator expands and simplifies to
| To check your answer: at (the case in part (ii)), and ; computing these directly from the six-ball distribution in (ii) by brute force gives the same values. ✓ |
and , where .