Select Source:

## Fibonacci series

Fibonacci series A sequence of numbers in which each number is the sum of the two preceding numbers, e.g. 0,1,1,2,3,5,8,…

The Fibonacci numbers Fn are formally defined to be F0 = 0, F1 = 1, Fn+2 = Fn+1 + Fn, n ≥ 0

Any positive number m can be represented uniquely as a sum of Fibonacci numbers, where the greatest Fn in the expansion does not exceed m and where no two of the Fn are adjacent numbers in the Fibonacci series.

Pick a style below, and copy the text for your bibliography.

• MLA
• Chicago
• APA

"Fibonacci series." A Dictionary of Computing. . Encyclopedia.com. 16 Dec. 2017 <http://www.encyclopedia.com>.

"Fibonacci series." A Dictionary of Computing. . Encyclopedia.com. (December 16, 2017). http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/fibonacci-series

"Fibonacci series." A Dictionary of Computing. . Retrieved December 16, 2017 from Encyclopedia.com: http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/fibonacci-series

## Fibonacci series

Fibonacci series. See number systems.