题目
Problem
9. (i) A sequence of numbers is defined by
u1=3
=un+12un−2n+1
n≥1
Prove by induction that, for n∈N
un=5×2n−1−n×2n
(5)
(ii) Prove by induction that, for n∈N
f(n)=5n+2−4n−9
is divisible by 16
(5)
题目中文翻译
- (i) 一个数列定义如下:
u1=3
=un+12un−2n+1
n≥1
用数学归纳法证明,对于 n∈N
un=5×2n−1−n×2n
(5)
(ii) 用数学归纳法证明,对于 n∈N
f(n)=5n+2−4n−9
能被 16 整除。
(5)
解答
(i)
解法一
思路
展开
先验证 n=1。归纳步骤中假设公式对 n=k 成立,再把该表达式代入递推关系;整理后的式子必须与原公式中把 n 换成 k+1 完全一致。
答题过程
展开
For n=1, the proposed formula gives
==5×20−1×215−23=u1.
Therefore, the result is true for n=1.
Assume that the result is true for n=k, where k∈Z+. Thus
uk=5×2k−1−k×2k.
Using the recurrence relation,
====uk+12uk−2k+12(5×2k−1−k×2k)−2k+15×2k−k×2k+1−2k+15×2k−(k+1)2k+1.
This is precisely
5×2(k+1)−1−(k+1)2k+1,
which is the required formula for n=k+1.
Hence, if the result is true for n=k, it is true for n=k+1. Since it is true for n=1, by mathematical induction,
un=5×2n−1−n×2n
for all n∈Z+.
(ii)
解法一
思路
展开
先验证 f(1) 是 16 的倍数。归纳步骤把 f(k+1) 改写成 5f(k)+16(k+2);归纳假设保证第一项可被 16 整除,第二项显然也可以。
答题过程
展开
For n=1,
f(1)===53−4−911216×7,
so f(1) is divisible by 16.
Assume that f(k) is divisible by 16 for some k∈Z+. Then
f(k)=5k+2−4k−9.
Now
=====f(k+1)5k+3−4(k+1)−95k+3−4k−135k+3−20k−45+16k+325(5k+2−4k−9)+16k+325f(k)+16(k+2).
By the induction hypothesis, f(k) is divisible by 16. Therefore both 5f(k) and 16(k+2) are divisible by 16, so f(k+1) is divisible by 16.
Hence, if the result is true for n=k, it is true for n=k+1. Since it is true for n=1, by mathematical induction,
16∣(5n+2−4n−9)
for all n∈Z+.
解法二
思路
展开
也可以使用差分。先求
=f(k+1)−f(k)4(5k+2−1),
再用一个简短的辅助归纳证明括号内总能被 4 整除,于是相邻两项之差可被 16 整除。
答题过程
展开
First,
f(1)=112=16×7,
so the result is true for n=1.
We first prove that 5k+2−1 is divisible by 4 for every k∈Z+.
For k=1,
53−1=124=4×31.
Assume that 5k+2−1=4m for some integer m. Then
5k+3−1===5(5k+2−1)+45(4m)+44(5m+1),
which is divisible by 4. Therefore, by induction, 5k+2−1 is divisible by 4 for every positive integer k.
Now assume that f(k) is divisible by 16. The difference between consecutive terms is
====f(k+1)−f(k)5k+3−4(k+1)−9−(5k+2−4k−9)5×5k+2−4k−4−9−5k+2+4k+94×5k+2−44(5k+2−1).
Since 5k+2−1 is divisible by 4, this difference is divisible by 16. Hence f(k+1), being the sum of f(k) and a multiple of 16, is divisible by 16.
The result is true for n=1, and truth for n=k implies truth for n=k+1. Therefore, by mathematical induction,
16∣(5n+2−4n−9)
for all n∈Z+.
解法三
思路
展开
把“能被 16 整除”明确写成“等于 16 乘某个整数”。由归纳假设把幂项表示出来,代入下一项后,提出因子 16,并说明括号内仍是整数。
答题过程
展开
For n=1,
f(1)==53−4−9112=16×7.
Thus the result is true for n=1.
Assume that the result is true for n=k, where k∈Z+. Then there is an integer λ such that
==f(k)5k+2−4k−916λ.
Rearranging,
5k+2=16λ+4k+9.
For the next value,
======f(k+1)5k+3−4(k+1)−95×5k+2−4k−135(16λ+4k+9)−4k−1380λ+20k+45−4k−1380λ+16k+3216(5λ+k+2).
Since λ and k are integers, 5λ+k+2 is an integer. Hence f(k+1) is divisible by 16.
The result is true for n=1, and truth for n=k implies truth for n=k+1. Therefore, by mathematical induction,
16∣(5n+2−4n−9)
for all n∈Z+.