Table of Contents
ISRN Discrete Mathematics
Volume 2014, Article ID 132925, 3 pages
Research Article

A Note on Closed-Form Representation of Fibonacci Numbers Using Fibonacci Trees

School of Information Technology and Engineering, VIT University, Vellore 632014, India

Received 7 November 2013; Accepted 22 December 2013; Published 12 February 2014

Academic Editors: M. Kano and X. Zhang

Copyright © 2014 Indhumathi Raman. 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.


We give a new representation of the Fibonacci numbers. This is achieved using Fibonacci trees. With the help of this representation, the th Fibonacci number can be calculated without having any knowledge about the previous Fibonacci numbers.

1. Introduction

A Fibonacci tree is a rooted binary tree in which for every nonleaf vertex , the heights of the subtrees, rooted at the left and right child of , differ by exactly one. A formal recursive definition of the Fibonacci tree (denoted by if its height is ) is given below.

Definition 1. . For , is obtained by taking a copy of , a copy of , a new vertex , and joining to the roots of and .

Figure 1 shows this construction and a few small Fibonacci trees.

Figure 1: Recursive construction and examples of Fibonacci Trees.

The above recursive definition implies that the number of vertices in is . On solving this recurrence relation, we get , where is the th number in the Fibonacci sequence, ; this justifies the terminology Fibonacci tree.

The Fibonacci tree is the one with the minimum number of vertices among the class of AVL trees (see [1]). Several properties of Fibonacci trees have been investigated: for example, Fibonacci numbers of Fibonacci trees have been studied in [2], optimality of Fibonacci numbers is discussed in [3], asymptotic properties of Balaban’s index for Fibonacci trees have been explored in [4], and Zeckendorf representation of integers is given in [5]. In this short paper, we represent the number of vertices of in closed form (A closed form is one which gives the value of a sequence at index in terms of only one parameter, itself.) by observing the number of vertices at each level of . Such a calculation helps us to give a closed-form representation of th Fibonacci number for every .

2. Closed-Form Representation of Fibonacci Numbers

There are several closed-form representations of the Fibonacci numbers. We state a few below.(i)ConsiderIt was also derived by Binet (see [6]) in 1843, although the result was known to Euler, Daniel Bernoulli, and de Moivre more than a century earlier.(ii)ConsiderIn the above generating function for the Fibonacci numbers the value of gives the th Fibonacci number. However, expanding the generating function involves tedious calculations.(iii)Consider

It was also derived by Binet (see [6]) where the function rounds the simplified expression up or down to an integer.

In this section, we give a simpler closed-form combinatorial representation of Fibonacci numbers. To do so, we first give a closed-form representation of the number of vertices of (the Fibonacci tree of height ). The following lemma gives the number of vertices in a particular level of and thereafter we sum the number of vertices over the levels to get .

Lemma 2. Let be a Fibonacci tree of height and let be an integer such that . The number of vertices at level of is given by

Proof. We prove the lemma by induction on . For we have . Using the convention if , we have . This is true since the root of is the only vertex at level . Further proceeding, from the recursive definition of , we have In Step of the above equation, we add and subtract for . This proves the lemma.

The number of vertices in any tree is the sum of the vertices at its levels. In particular, . Hence we have the following lemma.

Lemma 3. Let be the Fibonacci tree of height ; then the number of vertices of is .

The above theorem helps us to derive a closed-form representation of the Fibonacci numbers. This representation is in contrast to the recurrence relation form, which has certain previous values of the sequence as parameters. We know that . Equivalently .

Theorem 4. Let be the th number in the Fibonacci sequence starting with and . Then for ,

Proof. Since , the proof is an immediate consequence of Lemma 3.

As an example for Theorem 4, we calculate and :

3. Conclusion

In this paper, we give a closed-form representation of Fibonacci numbers using Fibonacci trees. A similar approach can be attempted for finding a closed-form representation for Lucas and Bernoulli numbers.

Conflict of Interests

The author declares that there is no conflict of interests regarding the publication of this paper.


  1. G. M. Adelson-Velskii and E. M. Landis, “An algorithm for organization of information,” Soviet Mathematics. Doklady, vol. 3, pp. 1259–1262, 1962. View at Google Scholar
  2. S. G. Wagner, “The Fibonacci number of Fibonacci trees and a related family of polynomial recurrence systems,” Fibonacci Quarterly, vol. 45, no. 3, pp. 247–253, 2007. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. Y. Horibe, “Notes on Fibonacci trees and their optimality,” The Fibonacci Quaterly, vol. 21, no. 2, pp. 118–128, 1983. View at Google Scholar
  4. N. Jia and K. W. McLaughlin, “Fibonacci trees: A study of the asymptotic behavior of Balaban's index,” MATCH. Communications in Mathematical and in Computer Chemistry, no. 51, pp. 79–95, 2004. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. R. M. Capocelli, “A note on Fibonacci trees and the Zeckendorf representation of integers,” The Fibonacci Quarterly, vol. 26, no. 4, pp. 318–324, 1988. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. W. Eric, “Binet's Fibonacci Number Formula,” from MathWorld.