題目 1 · Structured
10.7 分Prove by mathematical induction that, for all positive integers \(n\), \[\sum_{r=1}^n (3r-2)(3r+1) = n(3n^2 + 3n - 2).\]
查看答案詳解收起答案詳解
解題
Let the proposition be denoted by \(P(n)\): \(\sum_{r=1}^n (3r-2)(3r+1) = n(3n^2 + 3n - 2)\).
**Base case:** For \(n=1\):
LHS: \((3(1)-2)(3(1)+1) = 1 \times 4 = 4\).
RHS: \(1(3(1)^2 + 3(1) - 2) = 1(3+3-2) = 4\).
Since LHS = RHS, \(P(1)\) is true.
**Inductive step:** Assume that \(P(k)\) is true for some positive integer \(k\), so:
\[\sum_{r=1}^k (3r-2)(3r+1) = k(3k^2 + 3k - 2).\]
We need to show that \(P(k+1)\) is true, i.e.,
\[\sum_{r=1}^{k+1} (3r-2)(3r+1) = (k+1)\left(3(k+1)^2 + 3(k+1) - 2\right).\]
Simplifying the target RHS:
\[(k+1)(3k^2 + 6k + 3 + 3k + 3 - 2) = (k+1)(3k^2 + 9k + 4) = 3k^3 + 12k^2 + 13k + 4.\]
Now, adding the \((k+1)\)-th term to the inductive hypothesis:
\[\sum_{r=1}^{k+1} (3r-2)(3r+1) = k(3k^2 + 3k - 2) + \left(3(k+1)-2\right)\left(3(k+1)+1\right)\]
\[= 3k^3 + 3k^2 - 2k + (3k+1)(3k+4)\]
\[= 3k^3 + 3k^2 - 2k + 9k^2 + 15k + 4\]
\[= 3k^3 + 12k^2 + 13k + 4.\]
This is identical to the target RHS. Thus, if \(P(k)\) is true, then \(P(k+1)\) is also true.
**Conclusion:** Since \(P(1)\) is true and \(P(k) \implies P(k+1)\), \(P(n)\) is true for all positive integers \(n\) by mathematical induction.
**Base case:** For \(n=1\):
LHS: \((3(1)-2)(3(1)+1) = 1 \times 4 = 4\).
RHS: \(1(3(1)^2 + 3(1) - 2) = 1(3+3-2) = 4\).
Since LHS = RHS, \(P(1)\) is true.
**Inductive step:** Assume that \(P(k)\) is true for some positive integer \(k\), so:
\[\sum_{r=1}^k (3r-2)(3r+1) = k(3k^2 + 3k - 2).\]
We need to show that \(P(k+1)\) is true, i.e.,
\[\sum_{r=1}^{k+1} (3r-2)(3r+1) = (k+1)\left(3(k+1)^2 + 3(k+1) - 2\right).\]
Simplifying the target RHS:
\[(k+1)(3k^2 + 6k + 3 + 3k + 3 - 2) = (k+1)(3k^2 + 9k + 4) = 3k^3 + 12k^2 + 13k + 4.\]
Now, adding the \((k+1)\)-th term to the inductive hypothesis:
\[\sum_{r=1}^{k+1} (3r-2)(3r+1) = k(3k^2 + 3k - 2) + \left(3(k+1)-2\right)\left(3(k+1)+1\right)\]
\[= 3k^3 + 3k^2 - 2k + (3k+1)(3k+4)\]
\[= 3k^3 + 3k^2 - 2k + 9k^2 + 15k + 4\]
\[= 3k^3 + 12k^2 + 13k + 4.\]
This is identical to the target RHS. Thus, if \(P(k)\) is true, then \(P(k+1)\) is also true.
**Conclusion:** Since \(P(1)\) is true and \(P(k) \implies P(k+1)\), \(P(n)\) is true for all positive integers \(n\) by mathematical induction.
評分準則
Base case verified for n = 1: [1 mark]
State the inductive hypothesis clearly: [1 mark]
Add the (k+1)-th term to the sum of k terms: [3 marks]
Perform algebraic expansion and simplification correctly: [4 marks]
Conclude the proof with a complete mathematical statement: [1.7 marks]
State the inductive hypothesis clearly: [1 mark]
Add the (k+1)-th term to the sum of k terms: [3 marks]
Perform algebraic expansion and simplification correctly: [4 marks]
Conclude the proof with a complete mathematical statement: [1.7 marks]