https://www.conservapedia.com/api.php?action=feedcontributions&feedformat=atom&user=Euler 2026-09-30T22:32:15Z User contributions MediaWiki 1.35.14 https://www.conservapedia.com/index.php?title=Fibonacci_sequence&diff=49454 2007-03-19T23:40:24Z

<p>Euler: </p> <hr /> <div>The '''Fibonacci sequence''' is a series of numbers in which each number is the sum of the two preceding numbers. The numbers are known as '''Fibonacci numbers'''.<br /> <br /> '''Example'''<br /> 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144 ...<br /> <br /> The Fibonacci numbers were first described by the Sanskrit linguist Pingala around the year 450 BC. They arose from the study of meters with long and short syllables.<br /> <br /> The first Western mathematician to study this sequence was Leonardo of Pisa, commonly known as [[Fibonacci]], in the consideration of the growth of an idealized rabbit population.<br /> <br /> [[Johannes Kepler]] discovered that the [[limit]] of the ratios between succeeding Fibonacci numbers converges to the [[golden ratio]]. Fibonacci numbers also occur in [[Pascal's triangle]] and the run-time analysis of [[Euclid's Algorithm]].<br /> <br /> == Examples of Fibonacci Sequences ==<br /> <br /> * 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</div>

Euler