题目
Problem
Prove by induction that for all positive integers n
=r=1∑nlog(2r−1)log(2nn!(2n)!)
(6)
题目中文翻译
用数学归纳法证明:对于所有正整数 n,
=r=1∑nlog(2r−1)log(2nn!(2n)!)
(6)
解答
解法一
思路
展开
先验证 n=1。归纳步骤中,在前 k 项的和后加上第 k+1 项 log(2k+1),再用对数乘法法则合并。最后将分子、分母同乘 2k+2=2(k+1),把结果整理成题目在 n=k+1 时的形式。
答题过程
展开
For n=1,
==r=1∑1log(2r−1)log10,
and
==log(21(1!)2!)log10.
Hence the result is true for n=1.
Assume that the result is true for n=k, where k∈Z+. Thus
=r=1∑klog(2r−1)log(2kk!(2k)!).
Then
====r=1∑k+1log(2r−1)r=1∑klog(2r−1)+log(2k+1)log(2kk!(2k)!)+log(2k+1)log(2kk!(2k)!(2k+1))log(2kk!(2k+1)!).
Since 2k+2=2(k+1),
==2kk!(2k+1)!2kk!(2k+1)!×2k+22k+22kk!(2k+2)(2k+2)!.
The denominator can be written as
==2kk!(2k+2)2kk!⋅2(k+1)2k+1(k+1)!.
Therefore,
=r=1∑k+1log(2r−1)log(2k+1(k+1)!(2k+2)!),
which is the required result for n=k+1. Hence, by mathematical induction,
=r=1∑nlog(2r−1)log(2nn!(2n)!)
for all positive integers n.
解法二
思路
展开
也可以把归纳假设右侧拆成两个对数。加入第 k+1 项后,先把分子合成 (2k+1)!;再把分子、分母同时补上 2k+2,即可分别得到目标中的新阶乘。
答题过程
展开
The case n=1 is verified as in Method 1. Assume that the result is true for n=k, where k∈Z+. Writing the logarithm as a difference,
=r=1∑klog(2r−1)log((2k)!)−log(2kk!).
Therefore,
==r=1∑k+1log(2r−1)log((2k)!)−log(2kk!)+log(2k+1)log((2k+1)!)−log(2kk!).
Now
=(2k+2)!(2k+2)(2k+1)!
and
==2k+1(k+1)!2k+1(k+1)k!(2k+2)2kk!.
Hence
====log((2k+1)!)−log(2kk!)log(2k+2(2k+2)!)−log(2k+22k+1(k+1)!)log((2k+2)!)−log(2k+2)−log(2k+1(k+1)!)+log(2k+2)log((2k+2)!)−log(2k+1(k+1)!)log(2k+1(k+1)!(2k+2)!).
Thus the result is true for n=k+1. Since it is true for n=1, by mathematical induction,
=r=1∑nlog(2r−1)log(2nn!(2n)!)
for all positive integers n.