Fibonacci: Malsamoj inter versioj

2 261 bitokojn aldonis ,  antaŭ 4 jaroj
''Liber Abaci'' posed, and solved, a problem involving the growth of a population of rabbits based on idealized assumptions. The solution, generation by generation, was a sequence of numbers later known as [[Fibonacci number]]s. Although Fibonacci's ''Liber Abaci'' contains the earliest known description of the sequence outside of India, the sequence had been noted by Indian mathematicians as early as the sixth century.<ref>{{cite journal|first=Pamanand|last=Singh|title=The so-called fibonacci numbers in ancient and medieval India|journal=Historia Mathematica|volume=12|year=1985|pages=229–244|doi=10.1016/0315-0860(85)90021-7}}</ref><ref>{{cite book |title = Toward a Global Science | first = Susantha | last = Goonatilake |publisher = Indiana University Press |year = 1998 |page = 126 |isbn = 978-0-253-33388-9 |url = }}</ref><ref>{{cite book |title = The Art of Computer Programming: Generating All Trees – History of Combinatorial Generation; Volume 4 |first=Donald |last = Knuth |publisher=Addison-Wesley |year=2006 |isbn=978-0-321-33570-8 | page=50 |url=}}</ref><ref>Hall, Rachel W. [ Math for poets and drummers]. ''Math Horizons'' '''15''' (2008) 10–11.</ref>
In the Fibonacci sequence of numbers, each number is the sum of the previous two numbers. Fibonacci began the sequence not with 0, 1, 1, 2, as modern mathematicians do but with 1,1, 2, etc. He carried the calculation up to the thirteenth place (fourteenth in modern counting), that is 233, though another manuscript carries it to the next place: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377.<ref>[ Fibonacci Numbers] from [ The On-Line Encyclopedia of Integer Sequences].</ref><ref>[ ''Il Liber Abbaci'', 1857 edition, p. 231. Online at]</ref> Fibonacci did not speak about the [[golden ratio]] as the limit of the ratio of consecutive numbers in this sequence.
{| style="float:right;"
|Tiel la unuaj fibonaĉi-nombroj estas:
177 911