Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there a $2 \times 2$ matrix that can be raised to any power to obtain the Lucas Numbers? If so, what is that matrix? I've looked around on this website and other sites and am not able to find the solution.

share|cite|improve this question

Use the same matrix you would use for Fibonacci numbers, then apply to the initial state vector for Lucas numbers. The matrix captures the recurrence relation. So, same recurrence relation, same matrix. The differences between the Lucas numbers and the Fibonacci numbers lies entirely in the initial values, which do not come into the matrix, but rather an initial state vector to apply the matrix to.

Using one option for orienting the vectors: $$\begin{bmatrix}L_{n}\\L_{n+1}\end{bmatrix}=\begin{bmatrix}0 & 1\\1 & 1\end{bmatrix}^n\begin{bmatrix}L_0\\L_1\end{bmatrix}=\begin{bmatrix}0 & 1\\1 & 1\end{bmatrix}^n\begin{bmatrix}2\\1\end{bmatrix}$$

If you are using powers of $\begin{bmatrix}0 & 1\\1 & 1\end{bmatrix}$ to identify Fibonacci numbers, then maybe you aren't thinking about the method in the best way. $$\begin{bmatrix}F_{n}\\F_{n+1}\end{bmatrix}=\begin{bmatrix}0 & 1\\1 & 1\end{bmatrix}^n\begin{bmatrix}F_0\\F_1\end{bmatrix}=\begin{bmatrix}0 & 1\\1 & 1\end{bmatrix}^n\begin{bmatrix}0\\1\end{bmatrix}$$ happens to just pick out the second column of $\begin{bmatrix}0 & 1\\1 & 1\end{bmatrix}^n$, so there is some misleading coincidence there that makes the actual entries of $\begin{bmatrix}0 & 1\\1 & 1\end{bmatrix}^n$ be Fibonacci numbers.

share|cite|improve this answer

Let $$Q=\pmatrix{1&1\\1&0}\;,$$ so that $$\pmatrix{F_{n+1}&F_n\\F_n&F_{n-1}}=Q^n$$ for $n\ge 0$. I don’t know that you can find a matrix that does exactly the same thing for the Lucas numbers, but it is true that


Another matrix that’s not quite what you want is $$Q_L=\pmatrix{3&1\\1&2}\;,$$ since

$$Q_L^n=\begin{cases} 5^{n/2}\pmatrix{F_{n+1}&F_n\\F_n&F_{n-1}},&\text{if }n\text{ is even}\\\\ 5^{(n-1)/2}\pmatrix{L_{n+1}&L_n\\L_n&L_{n-1}},&\text{if }n\text{ is odd} \end{cases}$$

for $n\ge 1$. (This last result is taken from this paper.)

share|cite|improve this answer
Note that $L_n = F_{n+1} + F_{n-1}$. – Qiaochu Yuan Nov 28 '12 at 22:36

The Lucas number $L_n$ is $\text{tr} \left[ \begin{array}{cc} 1 & 1 \\\ 1 & 0 \end{array} \right]^n$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.