Minimum count of numbers in the Fibonacci number

Minimum count of numbers in the Fibonacci number


To find the minimum count of numbers in the Fibonacci series and their sum is equal to the number n.

Fibonacci Series

            The Fibonacci sequence is a set of numbers that starts with a one or a zero, followed by a one, and proceeds based on the rule that each number is equal to the sum of the preceding two numbers. If the Fibonacci sequence is denoted F (n), where n is the first term in the sequence, the following equation obtains for n = 0, where the first two terms are defined as 0 and 1 by convention:

F (0) = 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 …

In some texts, it is customary to use n = 1. In that case, the first two terms are defined as 1 and 1 by default, and therefore:

        F (1) = 1, 1, 2, 3, 5, 8, 13, 21, 34 …

More About Fibonacci


  • Generate the Fibonacci series to find the count.
  • Pass the series and n to the function.
  • Find the nearest smaller Fibonacci no to n and increment the count.
  • Then subtract the nearest number with n and assign value to n.
  • And Recursively repeat the process until n becomes zero.


int sum(int a[],int n)
    static int c=0;        //minimum no of count to reach the number n
    int i;
            printf("%d ",a[i-1]);
            n=n-a[i-1];   //a[i-1] is the nearest smaller number to n
            c++;          //increment the count
    if(n==0)              //return the count when number is zero
        return c;
        sum(a,n);        //call the function recursively
void main()
    int a[100],i,count=0,n;
    printf("Enter the number:");
    for(i=2;i<30;i++)            //generates the Fibonacci series
    count=sum(a,n);             //Pass the value and array to find the minimum count
    printf("Count: %d",count);

You might also like…
Program to perform string operations | ZOHO


A Computer Science graduate who likes to make things simpler. When he’s not working, you can find him surfing the web, learning facts, tricks and life hacks. He also enjoys movies in his leisure time.