02/06/2024, 06:51 Fibonacci sequence - Wikipedia
Fibonacci sequence
In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding
ones. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, commonly denoted
Fn . The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or
sometimes (as did Fibonacci) from 1 and 2. Starting from 0 and 1, the sequence begins[1]
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ....
The Fibonacci numbers were first described in Indian mathematics as early
as 200 BC in work by Pingala on enumerating possible patterns of Sanskrit
poetry formed from syllables of two lengths.[2][3][4] They are named after
the Italian mathematician Leonardo of Pisa, also known as Fibonacci, who
introduced the sequence to Western European mathematics in his 1202
book Liber Abaci.[5]
Fibonacci numbers appear unexpectedly often in mathematics, so much so A tiling with squares whose side
that there is an entire journal dedicated to their study, the Fibonacci lengths are successive Fibonacci
Quarterly. Applications of Fibonacci numbers include computer algorithms numbers: 1, 1, 2, 3, 5, 8, 13 and 21
such as the Fibonacci search technique and the Fibonacci heap data
structure, and graphs called Fibonacci cubes used for interconnecting
parallel and distributed systems. They also appear in biological settings, such as branching in trees, the
arrangement of leaves on a stem, the fruit sprouts of a pineapple, the flowering of an artichoke, and the
arrangement of a pine cone's bracts, though they do not occur in all species.
Fibonacci numbers are also strongly related to the golden ratio: Binet's formula expresses the n-th Fibonacci
number in terms of n and the golden ratio, and implies that the ratio of two consecutive Fibonacci numbers
tends to the golden ratio as n increases. Fibonacci numbers are also closely related to Lucas numbers, which
obey the same recurrence relation and with the Fibonacci numbers form a complementary pair of Lucas
sequences.
Definition
The Fibonacci numbers may be defined by the recurrence relation[6]
and
for n > 1.
The Fibonacci spiral: an
Under some older definitions, the value is omitted, so that the approximation of the golden spiral
created by drawing circular arcs
sequence starts with and the recurrence
connecting the opposite corners of
is valid for n > 2.[7][8] squares in the Fibonacci tiling (see
preceding image)
The first 20 Fibonacci numbers Fn are:[1]
https://en.wikipedia.org/wiki/Fibonacci_sequence 1/27
02/06/2024, 06:51 Fibonacci sequence - Wikipedia
F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15 F16 F17 F18 F19
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181
History
India
The Fibonacci sequence appears in Indian mathematics, in connection with
Sanskrit prosody.[3][9][10] In the Sanskrit poetic tradition, there was interest
in enumerating all patterns of long (L) syllables of 2 units duration,
juxtaposed with short (S) syllables of 1 unit duration. Counting the different
patterns of successive L and S with a given total duration results in the
Fibonacci numbers: the number of patterns of duration m units is Fm+1.[4]
Knowledge of the Fibonacci sequence was expressed as early as Pingala
(c. 450 BC–200 BC). Singh cites Pingala's cryptic formula misrau cha ("the
two are mixed") and scholars who interpret it in context as saying that the
number of patterns for m beats (Fm+1) is obtained by adding one [S] to the
Thirteen (F7) ways of arranging long
Fm cases and one [L] to the Fm−1 cases.[11] Bharata Muni also expresses
and short syllables in a cadence of
knowledge of the sequence in the Natya Shastra (c. 100 BC– length six. Eight (F6) end with a
c. 350 AD).[12][2] However, the clearest exposition of the sequence arises in short syllable and five (F5) end with
the work of Virahanka (c. 700 AD), whose own work is lost, but is available a long syllable.
in a quotation by Gopala (c. 1135):[10]
Variations of two earlier meters [is the variation] ... For example, for [a meter of length] four,
variations of meters of two [and] three being mixed, five happens. [works out examples 8, 13, 21] ...
In this way, the process should be followed in all mātrā-vṛttas [prosodic combinations].[a]
Hemachandra (c. 1150) is credited with knowledge of the sequence as well,[2] writing that "the sum of the last
and the one before the last is the number ... of the next mātrā-vṛtta."[14][15]
Europe
The Fibonacci sequence first appears in the book Liber Abaci (The Book of Calculation, 1202) by
Fibonacci[16][17] where it is used to calculate the growth of rabbit populations.[18][19] Fibonacci considers the
growth of an idealized (biologically unrealistic) rabbit population, assuming that: a newly born breeding pair of
rabbits are put in a field; each breeding pair mates at the age of one month, and at the end of their second
month they always produce another pair of rabbits; and rabbits never die, but continue breeding forever.
Fibonacci posed the puzzle: how many pairs will there be in one year?
At the end of the first month, they mate, but there is still only 1 pair.
At the end of the second month they produce a new pair, so there are 2 pairs in the field.
At the end of the third month, the original pair produce a second pair, but the second pair only mate to
gestate for a month, so there are 3 pairs in all.
At the end of the fourth month, the original pair has produced yet another new pair, and the pair born two
months ago also produces their first pair, making 5 pairs.
At the end of the n-th month, the number of pairs of rabbits is equal to the number of mature pairs (that is, the
number of pairs in month n – 2) plus the number of pairs alive last month (month n – 1). The number in the n-
th month is the n-th Fibonacci number.[20]
The name "Fibonacci sequence" was first used by the 19th-century number theorist Édouard Lucas.[21]
https://en.wikipedia.org/wiki/Fibonacci_sequence 2/27
