Question 1 · Short Questions
6.25 marksProve, by mathematical induction, that for all positive integers \(n\), \(\sum_{r=1}^{n} \frac{1}{(2r-1)(2r+1)} = \frac{n}{2n+1}\).
Answer
\frac{n}{2n+1}
Worked solution
Let \(P(n)\) be the proposition \(\sum_{r=1}^{n} \frac{1}{(2r-1)(2r+1)} = \frac{n}{2n+1}\). For \(n=1\), \(\text{LHS} = \frac{1}{1 \times 3} = \frac{1}{3}\) and \(\text{RHS} = \frac{1}{2(1)+1} = \frac{1}{3}\). Since \(\text{LHS} = \text{RHS}\), \(P(1)\) is true. Assume that \(P(k)\) is true for some positive integer \(k\), i.e., \(\sum_{r=1}^{k} \frac{1}{(2r-1)(2r+1)} = \frac{k}{2k+1}\). For \(n=k+1\), \(\text{LHS} = \sum_{r=1}^{k} \frac{1}{(2r-1)(2r+1)} + \frac{1}{(2(k+1)-1)(2(k+1)+1)} = \frac{k}{2k+1} + \frac{1}{(2k+1)(2k+3)} = \frac{k(2k+3) + 1}{(2k+1)(2k+3)} = \frac{2k^2+3k+1}{(2k+1)(2k+3)} = \frac{(2k+1)(k+1)}{(2k+1)(2k+3)} = \frac{k+1}{2k+3} = \frac{k+1}{2(k+1)+1} = \text{RHS}\). Thus, \(P(k+1)\) is true. By the principle of mathematical induction, \(P(n)\) is true for all positive integers \(n\).
Marking scheme
For testing \(n=1\) (1 mark); For assuming \(P(k)\) is true (0.5 mark); For using induction hypothesis to write down LHS for \(n=k+1\) (1.5 marks); For algebraic simplification to show \(P(k+1)\) is true (2.5 marks); For conclusion (0.75 mark).