Difference between revisions of "Fibonacci sequence"
Jump to navigation
Jump to search
(5 + 8 isn't 5) |
|||
| Line 4: | Line 4: | ||
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144 ... | 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144 ... | ||
| − | == | + | == Example of Fibonacci Sequences == |
* The family trees of honey bees can be depicted using fibonacci numbers because unmated females will always hatch male young, while mated females will always hatch female young. | * The family trees of honey bees can be depicted using fibonacci numbers because unmated females will always hatch male young, while mated females will always hatch female young. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 01:58, March 17, 2007
A fibonacci sequence is a series of numbers in which any number is the sum of the two preceding numbers.
Example
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144 ...
Example of Fibonacci Sequences
- The family trees of honey bees can be depicted using fibonacci numbers because unmated females will always hatch male young, while mated females will always hatch female young.