Skip to main content
Logo image

A First Course in Complex Analysis

Section 10.3 Fibonacci Numbers

The Fibonacci
 1 
Named after Leonardo Pisano Fibonacci (1170–1250).
numbers
are a sequence of integers defined recursively through
\begin{align*} f_0 \amp = 0\\ f_1 \amp = 1\\ f_n \amp = f_{n-1} + f_{n-2} \qquad \text{ for \(n \geq 2\) }\text{.} \end{align*}
Let \(F(z) = \s f_k \, z^k\text{.}\)
  1. Show that \(F\) has a positive radius of convergence.
  2. Show that the recurrence relation among the \(f_n\) implies that \(F(z) = \frac{z}{1 - z - z^2}\text{.}\) (Hint: Write down the power series of \(z \, F(z)\) and \(z^2 \, F(z)\) and rearrange both so that you can easily add.)
  3. Verify that
    \begin{equation*} \Res_{z=0} \left( \frac{1}{z^n (1 - z - z^2)} \right) \ = \ f_n\,\text{.} \end{equation*}
  4. Use the Residue Theorem 9.2.2 to derive an identity for \(f_n\text{.}\) (Hint: Integrate
    \begin{equation*} \frac{1}{z^n (1 - z - z^2)} \end{equation*}
    around \(C[0,R]\) and show that this integral vanishes as \(R \to \infty\text{.}\))
  5. Your identity should involve the golden ratio \(\frac{ 1 + \sqrt 5 }{ 2 }\text{.}\) Explain what is going on in the output of the following SageMath prompt:
  6. Generalize to other sequences defined by recurrence relations, e.g., the Tribonacci numbers
    \begin{align*} t_0 \amp = 0\\ t_1 \amp = 0\\ t_2 \amp = 1\\ t_n \amp = t_{n-1} + t_{n-2} + t_{n-3} \qquad \text{ for \(n \geq 3\). } \end{align*}