MathCastle
Linear AlgebraChallengeDiagonalization & Matrix Powers

Diagonalization & Matrix Powers · Challenge problem

The Fibonacci recurrence is powered by Q=(1110)Q = \begin{pmatrix}1&1\\1&0\end{pmatrix}: the entry (Qn)12=Fn(Q^n)_{12} = F_n. Compute F10F_{10} by any method.