Bilangan Fibonacci (Indonesian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Bilangan Fibonacci" in Indonesian language version.
refsWebsite
Global rank
Indonesian rank
3rd place
6th place
6th place
2nd place
8,396th place
low place
low place
low place
513th place
419th place
archive.org
- Lucas 1891, hlm. 3. Lucas, Édouard (1891), Théorie des nombres (dalam bahasa Prancis), vol. 1, Paris: Gauthier-Villars.
- Lucas 1891, hlm. 4. Lucas, Édouard (1891), Théorie des nombres (dalam bahasa Prancis), vol. 1, Paris: Gauthier-Villars.
books.google.com
- Goonatilake, Susantha (1998), Toward a Global Science, Indiana University Press, hlm. 126, ISBN 978-0-253-33388-9
- Knuth, Donald (2006), The Art of Computer Programming, vol. 4. Generating All Trees – History of Combinatorial Generation, Addison–Wesley, hlm. 50, ISBN 978-0-321-33570-8,
it was natural to consider the set of all sequences of [L] and [S] that have exactly m beats. ... there are exactly Fm+1 of them. For example the 21 sequences when m = 7 are: [gives list]. In this way Indian prosodists were led to discover the Fibonacci sequence, as we have observed in Section 1.2.8 (from v.1)
- Livio 2003, hlm. 197. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (Edisi First trade paperback), New York City: Broadway Books, ISBN 0-7679-0816-3
- Knuth, Donald (1968), The Art of Computer Programming, vol. 1, Addison Wesley, hlm. 100, ISBN 978-81-7758-754-8,
Before Fibonacci wrote his work, the sequence Fn had already been discussed by Indian scholars, who had long been interested in rhythmic patterns ... both Gopala (before 1135 AD) and Hemachandra (c. 1150) mentioned the numbers 1,2,3,5,8,13,21 explicitly [see P. Singh Historia Math 12 (1985) 229–44]" p. 100 (3d ed) ...
- Knuth, Donald (2006), The Art of Computer Programming, vol. 4. Generating All Trees – History of Combinatorial Generation, Addison–Wesley, hlm. 50, ISBN 978-0-321-33570-8,
it was natural to consider the set of all sequences of [Long] and [Short] that have exactly m beats. ... there are exactly of them. For example the 21 sequences when are: [gives list]. In this way Indian prosodists were led to discover the Fibonacci sequence, as we have observed in Section 1.2.8 (from v.1)
- Goonatilake, Susantha (1998), Toward a Global Science, Indiana University Press, hlm. 126, ISBN 978-0-253-33388-9
- Livio 2003, hlm. 197–198. Livio, Mario (2003) [2002], The Golden Ratio: The Story of Phi, the World's Most Astonishing Number (Edisi First trade paperback), New York City: Broadway Books, ISBN 0-7679-0816-3
- Sarah-Marie Belcastro (2018). Discrete Mathematics with Ducks (Edisi 2nd, illustrated). CRC Press. hlm. 260. ISBN 978-1-351-68369-2. Extract of page 260
doi.org
- Singh, Parmanand (1985), "The So-called Fibonacci numbers in ancient and medieval India", Historia Mathematica, 12 (3): 229–44, doi:10.1016/0315-0860(85)90021-7
- Singh, Parmanand (1985), "The So-called Fibonacci numbers in ancient and medieval India", Historia Mathematica, 12 (3): 229–44, doi:10.1016/0315-0860(85)90021-7
- Singh, Parmanand (1985), "The So-called Fibonacci Numbers in Ancient and Medieval India", Historia Mathematica, 12 (3), Academic Press: 232, doi:10.1016/0315-0860(85)90021-7
- Beutelspacher, Albrecht; Petri, Bernhard (1996), "Fibonacci-Zahlen", Der Goldene Schnitt, Einblick in die Wissenschaft, Vieweg+Teubner Verlag, hlm. 87–98, doi:10.1007/978-3-322-85165-9_6, ISBN 978-3-8154-2511-4
math.ca
fq.math.ca
- Gessel, Ira (October 1972), "Fibonacci is a Square" (PDF), The Fibonacci Quarterly, 10 (4): 417–19, diakses tanggal April 11, 2012
northeastern.edu
web.northeastern.edu
- Shah, Jayant (1991), "A History of Piṅgala's Combinatorics" (PDF), Northeastern University: 41, diakses tanggal 4 January 2019
oeis.org
- Sloane, N.J.A. (ed.). "Sequence A000045 (Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- Sloane, N.J.A. (ed.). "Sequence A000045 (Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
surrey.ac.uk
maths.surrey.ac.uk
- Knott, Ron (25 September 2016), "The Fibonacci Numbers and Golden section in Nature – 1", University of Surrey, diakses tanggal 27 November 2018
- Knott, Ron, Fibonacci's Rabbits, University of Surrey Faculty of Engineering and Physical Sciences
utah.edu
math.utah.edu
- "Fibonacci's Liber Abaci (Book of Calculation)", The University of Utah, 13 December 2009, diakses tanggal 28 November 2018