Maths WorkshopMaths problems with full solutions
Exercise 1769Linear algebra › Matrices and linear systemsL1Added 3 Nov 2026

A linear recurrence and matrix powers

#linear recurrence#diagonalization#matrix powers

Statement

Let (un)(u_n) be defined by u0=0u_0 = 0, u1=1u_1 = 1, and un+2=3un+1−2unu_{n+2} = 3u_{n+1} - 2u_n. Express the vector (un+1,un)T(u_{n+1}, u_n)^T as An(u1,u0)TA^n (u_1, u_0)^T, then compute AnA^n by diagonalization.

Hint

The companion matrix is A=(3−210)A = \begin{pmatrix} 3 & -2 \\ 1 & 0 \end{pmatrix}. Diagonalize it.

Show solutionHide solution

Solution

Matrix form.
(un+1un)=(3−210)(unun−1)=An(u1u0).\begin{pmatrix} u_{n+1} \\ u_n \end{pmatrix} = \begin{pmatrix} 3 & -2 \\ 1 & 0 \end{pmatrix}\begin{pmatrix} u_n \\ u_{n-1} \end{pmatrix} = A^n \begin{pmatrix} u_1 \\ u_0 \end{pmatrix}.

Eigenvalues. det⁡(A−λI)=(3−λ)(−λ)+2=λ2−3λ+2=(λ−1)(λ−2)\det(A - \lambda I) = (3-\lambda)(-\lambda) + 2 = \lambda^2 - 3\lambda + 2 = (\lambda-1)(\lambda-2), so λ1=1\lambda_1 = 1, λ2=2\lambda_2 = 2.

Eigenvectors. For λ=1\lambda=1: v1=(1,1)v_1 = (1,1). For λ=2\lambda=2: v2=(2,1)v_2 = (2,1).

Diagonalization.
A=P(1002)P−1,P=(1211),P−1=(−121−1).A = P\begin{pmatrix} 1 & 0 \\ 0 & 2 \end{pmatrix}P^{-1}, \qquad P = \begin{pmatrix} 1 & 2 \\ 1 & 1 \end{pmatrix}, \quad P^{-1} = \begin{pmatrix} -1 & 2 \\ 1 & -1 \end{pmatrix}.

Power.
An=P(1002n)P−1=(1211)(1002n)(−121−1).A^n = P\begin{pmatrix} 1 & 0 \\ 0 & 2^n \end{pmatrix}P^{-1} = \begin{pmatrix} 1 & 2 \\ 1 & 1 \end{pmatrix}\begin{pmatrix} 1 & 0 \\ 0 & 2^n \end{pmatrix}\begin{pmatrix} -1 & 2 \\ 1 & -1 \end{pmatrix}.
Compute:
An=(−1+2n+12−2n+1−1+2n2−2n).A^n = \begin{pmatrix} -1+2^{n+1} & 2-2^{n+1} \\ -1+2^n & 2-2^n \end{pmatrix}.

Conclusion. un=(An)21u1+(An)22u0=(2n−1)⋅1+0=2n−1u_n = (A^n)_{21} u_1 + (A^n)_{22} u_0 = (2^n - 1)\cdot1 + 0 = 2^n - 1.

Verification. u0=0u_0 = 0, u1=1u_1 = 1, u2=3u_2 = 3, u3=7u_3 = 7: matches 2n−12^n - 1.