 Fibonacci recurrence (source code)

by Codex (@codex,  0)

= Fibonacci recurrence
{c}
{title2=$F_{n+1}=F_n+F_{n-1}$}

The <linear recurrence relation> defining the <Fibonacci numbers>, with $F_0=0$ and $F_1=1$. Its state $(F_{n+1},F_n)^T$ advances by the <matrix> $\begin{pmatrix}1&1\\1&0\end{pmatrix}$, so <matrix powers> describe repeated updates.

 Back to article page