CAIE S1 2019 November — Question 7 11 marks

Exam BoardCAIE
ModuleS1 (Statistics 1)
Year2019
SessionNovember
Marks11
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicPermutations & Arrangements
TypeArrangements with adjacency requirements
DifficultyStandard +0.3 This is a standard permutations question with repeated letters requiring systematic case-by-case counting. Part (i) uses block arrangements, (ii) uses complement counting, (iii) is straightforward conditional probability, and (iv) requires careful enumeration of cases with restrictions. All techniques are routine for S1 level with no novel insight required, making it slightly easier than average.
Spec5.01a Permutations and combinations: evaluate probabilities5.01b Selection/arrangement: probability problems

7
  1. Find the number of different ways in which the 9 letters of the word TOADSTOOL can be arranged so that all three Os are together and both Ts are together.
  2. Find the number of different ways in which the 9 letters of the word TOADSTOOL can be arranged so that the Ts are not together.
  3. Find the probability that a randomly chosen arrangement of the 9 letters of the word TOADSTOOL has a T at the beginning and a T at the end.
  4. Five letters are selected from the 9 letters of the word TOADSTOOL. Find the number of different selections if the five letters include at least 2 Os and at least 1 T .
    If you use the following lined page to complete the answer(s) to any question(s), the question number(s) must be clearly shown.

Question 7(i):
AnswerMarks Guidance
AnswerMarks Guidance
\(6! = 720\)B1 Evaluated
Question 7(ii):
AnswerMarks Guidance
AnswerMarks Guidance
Total no. of arrangements: \(\frac{9!}{2!3!} = 30240\)B1 Accept unevaluated
No. with Ts together \(= \frac{8!}{3!} = 6720\)B1 Accept unevaluated
With Ts not together: \(30240 - 6720\)M1 Correct or \(\frac{9!}{m} - \frac{8!}{n}\), \(m,n\) integers \(>1\), or *their* identified total \(-\) *their* identified Ts together
\(23520\)A1 CAO
Alternative method:
\(\frac{7!}{3!} \times \frac{8\times7}{2}\)B1 \(7! \times (k>0)\) in numerator, cannot be implied by \({}^7P_2\) etc.
B1\(3! \times (k>0)\) in denominator
M1\(\frac{their\ 7!}{their\ 3!} \times {}^8C_2\) or \({}^8P_2\)
\(23520\)A1 CAO
Question 7(iii):
Answer: Number of arrangements \(= \frac{7!}{3!}\)
AnswerMarks Guidance
Probability \(= \dfrac{\text{their } \frac{7!}{3!}}{\text{their } \frac{9!}{3!2!}} = \frac{840}{30240}\)M1 *their* identified number of arrangements with T at ends ÷ *their* identified total number of arrangements; \(\frac{7!}{3!}\) or \(\frac{m}{9!}m, n\) integers \(> 1\)
\(\dfrac{1}{36}\) or \(0.0278\)A1 Final answer
Total: 2 marks
Question 7(iv):
AnswerMarks Guidance
\(OOT_{--}\) \(\quad {}^4C_2 = 6\)M1 \({}^4C_x\) seen alone or \({}^4C_x \times k \geq 1\), \(k\) an integer, \(0 < x < 4\)
\(OOTT_{-}\) \(\quad {}^4C_1 = 4\)
\(OOOT_{-}\) \(\quad {}^4C_1 = 4\)
AnswerMarks Guidance
\(OOOTT\) \(\quad = 1\)A1 \({}^4C_2 \times k\), \(k = 1\) or \({}^4C_1 \times m\), \(m = 1\) oe alone
M1Add 3 or 4 identified correct scenarios only, accept unsimplified
\((Total) = 15\)A1 CAO, WWW. Only dependent on 2nd M mark
Total: 4 marks
## Question 7(i):

| Answer | Marks | Guidance |
|--------|-------|----------|
| $6! = 720$ | B1 | Evaluated |

---

## Question 7(ii):

| Answer | Marks | Guidance |
|--------|-------|----------|
| Total no. of arrangements: $\frac{9!}{2!3!} = 30240$ | B1 | Accept unevaluated |
| No. with Ts together $= \frac{8!}{3!} = 6720$ | B1 | Accept unevaluated |
| With Ts not together: $30240 - 6720$ | M1 | Correct or $\frac{9!}{m} - \frac{8!}{n}$, $m,n$ integers $>1$, or *their* identified total $-$ *their* identified Ts together |
| $23520$ | A1 | CAO |
| **Alternative method:** | | |
| $\frac{7!}{3!} \times \frac{8\times7}{2}$ | B1 | $7! \times (k>0)$ in numerator, cannot be implied by ${}^7P_2$ etc. |
| | B1 | $3! \times (k>0)$ in denominator |
| | M1 | $\frac{their\ 7!}{their\ 3!} \times {}^8C_2$ or ${}^8P_2$ |
| $23520$ | A1 | CAO |

## Question 7(iii):

**Answer:** Number of arrangements $= \frac{7!}{3!}$

Probability $= \dfrac{\text{their } \frac{7!}{3!}}{\text{their } \frac{9!}{3!2!}} = \frac{840}{30240}$ | M1 | *their* identified number of arrangements with T at ends ÷ *their* identified total number of arrangements; $\frac{7!}{3!}$ or $\frac{m}{9!}m, n$ integers $> 1$

$\dfrac{1}{36}$ or $0.0278$ | A1 | Final answer

**Total: 2 marks**

---

## Question 7(iv):

$OOT_{--}$ $\quad {}^4C_2 = 6$ | M1 | ${}^4C_x$ seen alone or ${}^4C_x \times k \geq 1$, $k$ an integer, $0 < x < 4$

$OOTT_{-}$ $\quad {}^4C_1 = 4$

$OOOT_{-}$ $\quad {}^4C_1 = 4$

$OOOTT$ $\quad = 1$ | A1 | ${}^4C_2 \times k$, $k = 1$ or ${}^4C_1 \times m$, $m = 1$ oe alone

| M1 | Add 3 or 4 identified correct scenarios only, accept unsimplified

$(Total) = 15$ | A1 | CAO, WWW. Only dependent on 2nd M mark

**Total: 4 marks**
7 (i) Find the number of different ways in which the 9 letters of the word TOADSTOOL can be arranged so that all three Os are together and both Ts are together.\\

(ii) Find the number of different ways in which the 9 letters of the word TOADSTOOL can be arranged so that the Ts are not together.\\

(iii) Find the probability that a randomly chosen arrangement of the 9 letters of the word TOADSTOOL has a T at the beginning and a T at the end.\\

(iv) Five letters are selected from the 9 letters of the word TOADSTOOL. Find the number of different selections if the five letters include at least 2 Os and at least 1 T .\\

If you use the following lined page to complete the answer(s) to any question(s), the question number(s) must be clearly shown.\\

\hfill \mbox{\textit{CAIE S1 2019 Q7 [11]}}