Python Program for n-th Fibonacci number
In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation
Fn = Fn-1 + Fn-2
With seed values
F0 = 0 and F1 = 1.
Method 1 ( Use recursion ) :
Method 2 ( Use Dynamic Programming ) :
Method 3 ( Use Dynamic Programming with Space Optimization) :
Method 4 ( Using Arrays ) :
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144]
As we know that the Fibonacci series is the sum of the previous two terms, so if we enter 12 as the input in the program, so we should get 144 as the output. And that is what is the result.
Method 5 ( Using Direct Formula ) :
The formula for finding the n-th Fibonacci number is as follows:
144 is 12th fibonacci number
Please refer complete article on Program for Fibonacci numbers for more details!