Scribd
Upload
1K views4 pages

The Fibonacci Sequence: Ge 104 - Mathematics in The Modern World

The document discusses the Fibonacci sequence, which was discovered by Leonardo of Pisa (Fibonacci) in his 1202 book Liber Abaci. The sequence arises from a rabbit breeding problem posed by Fibonacci, where each month a new pair of rabbits is born to each existing pair. The number of pairs in each subsequent month is the sum of the previous two months. This recursive pattern results in the Fibonacci sequence 1, 1, 2, 3, 5, 8, etc. The ratio of adjacent terms approaches the golden ratio, around 1.618. Examples are provided to calculate Fibonacci numbers and sums using the recursive definition.

Uploaded by

Khem Buenavides
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1K views4 pages

The Fibonacci Sequence: Ge 104 - Mathematics in The Modern World

The document discusses the Fibonacci sequence, which was discovered by Leonardo of Pisa (Fibonacci) in his 1202 book Liber Abaci. The sequence arises from a rabbit breeding problem posed by Fibonacci, where each month a new pair of rabbits is born to each existing pair. The number of pairs in each subsequent month is the sum of the previous two months. This recursive pattern results in the Fibonacci sequence 1, 1, 2, 3, 5, 8, etc. The ratio of adjacent terms approaches the golden ratio, around 1.618. Examples are provided to calculate Fibonacci numbers and sums using the recursive definition.

Uploaded by

Khem Buenavides
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

GE 104 – MATHEMATICS IN THE MODERN WORLD

MODULE 2
THE FIBONACCI SEQUENCE

Learning Objectives:
At the end of this module, the students should be able to:
 illustrate and calculate the Fibonacci sequence
 distinguish the Golden Ratio

Discussion

Leonardo of Pisa, also known as Fibonacci (c. 1170-1250), is one of the best known
mathematicians of the medieval Europe. In 1202, after a trip that took him to several Arab
and Eastern countries, Fibonacci wrote the book Liber Abaci. In this book, Fibonacci
explained why the Hindu-Arabic numeration system that he had learned about during his
travels was a more sophisticated and efficient system than the Roman numeration system.
This book also contains a problem created by Fibonacci that concerns the birth rate of
rabbits. Here is a statement of Fibonacci’s rabbit problem.
At the beginning of a month, you are given a pair of newborn rabbits. After a month
the rabbits have produced no offspring; however, every month thereafter, the pair of
rabbits produces another pair of rabbits. The offspring reproduce in exactly the same
manner. If none of the rabbits dies, how many pairs of rabbits will there be at the start of
each succeeding month?
The solution of this problem is a sequence of numbers that we now call the
Fibonacci sequence. The following figure shows the numbers of pairs of rabbits on the first
day of each of the first six months. The larger rabbits represent mature rabbits that produce
another pair of rabbits each month. The numbers in the blue region—1, 1, 2, 3, 5, 8—are the
first six terms of the Fibonacci sequence.

The Fibonacci Sequence Page 1


GE 104 – MATHEMATICS IN THE MODERN WORLD

Fibonacci discovered that the number of pairs of rabbits for any month after the first
two months can be determined by adding the numbers of pairs of rabbits in each of the two
previous months. For instance, the number of pairs of rabbits at the start of the sixth month
is 3 + 5 = 8.
A recursive definition for a sequence is one in which each successive term of the sequence
is defined by using some of the preceding terms. If we use the mathematical notation Fn to
represent the nth Fibonacci number, then the numbers in the Fibonacci sequence are given
by the following recursive definition.

The Fibonacci Numbers


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

Fibonacci sequence has many interesting properties. Among these is that this
pattern is very visible in nature. Some of nature’s most beautiful patterns, like the spiral
arrangement of sunflower seeds, the number of petals in a flower, and the shape of a snail’s
shell. It is also interesting to note that the ratios of successive Fibonacci numbers approach
the number φ (Phi), also known as the Golden Ratio. This is approximately equal to 1.618.

The Golden Ratio can also be expressed as the ratio between two numbers, if the
latter is also the ratio between the sum and the larger of the two numbers. Geometrically, it
can also be visualized as a rectangle perfectly formed by a square and another rectangle,
which can be repeated infinitely inside each section.

The Fibonacci Sequence Page 2


GE 104 – MATHEMATICS IN THE MODERN WORLD

EXAMPLE 1. Find a Fibonacci Number

Use the definition of Fibonacci numbers to find the seventh and eighth Fibonacci
numbers.

Solution:
The first six Fibonacci numbers are 1, 1, 2, 3, 5, and 8. The seventh Fibonacci is the sum of
two previous Fibonacci numbers. Thus,

Fn = Fn-1 + Fn-2 The eighth Fibonacci number is

F7 = F7-1 + F7-2 F8 = F7 + F6

F7 = F 6 + F5 F8 = 13 + 8 = 21

F7 = 8 + 5 = 13

CHECK YOUR PROGRESS 1.

Use the definition of Fibonacci numbers to find the ninth Fibonacci number.

The Fibonacci Sequence Page 3


GE 104 – MATHEMATICS IN THE MODERN WORLD

SELF-CHECK: Solve the following problems and show the solutions.

Let Fib(n) be the nth term of the Fibonacci sequence, with Fib(1) = 1, Fib(2) = 1,
Fib(3) = 2, and so on.

1. Find Fib (8)

2. Find Fib (19)

3. If Fib (22) = 17,711 and Fib (24) = 46,368, what is Fib (23)?

4. Evaluate the following sum:

a. Fib (1) + Fib (2) = _____

b. Fib (1) + Fib (2) + Fib (3) = _____

c. Fib (1) + Fib (2) + Fib (3) + Fib (4) = _____

REFERENCES:

Aufmann, R, J. Lockwood, R. Nation, D. Clegg and S. Epp.2018.Mathematics in the Modern


World. Rex Book Store, Inc.

The Fibonacci Sequence Page 4

You might also like