OCR MEI FP1 2012 January — Question 6 8 marks

Exam BoardOCR MEI
ModuleFP1 (Further Pure Mathematics 1)
Year2012
SessionJanuary
Marks8
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicProof by induction
TypeProve summation with exponentials
DifficultyStandard +0.8 This is a standard proof by induction for a summation involving exponentials and a linear term (r·3^(r-1)). While it requires careful algebraic manipulation in the inductive step—particularly factoring out 3^n and simplifying to match the target form—it follows the standard induction template without requiring novel insight. The algebraic complexity is moderate but manageable for Further Maths students, placing it somewhat above average difficulty.
Spec4.01a Mathematical induction: construct proofs

6 Prove by induction that \(\sum _ { r = 1 } ^ { n } r 3 ^ { r - 1 } = \frac { 1 } { 4 } \left[ 3 ^ { n } ( 2 n - 1 ) + 1 \right]\). Section B (36 marks)

Question 6:
AnswerMarks Guidance
AnswerMarks Guidance
When \(n=1\): \(\sum_{r=1}^{1} r \cdot 3^{r-1} = 1 \times 3^0 = 1\) and \(\tfrac{1}{4}[3^n(2n-1)+1] = \tfrac{1}{4}[3(2-1)+1] = 1\), so true for \(n=1\)B1
Assume \(\sum_{r=1}^{k} r \cdot 3^{r-1} = \tfrac{1}{4}[3^k(2k-1)+1]\)E1 Assuming true for \(k\)
\(\sum_{r=1}^{k+1} r \cdot 3^{r-1} = \tfrac{1}{4}[3^k(2k-1)+1] + (k+1)3^{k+1-1}\)M1* Adding \((k+1)\)th term (incorrect expressions on LHS lose final E1)
\(= \tfrac{1}{4}[3^k(2k-1)+1+4(k+1)3^k]\)M1 dep* Attempt to obtain factor of \(\tfrac{1}{4}\)
\(= \tfrac{1}{4}[3^k(2k-1+4(k+1))+1]\)M1 dep* For \([3^k(ak+b)+c]\), \(c \neq 0\)
\(= \tfrac{1}{4}[3^k(6k+3)+1]\)
\(= \tfrac{1}{4}[3^{k+1}(2k+1)+1]\)A1
\(= \tfrac{1}{4}[3^{k+1}(2(k+1)-1)+1]\) Or target seen
Therefore if true for \(n=k\) it is also true for \(n=k+1\). Since it is true for \(k=1\), it is true for all positive integers.E1, E1 Dependent on A1 and previous E1; Dependent on B1 and previous E1
[8]
## Question 6:
| Answer | Marks | Guidance |
|--------|-------|----------|
| When $n=1$: $\sum_{r=1}^{1} r \cdot 3^{r-1} = 1 \times 3^0 = 1$ and $\tfrac{1}{4}[3^n(2n-1)+1] = \tfrac{1}{4}[3(2-1)+1] = 1$, so true for $n=1$ | B1 | |
| Assume $\sum_{r=1}^{k} r \cdot 3^{r-1} = \tfrac{1}{4}[3^k(2k-1)+1]$ | E1 | Assuming true for $k$ |
| $\sum_{r=1}^{k+1} r \cdot 3^{r-1} = \tfrac{1}{4}[3^k(2k-1)+1] + (k+1)3^{k+1-1}$ | M1* | Adding $(k+1)$th term (incorrect expressions on LHS lose final E1) |
| $= \tfrac{1}{4}[3^k(2k-1)+1+4(k+1)3^k]$ | M1 dep* | Attempt to obtain factor of $\tfrac{1}{4}$ |
| $= \tfrac{1}{4}[3^k(2k-1+4(k+1))+1]$ | M1 dep* | For $[3^k(ak+b)+c]$, $c \neq 0$ |
| $= \tfrac{1}{4}[3^k(6k+3)+1]$ | | |
| $= \tfrac{1}{4}[3^{k+1}(2k+1)+1]$ | A1 | |
| $= \tfrac{1}{4}[3^{k+1}(2(k+1)-1)+1]$ | | Or target seen |
| Therefore if true for $n=k$ it is also true for $n=k+1$. Since it is true for $k=1$, it is true for all positive integers. | E1, E1 | Dependent on A1 and previous E1; Dependent on B1 and previous E1 |
| **[8]** | | |

---
6 Prove by induction that $\sum _ { r = 1 } ^ { n } r 3 ^ { r - 1 } = \frac { 1 } { 4 } \left[ 3 ^ { n } ( 2 n - 1 ) + 1 \right]$.

Section B (36 marks)\\

\hfill \mbox{\textit{OCR MEI FP1 2012 Q6 [8]}}