Edexcel FP1 2016 June — Question 8 10 marks

Exam BoardEdexcel
ModuleFP1 (Further Pure Mathematics 1)
Year2016
SessionJune
Marks10
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicProof by induction
TypeProve summation with fractions
DifficultyStandard +0.3 This is a standard two-part induction question from FP1. Part (i) involves proving a summation formula with algebraic fractions requiring partial fraction manipulation, while part (ii) is a straightforward recurrence relation proof. Both follow routine induction templates with no novel insights required, making this slightly easier than average for A-level but typical for Further Maths.
Spec4.01a Mathematical induction: construct proofs

8. (i) Prove by induction that, for \(n \in \mathbb { Z } ^ { + }\) $$\sum _ { r = 1 } ^ { n } \frac { 2 r + 1 } { r ^ { 2 } ( r + 1 ) ^ { 2 } } = 1 - \frac { 1 } { ( n + 1 ) ^ { 2 } }$$ (ii) A sequence of positive rational numbers is defined by $$\begin{aligned} u _ { 1 } & = 3 \\ u _ { n + 1 } & = \frac { 1 } { 3 } u _ { n } + \frac { 8 } { 9 } , \quad n \in \mathbb { Z } ^ { + } \end{aligned}$$ Prove by induction that, for \(n \in \mathbb { Z } ^ { + }\) $$u _ { n } = 5 \times \left( \frac { 1 } { 3 } \right) ^ { n } + \frac { 4 } { 3 }$$

Question 8:
Part (i)
AnswerMarks Guidance
Answer/WorkingMark Guidance
If \(n=1\): \(\sum_{r=1}^{1}\frac{2r+1}{r^2(r+1)^2} = \frac{3}{4}\) and \(1-\frac{1}{(1+1)^2}=\frac{3}{4}\), so true for \(n=1\)B1 Checks \(n=1\) on both sides and states true for \(n=1\)
Assume true for \(n=k\) and consider \(\sum_{r=1}^{k+1}\frac{2r+1}{r^2(r+1)^2} = 1-\frac{1}{(k+1)^2}+\frac{2(k+1)+1}{(k+1)^2(k+2)^2}\)M1 Assumes true for \(n=k\) and adds \((k+1)\)th term
\(= 1-\left(\frac{(k+2)^2}{(k+1)^2(k+2)^2}-\frac{2(k+1)+1}{(k+1)^2(k+2)^2}\right) = 1-\left(\frac{k^2+2k+1}{(k+1)^2(k+2)^2}\right)\)A1 \((k+1)^2(k+2)^2\) as common denominator attempted
\(= 1-\left(\frac{(k+1)^2}{(k+1)^2(k+2)^2}\right) = 1-\left(\frac{1}{(k+1+1)^2}\right)\)M1
True for \(n=k+1\) if true for \(n=k\), (and true for \(n=1\)) so true by induction for all \(n \in \mathbb{Z}^+\)A1 cso Complete induction statement with bold statements; accept \(n\geq1\) or \(n=1,2,3\ldots\)
Part (ii)
AnswerMarks Guidance
Answer/WorkingMark Guidance
\(n=1\): \(u_1 = 5\times(\frac{1}{3})^1+\frac{4}{3}=3\), so true for \(n=1\)B1 Checks \(n=1\) in \(u_n\) and states true
Assume true for \(n=k\) and consider \(u_{k+1} = \frac{1}{3}(5\times(\frac{1}{3})^k+\frac{4}{3})+\frac{8}{9}\)M1 Assumes result for \(n=k\) and substitutes \(u_k\) into correct \(u_{k+1}\) expression
Obtain \(u_{k+1} = 5\times(\frac{1}{3})^{k+1}+\frac{4}{9}+\frac{8}{9}\)A1 \(\frac{4}{9}+\frac{8}{9}\) or \(\frac{1}{3}\cdot\frac{4}{3}+\frac{8}{9}\) seen
\(5\times\left(\frac{1}{3}\right)^{k+1}+\frac{4}{3}\) and deduce true for \(n=k+1\)dM1 Obtains \(5\times(\frac{1}{3})^{k+1}+\frac{4}{3}\); dependent on previous M
True for \(n=k+1\) if true for \(n=k\), (and true for \(n=1\)) so true by induction for all \(n \in \mathbb{Z}^+\)A1 cso Complete induction statement; accept \(n\geq1\) or \(n=1,2,3\ldots\)
# Question 8:

## Part (i)
| Answer/Working | Mark | Guidance |
|---|---|---|
| If $n=1$: $\sum_{r=1}^{1}\frac{2r+1}{r^2(r+1)^2} = \frac{3}{4}$ and $1-\frac{1}{(1+1)^2}=\frac{3}{4}$, so true for $n=1$ | B1 | Checks $n=1$ on both sides and states true for $n=1$ |
| Assume true for $n=k$ and consider $\sum_{r=1}^{k+1}\frac{2r+1}{r^2(r+1)^2} = 1-\frac{1}{(k+1)^2}+\frac{2(k+1)+1}{(k+1)^2(k+2)^2}$ | M1 | Assumes true for $n=k$ and adds $(k+1)$th term |
| $= 1-\left(\frac{(k+2)^2}{(k+1)^2(k+2)^2}-\frac{2(k+1)+1}{(k+1)^2(k+2)^2}\right) = 1-\left(\frac{k^2+2k+1}{(k+1)^2(k+2)^2}\right)$ | A1 | $(k+1)^2(k+2)^2$ as common denominator attempted |
| $= 1-\left(\frac{(k+1)^2}{(k+1)^2(k+2)^2}\right) = 1-\left(\frac{1}{(k+1+1)^2}\right)$ | M1 | |
| **True** for $n=k+1$ if **true** for $n=k$, (and **true** for $n=1$) so **true** by induction for all $n \in \mathbb{Z}^+$ | A1 cso | Complete induction statement with bold statements; accept $n\geq1$ or $n=1,2,3\ldots$ |

## Part (ii)
| Answer/Working | Mark | Guidance |
|---|---|---|
| $n=1$: $u_1 = 5\times(\frac{1}{3})^1+\frac{4}{3}=3$, so true for $n=1$ | B1 | Checks $n=1$ in $u_n$ and states true |
| Assume true for $n=k$ and consider $u_{k+1} = \frac{1}{3}(5\times(\frac{1}{3})^k+\frac{4}{3})+\frac{8}{9}$ | M1 | Assumes result for $n=k$ and substitutes $u_k$ into correct $u_{k+1}$ expression |
| Obtain $u_{k+1} = 5\times(\frac{1}{3})^{k+1}+\frac{4}{9}+\frac{8}{9}$ | A1 | $\frac{4}{9}+\frac{8}{9}$ or $\frac{1}{3}\cdot\frac{4}{3}+\frac{8}{9}$ seen |
| $5\times\left(\frac{1}{3}\right)^{k+1}+\frac{4}{3}$ and deduce true for $n=k+1$ | dM1 | Obtains $5\times(\frac{1}{3})^{k+1}+\frac{4}{3}$; dependent on previous M |
| **True** for $n=k+1$ if **true** for $n=k$, (and **true** for $n=1$) so **true** by induction for all $n \in \mathbb{Z}^+$ | A1 cso | Complete induction statement; accept $n\geq1$ or $n=1,2,3\ldots$ |

---
8. (i) Prove by induction that, for $n \in \mathbb { Z } ^ { + }$

$$\sum _ { r = 1 } ^ { n } \frac { 2 r + 1 } { r ^ { 2 } ( r + 1 ) ^ { 2 } } = 1 - \frac { 1 } { ( n + 1 ) ^ { 2 } }$$

(ii) A sequence of positive rational numbers is defined by

$$\begin{aligned}
u _ { 1 } & = 3 \\
u _ { n + 1 } & = \frac { 1 } { 3 } u _ { n } + \frac { 8 } { 9 } , \quad n \in \mathbb { Z } ^ { + }
\end{aligned}$$

Prove by induction that, for $n \in \mathbb { Z } ^ { + }$

$$u _ { n } = 5 \times \left( \frac { 1 } { 3 } \right) ^ { n } + \frac { 4 } { 3 }$$

\begin{center}

\end{center}

\begin{center}

\end{center}

\hfill \mbox{\textit{Edexcel FP1 2016 Q8 [10]}}