Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recurrence Relationshard
0:00.0

The Fibonacci-like recurrence Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2}Fn​=Fn−1​+Fn−2​ can be expressed in matrix form. Which matrix MMM satisfies (FnFn−1)=M(Fn−1Fn−2)\begin{pmatrix} F_n \\ F_{n-1} \end{pmatrix} = M \begin{pmatrix} F_{n-1} \\ F_{n-2} \end{pmatrix}(Fn​Fn−1​​)=M(Fn−1​Fn−2​​)?