題目 1 · Structured
10.7 分Prove by mathematical induction that, for all positive integers \(n\),
\[ 5^{2n} + 24n - 1 \]
is divisible by 48.
\[ 5^{2n} + 24n - 1 \]
is divisible by 48.
查看答案詳解收起答案詳解
解題
Let \(P(n)\) be the statement that \(5^{2n} + 24n - 1\) is divisible by 48.
**Base step:**
For \(n = 1\):
\(5^{2(1)} + 24(1) - 1 = 25 + 24 - 1 = 48\), which is divisible by 48.
Thus, \(P(1)\) is true.
**Induction step:**
Assume that \(P(k)\) is true for some positive integer \(k\).
That is, \(5^{2k} + 24k - 1 = 48M\) for some integer \(M\).
Now consider \(P(k+1)\):
\(5^{2(k+1)} + 24(k+1) - 1 = 5^{2k+2} + 24k + 24 - 1\)
\(= 25 \cdot 5^{2k} + 24k + 23\).
From the inductive hypothesis, we can express \(5^{2k} = 48M - 24k + 1\).
Substituting this into the expression for \(P(k+1)\):
\(25(48M - 24k + 1) + 24k + 23\)
\(= 25(48M) - 600k + 25 + 24k + 23\)
\(= 48(25M) - 576k + 48\)
\(= 48(25M - 12k + 1)\).
Since \(M\) and \(k\) are integers, \(25M - 12k + 1\) is also an integer.
Therefore, \(5^{2(k+1)} + 24(k+1) - 1\) is divisible by 48.
This shows that if \(P(k)\) is true, then \(P(k+1)\) is also true. Since \(P(1)\) is true and \(P(k) \implies P(k+1)\), by mathematical induction \(P(n)\) is true for all positive integers \(n\).
**Base step:**
For \(n = 1\):
\(5^{2(1)} + 24(1) - 1 = 25 + 24 - 1 = 48\), which is divisible by 48.
Thus, \(P(1)\) is true.
**Induction step:**
Assume that \(P(k)\) is true for some positive integer \(k\).
That is, \(5^{2k} + 24k - 1 = 48M\) for some integer \(M\).
Now consider \(P(k+1)\):
\(5^{2(k+1)} + 24(k+1) - 1 = 5^{2k+2} + 24k + 24 - 1\)
\(= 25 \cdot 5^{2k} + 24k + 23\).
From the inductive hypothesis, we can express \(5^{2k} = 48M - 24k + 1\).
Substituting this into the expression for \(P(k+1)\):
\(25(48M - 24k + 1) + 24k + 23\)
\(= 25(48M) - 600k + 25 + 24k + 23\)
\(= 48(25M) - 576k + 48\)
\(= 48(25M - 12k + 1)\).
Since \(M\) and \(k\) are integers, \(25M - 12k + 1\) is also an integer.
Therefore, \(5^{2(k+1)} + 24(k+1) - 1\) is divisible by 48.
This shows that if \(P(k)\) is true, then \(P(k+1)\) is also true. Since \(P(1)\) is true and \(P(k) \implies P(k+1)\), by mathematical induction \(P(n)\) is true for all positive integers \(n\).
評分準則
M1: Verify the base case \(n = 1\) showing it equals 48.
A1: Conclude \(P(1)\) is true.
M1: State the induction hypothesis for \(n = k\).
M1: Write expression for \(n = k+1\) and attempt to substitute the induction hypothesis.
A1: Correctly expand and simplify to get \(25(48M) - 576k + 48\) or an equivalent expression.
M1: Factorize out 48 from the simplified expression to show divisibility.
A1: Correctly show that the term is \(48 \times \text{integer}\).
A1: Clear concluding statement showing understanding of mathematical induction.
A1: Conclude \(P(1)\) is true.
M1: State the induction hypothesis for \(n = k\).
M1: Write expression for \(n = k+1\) and attempt to substitute the induction hypothesis.
A1: Correctly expand and simplify to get \(25(48M) - 576k + 48\) or an equivalent expression.
M1: Factorize out 48 from the simplified expression to show divisibility.
A1: Correctly show that the term is \(48 \times \text{integer}\).
A1: Clear concluding statement showing understanding of mathematical induction.