PastPaper.question 1 · Structured Proof and Calculations
10.7 PastPaper.marksUse mathematical induction to prove that, for all positive integers \(n\),
\[ \sum_{r=1}^{n} (3r-2)2^{r-1} = (3n-5)2^n + 5. \]
\[ \sum_{r=1}^{n} (3r-2)2^{r-1} = (3n-5)2^n + 5. \]
PastPaper.showAnswersPastPaper.hideAnswers
PastPaper.workedSolution
Let \(P(n)\) be the statement \(\sum_{r=1}^{n} (3r-2)2^{r-1} = (3n-5)2^n + 5\).
**Base case:**
For \(n=1\):
LHS \(= (3(1)-2)2^{1-1} = 1 \cdot 2^0 = 1\).
RHS \(= (3(1)-5)2^1 + 5 = -2(2) + 5 = -4 + 5 = 1\).
Since LHS = RHS, the statement \(P(1)\) is true.
**Inductive step:**
Assume \(P(k)\) is true for some positive integer \(k\), so
\[ \sum_{r=1}^{k} (3r-2)2^{r-1} = (3k-5)2^k + 5. \]
Now consider the sum for \(n=k+1\):
\[ \sum_{r=1}^{k+1} (3r-2)2^{r-1} = \left[ \sum_{r=1}^{k} (3r-2)2^{r-1} \right] + (3(k+1)-2)2^{(k+1)-1} \]
\[ = (3k-5)2^k + 5 + (3k+1)2^k \]
\[ = 2^k [ (3k-5) + (3k+1) ] + 5 \]
\[ = 2^k [ 6k - 4 ] + 5 \]
\[ = 2^k \cdot 2(3k-2) + 5 \]
\[ = (3k-2)2^{k+1} + 5 \]
\[ = (3(k+1)-5)2^{k+1} + 5. \]
This is the form of the formula with \(n = k+1\).
**Conclusion:**
Since \(P(1)\) is true, and the truth of \(P(k)\) implies the truth of \(P(k+1)\), by mathematical induction the statement \(P(n)\) is true for all positive integers \(n\).
**Base case:**
For \(n=1\):
LHS \(= (3(1)-2)2^{1-1} = 1 \cdot 2^0 = 1\).
RHS \(= (3(1)-5)2^1 + 5 = -2(2) + 5 = -4 + 5 = 1\).
Since LHS = RHS, the statement \(P(1)\) is true.
**Inductive step:**
Assume \(P(k)\) is true for some positive integer \(k\), so
\[ \sum_{r=1}^{k} (3r-2)2^{r-1} = (3k-5)2^k + 5. \]
Now consider the sum for \(n=k+1\):
\[ \sum_{r=1}^{k+1} (3r-2)2^{r-1} = \left[ \sum_{r=1}^{k} (3r-2)2^{r-1} \right] + (3(k+1)-2)2^{(k+1)-1} \]
\[ = (3k-5)2^k + 5 + (3k+1)2^k \]
\[ = 2^k [ (3k-5) + (3k+1) ] + 5 \]
\[ = 2^k [ 6k - 4 ] + 5 \]
\[ = 2^k \cdot 2(3k-2) + 5 \]
\[ = (3k-2)2^{k+1} + 5 \]
\[ = (3(k+1)-5)2^{k+1} + 5. \]
This is the form of the formula with \(n = k+1\).
**Conclusion:**
Since \(P(1)\) is true, and the truth of \(P(k)\) implies the truth of \(P(k+1)\), by mathematical induction the statement \(P(n)\) is true for all positive integers \(n\).
PastPaper.markingScheme
M1: Verify the base case \(n=1\).
M1: State inductive hypothesis for \(n=k\).
M1: Attempt to find the sum for \(n=k+1\) by adding the \((k+1)\)-th term to the assumed sum.
A1: Correctly factor out \(2^k\) or \(2^{k+1}\) from the terms.
A1: Correct algebraic simplification to obtain \((3k-2)2^{k+1} + 5\).
A1: Express the simplified form in terms of \(k+1\), i.e., \((3(k+1)-5)2^{k+1} + 5\).
A1: Complete the proof with a clear concluding statement referencing mathematical induction.
M1: State inductive hypothesis for \(n=k\).
M1: Attempt to find the sum for \(n=k+1\) by adding the \((k+1)\)-th term to the assumed sum.
A1: Correctly factor out \(2^k\) or \(2^{k+1}\) from the terms.
A1: Correct algebraic simplification to obtain \((3k-2)2^{k+1} + 5\).
A1: Express the simplified form in terms of \(k+1\), i.e., \((3(k+1)-5)2^{k+1} + 5\).
A1: Complete the proof with a clear concluding statement referencing mathematical induction.