AQA Further Paper 2 2022 June — Question 5 4 marks

Exam BoardAQA
ModuleFurther Paper 2 (Further Paper 2)
Year2022
SessionJune
Marks4
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicProof by induction
TypeProve summation formula
DifficultyStandard +0.3 This is a standard proof by induction for a summation formula with a straightforward algebraic structure. The base case is trivial, and the inductive step requires only routine algebraic manipulation of the well-known sum of cubes formula. While it's a Further Maths question, it's one of the most common induction exercises with no novel insight required, making it slightly easier than average overall.
Spec4.01a Mathematical induction: construct proofs4.06a Summation formulae: sum of r, r^2, r^3

5 Prove by induction that, for all integers \(n \geq 1\), $$\sum _ { r = 1 } ^ { n } r ^ { 3 } = \left\{ \frac { 1 } { 2 } n ( n + 1 ) \right\} ^ { 2 }$$ [4 marks]

Question 5:
AnswerMarks Guidance
Base case: Let \(n=1\), then \(\left(\frac{1}{2}n(n+1)\right)^2 = 1^2 = 1\) and \(\sum_{r=1}^{n} r^3 = 1\), so the result is true for \(n=1\)B1 Must demonstrate result AND state it is true for \(n=1\)
Inductive step: Assume the result is true for \(n=k\), then \(\sum_{r=1}^{k} r^3 = \left(\frac{1}{2}k(k+1)\right)^2\)M1 Must assume true for \(n=k\) AND add \((k+1)^3\)
\[\sum_{r=1}^{k+1} r^3 = \left(\frac{1}{2}k(k+1)\right)^2 + (k+1)^3 = \frac{1}{4}(k+1)^2(k^2+4(k+1))\] \[= \frac{1}{4}(k+1)^2(k^2+4k+4) = \frac{1}{4}(k+1)^2(k+2)^2 = \left(\frac{1}{2}(k+1)(k+2)\right)^2\]A1 Must obtain \(\frac{1}{4}(k+1)^2(k+2)^2\)
Conclusion: The result is true for \(n=1\); if true for \(n=k\), then it's also true for \(n=k+1\) and hence by induction \(\sum_{r=1}^{n} r^3 = \left\{\frac{1}{2}n(n+1)\right\}^2\) for all integers \(n \geq 1\)R1 Must state both base case and inductive step in conclusion
## Question 5:

**Base case:** Let $n=1$, then $\left(\frac{1}{2}n(n+1)\right)^2 = 1^2 = 1$ and $\sum_{r=1}^{n} r^3 = 1$, so the result is true for $n=1$ | B1 | Must demonstrate result AND state it is true for $n=1$

**Inductive step:** Assume the result is true for $n=k$, then $\sum_{r=1}^{k} r^3 = \left(\frac{1}{2}k(k+1)\right)^2$ | M1 | Must assume true for $n=k$ AND add $(k+1)^3$

$$\sum_{r=1}^{k+1} r^3 = \left(\frac{1}{2}k(k+1)\right)^2 + (k+1)^3 = \frac{1}{4}(k+1)^2(k^2+4(k+1))$$ $$= \frac{1}{4}(k+1)^2(k^2+4k+4) = \frac{1}{4}(k+1)^2(k+2)^2 = \left(\frac{1}{2}(k+1)(k+2)\right)^2$$ | A1 | Must obtain $\frac{1}{4}(k+1)^2(k+2)^2$

**Conclusion:** The result is true for $n=1$; if true for $n=k$, then it's also true for $n=k+1$ and hence by induction $\sum_{r=1}^{n} r^3 = \left\{\frac{1}{2}n(n+1)\right\}^2$ for all integers $n \geq 1$ | R1 | Must state both base case and inductive step in conclusion

---
5 Prove by induction that, for all integers $n \geq 1$,

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

[4 marks]\\

\hfill \mbox{\textit{AQA Further Paper 2 2022 Q5 [4]}}