Fibonacci numbersA 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.
Because nothing says "I Love You" Like an open source app. Read More »Guarding your Data against Cyber Attacks
In this new era of heightened stakes comes an increased need for a comprehensive security strategy. Let's take a look at how cyber-threats have... Read More »The Great Data Storage Debate: Is Tape Dead?
Tape clearly is on the decline. But remember, legacy systems can hang for a shockingly long time. Read More »
A network is a group of two or more computer systems or devices, linked together to share resources, exchange files and electronic communications.... Read More »Computer Architecture Study Guide
This Webopedia study guide describes the different parts of a computer system and their relations. Read More »Webopedia Polls
The trend for the past two years has been for shoppers to spend more online during the holiday season. How do you typically shop for holiday... Read More »
Stay up to date on the latest developments in Internet terminology with a free weekly newsletter from Webopedia. Join to subscribe now.
- Watch Datamation's editor James Maguire moderate roundtable discussions with tech experts from companies such as Accenture, Dell, Blue Jeans Network, Microsoft and more »