Fibonacci
Sequence
Fibonacci
Sequence
Sum of two preceding
number.
Expressed as: F(n) = +
n 1 2 3 4 5 6
1 1 2 3
The Golden Ratio is a special number which is
approximately equal to 1.618034 and may be used to find
the nth term of a Fibonacci Sequence using the Binet’s
Formula.
where n= no. of term missing
Example: What is the 15th term of the Fibonacci
Sequence?
Find the 20th term using Fibonacci
Sequence Binet’s Formula
Find the 23rd term using Fibonacci
Sequence Binet’s Formula
28657
Find the 22nd term using Fibonacci Sequence
Binet’s Formula
What is the 17th term of the Fibonacci
Sequence?
A sequence may be finite or infinite. The Fibonacci sequence
is an infinite sequence. A finite sequence has a definite number
of terms. A list of numbers which form a pattern is called a
sequence. Number patterns may be described by examining
how the terms are being generated.
A pattern may have a list of numbers in which a constant
number is added to get the succeeding terms. For other
sequences, the terms are increasing because the number to be
added is increasing in a predictable way. There are number
patterns whose terms are decreasing, because the number to
be added is decreasing in an expected way.
To generate the next term, the number to be
Example
added is
Repeating 10, 20, 30, 40, 50, 60, …
Growing/increasing 14, 15, 17, 20, 24, 29, …
shrinking 118, 98, 73, 43, 8, -32, …