Difference between revisions of "Fibonacci sequence"
Jump to navigation
Jump to search
(Valid information reinstated again. Huey gunna getcha is a vandal. Can we please prevent him from continuing belligerent behaviour?) |
(Bill must be a subtle vandal, as he continues to post erroneous material. His examples do not match up with his definition, this must be prevented.) |
||
| 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 ... | ||
| − | == Examples of Fibonacci | + | == Examples of Fibonacci Sequence == |
* 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 02:10, 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 ...
Examples of Fibonacci Sequence
- 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.