# Print Fibonacci Series up to Nth Term

Print Fibonacci Series up to Nth Term” is one of the most popular problem of programming. Here, we are given a number ‘n’, entered by user and our task is to print the Fibonacci series up to nth Term.

Fibonacci Series: 0, 1, 1, 2, 3, 5, 8,…

The first two terms of Fibonacci series are fixed and are 0 and 1. All the succeeding numbers of the Fibonacci series are sum of preceding two numbers.

Like, First term = 0, Second Term = 1

Third Term = Second Term(1) + First Term(0) = 1

Fourth Term = Third Term(1) + Second Term(1) = 2

Fifth Term = Fourth Term(2) + Third Term(1) = 3

.

.

.

So on…

```Formula:
F(n) = F(n-1) + F(n-2)```

Example to Print Fibonacci Series up to nth term

```INPUT:
N = 5
OUTPUT:
0 1 1 2 3
INPUT:
N = 7
OUTPUT:
0 1 1 2 3 5 8```

#### C++ Program to print Fibonacci series up to nth term is as follows:

```/* C++ Program to print Fibonacci series up to nth term */
#include<bits/stdc++.h>
using namespace std;
int main()
{
//Scan the number
int n;
cout<<"Enter the number:";
cin>>n;

// Computing and Printing the fibonacci series upto nth number
int first = 0;
int second = 1;
int nth;
cout<<"The fibonacci series :\n";
for(int i = 1; i <= n ; i++)
{
// Printing the first fibonacci number
if(i == 1)
{
cout<<first<<" ";
}
// Printing the second fibonacci number
else if(i == 2)
{
cout<<second<<" ";
}
// Printing the rest of fibonacci series number
else
{
nth = first + second;
first = second;
second = nth;
cout<<nth<<" ";
}
}
}

```
```OUTPUT:
Enter the number: 6
The Fibonacci series:
0 1 1 2 3 5```

Related Posts: