May 2025 Paper 2 Q15
15. Prove by induction that, for all positive integers \(n\),
\[\sum_{r=1}^{n}\frac{1}{(2r+1)(2r-1)}=\frac{n}{2n+1}.\][5]
| Mark | Generic scheme | Illustrative scheme |
|---|---|---|
| •1 | show true for \(n=1\) 1 | when \(n=1\) \(\dfrac{1}{(2+1)(2-1)}=\dfrac{1}{3}\) \(\dfrac{1}{2+1}=\dfrac{1}{3}\) so true for \(n=1\) |
| •2 | assume (statement) true for \(n=k\) AND consider case of \(n=k+1\) (RHS of final expression must not be the aim/goal unless it is identified as such) 2,3,4,5,6,10 | suitable statement AND \(\displaystyle\sum_{r=1}^{k}\frac{1}{(2r+1)(2r-1)}=\frac{k}{2k+1}\) AND \(\displaystyle\sum_{r=1}^{k+1}\frac{1}{(2r+1)(2r-1)}=\ldots\) |
| •3 | correct statement for sum to \((k+1)\) terms using inductive hypothesis 2,7 | \(\dfrac{k}{2k+1}+\dfrac{1}{\left(2(k+1)+1\right)\left(2(k+1)-1\right)}\) |
| •4 | express sum to \((k+1)\) terms as a single term 2,8 | \(\dfrac{(2k+3)k+1}{(2k+1)(2k+3)}\) or equivalent |
| •5 | express sum explicitly in terms of \((k+1)\) or achieve stated aim/goal AND communicate 2,8,9,10,11 | \(\dfrac{k+1}{2(k+1)+1}\) AND If true for \(n=k\) then true for \(n=k+1\). Also shown true for \(n=1\) therefore, by induction, true for all positive integers \(n\). |
| (5) |
Notes:
- “RHS = \(\dfrac{1}{3}\), LHS = \(\dfrac{1}{3}\)” and/or “True for \(n=1\)” are insufficient for the award of •1. A candidate must demonstrate some evidence of substitution into both expressions. Where a candidate does not independently evaluate the LHS and RHS, •1 may still be awarded. Communication that the statement is true for \(n=1\) may appear in the final statement.
- Where \(n\) is used in place of \(k\), marks •2, •3, •4 and •5 are not available.
- For •2 sufficient phrases for \(n=k\) contain:
- “If true for…”; “Suppose true for…”; “Assume true for…”.
- “Consider \(n=k\),”, “Assume \(n=k\) is true”, “True for \(n=k\)”, “Let \(n=k\)”
- A sufficient phrase for the award of •2 may appear at •5.
- For •2, the RHS of final expression must not be the aim/goal unless it is identified as such, or subsequent decomposition of \(\displaystyle\sum_{r=1}^{k+1}\frac{1}{(2r+1)(2r-1)}\) appears.
- For •2 unacceptable phrases for \(n=k+1\) contain:
- “Consider true for \(n=k+1\)”, “true for \(n=k+1\)”.
- Since •3 may be awarded directly after •2, exercise leniency for the award of •3 in relation to intermediate notation where this has been provided, eg the handling of sigma notation.
- Do not award •4 or •5 where one of the fractions is numeric.
- For candidates who write down the correct expression without algebraic justification, •5 is unavailable.
- Full marks are available to candidates who state an aim/goal earlier in the proof and who subsequently achieve the stated aim/goal provided the substitution of \(k+1\) is clearly shown.
- Following the required algebra and statement of the inductive hypothesis, the minimal acceptable response for •5 must contain:
- if true for \(n=k\) then true for \(n=k+1\) (do not accept “eg \(n=k\) is true”)
- true for \(n=1\)
- true for all \(n\) (do not accept “for all integers”).