# Fibonacci Formula

The series where adding the previous two terms in generated, that series is called a fibonacci series. The first and second term of the Fibonacci series are set as 0 and 1. It continues till infinity. The formula is used to generate fibonacci in a recursive formula. Observe the following Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34….

The Fibonacci Formula is given as,

$\large F_{n}=F_{n-1}+F_{n-2}$

### Solved Examples

Question 1: Find the next number in the fibonacci series 0, 1, 1, 2, 3, 5, 8, 13,…… ?

Solution:

The fibonacci formula is given as,

Fn = Fn-1 + Fn-2
F9 = F8 + F7
F9 = 13 + 8
F9 = 21

#### Practise This Question

How many diagonals can the following figure have?