Lesson 1 Jelly Ann S. Casuncad MMW Module
Lesson 1 Jelly Ann S. Casuncad MMW Module
Lesson 1 Jelly Ann S. Casuncad MMW Module
A tiling with squares whose side lengths are successive Fibonacci numbers: 1, 1, 2, 3, 5, 8, 13
and 21.
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. 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 that there is an entire
journal dedicated to their study, the Fibonacci Quarterly. Applications of Fibonacci numbers
include computer algorithms 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, an uncurling
fern, and the arrangement of a pine cone's bracts.
Fibonacci numbers are also strongly related to the golden ratio: Binet's formula expresses the nth
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.
HISTORY OF FIBONACCI SEQUENCE
The Fibonacci sequence appears in Indian mathematics, in connection with Sanskrit prosody. 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.
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 Fm cases and one [L] to the Fm−1 cases. Bharata Muni also expresses
knowledge of the sequence in the Natya Shastra (c. 100 BC–c. 350 AD).However, the clearest
exposition of the sequence arises in the work of Virahanka (c. 700 AD), whose own work is lost,
but is available in a quotation by Gopala .
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].
Hemachandra (c. 1150) is credited with knowledge of the sequence as well, writing that "the sum
of the last and the one before the last is the number ... of the next mātrā-vṛtta."
The Fibonacci sequence first appears in the book Liber Abaci (The Book of Calculation, 1202)
by Fibonacci where it is used to calculate the growth of rabbit populations.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 nth 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 nth month is the nth Fibonacci number.
The name "Fibonacci sequence" was first used by the 19th-century number theorist Édouard
Lucas.
PROBLEM EXERCISES