October 2020 Paper 2 Q5
5 A company needs to appoint 3 new assistants. 8 candidates are invited for interview; each candidate has a different surname. The candidates are to be interviewed one after another. The personnel officer randomly selects the order in which the candidates are to be interviewed by drawing their names out of a hat. One of the candidates is called Mr Browne and another is called Mrs Green.
5 of the 8 candidates invited for interview are women and the other 3 are men. The chief executive can’t make up his mind who to appoint so he randomly selects 3 candidates by drawing their names out of a hat.
| Scheme | Marks | AO |
|---|---|---|
| \(\dfrac{1}{8} \times \dfrac{1}{7}\) | M1 | 1.1a |
| \(\dfrac{1}{56}\) | A1 | 1.1 |
| [2] |
Notes
M1: or \(\dfrac{6!}{8!}\) oe
A1: CAO accept 0.0179
0.017857142
| Scheme | Marks | AO |
|---|---|---|
| \({}^5\mathrm{C}_3\) or \({}^5\mathrm{C}_2 \times {}^3\mathrm{C}_1\) seen [10, 30] | M1 | 1.1a |
| \({}^8\mathrm{C}_3\) is denominator [56] {equiv to \({}^8\mathrm{C}_5\)} | B1 | 1.1 |
| P(3, 0) + P(2, 1) attempted | M1 | 2.1 |
| \(\dfrac{5}{7}\) | A1 | 1.1 |
| [4] |
Notes
OR 3W 10 ways
2W1M 10x3 = 30 ways
1W2M 5x3 = 15 ways
3M 1 way
So \(\dfrac{10 + 30}{10 + 30 + 15 + 1} = \dfrac{5}{7}\)
Allow M1 if the 2 cases are identified and added, whatever the calculation.
Allow method by subtraction from 1.
This question can be done by tree diagram, with similar working.
Alternative solution
| Scheme | Marks | AO |
|---|---|---|
| alternatively \(\frac{5}{8} \times \frac{4}{7} \times \frac{3}{6}\) or \(3 \times \frac{5}{8} \times \frac{4}{7} \times \frac{3}{6}\) seen | M1 | 1.1a |
| both correct including \(\times 3\) | A1 | 1.1 |
| P(3, 0) + P(2, 1) attempted | M1 | 2.1 |
| \(\dfrac{5}{7}\) | A1 | 1.1 |
M1: \(\dfrac{60}{336}\) or \(\dfrac{5}{28}\) or \(\dfrac{180}{336}\) or \(\dfrac{15}{28}\)
M1: Allow even if \(\times 3\) missing
Allow both M marks for all denoms 8 – eg \(\frac{5}{8} \times \frac{4}{8} \times \frac{3}{8} = \frac{60}{512}\) etc leading to \(\frac{15}{32}\)