Fibonacci Sequence

Fibonacci Sequence
The Fibonacci sequence was first found by an Italian named Leonardo Pisano Bogollo
(Fibonacci). Fibonacci numbers are a sequence of whole numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,
... This infinite sequence is called the Fibonacci sequence. Here each term is the sum of the two
preceding ones, starting from 0 and 1. This has been termed "nature's secret code".
We can spot the Fibonacci sequence in the spiral patterns of sunflowers, daisies, broccoli,
cauliflowers, and seashells.

What is Fibonacci Sequence?

The Fibonacci sequence, in simple terms, says that every number in the Fibonacci sequence
is the sum of two numbers preceding it in the sequence.
The first 20 Fibonacci numbers are given as follows:

F0 = 0 F10 = 55

F1 = 1 F11 = 89

F2 = 1 F12 = 144

F3 = 2 F13 = 233

F4 = 3 F14 = 377

F5 = 5 F15 = 610

F6 = 8 F16 = 987

F7 = 13 F17 = 1597
 F8 = 21 F18 = 2584

F9 = 34 F19 = 4181

Fibonacci Spiral
The Fibonacci sequence is represented as the spiral shown below. The spiral

represents the pattern of the Fibonacci numbers. This spiral starts with a rectangle whose

length and width form the golden ratio(≈1.618). This rectangle is partitioned into two squares.

Then the squares are further partitioned. Connecting the corners of the boxes, the spiral is drawn

inside these squares. The larger the numbers in the Fibonacci sequence, the ratio becomes closer

to the golden ratio.

The puzzle of rabbits explains the wonder behind this Fibonacci sequence.

● Two newborn rabbits are left in the field. They are still one pair at the end of

the first month.

● They mate and produce a new pair, so there are 2 pairs in the field, at the

end of the second month.

● The first pair produces the second pair, but the second pair is left without

breeding, so 3 pairs in all at the end of the third month.

● The original pair produces another pair, the second pair produces their first

pair and the third pair remains without breeding, making 5 pairs.
 th
● The sequence continues in this pattern and at the end of the n month, the

number of rabbits in the field is equal to the sum of the number of mature

th th
pairs (n-2) month and the number of pairs alive last month(n-1) month.

th
This happens to be the n Fibonacci number.

Fibonacci Sequence Formula

The Fibonacci sequence formula for “Fn” is defined using the recursive formula by

setting F0 = 0, F1= 1, and using the formula below to find Fn. The Fibonacci formula is

given as follows.

Fn = Fn-1 + Fn-2, where n > 1

Note that F0 is termed as the first term here (but NOT F1).

Golden Ratio to Calculate Fibonacci Numbers

The Fibonacci Sequence is closely related to the value of the Golden Ratio. We know that the Golden

Ratio value is approximately equal to 1.618034. It is denoted by the symbol “φ”. If we take the ratio

of two successive Fibonacci numbers, the ratio is close to the Golden ratio. For example, 3 and 5 are

the two successive Fibonacci numbers. The ratio of 5 and 3 is:

5/3 = 1.6666
Take another pair of numbers, say 21 and 34, the ratio of 34 and 21 is:

34/21 = 1.619

It means that if the pair of Fibonacci numbers are of bigger value, then the ratio is very close to the

Golden Ratio.

So, with the help of Golden Ratio, we can find the Fibonacci numbers in the sequence.

The formula to calculate the Fibonacci numbers using the Golden Ratio is:

Xn = [φn – (1-φ)n]/√5

Where,

φ is the Golden Ratio, which is approximately equal to the value of 1.618

n is the nth term of the Fibonacci sequence.

Fibonacci Sequence Properties

The interesting properties of the Fibonacci sequence are as follows:

1) Fibonacci numbers are related to the golden ratio. Any Fibonacci number can be

n n
calculated using the golden ratio, Fn =(Φ - (1-Φ) )/√5, Here φ is the golden ratio and Φ ≈

1.618034.

th 7 7
To find the 7 term, we apply F7 = [(1.618034) - (1-1.618034) ] / √5 = 13

2) The ratio of successive Fibonacci numbers is called the "golden ratio". Let A and B

be the two consecutive numbers in the Fibonacci sequence. Then B/A converges to the

Golden ratio. to find any term in the Fibonacci sequence, we could apply the above-said

formula.
 A B A/B

2 3 1.5

3 5 1.6

5 8 1.6

8 13 1.625

144 233 1.618055555555556

233 377 1.618025751072961

Just by multiplying the previous Fibonacci Number by the golden ratio (1.618034), we

get the approximated Fibonacci number. For example, 13 is a number in the sequence,

and 13 × 1.618034... = 21.034442. This gives the next Fibonacci number 21 after 13 in

the sequence.

th
2) Every n number is a multiple of n. Observe the sequence to find another interesting

pattern. Every 3rd number in the sequence is a multiple of 2. Every 4th number in the

sequence is a multiple of 3 and every 5th number is a multiple of 5.

n+1
3) The Fibonacci sequence works below zero too. We write F-n = (-1) Fn. For

5
example, F-4 = (-1) . F4 = (-1) 3 = -3.

n
4) The sum of n terms of Fibonacci Sequence is given by Σi=0 Fi = Fn+2 - F2 (or)

th
Fn+2 - 1, where Fn is the n Fibonacci number. (Note: the first term starts from F0)
 th
For example, the sum of first 10 terms of sequence = 12 term - 1 = 89 - 1 = 88. It can

9
be mathematically written as Σi=0 Fi = F11 - 1 = 89 - 1 = 88.

Applications of Fibonacci Sequence

The Fibonacci sequence can be found in a varied number of fields from nature, to

music, and to the human body.

● used in the grouping of numbers and the brilliant proportion in music

generally.

● used in Coding (computer algorithms, interconnecting parallel, and distributed

systems)

● in numerous fields of science including high energy physical science,

quantum mechanics, Cryptography, etc.