0% found this document useful (0 votes)
98 views3 pages

Understanding Fibonacci Numbers and Sequence

The document discusses the Fibonacci sequence, which is a series of numbers where each subsequent number is the sum of the previous two. It provides examples of how the sequence appears in nature like flower petals and describes how the sequence is calculated. The document also introduces Binet's formula, which can be used to find any number in the Fibonacci sequence.

Uploaded by

Kc Paña Yacon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
98 views3 pages

Understanding Fibonacci Numbers and Sequence

The document discusses the Fibonacci sequence, which is a series of numbers where each subsequent number is the sum of the previous two. It provides examples of how the sequence appears in nature like flower petals and describes how the sequence is calculated. The document also introduces Binet's formula, which can be used to find any number in the Fibonacci sequence.

Uploaded by

Kc Paña Yacon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Fibonacci Numbers

Fibonacci sequence is one of the most famous formulas in mathematics. It observed numbers
in nature. His most popular contribution perhaps is the number that is seen in the petals of flowers. A
calla lily flower has only 1 petal, trillium has 3, hibiscus has 5, cosmos flower has 8, corn marigold has
13, some asters have 21, and a daisy can have 34,55, or 89 petals. Surprisingly, these petals count
represent the first eleven numbers of the Fibonacci sequence. Not all petal numbers of flowers,
however, follows this pattern discovered by Fibonacci. Some examples include the Brassicaceae
family having four petals. Astoundingly, many of the flowers abide by the pattern observed by
Fibonacci.

Fibonacci rabbit problems in the end of this lesson is not a realistic model of population growth
of rabbits but is a very good example of a mathematical problem solved using patterns. It is
interesting to note also that the famous rabbit problem paved the way to the discovery of a
phenomenal sequence of numbers known as the Fibonacci Sequence.

Leonardo Pisano Fibonacci also known as Leonardo of Pisa is an Italian mathematician and
was born in Pisa, Italy on around 1170 A.D., who introduces the sequence with a problem involving
rabbits in the 13th century. He started with a male and a female rabbit. After a month, they mature
and produce a litter with another male and female rabbit. A month later, those rabbits reproduce and
out comes another male and female, who also can mate after a month. After a year, how many
rabbits would you have? the formula used to get to that answer is what's now known as the Fibonacci
sequence.

Sequence is an ordered list of numbers, called terms, that may have repeated values. The
arrangement of these terms is set by a definite rule. The terms of a sequence could be generated by
applying the rule to the previous term of the sequence.

Fibonacci Sequence is formed by adding the preceding two numbers, beginning with 0 and 1.
ratios of two Fibonacci numbers approximate the golden ratio, which is considered as the most
aesthetically pleasing proportion.

The principle behind the Fibonacci numbers is as follows:

 Let F n be the nth integer in the Fibonacci sequence, the next (n +1) th term F n+1 is
determined by adding nth and the (n-1) th integer.
 Consider the first few terms below: Let F1 = 1 be the first term, and F2 = 1 be the second
term, the third term F3 is found by F3 = F1 + F2 = 1 + 1 = 2.
 The fourth term F 4 is 2 + 1 =3, the sum of the second and the third term.
 To find the new nth Fibonacci number, simply add the two numbers immediately
preceding this nth number.

n= 3 : F 3 = 1 + 1 = 2 n= 7 : F 7 = 5 + 8 = 13

n= 4 : F4 = 1 + 2 = 3 n= 8 : F8 = 8 + 13 = 21
n= 5: F 5 = 2 + 3 = 5 n= 9 : F9 = 13 + 21 = 34

n= 6 : F 6 = 3 + 5 = 8

from this pattern, we conjecture that F n = F n-1 +F n-2 for n ≥ 3, Fibonacci discovered that a
Fibonacci number can be found by adding its previous two Fibonacci number.

F1 = 1, F2 = 1 and Fn = F n-1 + F n-2 , for n ≥ 3

Example 1: Using the definition of Fibonacci numbers find the eight and tenth Fibonacci
number.

Solution: the eight Fibonacci number is the sum of the two previous Fibonacci number. Thus,

F8=F7+F6

= (F6 +F5) + F6

= (8 + 5) +8

= 13 + 8

= 21

The tenth Fibonacci number is the sum of the two previous Fibonacci number in an ordered
sequence. Thus,

F 10 = F 9 + F 8

= (F8 +F7) + F8

= (21 + 13) + 21

= 34 + 21

= 55

It is easy to find the nth Fibonacci number F n if the two previous number, F n-1 and F n-2 are
known. Suppose we want find F 20 using the definition, it is tedious and time consuming to compute F
19 and F 18 to determine F 20 . Fortunately, Jacques Binet in 1543 was able to find a formula for the
nth Fibonacci number.

Binet’s Formula:

Example 2: Use Binet formula and a calculator to find the 20th and 50th Fibonacci number.
Solution:

Fn = (1 + √ 5 / 2) n – (1-√ 5 / 2) n / √ 5

F 20 = (1 + √ 5 / 2) 20 – (1-√ 5 / 2) 20

= 6765

Fn = (1 + √ 5 / 2) n – (1-√ 5 / 2) n / √ 5

F 50 = (1 + √ 5 / 2) 50 – (1-√ 5 / 2) 50

= 12,586,269,020

You might also like