Click here

Fibonacci numbers

A series of whole numbers in which each number is the sum of the two preceding numbers. Beginning with 0 and 1, the sequence of Fibonacci numbers would be 0,1,1, 2, 3, 5, 8, 13, 21, 34, etc. using the formula n = n(-1) + n(-2), where the n(-1) means "the last number before n in the series" and n(-2) refers to "the second last one before n in the series."

In computer programming, Fibonacci numbers give a model for designing recursive programming algorithms where the time for any routine is the time within the routine itself, plus the time for the recursive calls.

The Fibonacci numbers were originally defined by the Italian mathematician Fibonacci, also known as Leonardo da Pisa, in the 13th century to model the growth of rabbit populations.



Top Terms
  • 1

    enterprise application

    An enterprise application is the term used to describe applications -- or software -- that a business would use to assist the organization in...

    Read more »

  • 2

    open source

    Generically, open source refers to a program in which the source code is available to the general public for use and/or modification from its...

    Read more »

  • Click Here!

Connect with Webopedia

Did You Know? Archive »

  • Quick Reference Archive »