How to make Fibonacci Series using recursion in Python.
Fibonacci Series Q) What is a Fibonacci Series ? 0 1 1 2 3 5 8 13 21 34.... Explanation - the 2 is found by adding the two numbers before it (1+1) the 3 is found by adding the two numbers before it (1+2), the 5 is (2+3), and so on! If you are interested to see the longer list - 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, ... Question - Given a number n, print n-th Fibonacci Number ? Explanation - We have to solve it through recursion. The program will start from Line no. 9 , it will take an input n (integer). (Let's take n= 5) Then the cursor will move to Line no. 10 for loop i.e for i in range ( 1,6 ). Loop will run 5 times storing value 1 2 3 4 5 in consecutive loop. First, it will store value 1 i.e. i=1, and when we print(fb(1)), the cursor will move to Line No. 1 ( where our function define). Then it will move to condit...