This is an extended version of my entry in the Lockdown Mathoff at the Aperiodical Binet’s formula1 is a lovely way to generate the $n$th Fibonacci number, $F_n$. If $\phi = \frac{1}{2}\left(\sqrt{5} + 1\right)$, then $$F_n = \frac{ \phi^n - (-\phi)^{-n} }{\sqrt{5}}$$ Haskell and computation The main reason I’m writing