FIBONACCI NUMBER

In mathematics, the 'Fibonacci numbers' form a sequence defined by the following recurrence relation:
:$$
F(n):=
egin{cases}
0 & mbox{if } n = 0; \
1 & mbox{if } n = 1; \
F(n-1)+F(n-2) & mbox{if } n > 1. \
end{cases}

That is, after two starting values, each number is the sum of the two preceding numbers. The first Fibonacci numbers , also denoted as ''F_n'', for ''n'' = 0, 1, … , are:
: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811…
(Sometimes this sequence is considered to start at ''F''₁ = 1, but in this article it is regarded as beginning with ''F''₀=0.)
The Fibonacci numbers are named after Leonardo of Pisa, known as Fibonacci, although they had been described earlier in India.^[1][2]

Contents

Origins

The bee ancestry code

Relation to the golden ratio

Golden ratio defined

Closed form expression

Limit of consecutive quotients

Matrix form

Recognizing Fibonacci numbers

Identities

Proof of the first identity

Proof of the second identity

Proof of the third identity

Identity for doubling ''n''

Other identities

Power series

Reciprocal sums

Primes and divisibility

Right triangles

Magnitude of Fibonacci numbers

Applications

Fibonacci numbers in nature

Popular culture

Generalizations

See also

References

External links

Origins

The Fibonacci numbers first appeared, under the name ''mātrāmeru'' (mountain of cadence), in the work of the Sanskrit grammarian Pingala (''Chandah-shāstra'', the Art of Prosody, 450 or 200 BC). Prosody was important in ancient Indian ritual because of an emphasis on the purity of utterance. The Indian mathematician Virahanka (6th century AD) showed how the Fibonacci sequence arose in the analysis of metres with long and short syllables. Subsequently, the Jain philosopher Hemachandra (c.1150) composed a well known text on these. A commentary on Virahanka by Gopāla in the 12th century also revisits the problem in some detail.
Sanskrit vowel sounds can be long (L) or short (S), and Virahanka's analysis, which came to be known as ''mātrā-vṛtta'', wishes to compute how many metres (''mātrā''s) of a given overall length can be composed of these syllables. If the long syllable is twice as long as the short, the solutions are:
: 1 mora: S (1 pattern)
: 2 morae: SS; L (2)
: 3 morae: SSS, SL; LS (3)
: 4 morae: SSSS, SSL, SLS; LSS, LL (5)
: 5 morae: SSSSS, SSSL, SSLS, SLSS, SLL; LSSS, LSL, LLS (8)
: 6 morae: SSSSSS, SSSSL, SSSLS, SSLSS, SLSSS, LSSSS, SSLL, SLSL, SLLS, LSSL, LSLS, LLSS, LLL (13)
: 7 morae: SSSSSSS, SSSSSL, SSSSLS, SSSLSS, SSLSSS, SLSSSS, LSSSSS, SSSLL, SSLSL, SLSSL, LSSSL, SSLLS, SLSLS, LSSLS, SLLSS, LSLSS, LLSSS, SLLL, LSLL, LLSL, LLLS (21)
A pattern of length ''n'' can be formed by adding S to a pattern of length ''n''−1, or L to a pattern of length ''n''−2; and the prosodicists showed that the number of patterns of length n is the sum of the two previous numbers in the series. Donald Knuth reviews this work in ''The Art of Computer Programming'' as equivalent formulations of the bin packing problem for items of lengths 1 and 2.
In the West, the sequence was first studied by Leonardo of Pisa, known as Fibonacci, in his Liber Abaci (1202)^[3]. He considers the growth of an idealised (biologically unrealistic) rabbit population, assuming that:

★ in the first month there is just one newly-born pair,

★ new-born pairs become fertile from their second month on

★ each month every fertile pair begets a new pair, and

★ the rabbits never die
Let the population at month ''n'' be ''F''(''n''). At this time, only rabbits who were alive at month ''n''−2 are fertile and produce offspring, so ''F''(''n''−2) pairs are added to the current population of ''F''(''n''−1). Thus the total is ''F''(''n'') = ''F''(''n''−1) + ''F''(''n''−2).^[4]

The bee ancestry code

Fibonacci numbers also appear in the description of the reproduction of a population of idealized bees, according to the following rules:

★ If an egg is laid by an unmated female, it hatches a male.

★ If, however, an egg was fertilized by a male, it hatches a female.
Thus, a male bee will always have one parent, and a female bee will have two.
If one traces the ancestry of any male bee (1 bee), he has 1 female parent (1 bee). This female had 2 parents, a male and a female (2 bees). The female had two parents, a male and a female, and the male had one female (3 bees). Those two females each had two parents, and the male had one (5 bees). This sequence of numbers of parents is the Fibonacci sequence.
This is an idealization that does not describe ''actual'' bee ancestries. In reality, some ancestors of a particular bee will always be sisters or brothers, thus breaking the lineage of distinct parents.

Relation to the golden ratio

Golden ratio defined

The golden ratio (phi), also written $au$ (tau), is defined as the ratio that results when a line is divided so that the whole line has the same ratio to the larger segment as the larger segment has to the smaller segment. Expressed algebraically, normalising the larger part to unit length, it is the positive solution of the equation:
: or equivalently $x^2-x-1=0,,$
which is equal to:
:

Closed form expression

Like every sequence defined by linear recurrence, the Fibonacci numbers have a closed-form solution. It has become known as Binet's formula, even though it was already known by Abraham de Moivre:
:$Fleft(n$
ight) = {{arphi^n-(1-arphi)^n} over {sqrt 5}}, , where is the golden ratio.
The Fibonacci recursion
:$F(n+2)-F(n+1)-F(n)=0,$
is similar to the defining equation of the golden ratio in the form
:$x^2-x-1=0,,$
which is also known as the generating polynomial of the recursion.
'Proof' (by induction):
Any root of the equation above satisfies and multiplying by $x^\{n-1\},$ shows:
:$x^\{n+1\}\; =\; x^n\; +\; x^\{n-1\},$
By definition is a root of the equation, and the other root is . Therefore:
:
and
:
Now consider the functions:
: defined for any real $a,b,\; .$
All these functions satisfy the Fibonacci recursion
:
F_{a,b}(n+1) &= aarphi^{n+1}+b(1-arphi)^{n+1} \
&=a(arphi^{n}+arphi^{n-1})+b((1-arphi)^{n}+(1-arphi)^{n-1}) \
&=a{arphi^{n}+b(1-arphi)^{n}}+a{arphi^{n-1}+b(1-arphi)^{n-1}} \
&=F_{a,b}(n)+F_{a,b}(n-1)
end{align}
Selecting $a=1/sqrt\; 5$ and $b=-1/sqrt\; 5$ gives the formula of Binet we started with. It has been shown that this formula satisfies the Fibonacci recursion. Furthermore:
:
and
:
establishing the base cases of the induction, proving that
: for all $n,\; .$
For any two starting values, a combination $a,b$ can be found such that the function $F\_\{a,b\}(n),$ is the exact closed formula for the series.
Since for all $ngeq\; 0,\; ,\; F(n),$ is the closest integer to
For computational purposes, this is expressed using the floor function:
:
floor.

Limit of consecutive quotients

Johannes Kepler pointed out that the ratio of consecutive Fibonacci numbers converges to the golden ratio as the limit.
:
This convergence does not depend on the starting values chosen, excluding 0, 0.
'Proof':
It follows from the explicit formula that for any real $a$
e 0, b
e 0:
:
lim_{n oinfty}rac{F_{a,b}(n+1)}{F_{a,b}(n)}
&= lim_{n oinfty}rac{aarphi^{n+1}-b(1-arphi)^{n+1}}{aarphi^n-b(1-arphi)^n} \
&= lim_{n oinfty}rac{aarphi-b(1-arphi)(rac{1-arphi}{arphi})^n}{a-b(rac{1-arphi}{arphi})^n} \
&= arphi
end{align}
because and thus
ight)^n=0

Matrix form

A 2-dimensional system of linear difference equations that describes the Fibonacci sequence is
:
or
:
The eigenvalues of the matrix A are and , and the elements of the eigenvectors of A, and , are in the ratios and .
This matrix has a determinant of −1, and thus it is a 2×2 unimodular matrix. This property can be understood in terms of the continued fraction representation for the golden ratio:
:
=1 + cfrac{1}{1 + cfrac{1}{1 + cfrac{1}{;;ddots,}}} ;.
The Fibonacci numbers occur as the ratio of successive convergents of the continued fraction for , and the matrix formed from successive convergents of any continued fraction has a determinant of +1 or −1.
The matrix representation gives the following closed expression for the Fibonacci numbers:
:
egin{pmatrix} F_{n+1} & F_n \
F_n & F_{n-1} end{pmatrix}.

Taking the determinant of both sides of this equation yields Cassini's identity
:$F\_\{n+1\}F\_\{n-1\}\; -\; F\_n^2\; =\; (-1)^n.,$
Additionally, since $A^n\; A^m=A^\{m+n\}$ for any square matrix $A$, the following identities can be derived:
:$\{F\_n\}^2\; +\; \{F\_\{n-1\}\}^2\; =\; F\_\{2n-1\},,$
:$F\_\{n+1\}F\_\{m\}\; +\; F\_n\; F\_\{m-1\}\; =\; F\_\{m+n\}.,$

Recognizing Fibonacci numbers

Occasionally, the question may arise whether a positive integer $z$ is a Fibonacci number. Since $F(n)$ is the closest integer to , the most straightforward test is the identity
:
floorigg)=z,
which is true if and only if $z$ is a Fibonacci number.
A slightly more sophisticated test uses the fact that the convergents of the continued fraction representation of are ratios of successive Fibonacci numbers, that is the inequality
:
(with coprime positive integers $p$, $q$) is true if and only if $p$ and $q$ are successive Fibonacci numbers. From this one derives the criterion that $z$ is a Fibonacci number if and only if the intersection of the closed interval
:
with the positive integers $mathbb\{N\}$ is not empty.^[5]

Identities

#''F''(''n'' + 1) = ''F''(''n'') + ''F''(''n'' − 1)
#''F''(0) + ''F''(1) + ''F''(2) + … + ''F''(''n'') = ''F''(''n'' + 2) − 1
#''F''(1) + 2 ''F''(2) + 3 ''F''(3) + … + ''n F''(''n'') = ''n F''(''n'' + 2) − ''F''(''n'' + 3) + 2
#''F''(0)² + ''F''(1)² + ''F''(2)² + … + ''F''(''n'')² = ''F''(''n'') ''F''(''n'' + 1)
These identities can be proven using many different methods.
But, among all, we wish to present an elegant proof for each of them using combinatorial arguments here.
In particular, ''F''(''n'') can be interpreted as the number of ways summing 1's and 2's to ''n'' − 1, with the convention that ''F''(0) = 0, meaning no sum will add up to −1, and that ''F''(1) = 1, meaning the empty sum will "add up" to 0.
Here the order of the summands matters.
For example, 1 + 2 and 2 + 1 are considered two different sums and are counted twice.

Proof of the first identity

Without loss of generality, we may assume ''n'' ≥ 1.
Then ''F''(''n'' + 1) counts the number of ways summing 1's and 2's to ''n''.
When the first summand is 1, there are ''F''(''n'') ways to complete the counting for ''n'' − 1; and when the first summand is 2, there are ''F''(''n'' − 1) ways to complete the counting for ''n'' − 2.
Thus, in total, there are ''F''(''n'') + ''F''(''n'' − 1) ways to complete the counting for ''n''.

Proof of the second identity

We count the number of ways summing 1's and 2's to ''n'' + 1 such that at least one of the summands is 2.
As before, there are ''F''(''n'' + 2) ways summing 1's and 2's to ''n'' + 1 when ''n'' ≥ 0.
Since there is only one sum of ''n'' + 1 that does not use any 2, namely 1 + … + 1 (''n'' + 1 terms), we subtract 1 from ''F''(''n'' + 2).
Equivalently, we can consider the first occurrence of 2 as a summand.
If, in a sum, the first summand is 2, then there are ''F''(''n'') ways to the complete the counting for ''n'' − 1.
If the second summand is 2 but the first is 1, then there are ''F''(''n'' − 1) ways to complete the counting for ''n'' − 2.
Proceed in this fashion.
Eventually we consider the (''n'' + 1)th summand.
If it is 2 but all of the previous ''n'' summands are 1's, then there are ''F''(0) ways to complete the counting for 0.
If a sum contains 2 as a summand, the first occurrence of such summand must take place in between the first and (''n'' + 1)th position.
Thus ''F''(''n'') + ''F''(''n'' − 1) + … + ''F''(0) gives the desired counting.

Proof of the third identity

This identity can be established in two stages.
First, we count the number of ways summing 1s and 2s to −1, 0, …, or ''n'' + 1 such that at least one of the summands is 2.
By our second identity, there are ''F''(''n'' + 2) − 1 ways summing to ''n'' + 1; ''F''(''n'' + 1) − 1 ways summing to ''n''; …; and, eventually, ''F''(2) − 1 way summing to 1.
As ''F''(1) − 1 = ''F''(0) = 0, we can add up all ''n'' + 1 sums and apply the second identity again to obtain
:    [''F''(''n'' + 2) − 1] + [''F''(''n'' + 1) − 1] + … + [''F''(2) − 1]
: = [''F''(''n'' + 2) − 1] + [''F''(''n'' + 1) − 1] + … + [''F''(2) − 1] + [''F''(1) − 1] + ''F''(0)
: = ''F''(''n'' + 2) + [''F''(''n'' + 1) + … + ''F''(1) + ''F''(0)] − (''n'' + 2)
: = ''F''(''n'' + 2) + ''F''(''n'' + 3) − (''n'' + 2).
On the other hand, we observe from the second identity that there are

★ ''F''(0) + ''F''(1) + … + ''F''(''n'' − 1) + ''F''(''n'') ways summing to ''n'' + 1;

★ ''F''(0) + ''F''(1) + … + ''F''(''n'' − 1) ways summing to ''n'';
……

★ ''F''(0) way summing to −1.
Adding up all ''n'' + 1 sums, we see that there are

★ (''n'' + 1) ''F''(0) + ''n'' ''F''(1) + … + ''F''(''n'') ways summing to −1, 0, …, or ''n'' + 1.
Since the two methods of counting refer to the same number, we have
: (''n'' + 1) ''F''(0) + ''n'' ''F''(1) + … + ''F''(''n'') = ''F''(''n'' + 2) + ''F''(''n'' + 3) − (''n'' + 2)
Finally, we complete the proof by subtracting the above identity from ''n'' + 1 times the second identity.

Identity for doubling ''n''

Another identity useful for calculating ''F_n'' for large values of ''n'' is
:$F\_\{2n+k\}\; =\; F\_k\; F\_\{n+1\}^2\; +\; 2\; F\_\{k-1\}\; F\_\{n+1\}\; F\_n\; +\; F\_\{k-2\}\; F\_n^2$
for all integers ''n'' and ''k''. Dijkstra^[6] points out that doubling identities of this type can be used to calculate ''F_n'' using O(log ''n'') arithmetic operations.
(From practical standpoint it should be noticed that the calculation involves manipulation of numbers which length (number of digits) is $\{$
m Theta}(n),. Thus the actual performance depends mainly upon efficiency of the implemented long multiplication, and usually is $\{$
m Theta}(n ,log n) or $\{$
m Theta}(n ^{log_2 3}).)

Other identities

Other identities include relationships to the Lucas numbers, which have the same recursive properties but start with ''L''_''0''=2 and ''L''_''1''=1. These properties include
''F''_''2n''=''F''_''n''''L''_''n''.
There are also scaling identities, which take you from ''F''_n and ''F''_n+1 to a variety of things of the form ''F''_an+b; for instance
$F\_\{3n\}\; =\; 5F\_\{n\}^3\; +\; 3\; (-1)^n\; F\_\{n\}$
$F\_\{3n+1\}\; =\; F\_\{n+1\}^3\; +\; 3\; F\_\{n+1\}F\_n^2\; -\; F\_n^3$
$F\_\{3n+2\}\; =\; F\_\{n+1\}^3\; +\; 3\; F\_\{n+1\}^2F\_n\; +\; F\_n^3$
$F\_\{4n\}\; =\; 4F\_nF\_\{n+1\}(F\_\{n+1\}^2\; +\; 2F\_n^2)\; -\; 3F\_n^2(F\_n^2\; +\; 2F\_\{n+1\}^2)$
These can be found experimentally using lattice reduction, and are useful in setting up the special number field sieve, should you wish to factorize a Fibonacci number. Their existence is strongly dependent on the fact that $F\_n\; =\; sqrt\{1/5\}\; left(phi^n\; -\; left(-phi$
ight)^{-n}
ight); Fibonacci-like numbers with a less symmetrical form to the solution of the recurrence relation do not have such identities associated with them.

Power series

The generating function of the Fibonacci sequence is the power series
:$s(x)=sum\_\{k=0\}^\{infty\}\; F\_k\; x^k.$
This series has a simple and interesting closed-form solution for ''x'' < 1/
:
This solution can be proven by using the Fibonacci recurrence to expand each coefficient in the infinite sum defining $s(x)$:
:
s(x) &= sum_{k=0}^{infty} F_k x^k \
&= F_0 + F_1x + sum_{k=2}^{infty} left( F_{k-1} + F_{k-2}
ight) x^k \
&= x + sum_{k=2}^{infty} F_{k-1} x^k + sum_{k=2}^{infty} F_{k-2} x^k \
&= x + xsum_{k=0}^{infty} F_k x^k + x^2sum_{k=0}^{infty} F_k x^k \
&= x + x s(x) + x^2 s(x)
end{align}
Solving the equation $s(x)=x+xs(x)+x^2s(x)$ for $s(x)$ results in the closed form solution.
In particular, math puzzle-books note the curious value .
Conversely,
:

Reciprocal sums

Infinite sums over reciprocal Fibonacci numbers can sometimes be evaluated in terms of theta functions. For example, we can write the sum of every odd-indexed reciprocal Fibonacci number as
:
ight) ,
and the sum of squared reciprocal Fibonacci numbers as
:
ight) - artheta_4^4left(0, rac{3-sqrt 5}{2}
ight) + 1
ight).
If we add 1 to each Fibonacci number in the first sum, there is also the closed form
:
and there is a nice ''nested'' sum of squared Fibonacci numbers giving the reciprocal of the golden ratio,
:
Results such as these make it plausible that a closed formula for the plain sum of reciprocal Fibonacci numbers could be found, but none is yet known. Despite that, the reciprocal Fibonacci constant
:
has been proved irrational by Richard André-Jeannin.

Primes and divisibility

Main articles: Fibonacci prime

A 'Fibonacci prime' is a Fibonacci number that is prime . The first few are:
: 2, 3, 5, 13, 89, 233, 1597, 28657, 514229, …
Fibonacci primes with thousands of digits have been found, but it is not known whether there are infinitely many. They must all have a prime index, except ''F''₄ = 3.
Any three consecutive Fibonacci numbers, taken two at a time, are relatively prime: that is,
:gcd(''F''_''n'',''F''_''n''+1) = gcd(''F''_''n'',''F''_''n''+2) = 1.
More generally,
:gcd(''F''_''n'', ''F''_''m'') = ''F''_{gcd(''n'',''m'').}^[7]
A proof of this striking fact is online at Harvey Mudd College's Fun Math site

Right triangles

Starting with 5, every other Fibonacci number is the length of the hypotenuse of a right triangle with integer sides, or in other words, the largest number in a Pythagorean triple. The length of the longer leg of this triangle is equal to the sum of the three sides of the preceding triangle in this series of triangles, and the shorter leg is equal to the difference between the preceding bypassed Fibonacci number and the shorter leg of the preceding triangle.
The first triangle in this series has sides of length 5, 4, and 3. Skipping 8, the next triangle has sides of length 13, 12 (5 + 4 + 3), and 5 (8 − 3). Skipping 21, the next triangle has sides of length 34, 30 (13 + 12 + 5), and 16 (21 − 5). This series continues indefinitely.

Magnitude of Fibonacci numbers

The number of base ''b'' digits of $F\_n,$ asymptotes to .

Applications

The Fibonacci numbers are important in the run-time analysis of Euclid's algorithm to determine the greatest common divisor of two integers: the worst case input for this algorithm is a pair of consecutive Fibonacci numbers.
Yuri Matiyasevich was able to show that the Fibonacci numbers can be defined by a Diophantine equation, which led to his original solution of Hilbert's tenth problem.
The Fibonacci numbers occur in the sums of "shallow" diagonals in Pascal's triangle and Lozanić's triangle (''see "Binomial coefficient"'').
Every positive integer can be written in a unique way as the sum of ''one or more'' distinct Fibonacci numbers in such a way that the sum does not include any two consecutive Fibonacci numbers. This is known as Zeckendorf's theorem, and a sum of Fibonacci numbers that satisfies these conditions is called a Zeckendorf representation.
Fibonacci numbers are used by some pseudorandom number generators.
A one-dimensional optimization method, called the Fibonacci search technique, uses Fibonacci numbers.^[8]
In music, Fibonacci numbers are sometimes used to determine tunings, and, as in visual art, to determine the length or size of content or formal elements. It is commonly thought that the first movement of Béla Bartók's ''Music for Strings, Percussion, and Celesta'' was structured using Fibonacci numbers.
Since the conversion factor 1.609 for miles to kilometers is close to the golden ratio (denoted φ), the decomposition of distance in miles into a sum of Fibonacci numbers becomes nearly the kilometer sum when the Fibonacci numbers are replaced by their successors. This method amounts to a radix 2 number register in golden ratio base φ being shifted. To convert from kilometers to miles, shift the register down the Fibonacci sequence instead.

Fibonacci numbers in nature

Fibonacci sequences appear in biological settings,^[9] such as branching in trees, the spiral of shells, the curve of waves, the fruitlets of a pineapple,^[10] an uncurling fern and the arrangement of a pine cone.^[11] Przemyslaw Prusinkiewicz advanced the idea that these can be in part understood as the expression of certain algebraic constraints on free groups, specifically as certain Lindenmayer grammars.^[12]
A model for the pattern of florets in the head of a sunflower was proposed by H. Vogel in 1979.^[13]
This has the form
:, $r\; =\; c\; sqrt\{n\}$
where ''n'' is the index number of the floret and ''c'' is a constant scaling factor; the florets thus lie on Fermat's spiral. The divergence angle, approximately 137.5°, is the golden angle, dividing the circle in the golden ratio. Because this ratio is irrational, no floret has a neighbor at exactly the same angle from the center, so the florets pack efficiently. Because the rational approximations to the golden ratio are of the form F(j):F(j+1), the nearest neighbors of floret number ''n'' are those at ''n''±F(j) for some index ''j'' which depends on ''r'', the distance from the center. It is often said that sunflowers and similar arrangements have 55 spirals in one direction and 89 in the other (or some other pair of adjacent Fibonacci numbers), but this is true only of one range of radii, typically the outermost and thus most conspicuous.^[14]

Popular culture

Main articles: Fibonacci numbers in popular culture

Because the Fibonacci sequence is easy for non-mathematicians to understand, there are many examples of the Fibonacci numbers being used in popular culture.

Generalizations

Main articles: Generalizations of Fibonacci numbers

The Fibonacci sequence has been generalized in many ways. These include:

★ Extending to negative index ''n'', satisfying ''F_n'' = ''F''_''n''−1 + ''F''_''n''−2 and, equivalently, ''F_-n'' = (−1)ⁿ⁺¹''F''_''n''

★ Generalising the index from positive integers to real numbers using a modification of Binet's formula. ^[15]

★ Starting with other integers. Lucas numbers have ''L''₁ = 1, ''L''₂ = 3, and ''L_n'' = ''L''_''n''−1 + ''L''_''n''−2. Primefree sequences use the Fibonacci recursion with other starting points in order to generate sequences in which all numbers are composite.

★ Letting a number be a linear function (other than the sum) of the 2 preceding numbers. The Pell numbers have ''P_n'' = 2''P''_{''n'' – 1} + ''P''_{''n'' – 2}.

★ Not adding the immediately preceding numbers. The Padovan sequence and Perrin numbers have P(n) = P(n – 2) + P(n – 3).

★ Generating the next number by adding 3 numbers (tribonacci numbers), 4 numbers (tetranacci numbers), or more.

★ Adding other objects than integers, for example functions or strings.

See also

★ Golden ratio (or golden section)

★ Logarithmic spiral

★ at Wikibooks

★ The Fibonacci Association

★ Fibonacci Quarterly — an academic journal devoted to the study of Fibonacci numbers

★ Negafibonacci numbers

References

1. Parmanand Singh. Acharya Hemachandra and the (so called) Fibonacci Numbers. Math . Ed. Siwan , 20(1):28-30,1986.ISSN 0047-6269]
2. Parmanand Singh,"The So-called Fibonacci numbers in ancient and medieval India. Historia Mathematica v12 n3, 229–244,1985
3. Fibonacci's Liber Abaci, Sigler, Laurence E. (trans.), , , Springer-Verlag, 2002, ISBN 0-387-95419-8 Chapter II.12, pp. 404–405.
4. Fibonacci's Rabbits
5. M. Möbius, ''Wie erkennt man eine Fibonacci Zahl?'', Math. Semesterber. (1998) 45; 243–246
6. E. W. Dijkstra (1978). In honor of Fibonacci. Report EWD654.
7. Paulo Ribenboim, ''My Numbers, My Friends'', Springer-Verlag 2000
8. Optimality of the Symmetric Fibonacci Search Technique, M. Avriel and D.J. Wilde, , , Fibonacci Quarterly, 1966
9. Phyllotaxis as a Dynamical Self Organizing Process, S. Douady and Y. Couder, , , Journal of Theoretical Biology, 1996
10. An Incomplete Education, , Judy, Jones, Ballantine Books, 2006, ISBN 978-0-7394-7582-9
11. Fibonacci Statistics in Conifers, A. Brousseau, , , Fibonacci Quarterly, 1969
12. Lindenmayer Systems, Fractals, and Plants (Lecture Notes in Biomathematics), , Przemyslaw, Prusinkiewicz, Springer-Verlag, 1989, ISBN 0-387-97092-4
13.

14. The Algorithmic Beauty of Plants, , Przemyslaw, Prusinkiewicz, Springer-Verlag, , ISBN 978-0387972978
15.

External links

★ Ron Knott, ''The Golden Section: Phi'', (2005).

★ Ron Knott, ''Representations of Integers using Fibonacci numbers'', (2004).

★ Bob Johnson, ''Fibonacci resources'', (2004)

★ Donald E. Simanek, ''Fibonacci Flim-Flam'', (undated, 2005 or earlier).

★ Rachel Hall, ''Hemachandra's application to Sanskrit poetry'', (undated; 2005 or earlier).

★ Alex Vinokur, ''Computing Fibonacci numbers on a Turing Machine'', (2003).

★ (no author given), ''Fibonacci Numbers Information'', (undated, 2005 or earlier).

★ Fibonacci Numbers and the Golden Section – Ron Knott's Surrey University multimedia web site on the Fibonacci numbers, the Golden section and the Golden string.

★ The Fibonacci Association incorporated in 1963, focuses on Fibonacci numbers and related mathematics, emphasizing new results, research proposals, challenging problems, and new proofs of old ideas.

★ Dawson Merrill's Fib-Phi link page.

★ Fibonacci primes

★ The One Millionth Fibonacci Number

★ Source code for calculating the Fibonacci sequence in many programming languages.

★ The Ten Millionth Fibonacci Number

★ Manolis Lourakis, Fibonaccian search in C

★ Scientists find clues to the formation of Fibonacci spirals in nature

★ Fibonacci Numbers at Convergence