फिबोनाची अनुक्रम (Hindi Wikipedia)

Analysis of information sources in references of the Wikipedia article "फिबोनाची अनुक्रम" in Hindi language version.

refsWebsite
Global rank Hindi rank
3rd place
2nd place
2nd place
5th place
1,135th place
341st place

books.google.com (Global: 3rd place; Hindi: 2nd place)

  • Knuth, Donald (1968), The Art of Computer Programming, vol. 1, Addison Wesley, p. 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, p. 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)

doi.org (Global: 2nd place; Hindi: 5th place)

  • Singh, Parmanand (1985), "The So-called Fibonacci numbers in ancient and medieval India", Historia Mathematica, 12 (3): 229–44, डीओआई:10.1016/0315-0860(85)90021-7

investopedia.com (Global: 1,135th place; Hindi: 341st place)