Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Fibonacci
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Fibonacci sequence== {{Main|Fibonacci number}} {{Lang|la|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 {{Lang|la|Liber Abaci}} contains the earliest known description of the sequence outside of India, the sequence had been described 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|issue=3|year=1985|pages=229β244|doi=10.1016/0315-0860(85)90021-7|doi-access=free}}</ref><ref>{{cite book |title = Toward a Global Science | first = Susantha | last = Goonatilake |publisher = Indiana University Press |year = 1998 |page = [https://archive.org/details/towardglobalscie0000goon/page/126 126] |isbn = 978-0-253-33388-9 |url = https://archive.org/details/towardglobalscie0000goon |url-access = registration |quote = Virahanka Fibonacci. }}</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=https://books.google.com/books?id=56LNfE2QGtYC&q=rhythms&pg=PA50 |access-date=2020-11-11 |archive-date=2023-03-13 |archive-url=https://web.archive.org/web/20230313121953/https://books.google.com/books?id=56LNfE2QGtYC&q=rhythms&pg=PA50 |url-status=live }}</ref><ref>Hall, Rachel W. [http://www.sju.edu/~rhall/mathforpoets.pdf Math for poets and drummers] {{Webarchive|url=https://web.archive.org/web/20120212145748/http://www.sju.edu/~rhall/mathforpoets.pdf |date=2012-02-12 }}. ''Math Horizons'' '''15''' (2008) 10β11.</ref> In the Fibonacci sequence, each number is the sum of the previous two numbers. Fibonacci omitted the "0" and first "1" included today and began the sequence with 1, 2, 3, ... . He carried the calculation up to the thirteenth place, the value 233, though another manuscript carries it to the next place, the value 377.<ref>{{Cite OEIS|1=A000045|2=Fibonacci Numbers}}</ref><ref>{{cite book |url=https://books.google.com/books?id=gvRFAAAAcAAJ&pg=PA231 |title=Scritti: Il Liber Abbaci |first1=Leonardus |last1=Pisanus |first2=Baldassarre |last2=Boncompagni |date=1 January 1857 |page=231 |publisher=Tip. delle Scienze Fisiche e Matematiche |via=Google Books |access-date=20 December 2018 |archive-date=13 March 2023 |archive-url=https://web.archive.org/web/20230313121953/https://books.google.com/books?id=gvRFAAAAcAAJ&pg=PA231 |url-status=live }}</ref> Fibonacci did not speak about the [[golden ratio]] as the limit of the ratio of consecutive numbers in this sequence.
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Fibonacci
(section)
Add topic