CAIE S1 2016 June — Question 6 9 marks

Exam BoardCAIE
ModuleS1 (Statistics 1)
Year2016
SessionJune
Marks9
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicPermutations & Arrangements
TypeArrangements with positional constraints
DifficultyModerate -0.8 This is a straightforward permutations and combinations question testing standard techniques: arrangements with repeated letters, positional constraints, and basic selection problems. All parts use direct formula application (9!/4!2! for repeated letters, treating grouped letters as one unit, basic combination counting) with no novel problem-solving required. Easier than average A-level due to being purely procedural.
Spec5.01a Permutations and combinations: evaluate probabilities5.01b Selection/arrangement: probability problems

6 Find the number of ways all 9 letters of the word EVERGREEN can be arranged if
  1. there are no restrictions,
  2. the first letter is R and the last letter is G ,
  3. the Es are all together. Three letters from the 9 letters of the word EVERGREEN are selected.
  4. Find the number of selections which contain no Es and exactly 1 R .
  5. Find the number of selections which contain no Es.

Question 6:
Part (i)
AnswerMarks Guidance
AnswerMarks Guidance
7560 waysB1 [1]
Part (ii)
AnswerMarks Guidance
AnswerMarks Guidance
RxxxxxxxG in \(\dfrac{7!}{4!}\)B1 \(7!\) alone seen in numerator or \(4!\) alone in denominator. \(\dfrac{7! \times 2}{4! \times 2}\) gets full marks
\(= 210\) waysB1 [2]
Part (iii)
AnswerMarks Guidance
AnswerMarks Guidance
e.g. EEEExxxxx in \(\dfrac{6!}{2!}\)B1 \(6!\) or \(5! \times 6\) seen in numerator or on own. Can be \(6! \times k\) but not \(6! \pm k\)
\(= 360\) waysB1 [2]
Part (iv)
AnswerMarks Guidance
AnswerMarks Guidance
1 R e.g. RVG or RVN or RGN \(= 3\)B1 [1]
Part (v)
AnswerMarks Guidance
AnswerMarks Guidance
no Rs e.g. VGN or 3C3 ways \(= 1\); 2 Rs e.g. RRV or 3C1 ways \(= 3\)M1 Summing at least 2 options for R
Total \(= 7\)A1, A1 [3] Correct outcome for no Rs or 2 Rs evaluated
## Question 6:

### Part (i)
| Answer | Marks | Guidance |
|--------|-------|----------|
| 7560 ways | **B1** [1] | |

### Part (ii)
| Answer | Marks | Guidance |
|--------|-------|----------|
| RxxxxxxxG in $\dfrac{7!}{4!}$ | **B1** | $7!$ alone seen in numerator or $4!$ alone in denominator. $\dfrac{7! \times 2}{4! \times 2}$ gets full marks |
| $= 210$ ways | **B1** [2] | |

### Part (iii)
| Answer | Marks | Guidance |
|--------|-------|----------|
| e.g. EEEExxxxx in $\dfrac{6!}{2!}$ | **B1** | $6!$ or $5! \times 6$ seen in numerator or on own. Can be $6! \times k$ but not $6! \pm k$ |
| $= 360$ ways | **B1** [2] | |

### Part (iv)
| Answer | Marks | Guidance |
|--------|-------|----------|
| 1 R e.g. RVG or RVN or RGN $= 3$ | **B1** [1] | |

### Part (v)
| Answer | Marks | Guidance |
|--------|-------|----------|
| no Rs e.g. VGN or 3C3 ways $= 1$; 2 Rs e.g. RRV or 3C1 ways $= 3$ | **M1** | Summing at least 2 options for R |
| Total $= 7$ | **A1**, **A1** [3] | Correct outcome for no Rs or 2 Rs evaluated |

---
6 Find the number of ways all 9 letters of the word EVERGREEN can be arranged if\\
(i) there are no restrictions,\\
(ii) the first letter is R and the last letter is G ,\\
(iii) the Es are all together.

Three letters from the 9 letters of the word EVERGREEN are selected.\\
(iv) Find the number of selections which contain no Es and exactly 1 R .\\
(v) Find the number of selections which contain no Es.

\hfill \mbox{\textit{CAIE S1 2016 Q6 [9]}}