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

IAL 2026 Jan FP1 Q10

A Level / Edexcel / FP1

IAL 2026 Jan Paper · Question 10

Question

Problem

A sequence of numbers u1,u2,u3,u_1, u_2, u_3, \ldots is defined by

u1=8,u2=10u_1 = 8, \quad u_2 = 10 un+2=un+1+2un,n1u_{n+2} = u_{n+1} + 2u_n, \quad n \geq 1

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

un=3×2n2×(1)nu_n = 3 \times 2^n - 2 \times (-1)^n

(6)

中文翻译

一个数列 u1,u2,u3,u_1, u_2, u_3, \ldots 由下式定义

u1=8,u2=10u_1 = 8, \quad u_2 = 10 un+2=un+1+2un,n1u_{n+2} = u_{n+1} + 2u_n, \quad n \geq 1

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

un=3×2n2×(1)nu_n = 3 \times 2^n - 2 \times (-1)^n

(6)

解答

解法一

思路

展开

递推式同时使用前两项,所以归纳证明必须先验证 n=1n=1n=2n=2 两个基例。归纳步骤中假设公式对相邻的 uku_kuk+1u_{k+1} 成立,再代入递推式推出 uk+2u_{k+2} 的目标形式。

答题过程

展开

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

3×212×(1)1=6+2=8=u1.3\times2^1-2\times(-1)^1=6+2=8=u_1.

For n=2n=2, it gives

3×222×(1)2=122=10=u2.3\times2^2-2\times(-1)^2=12-2=10=u_2.

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

Assume that the result is true for two consecutive positive integers kk and k+1k+1. Thus,

uk=3×2k2×(1)ku_k=3\times2^k-2\times(-1)^k

and

uk+1=3×2k+12×(1)k+1.u_{k+1}=3\times2^{k+1}-2\times(-1)^{k+1}.

Using the recurrence relation,

uk+2=uk+1+2uk=3×2k+12×(1)k+1+2[3×2k2×(1)k]=3×2k+1+6×2k2×(1)k+14×(1)k=3×2k+22×(1)k=3×2k+22×(1)k+2.\begin{align*} u_{k+2} =&\,u_{k+1}+2u_k\\ =&\,3\times2^{k+1}-2\times(-1)^{k+1}\\ &\,+2\big[3\times2^k-2\times(-1)^k\big]\\ =&\,3\times2^{k+1}+6\times2^k\\ &\,-2\times(-1)^{k+1}-4\times(-1)^k\\ =&\,3\times2^{k+2}-2\times(-1)^k\\ =&\,3\times2^{k+2}-2\times(-1)^{k+2}. \end{align*}

Hence, if the result is true for n=kn=k and n=k+1n=k+1, it is also true for n=k+2n=k+2. Since it is true for n=1n=1 and n=2n=2, by induction,

un=3×2n2×(1)n\boxed{u_n=3\times2^n-2\times(-1)^n}

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