The fibonacci numbers are a sequence of integers in which the first two elements are 1, and each following element is the sum of the two preceding elements. the mathematical definition of each kth fibonacci number is the following: f(k): k > 2 : f(k-1) + f(k-2) k < = 2 : 1 the first 12 fibonacci numbers are: 1 1 2 3 5 8 13 21 34 55 89 144 write a piece of code that uses a for loop to compute and print the first 12 fibonacci numbers. (you may include other code, such as declaring variables before the loop, if you like.)

// C++ program to print first 12 term of Fibonacci Series

#include <iostream>

using namespace std;

// main function

int main()

{

   // variables

   int n=12, f = 1, s = 1, nt = 0;

   cout << "First 12 term of Fibonacci Series: ";

   // print 12 terms

   for (int a = 1; a<= n; a++)

   {

       // Prints the first two terms.

       if(a <=2 )

       {

           cout << 1<<" ";

       }

      else

      {

      // update the next term

       nt = f + s;

       f = s;

       s = nt;

       // print the next term

       cout << nt << " ";

      }

   }

   return 0;

}

Explanation:

Declare and initialize n=12,f=1,s=1 and nt=0.Run a loop for 12 times, for first term print 1 and then next term will be calculated as sum of last two term of Series. Then update the first and second term.This will continue for 12 time and print the  terms of Fibonacci Series.

Output:

First 12 term of Fibonacci Series: 1 1 2 3 5 8 13 21 34 55 89 144

go to the floppy disc icon and click it

explanation: