OCR MEI FP1 2005 January — Question 6 8 marks

Exam BoardOCR MEI
ModuleFP1 (Further Pure Mathematics 1)
Year2005
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 formula involving exponentials. While it requires careful algebraic manipulation in the inductive step (particularly factoring out powers of 2 and simplifying), it follows the standard induction template without requiring novel insight. It's moderately harder than average due to the algebraic complexity and being a Further Maths topic, but remains a textbook-style exercise.
Spec4.01a Mathematical induction: construct proofs

6 Prove by induction that \(\sum _ { r = 1 } ^ { n } r 2 ^ { r - 1 } = 1 + ( n - 1 ) 2 ^ { n }\).

Question 6:
AnswerMarks Guidance
AnswerMark Guidance
For \(k=1\), \(1 \times 2^{1-1}\) and \(1+(1-1)2^1 = 1\), so true for \(k=1\)B1
Assume true for \(n = k\)E1 Explicit statement: 'assume true for \(n=k\)'; ignore irrelevant work
Next term is \((k+1)2^{k+1-1} = (k+1)2^k\)M1, A1 Attempt to find \((k+1)\)th term; Correct
Add to both sides: RHS \(= 1+(k-1)2^k + (k+1)2^k\)M1 Add to both sides
\(= 1 + 2^k(k-1+k+1) = 1 + 2^k \times 2k = 1 + 2^{k+1}k\)A1 Correct simplification of RHS
\(= 1 + ((k+1)-1)2^{k+1}\)E1 Statement: 'if true for \(k\), true for \(k+1\)'; only give if simplification valid
Since true for \(k=1\), true for \(k = 1,2,3,\ldots\) by inductionE1, [8] Relating to \(k=1\), accept 'by induction'
# Question 6:

| Answer | Mark | Guidance |
|--------|------|----------|
| For $k=1$, $1 \times 2^{1-1}$ and $1+(1-1)2^1 = 1$, so true for $k=1$ | B1 | |
| Assume true for $n = k$ | E1 | Explicit statement: 'assume true for $n=k$'; ignore irrelevant work |
| Next term is $(k+1)2^{k+1-1} = (k+1)2^k$ | M1, A1 | Attempt to find $(k+1)$th term; Correct |
| Add to both sides: RHS $= 1+(k-1)2^k + (k+1)2^k$ | M1 | Add to both sides |
| $= 1 + 2^k(k-1+k+1) = 1 + 2^k \times 2k = 1 + 2^{k+1}k$ | A1 | Correct simplification of RHS |
| $= 1 + ((k+1)-1)2^{k+1}$ | E1 | Statement: 'if true for $k$, true for $k+1$'; only give if simplification valid |
| Since true for $k=1$, true for $k = 1,2,3,\ldots$ by induction | E1, **[8]** | Relating to $k=1$, accept 'by induction' |

---
6 Prove by induction that $\sum _ { r = 1 } ^ { n } r 2 ^ { r - 1 } = 1 + ( n - 1 ) 2 ^ { n }$.

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