OCR MEI C2 — Question 4 12 marks

Exam BoardOCR MEI
ModuleC2 (Core Mathematics 2)
Marks12
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicArithmetic Sequences and Series
TypeReal-world AP: find term or total
DifficultyModerate -0.3 This is a straightforward multi-part question testing standard arithmetic sequence formulas (part a) and basic geometric progression properties including sum to infinity and logarithmic manipulation (part b). All techniques are routine C2 level with clear scaffolding - slightly easier than average due to the step-by-step guidance and standard textbook methods required.
Spec1.04h Arithmetic sequences: nth term and sum formulae1.04i Geometric sequences: nth term and finite series sum1.04j Sum to infinity: convergent geometric series |r|<11.06f Laws of logarithms: addition, subtraction, power rules

4
  1. André is playing a game where he makes piles of counters. He puts 3 counters in the first pile. Each successive pile he makes has 2 more counters in it than the previous one.
    1. How many counters are there in his sixth pile?
    2. André makes ten piles of counters. How many counters has he used altogether?
  2. In another game, played with an ordinary fair die and counters, Betty needs to throw a six to start. The probability \(\mathrm { P } _ { n }\) of Betty starting on her \(n\)th throw is given by $$P _ { n } = \frac { 1 } { 6 } \times \left( \frac { 5 } { 6 } \right) ^ { n - 1 }$$
    1. Calculate \(\mathrm { P } _ { 4 }\). Give your answer as a fraction.
    2. The values \(\mathrm { P } _ { 1 } , \mathrm { P } _ { 2 } , \mathrm { P } _ { 3 } , \ldots\) form an infinite geometric progression. State the first term and the common ratio of this progression. Hence show that \(\mathrm { P } _ { 1 } + \mathrm { P } _ { 2 } + \mathrm { P } _ { 3 } + \ldots = 1\).
    3. Given that \(\mathrm { P } _ { n } < 0.001\), show that \(n\) satisfies the inequality $$n > \frac { \log _ { 10 } 0.006 } { \log _ { 10 } \left( \frac { 5 } { 6 } \right) } + 1$$ Hence find the least value of \(n\) for which \(\mathrm { P } _ { n } < 0.001\).

Question 4:
Part ai:
AnswerMarks
\(13\)B1
Part aii:
AnswerMarks Guidance
\(120\)M1, A1 M1 for attempt at AP formula ft their \(a\), \(d\) or for \(3 + 5 + \ldots + 21\)
Part bi:
AnswerMarks Guidance
\(\dfrac{125}{1296}\)M1, A1 M1 for \(\dfrac{1}{6} \times \left(\dfrac{5}{6}\right)^3\)
Part bii:
AnswerMarks Guidance
\(a = 1/6,\ r = 5/6\) s.o.i.B1, B1 If not specified, must be in right order
\(S_{\infty} = \dfrac{\frac{1}{6}}{1 - \frac{5}{6}}\) o.B1
Part biii:
AnswerMarks Guidance
\(\left(\dfrac{5}{6}\right)^{n-1} < 0.006\)M1
\((n-1)\log_{10}\left(\dfrac{5}{6}\right) < \log_{10} 0.006\)M1 condone omission of base, but not brackets
\(n - 1 > \dfrac{\log_{10} 0.006}{\log_{10}\left(\dfrac{5}{6}\right)}\)DM1
\(n_{\min} = 30\)B1 NB change of sign must come at correct place
Or: \(\log(1/6) + \log(5/6)^{n-1} < \log 0.001\)M1
\((n-1)\log(5/6) < \log(0.001/(1/6))\)M1
## Question 4:

### Part ai:
$13$ | B1 | |

### Part aii:
$120$ | M1, A1 | M1 for attempt at AP formula ft their $a$, $d$ or for $3 + 5 + \ldots + 21$ |

### Part bi:
$\dfrac{125}{1296}$ | M1, A1 | M1 for $\dfrac{1}{6} \times \left(\dfrac{5}{6}\right)^3$ |

### Part bii:
$a = 1/6,\ r = 5/6$ s.o.i. | B1, B1 | If not specified, must be in right order |

$S_{\infty} = \dfrac{\frac{1}{6}}{1 - \frac{5}{6}}$ o. | B1 | |

### Part biii:
$\left(\dfrac{5}{6}\right)^{n-1} < 0.006$ | M1 | |

$(n-1)\log_{10}\left(\dfrac{5}{6}\right) < \log_{10} 0.006$ | M1 | condone omission of base, but not brackets |

$n - 1 > \dfrac{\log_{10} 0.006}{\log_{10}\left(\dfrac{5}{6}\right)}$ | DM1 | |

$n_{\min} = 30$ | B1 | NB change of sign must come at correct place |

Or: $\log(1/6) + \log(5/6)^{n-1} < \log 0.001$ | M1 | |

$(n-1)\log(5/6) < \log(0.001/(1/6))$ | M1 | |

---
4
\begin{enumerate}[label=(\alph*)]
\item André is playing a game where he makes piles of counters. He puts 3 counters in the first pile. Each successive pile he makes has 2 more counters in it than the previous one.
\begin{enumerate}[label=(\roman*)]
\item How many counters are there in his sixth pile?
\item André makes ten piles of counters. How many counters has he used altogether?
\end{enumerate}\item In another game, played with an ordinary fair die and counters, Betty needs to throw a six to start.

The probability $\mathrm { P } _ { n }$ of Betty starting on her $n$th throw is given by

$$P _ { n } = \frac { 1 } { 6 } \times \left( \frac { 5 } { 6 } \right) ^ { n - 1 }$$
\begin{enumerate}[label=(\roman*)]
\item Calculate $\mathrm { P } _ { 4 }$. Give your answer as a fraction.
\item The values $\mathrm { P } _ { 1 } , \mathrm { P } _ { 2 } , \mathrm { P } _ { 3 } , \ldots$ form an infinite geometric progression. State the first term and the common ratio of this progression.

Hence show that $\mathrm { P } _ { 1 } + \mathrm { P } _ { 2 } + \mathrm { P } _ { 3 } + \ldots = 1$.
\item Given that $\mathrm { P } _ { n } < 0.001$, show that $n$ satisfies the inequality

$$n > \frac { \log _ { 10 } 0.006 } { \log _ { 10 } \left( \frac { 5 } { 6 } \right) } + 1$$

Hence find the least value of $n$ for which $\mathrm { P } _ { n } < 0.001$.
\end{enumerate}\end{enumerate}

\hfill \mbox{\textit{OCR MEI C2  Q4 [12]}}