Abstract
We investigate several methods of computing Fibonacci numbers quickly and generalize some properties of the Fibonacci numbers to degree r Fibonacci (R-nacci) numbers. Sections 2 and 3 present several algorithms for computing the traditional, degree two, Fibonacci numbers quickly. Sections 4 and 5 investigate the structure of the binary representation of the Fibonacci numbers. Section 6 shows how the generalized Fibonacci numbers can be expressed as rounded powers of the dominant root of the characteristic equation. Properties of the roots of the characteristic equation of the generalized Fibonacci numbers are presented in Section 7. Section 8 introduces several properties of the Zeckendorf representation of the integers. Finally, in Section 9 the asymptotic proportion of l’s in the Zeckendorf representation of integers is computed and an easy to compute closed formula is given.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
