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

IAL 2025 Jan FP1 Q8

A Level / Edexcel / FP1

IAL 2025 Jan Paper · Question 8

题目

Problem

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

(2914)n=(13n9nn3n+1)\begin{pmatrix} -2 & 9 \\ -1 & 4 \end{pmatrix}^n = \begin{pmatrix} 1 - 3n & 9n \\ -n & 3n + 1 \end{pmatrix}

(5)

(ii) A sequence of numbers is defined by

u1=1u2=4un+2=6un+19unu_1 = 1 \quad u_2 = 4 \quad u_{n+2} = 6u_{n+1} - 9u_n

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

un=3n2(n+2)u_n = 3^{n-2}(n + 2)

(5)
题目中文翻译

(i) 用数学归纳法证明,对于所有正整数 nZ+n \in \mathbb{Z}^+ (2914)n=(13n9nn3n+1)\begin{pmatrix} -2 & 9 \\ -1 & 4 \end{pmatrix}^n = \begin{pmatrix} 1 - 3n & 9n \\ -n & 3n + 1 \end{pmatrix}

(ii) 一个数列定义如下: u1=1u2=4un+2=6un+19unu_1 = 1 \quad u_2 = 4 \quad u_{n+2} = 6u_{n+1} - 9u_n

用数学归纳法证明,对于所有正整数 nZ+n \in \mathbb{Z}^+un=3n2(n+2)u_n = 3^{n-2}(n + 2)

解答

(i)

解法一

思路

展开

先验证 n=1n=1。再假设公式对 n=kn=k 成立,把假设中的矩阵右乘原矩阵,逐项计算并整理成把 kk 换成 k+1k+1 后的目标矩阵,最后写出完整归纳结论。

答题过程

展开

Let

A=(2914).A=\begin{pmatrix}-2&9\\-1&4\end{pmatrix}.

For n=1n=1, the right-hand side is

(13913+1)=(2914)=A.\begin{pmatrix} 1-3&9\\ -1&3+1 \end{pmatrix} = \begin{pmatrix} -2&9\\ -1&4 \end{pmatrix} =A.

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

Assume that the result is true for n=kn=k, so that

Ak=(13k9kk3k+1).A^k= \begin{pmatrix} 1-3k&9k\\ -k&3k+1 \end{pmatrix}.

Then

Ak+1=AkA=(13k9kk3k+1)(2914)=(23k9+9kk13k+4)=(13(k+1)9(k+1)(k+1)3(k+1)+1).\begin{align*} A^{k+1} =&\,A^kA\\ =&\,\begin{pmatrix} 1-3k&9k\\ -k&3k+1 \end{pmatrix} \begin{pmatrix} -2&9\\ -1&4 \end{pmatrix}\\ =&\,\begin{pmatrix} -2-3k&9+9k\\ -k-1&3k+4 \end{pmatrix}\\ =&\,\begin{pmatrix} 1-3(k+1)&9(k+1)\\ -(k+1)&3(k+1)+1 \end{pmatrix}. \end{align*}

Therefore, if the result is true for n=kn=k, it is also true for n=k+1n=k+1. Since it is true for n=1n=1, by mathematical induction,

(2914)n=(13n9nn3n+1)\boxed{ \begin{pmatrix}-2&9\\-1&4\end{pmatrix}^{n} = \begin{pmatrix} 1-3n&9n\\ -n&3n+1 \end{pmatrix}}

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

(ii)

解法一

思路

展开

这是二阶递推数列,归纳时必须验证 n=1,2n=1,2 两个初值,并同时假设公式对相邻的 kkk+1k+1 成立。把这两个假设代入递推式后,整理成公式在 n=k+2n=k+2 时的形式。

答题过程

展开

For n=1n=1,

312(1+2)=313=1=u1.3^{1-2}(1+2)=3^{-1}\cdot3=1=u_1.

For n=2n=2,

322(2+2)=304=4=u2.3^{2-2}(2+2)=3^0\cdot4=4=u_2.

Hence the result is true for n=1n=1 and n=2n=2.

Assume that the result is true for n=kn=k and n=k+1n=k+1, so that

uk=3k2(k+2)u_k=3^{k-2}(k+2)

and

uk+1=3k1(k+3).u_{k+1}=3^{k-1}(k+3).

Using the recurrence relation,

uk+2=6uk+19uk=6[3k1(k+3)]9[3k2(k+2)]=3k[2(k+3)(k+2)]=3k(k+4)=3(k+2)2((k+2)+2).\begin{align*} u_{k+2} =&\,6u_{k+1}-9u_k\\ =&\,6\bigl[3^{k-1}(k+3)\bigr] -9\bigl[3^{k-2}(k+2)\bigr]\\ =&\,3^k\bigl[2(k+3)-(k+2)\bigr]\\ =&\,3^k(k+4)\\ =&\,3^{(k+2)-2}\bigl((k+2)+2\bigr). \end{align*}

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

un=3n2(n+2)\boxed{u_n=3^{n-2}(n+2)}

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