Research Article | Open Access

Alberto Fiorenza, Giovanni Vincenzi, "From Fibonacci Sequence to the Golden Ratio", *Journal of Mathematics*, vol. 2013, Article ID 204674, 3 pages, 2013. https://doi.org/10.1155/2013/204674

# From Fibonacci Sequence to the Golden Ratio

**Academic Editor:**Mike Tsionas

#### Abstract

We consider the well-known characterization of the Golden ratio as limit of the ratio of consecutive terms of the Fibonacci sequence, and we give an explanation of this property in the framework of the Difference Equations Theory. We show that the Golden ratio coincides with this limit not because it is the root with maximum modulus and multiplicity of the characteristic polynomial, but, from a more general point of view, because it is the root with maximum modulus and multiplicity of a restricted set of roots, which in this special case coincides with the two roots of the characteristic polynomial. This new perspective is the heart of the characterization of the limit of ratio of consecutive terms of all linear homogeneous recurrences with constant coefficients, without any assumption on the roots of the characteristic polynomial, which may be, in particular, also complex and not real.

In this paper, we consider a well-known property of the Fibonacci sequence, defined by namely, the fact that the limit of the ratio of consecutive terms (the sequence defined from the ratio between each term and its previous one) is , the highly celebrated Golden ratio:

Many proofs already exist and are well known since long time, and we do not wish to add one more to the repertory.

The Fibonacci sequence can be studied in the framework of the Difference Equations Theory (e.g., see [1] Chapter 3 Page 43), where, roughly speaking, the properties of the more general sequences satisfying
where , are studied. The first step of the theory consists in considering the associated characteristic polynomial
whose complex roots , with respective multiplicity permit to express explicitly the terms by means of the representation, known as Binet’s formula:
where are (complex) numbers uniquely determined by . In the case of the Fibonacci sequence, (3), (4), and (5) become, respectively,
where the last equality comes out taking into account the initial conditions . Well, the fact that the Golden ratio, limit of the ratio of adjacent terms, coincides with one of the roots of the characteristic polynomial (7) is not a coincidence. It can be very easily seen that this is always the case, also for general order-*k* linear homogeneous recurrences with constant coefficients; the limit of the ratio of adjacent terms (in the following, we will refer to this limit as the *Kepler* limit of ), if it exists, is always one of the roots of the characteristic polynomial. It suffices to write, starting from (3),
and to substitute each ratio with its limit.

*Q: if for an order-k linear homogeneous recurrence with constant coefficients, the limit of the ratio of adjacent terms exists, which root is it*?

In the case of the Fibonacci sequence, it is clear that the Golden ratio is the root of the characteristic polynomial with maximum modulus, and all the proofs of (2) use more or less implicitly this property. And the same machinery works with several other examples of recurrences (e.g., see the pioneering paper [2]).

Surprisingly, the correct answer to the question is *not* that the limit of the ratio of adjacent terms is the root with maximum modulus. The fact that the Golden ratio is the unique root of maximum modulus is just a *coincidence*! In fact, consider, for instance, the sequence
with different initial conditions and same characteristic polynomial (7). Here, Binet’s formula reads (the term containing is in some sense “killed” by the initial conditions). In this case, the sequence is geometric, and the Kepler limit is the other root of the characteristic polynomial: the smaller. This sequence (along with those obtained multiplying each term by a nonzero constant) is known as an “exception”, and much attention is devoted in the literature to the roots of maximum modulus; up to some assumptions which should exclude the exceptions, it is known that the Kepler limit exists if, among the roots of maximum modulus of (4), there exists a unique root of maximal multiplicity (the “dominant” root; see [3] and references therein).

Another surprise: the existence of the dominant root is independent of the existence of the Kepler limit, and also the value of the limit is not necessarily the dominant root. This is shown by the following examples. Consider the sequence the characteristic polynomial is , whose roots are ; Binet’s formula is

In this case, the dominant root exists, while the Kepler limit does not. In the case the characteristic polynomial is , whose roots are . Binet’s formula is

Here, the characteristic polynomial has a dominant root, but there exists the Kepler limit, which is the root 1 (note that 1 is not among the roots of maximum modulus).

These phenomena attracted several researchers since Poincaré, who proved in a more general context (e.g., see [4]) the following result.

Theorem A. *Let be the roots of the characteristic equation
**
of (3), and suppose that for . Then, either for all large n or there exists an index such that
*

The condition about the pairwise distinct moduli is optimal (namely, necessary and sufficient) if one requires the existence of the Kepler limit for all possible initial conditions; in other words, if there exist two distinct roots with the same modulus, then it is always possible to consider initial conditions such that the Kepler limit does not exist.

What can be said about the general case, also when the moduli of the roots are not necessarily distinct? Is there a necessary and sufficient condition for the existence of the Kepler limit?

Well, for a given linear recurrence with constant coefficients , consider the “essential Binet’s formula representation”; namely, write it in the form (5) where the coefficients have been computed starting from the initial conditions, and where only the nonzero coefficients appear:

In this representation, one can see only a of the addends of the right hand side of (5). In some sense, the addends not appearing in the right hand side of (17) can be considered as “killed" by the initial conditions. In this representation, among the addends containing the “survived" roots, count how many, among them, have maximum modulus and contain the maximum power of (let us call them “leading"). For instance, the classical Fibonacci sequence (1) admits the Golden Ratio as unique leading root (see (8)); the sequence (10) has the same characteristic polynomial of (1), but the unique leading root is ; in the case of (11), the leading roots are , , (see (12)). Moreover, if we consider the sequence the characteristic polynomial is , and Binet’s formula is the unique leading root being 2.

In [3], it is proved that if you count exactly one leading term, then the Kepler limit exists, and in such case, the Kepler limit is exactly the corresponding root (“the unique leading root”). When this happens, we say that the initial conditions are *in agreement* with the characteristic polynomial.

Thus, Theorem A is, of course, an immediate corollary; it is trivial that in the case of pairwise distinct moduli, independently of the “killed” roots, the set of the “survived” roots, whatever it is, must contain a unique leading root.

On the other hand, for a general order-*k* linear homogeneous recurrence with constant coefficients, it may happen that (e.g., see (11)) there are more than one leading root. What can be said, in this case, about the existence of the Kepler limit? A third surprise, in this case, is that the Kepler limit does not exist; the condition given earlier (i.e., the uniqueness of the leading root) is also necessary.

In the end, the notion of *agreement* gives us the answer to the original question *Q*: *the unique leading root. *

The importance of this study relies upon the fact that the ratio of consecutive terms tells that all linear recurrences in agreement behave at infinity like geometric sequences, and the first terms (which give the initial conditions), along with the law (which can be conjectured after a reasonable number of tests), permit to predict the ratio. This may be very important for all applications, where linear recurrences represent mathematical models.

#### References

- W. G. Kelley and A. C. Peterson,
*Difference Equations*, Harcourt/Academic Press, San Diego, Calif, USA, 2nd edition, 2001, An introduction with applications. View at: MathSciNet - E. P. Miles, Jr., “Generalized Fibonacci numbers and associated matrices,”
*The American Mathematical Monthly*, vol. 67, pp. 745–752, 1960. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - A. Fiorenza and G. Vincenzi, “Limit of ratio of consecutive terms for general order-$k$ linear homogeneous recurrences with constant coefficients,”
*Chaos, Solitons & Fractals*, vol. 44, no. 1–3, pp. 145–152, 2011. View at: Publisher Site | Google Scholar | MathSciNet - H. Poincaré, “Sur les equations linéaires aux différentielles ordinaires et aux différences finies,”
*American Journal of Mathematics*, vol. 7, no. 3, pp. 203–258, 1885. View at: Publisher Site | Google Scholar | MathSciNet

#### Copyright

Copyright © 2013 Alberto Fiorenza and Giovanni Vincenzi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.