[GO to Home / Site Index] [GO to 'The Series'] [GO to 'The Rabbit Problem']

[Section Index]
[An Introduction to the Series]
[An Intro to the Series In Action]
[The Rabbit Problem]
[The Rabbit Problem Proof]
[Binet's Formula]
[Binet's Formula In Action]
[The Successor Formula]
[The Successor Formula In Action]
[Binomial Form]
[Binomial Form In Action]
[Fibonacci Spiral]
[Fibonacci Spiral In Action]

[Section Index]

[Section Index]

[Section Index]

[The Fibonacci Forum]

[Section Index]

[Section Index]

[Search This Site]

An Introduction to the Series [GO to 'An Intro to the Series In Action']

The first two numbers in the series are one and one. To obtain each number of the series, you simply add the two numbers that came before it. In other words, each number of the series is the sum of the two numbers preceding it.

Note: Historically, some mathematicians have considered zero to be a Fibonacci number, placing it before the first 1 in the series. It is known as the zeroth Fibonacci number, and has no real practical merit. We will not consider zero to be a Fibonacci number in our discussion of the series.

[GO to 'The Series'] [GO to 'The Rabbit Problem'] [GO to 'An Intro to the Series in Action']

Random Fibonacci number from the 1st through the 200th:

 

All contents, unless otherwise specified, are © 1999 by Matt Anderson, Jeffrey Frazier, and Kris Popendorf.
Created by Team 27890 for the 1999 [ThinkQuest] competition.