C Program to Fibonacci Sequence

A series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc.

Leonardo Bonacci (c. 1170 – c. 1250)—known as Fibonacci, and also Leonardo of Pisa, Leonardo Pisano Bigollo, Leonardo Fibonacci—was an Italian mathematician, considered to be "the most talented Western mathematician of the Middle Ages".

Fibonacci popularized the Hindu–Arabic numeral system to the Western World primarily through his composition in 1202 of Liber Abaci (Book of Calculation).[6] He also introduced to Europe the sequence of Fibonacci numbers which he used as an example in Liber Abaci.

Fibonacci sequence   Fibonacci number

19th century statue of Fibonacci in Camposanto, Pisa.

Liber Abaci posed, and solved, a problem involving the growth of a population of rabbits based on idealized assumptions. The solution, generation by generation, was a sequence of numbers later known as Fibonacci numbers. Although Fibonacci's Liber Abaci contains the earliest known description of the sequence outside of India, the sequence had been noted by Indian mathematicians as early as the sixth century.

In the Fibonacci sequence of numbers, each number is the sum of the previous two numbers. Fibonacci began the sequence not with 0, 1, 1, 2, as modern mathematicians do but with 1,1, 2, etc. He carried the calculation up to the thirteenth place (fourteenth in modern counting), that is 233, though another manuscript carries it to the next place: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377. Fibonacci did not speak about the golden ratio as the limit of the ratio of consecutive numbers in this sequence.

Solution:

This C Program Find the Fibonacci Sequence of a Number in C Program. nth Number is enter through keyboard.

1. #include <stdio.h>
3. int fibo(int);
4. int main()
5. {
6.     int num;
7.     int result;
8.     printf("Enter the nth number in fibonacci series: ");
9.     scanf("%d", &num);
10.     if (num < 0)
11.     {
12.         printf("The fibonacci of a negative number is not possible.\n");
13.     }
14.     else
15.     {
16.         result = fibo(num);
17.         printf("The %d number in fibonacci series is %d\n", num, result);
18.     }
19.     return 0;
20. }
21. int fibo(int num)
22. {
23.     if (num == 0)
24.     {
25.         return 0;
26.     }
27.     else if (num == 1)
28.     {
29.         return 1;
30.     }
31.     else
32.     {
33.         return(fibo(num - 1) + fibo(num - 2));
34.     }
35.    
36. }

Learn More :

Share this

Share on FacebookPlus on Google+