
Content Curator
Fibonacci series is named after Italian mathematician Leonardo Pisano Bigollo. Fibonacci numbers are represented in a series of numbers in which a number is the addition of the previous two numbers. This series of numbers start with 0 and 1. For example, let the first numbers be 0 and 1. So, the third number will be the sum of two numbers i.e 1 and so on. The recurrence relation of Fibonacci number series if given by xn+2 = xn + xn+1. The Fibonacci sequence is given by 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 ………. ∞.
Read Also: Isosceles Triangle theorems
| Table of Content |
Fibonacci Numbers
[Click Here for Sample Questions]
Fibonacci series formula in mathematics is used to find the missing terms in a Fibonacci number sequence. The formula to find the series can be used to express the (n+1)th term in the sequence which is defined using the recursive formula, such that F0 = 0, F1 = 1 to give Fn.
The formula is given as follows -
Fn = Fn-1 + Fn-2
where n should be greater than 1.
Also Read:
Properties of Fibonacci Numbers
[Click Here for Sample Questions]
- In Fibonacci series, if we take any three consecutive numbers from the series and add them, then we divide the result by 2, we will get the third number.
- In Fibonacci series, if we take four consecutive numbers excluding 0, we multiply the outer number and the inner number. When we subtract these numbers, then the difference will always be equal to 1.
- The numbers in the Fibonacci series are related to the golden ratio. We can calculate any number of fibonacci series using the formula,
Fn = \(\phi\)n - (1-\(\phi\))n / √5
where \(\phi\) is the golden ratio.
-
For finding 2 consecutive numbers of the series given as Fn+1 = Fn, the value of \(\phi\) can be calculated as limn->infinity Fn+1 / Fn.
Also Check:
Fibonacci Series and Golden Ratio
[Click Here for Sample Questions]
In mathematics, there is a close connection between the Fibonacci series and golden ratio. Any number of a Fibonacci series can be calculated using the below formula -
Fn = \(\phi\)n - (1-\(\phi\))n / √5
where ? is the golden ratio.
Golden ratio is expressed in terms of Fibonacci series as the limit of ratios of successive terms of Fibonacci series (or any other Fibonacci like sequence) as represented by Kepler in the given expression.
φ = limn->infinity Fn+1 / Fn
In simple words, we can say that if any number of a Fibonacci number is divided by its immediate predecessor in the given series, the quotient is approximately given by φ. As the value of n increases, the approximate value also increases i.e as n tends to infinity.
There are various operations of golden ratio in the field of architecture. For example, The Great Pyramid of Egypt and the Great Mosque of Kairouan are architectural miracles in which there is an involvement of the golden ratio concept.
Read More:
Fibonacci Series and Pascal’s Triangle
[Click Here for Sample Questions]
Using Pascal’s Triangle, there is an interesting method to find numbers in a Fibonacci series. A Pascal’s triangle in mathematics is a triangular array which consists of binomial coefficients. Fibonacci numbers can be represented by calculating the sum of elements on rising diagonal lines in Pascal’s triangle in the Fibonacci series. We can observe in the figure that considering the first element in the Fibonacci series as ‘0’, the following terms can be calculated by adding the diagonal elements as shown.
Things to Remember
[Click Here for Sample Questions]
- Fibonacci numbers are used in various fields of science like quantum mechanics, Cryptography etc.
- Fibonacci retracement levels are widely used in technical analysis in financial market trading.
- They are used in Coding fundamentals (Computer algorithms, distributed systems etc). For example, They are applied in the computational run-time analysis of Euclid’s Algorithm, and for determining the GCF of two integral values.
- They are used in the grouping and arrangement of numbers and used to study other different special mathematical sequences.
- Fibonacci series is important because of its relationship with the golden ratio and Pascal’s triangle.
- The series of Fibonacci numbers also applies to numbers below zero.
- From a financial perspective, the concept of Fibonacci numbers is applicable for whole numbers and decimal numbers.
Read More:
Sample Questions
Ques. Find the 10th term of the fibonacci series if the 8th and 9th terms are 13 and 21. (2 Marks)
Ans. Using the Fibonacci series recursive formula, the 10th term is the sum of 8th and 9th terms.
10th term = 8th term + 9th term
10th term = 13 + 21
10th term = 34
Ques. Using the fibonacci series formula, find the value of the 21st and 22nd term of fibonacci series given that the 19th and 20th terms are 2584 and 4181. (2 Marks)
Ans. Using the fibonacci formula, we can say that the 21th term is the sum of the 19th and 20th term.
21st term = 19th term + 20th term = 2584 + 4181 = 6765
Now, 22nd term = 20th term + 21st term = 6765 + 4181 = 10946
Ques. What are the examples of fibonacci series in nature and its uses? (3 Marks)
Ans. The fibonacci series can be seen in biological settings around us in different forms. It can be found in spirals in petals of some flowers such as in flower heads of sunflowers. It can also be found in branches of trees.
Fibonacci series have various applications in our day-to-day lives. They are used to study patterns of numbers and data in mathematical analysis in various fields.
Ques. Calculate the sum of the first 15 fibonacci numbers in the series. (2 Marks)
Ans. As from the series, the first 15 fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377.
Then to find the sum, we have to add all these numbers in the given sequence.
0 + 1 + 1 + 2 + 3 + 5 + 8 + 13 + 21 + 34 + 55 + 89 + 144 + 233 + 377
= 986
Ques. Find a fibonacci number when n = 4 using recursive relation. (3 Marks)
Ans. As we know the formula for fibonacci number,
Fn = Fn-1 + Fn-2
Where Fn is nth term
Fn-1 is (n-1)th term
Fn-2 is (n-2)th term
Since the first and second terms are 0 and 1, so F0 = 0, F1 = 1.
Hence third term is F2 = F0 + F1 = 0 + 1 = 1
Fourth term is F3 = F2 + F1 = 1 + 1 = 2
Fifth term is Fzw = F3 + F2 = 1 + 2 = 3
So, 3 is the fibonacci number when n = 4 using recurrence relation
Ques. Find the fibonacci number using the golden ratio when n = 6. (3 Marks)
Ans. The formula to calculate fibonacci number using golden ratio is
Fn = \(\phi\)n - (1-\(\phi\))n / √5
In which \(\phi\) is golden ratio whose value is approximately equal to 1.618 n where n is nth term of the series.
In the question, n = 6 given
Substituting both values in the equation we get,
F6 = 1.6186 - (1-1.618)6 / √5
F6 = 17.942 - (0.618)6 / √5
F6 = 17.942 - 0.056 / 2.236
F6 = 17.886 / 2.236
F6 = 7.999
F6 = 8 (rounded value)
So, the fibonacci number is 8 when n = 6.
Ques. Find the sum of GP.: 1, 2,4,8, ... up to the 10th term. (2 Marks)
Ans. Using the formula for summation of n terms of a GP:
Sn = a(rn-¹)/(r-1)
Putting the value of a=1, r =2 , n=10
We get the solution :
2¹0 - 1
Ques. Find the sum of an infinite GP 3,1,1/3,….? (2 Marks)
Ans. The sum of an infinite GP is given by,
Sn = a / 1 - r
a = 3, r=1/3.
Putting the values in the equation :
3 / (1-1/3)= 9/2
Mathematics Related Links:






Comments