Skip to content
CalcGospel 國際數學圖譜
返回

IAL 2020 May FP1 Q8

A Level / Edexcel / FP1

IAL 2020 May Paper · Question 8

题目

Problem

8. (i) Prove by induction that, for nZ+n \in \mathbb{Z}^+

r=1n2r21r2(r+1)2=n2(n+1)2\sum_{r=1}^{n} \frac{2r^2 - 1}{r^2(r+1)^2} = \frac{n^2}{(n+1)^2}

(6)

(ii) Prove by induction that, for nZ+n \in \mathbb{Z}^+

f(n)=12n+2×5n1f(n) = 12^n + 2 \times 5^{n-1}

is divisible by 77

(6)
题目中文翻译
  1. (i) 用数学归纳法证明,对于 nZ+n \in \mathbb{Z}^+

r=1n2r21r2(r+1)2=n2(n+1)2\sum_{r=1}^{n} \frac{2r^2 - 1}{r^2(r+1)^2} = \frac{n^2}{(n+1)^2}

(ii) 用数学归纳法证明,对于 nZ+n \in \mathbb{Z}^+

f(n)=12n+2×5n1f(n) = 12^n + 2 \times 5^{n-1}

能被 77 整除。

解答

(i)

解法一

思路

展开

先验证 n=1n=1。归纳步骤中假设结论对 n=kn=k 成立,再给等式左边加上第 k+1k+1 项;通分后把分子展开成 (k+1)4(k+1)^4,即可得到 n=k+1n=k+1 时的目标式。

答题过程

展开

For n=1n=1,

r=112r21r2(r+1)2=2(1)2112(1+1)2=14.\begin{align*} \sum_{r=1}^{1}\frac{2r^2-1}{r^2(r+1)^2} =&\,\frac{2(1)^2-1}{1^2(1+1)^2} \\ =&\,\frac{1}{4}. \end{align*}

and

12(1+1)2=14.\frac{1^2}{(1+1)^2}=\frac{1}{4}.

Therefore, the result is true for n=1n=1.

Assume that the result is true for n=kn=k, where kZ+k\in\mathbb{Z}^+. Thus

r=1k2r21r2(r+1)2=k2(k+1)2.\sum_{r=1}^{k}\frac{2r^2-1}{r^2(r+1)^2} =\frac{k^2}{(k+1)^2}.

Then

r=1k+12r21r2(r+1)2=k2(k+1)2+2(k+1)21(k+1)2(k+2)2=k2(k+2)2+2(k+1)21(k+1)2(k+2)2=k4+4k3+6k2+4k+1(k+1)2(k+2)2=(k+1)4(k+1)2(k+2)2=(k+1)2(k+2)2.\begin{align*} &\,\sum_{r=1}^{k+1}\frac{2r^2-1}{r^2(r+1)^2} \\ =&\,\frac{k^2}{(k+1)^2} \\ +&\,\hspace{2pt} \frac{2(k+1)^2-1}{(k+1)^2(k+2)^2} \\ =&\,\frac{k^2(k+2)^2+2(k+1)^2-1} {(k+1)^2(k+2)^2} \\ =&\,\frac{k^4+4k^3+6k^2+4k+1} {(k+1)^2(k+2)^2} \\ =&\,\frac{(k+1)^4}{(k+1)^2(k+2)^2} \\ =&\,\frac{(k+1)^2}{(k+2)^2}. \end{align*}

This is the required result with k+1k+1 in place of nn. Hence, if the result is true for n=kn=k, it is true for n=k+1n=k+1. Since it is true for n=1n=1, the result is true for all nZ+n\in\mathbb{Z}^+ by mathematical induction.

(ii)

解法一

思路

展开

先验证 f(1)f(1) 能被 77 整除。归纳步骤中把 f(k+1)f(k+1) 写成 12f(k)145k112f(k)-14\cdot5^{k-1};归纳假设保证第一项能被 77 整除,第二项显然也含因子 77

答题过程

展开

For n=1n=1,

f(1)=12+2×50=14,f(1)=12+2\times5^0=14,

which is divisible by 77.

Assume that the result is true for n=kn=k, where kZ+k\in\mathbb{Z}^+. Thus f(k)f(k) is divisible by 77.

Now

f(k+1)=12k+1+2×5k=12(12k+2×5k1)14×5k1=12f(k)14×5k1.\begin{align*} f(k+1) =&\,12^{k+1}+2\times5^k \\ =&\,12\big(12^k+2\times5^{k-1}\big) \\ -&\,14\times5^{k-1} \\ =&\,12f(k)-14\times5^{k-1}. \end{align*}

By the inductive hypothesis, 12f(k)12f(k) is divisible by 77, and 14×5k114\times5^{k-1} is also divisible by 77. Therefore, f(k+1)f(k+1) is divisible by 77.

Hence, if the result is true for n=kn=k, it is true for n=k+1n=k+1. Since it is true for n=1n=1, f(n)f(n) is divisible by 77 for all nZ+n\in\mathbb{Z}^+ by mathematical induction.

解法二

思路

展开

归纳框架不变,但在归纳步骤中计算 f(k+1)5f(k)f(k+1)-5f(k)。含 5k5^k 的项恰好相消,剩下 712k7\cdot12^k,因而整除关系更直接。

答题过程

展开

For n=1n=1,

f(1)=12+2×50=14,f(1)=12+2\times5^0=14,

which is divisible by 77.

Assume that f(k)f(k) is divisible by 77 for some kZ+k\in\mathbb{Z}^+. Then

f(k+1)5f(k)=12k+1+2×5k5(12k+2×5k1)=7×12k.\begin{align*} f(k+1)-5f(k) =&\,12^{k+1}+2\times5^k \\ -&\,5\big(12^k+2\times5^{k-1}\big) \\ =&\,7\times12^k. \end{align*}

Therefore,

f(k+1)=5f(k)+7×12k.f(k+1)=5f(k)+7\times12^k.

Both terms on the right are divisible by 77, so f(k+1)f(k+1) is divisible by 77.

Hence, if the result is true for n=kn=k, it is true for n=k+1n=k+1. Since it is true for n=1n=1, f(n)f(n) is divisible by 77 for all nZ+n\in\mathbb{Z}^+ by mathematical induction.