Elsevier

Computers & Graphics

Volume 28, Issue 2, April 2004, Pages 297-300
Computers & Graphics

Chaos and graphics
Views of Fibonacci dynamics

https://doi.org/10.1016/j.cag.2003.12.014Get rights and content

Abstract

The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers viewed in that manner. Attracting and repelling fixed points are related to the filled Julia set and to regions of escape time images with fascinating behavior.

Introduction

The Fibonacci numbers are traditionally described as a sequence Fn defined by F0=0,F1=1, and Fn=Fn−1+Fn−2. The sequence begins as 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,… .

The Fibonacci sequence has many remarkable properties, ranging from routine to startling [1], [2], [3], [4]. Moreover, the numbers arise in nature, for example, as the number of spirals of pinecone petals. They may also be used to construct mathematical quasicrystals [5].

One of the beautiful formulas of Fibonacci numbers is the Binet formula. Binet described a version of the formula in 1843 [6], [7]. Its beauty arises from the fact that the formula gives a closed form solution to a recursive definition, and from the symmetry of the formula itself. The Binet formula may be derived from the theory of difference equations, it can be derived by diagonalizing a suitable matrix, or it can be proven by induction [1], [2], [3]. The Fibonacci recursion has characteristic equation x2x−1=0 which has roots τ=1+5/2≈1.618 and τ̄=1−5/2≈−0.618, where τ is the golden ratio and τ̄ is the conjugate of τ. Choosing constants to satisfy the initial conditions F0=0 and F1=1 gives the Binet formula: Fnnτ̄n/5. To obtain the Fibonacci numbers as a function of a complex variable, instead of viewing the index n in the Binet formula as an integer, we view it as a complex variable z. Thus, we define the following complex Fibonacci function:F(z)=τzτ̄z5.The number τ̄ is negative and τ̄ appears as the base of an exponential in the Binet formula. Thus, complex numbers will result for fractional real arguments. Nonetheless, the Binet form gives a natural generalization of the Fibonacci sequence. It satisfies the initial conditions F(0)=0 and F(1)=1. It also satisfies the recursion F(z)=F(z−1)+F(z−2) and it is defined for all complex values of z.

Thus, we can ask questions about the complex dynamics of this function. What are its fixed points? Are they attracting or repelling? What happens upon iteration of the function? In this note we take a visual look at those questions and see that the Fibonacci numbers have interesting and beautiful complex dynamics.

Section snippets

Fixed points

The fixed points of a function F(z) are the values of z such that F(z)=z. Table 1 shows the values of the Fibonacci numbers at several integer values of z.

Note that z=0,1,5 are all fixed points. It might seem as though there ought to be another fixed point between −2 and −1 since F(z) changes from negative to positive, but remember that since the definition of F(z) involves an exponential with a negative base, we obtain complex values for F(z) at intermediate values. For example, F

Escape time

In particular, an escape time image corresponds to some region in the complex plane and typically color is used to indicate the number of iterations required before iterates get large. Perhaps the most famous illustrations of those occur for the famous quadratic Julia and Mandlebrot sets, but escape time images and basins of attraction have been utilized to visualize the dynamics of many processes [8], [9], [10], [11], [12], [13].

In order to create an escape time image of a function f(z), one

Conclusions

By using the Binet formula we have been able to investigate the complex dynamics of the Fibonacci numbers. There are integer fixed points that are associated with a large basin of attraction, an edge of that basin, and a spiral of fans. There are additional complex fixed points, and the escape time images show the Fibonacci numbers have rich complex dynamics.

References (15)

  • J.C. Sprott et al.

    Automatic generation of general quadratic map basins

    Computers & Graphics

    (1995)
  • V.E. Hoggatt

    Fibonacci and Lucas numbers

    (1979)
  • K.H. Rosen

    Elementary number theory and its applications

    (1999)
  • J.K. Strayer

    Elementary number theory

    (1993)
  • Fibonacci Association,...
  • M. Senechal

    Quasicrystals and geometry

    (1995)
  • M.J. Binet

    Mémoire sur l’intégraton des équations linéaires aux différences finies, d’un order quelconque, á coefficients variables

    Comptes Rendus des Séances de L’académie des Sciences

    (1843)
There are more references available in the full text version of this article.

Cited by (0)

View full text