Fibonacci Sequence and The Golden Ratio

Download as pdf or txt
Download as pdf or txt
You are on page 1of 19

Part 1:

Fibonacci Sequence
Mathematics in the Modern World
Leonardo De Bigollo Pissano
An Italian mathematician, developed the
Fibonacci numbers and the Fibonacci
sequence. He is very known as number
theorist

Published Works:
Liber Abaci (The Book of
Calculation), 1202 and 1228
Pratica Geometriae (The Practice of
1170 – 240 or 250 Geometry), 1220
Liber Quadratorum (The Book of
Square Numbers), 1225
Liber Abaci
"A certain man put a pair of rabbits in a place surrounded on
all sides by a wall. How many pairs of rabbits can be
produced from that pair in a year if it is supposed that every
month each pair begets a new pair, which from the second
month on becomes productive?"
Fibonacci Sequence

The Fibonacci sequence, also known as Fibonacci numbers,


is defined as the sequence of numbers in which each
number in the sequence is equal to the sum of two numbers
before it. The Fibonacci Sequence is given as:

Fibonacci Sequence
0, 1, 1, 2, 3, 5, 8, 13, 21, ….
Fibonacci Sequence Formula
The Fibonacci sequence numbers, 𝐹𝑛 is defined using the
recursive relation with the seed values 𝐹0 = 0, 𝐹1 = 1 and
𝐹2 = 1, …

𝐹𝑛 = 𝐹𝑛−1 + 𝐹𝑛−2 (the recursive rule)


Fibonacci Sequence Formula
The recursive rule
𝐹𝑛 = 𝐹𝑛−1 + 𝐹𝑛−2

In computing the Fibonacci numbers using a recursive rules


takes an a lot time, since it can result to a very large numbers.

Jacques Binet a mathematician and astronomer created the


formula called Binet’s Formula
Binet’s Formula
𝑁 𝑁
1 1+ 5 1− 5
𝐹𝑁 = −
5 2 2

A quite complicated right!

This formula allows us to calculate a Fibonacci


number without needing to calculate any of the
preceding Fibonacci numbers.
Fibonacci Numbers in Nature
Fibonacci Numbers in Nature
Fibonacci Numbers in Nature
Part 2:
The Golden Ratio
Mathematics in the Modern World
The Divine Proportion

The Golden Ratio


1+ 5
𝜑=
2

𝜑 = 1.618
The Golden Property
Find a number such that when
you add 1 to it you get a square
of a number

The problem can be translated as;


x2 = x + 1, using quadratic formula

1± 5
𝑥=
2
Fibonacci and the Golden Property

We will use the Golden Property


𝜑2 = 𝜑 + 1

If we multiply 𝜑 2 = 𝜑 + 1 by 𝜑 to both sides


𝜑(𝜑2 = 𝜑 + 1)
𝜑3 = 𝜑2 + 𝜑
Since 𝜑2 = 𝜑 + 1 we can replace
𝜑 3 = 𝜑 + 1 + 𝜑 or 𝜑3 = 2𝜑 + 𝜑

Repeat the same pattern, we can derive the “Powers of


the Golden Ratio”
Powers of the Golden Ratio

𝜑𝑁 = 𝐹𝑁𝜑 + 𝐹𝑁−1

𝜑 = 1.618
Ratios of Consecutive Fibonacci Numbers

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …

𝑭𝑵 𝑭𝑵−𝟏 𝑭𝑵 𝑭𝑵 𝑭𝑵−𝟏 𝑭𝑵
ൗ𝑭 ൗ𝑭
𝑵−𝟏 𝑵−𝟏

1 1 1/1 = 1 21 13 21/13 = 1.615


2 1 2/1 = 2 34 21 34/21 = 1.619
3 2 3/2 = 1.5 55 34 55/34 = 1.617
5 3 5/3 = 1.666… 89 55 89/55 = 1.61818…

8 5 8/5 = 1.6 144 89 144/89 = 1.617

13 8 13/8 = 1.625 233 144 233/144 = 1.61805


The table shows an interesting pattern: As N gets bigger, the ratio of
𝑭
consecutive Fibonacci numbers 𝑵ൗ𝑭𝑵−𝟏 , appears to settle down to a
fixed value and that fixed value turns out to be the Golden Ratio

Ratio of Consecutive Fibonacci


Numbers

𝑭𝑵
ൗ𝑭 = 𝝋
𝑵−𝟏
Thank you!
References
1. Mathematical Excursions by Aufmann, Clegg, Lockwood and Nation

2. Miller, Charles et al (2012). Mathematical Ideas (12thedition)


Pearson Education Inc.

3. Tannenbaum, Peter (2007) Excursions in Mathematics (8thedition).


Pearson Education Inc.

4. Parks, Harold et al (2007) Park’s et al’s: A Mathematical View of the


World. Thomson Brooks/Cole.

You might also like