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

IAL 2022 June FP1 Q9

A Level / Edexcel / FP1

IAL 2022 June Paper · Question 9

题目

Problem

9. (i) A sequence of numbers is defined by

u1=3u_1 = 3

un+1=2un2n+1n1u_{n+1} = 2u_n - 2^{n+1} \quad n \geq 1

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

un=5×2n1n×2nu_n = 5 \times 2^{n-1} - n \times 2^n

(5)

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

f(n)=5n+24n9f(n) = 5^{n+2} - 4n - 9

is divisible by 1616

(5)
题目中文翻译
  1. (i) 一个数列定义如下:

u1=3u_1 = 3

un+1=2un2n+1n1u_{n+1} = 2u_n - 2^{n+1} \quad n \geq 1

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

un=5×2n1n×2nu_n = 5 \times 2^{n-1} - n \times 2^n

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

f(n)=5n+24n9f(n) = 5^{n+2} - 4n - 9

能被 1616 整除。

解答

(i)

解法一

思路

展开

先验证 n=1n=1。归纳步骤中假设公式对 n=kn=k 成立,再把该表达式代入递推关系;整理后的式子必须与原公式中把 nn 换成 k+1k+1 完全一致。

答题过程

展开

For n=1n=1, the proposed formula gives

5×201×21=52=3=u1.5\times2^0-1\times2^1=5-2=3=u_1.

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

uk=5×2k1k×2k.u_k=5\times2^{k-1}-k\times2^k.

Using the recurrence relation,

uk+1=2uk2k+1=2(5×2k1k×2k)2k+1=5×2kk×2k+12k+1=5×2k(k+1)2k+1.\begin{align*} u_{k+1} =&\,2u_k-2^{k+1}\\ =&\,2\big(5\times2^{k-1}-k\times2^k\big) -2^{k+1}\\ =&\,5\times2^k-k\times2^{k+1}-2^{k+1}\\ =&\,5\times2^k-(k+1)2^{k+1}. \end{align*}

This is precisely

5×2(k+1)1(k+1)2k+1,5\times2^{(k+1)-1}-(k+1)2^{k+1},

which is the required formula for n=k+1n=k+1.

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, by mathematical induction,

un=5×2n1n×2n\boxed{u_n=5\times2^{n-1}-n\times2^n}

for all nZ+n\in\mathbb Z^+.

(ii)

解法一

思路

展开

先验证 f(1)f(1)1616 的倍数。归纳步骤把 f(k+1)f(k+1) 改写成 5f(k)+16(k+2)5f(k)+16(k+2);归纳假设保证第一项可被 1616 整除,第二项显然也可以。

答题过程

展开

For n=1n=1,

f(1)=5349=112=16×7,f(1)=5^3-4-9=112=16\times7,

so f(1)f(1) is divisible by 1616.

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

f(k)=5k+24k9.f(k)=5^{k+2}-4k-9.

Now

f(k+1)=5k+34(k+1)9=5k+34k13=5(5k+24k9)+16k+32=5f(k)+16(k+2).\begin{align*} f(k+1) =&\,5^{k+3}-4(k+1)-9\\ =&\,5^{k+3}-4k-13\\ =&\,5\big(5^{k+2}-4k-9\big) +16k+32\\ =&\,5f(k)+16(k+2). \end{align*}

By the induction hypothesis, f(k)f(k) is divisible by 1616. Therefore both 5f(k)5f(k) and 16(k+2)16(k+2) are divisible by 1616, so f(k+1)f(k+1) is divisible by 1616.

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, by mathematical induction,

16(5n+24n9)\boxed{16\mid\big(5^{n+2}-4n-9\big)}

for all nZ+n\in\mathbb Z^+.

解法二

思路

展开

官方评分资料还给出差分路线。先求 f(k+1)f(k)=4(5k+21)f(k+1)-f(k)=4(5^{k+2}-1),再用一个简短的辅助归纳证明括号内总能被 44 整除,于是相邻两项之差可被 1616 整除。

答题过程

展开

First,

f(1)=112=16×7,f(1)=112=16\times7,

so the result is true for n=1n=1.

We first prove that 5k+215^{k+2}-1 is divisible by 44 for every kZ+k\in\mathbb Z^+.

For k=1k=1,

531=124=4×31.5^3-1=124=4\times31.

Assume that 5k+21=4m5^{k+2}-1=4m for some integer mm. Then

5k+31=5(5k+21)+4=5(4m)+4=4(5m+1),\begin{align*} 5^{k+3}-1 =&\,5\big(5^{k+2}-1\big)+4\\ =&\,5(4m)+4\\ =&\,4(5m+1), \end{align*}

which is divisible by 44. Therefore, by induction, 5k+215^{k+2}-1 is divisible by 44 for every positive integer kk.

Now assume that f(k)f(k) is divisible by 1616. The difference between consecutive terms is

f(k+1)f(k)=5k+34(k+1)9(5k+24k9)=4(5k+21).\begin{align*} f(k+1)-f(k) =&\,5^{k+3}-4(k+1)-9\\ &\,-\big(5^{k+2}-4k-9\big)\\ =&\,4\big(5^{k+2}-1\big). \end{align*}

Since 5k+215^{k+2}-1 is divisible by 44, this difference is divisible by 1616. Hence f(k+1)f(k+1), being the sum of f(k)f(k) and a multiple of 1616, is divisible by 1616.

The result is true for n=1n=1, and truth for n=kn=k implies truth for n=k+1n=k+1. Therefore, by mathematical induction,

16(5n+24n9)\boxed{16\mid\big(5^{n+2}-4n-9\big)}

for all nZ+n\in\mathbb Z^+.