题目
Problem
8. (i) Prove by induction that, for n∈Z+
∑r=1nr2(r+1)22r2−1=(n+1)2n2
(6)
(ii) Prove by induction that, for n∈Z+
f(n)=12n+2×5n−1
is divisible by 7
(6)
题目中文翻译
- (i) 用数学归纳法证明,对于 n∈Z+
∑r=1nr2(r+1)22r2−1=(n+1)2n2
(ii) 用数学归纳法证明,对于 n∈Z+
f(n)=12n+2×5n−1
能被 7 整除。
解答
(i)
解法一
思路
展开
先验证 n=1。归纳步骤中假设结论对 n=k 成立,再给等式左边加上第 k+1 项;通分后把分子展开成 (k+1)4,即可得到 n=k+1 时的目标式。
答题过程
展开
For n=1,
r=1∑1r2(r+1)22r2−1==12(1+1)22(1)2−141.
and
(1+1)212=41.
Therefore, the result is true for n=1.
Assume that the result is true for n=k, where k∈Z+. Thus
r=1∑kr2(r+1)22r2−1=(k+1)2k2.
Then
=+====r=1∑k+1r2(r+1)22r2−1(k+1)2k2(k+1)2(k+2)22(k+1)2−1(k+1)2(k+2)2k2(k+2)2+2(k+1)2−1(k+1)2(k+2)2k4+4k3+6k2+4k+1(k+1)2(k+2)2(k+1)4(k+2)2(k+1)2.
This is the required result with k+1 in place of n. Hence, if the result is true for n=k, it is true for n=k+1. Since it is true for n=1, the result is true for all n∈Z+ by mathematical induction.
(ii)
解法一
思路
展开
先验证 f(1) 能被 7 整除。归纳步骤中把 f(k+1) 写成 12f(k)−14⋅5k−1;归纳假设保证第一项能被 7 整除,第二项显然也含因子 7。
答题过程
展开
For n=1,
f(1)=12+2×50=14,
which is divisible by 7.
Assume that the result is true for n=k, where k∈Z+. Thus f(k) is divisible by 7.
Now
f(k+1)==−=12k+1+2×5k12(12k+2×5k−1)14×5k−112f(k)−14×5k−1.
By the inductive hypothesis, 12f(k) is divisible by 7, and 14×5k−1 is also divisible by 7. Therefore, f(k+1) is divisible by 7.
Hence, if the result is true for n=k, it is true for n=k+1. Since it is true for n=1, f(n) is divisible by 7 for all n∈Z+ by mathematical induction.
解法二
思路
展开
归纳框架不变,但在归纳步骤中计算 f(k+1)−5f(k)。含 5k 的项恰好相消,剩下 7⋅12k,因而整除关系更直接。
答题过程
展开
For n=1,
f(1)=12+2×50=14,
which is divisible by 7.
Assume that f(k) is divisible by 7 for some k∈Z+. Then
f(k+1)−5f(k)=−=12k+1+2×5k5(12k+2×5k−1)7×12k.
Therefore,
f(k+1)=5f(k)+7×12k.
Both terms on the right are divisible by 7, so f(k+1) is divisible by 7.
Hence, if the result is true for n=k, it is true for n=k+1. Since it is true for n=1, f(n) is divisible by 7 for all n∈Z+ by mathematical induction.