A note on closed-form representation of Fibonacci numbers using Fibonacci trees

2013/02/26 by Raman, Indhumathi
#05C30 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1302.6583

Abstract

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

Related

• Fibonacci and digit-by-digit computation; An example of reverse engineering in computational mathematics
• Twelve Simple Algorithms to Compute Fibonacci Numbers
• Zeckendorf Representations Using Negative Fibonacci Numbers
• Fibonacci Numbers, Golden Section and Applications
• Fibonometry and Beyond