## Problem Description :

Write a program in java that prints first N Fibonacci terms.

## Concept :

In Fibonacci sequence every number after the first two terms is the sum of the two preceding terms and it is defined by following recurrence relation.
F(N)=F(N-1)+F(N-2)
For example - First 10 Fibonacci terms are 1,1,2,3,5,8,13,21,34,55.

## Java Program :

```package com.javamultiplex.number;

import java.util.Scanner;

/**
*
* @author Rohit Agarwal
* @category Number Problems
* @problem How to get first n fibonacci numbers?
*
*/
public class FibonacciNumbers {

public static void main(String[] args) {

Scanner input = null;
try {
input = new Scanner(System.in);
System.out.println("Enter limit : ");
int limit = input.nextInt();
if (limit >= 2) {
int fib[] = new int[limit];
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < limit; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
System.out.println("First " + limit + " Fibonacci numbers are : ");
for (int i = 0; i < limit; i++) {
System.out.print(fib[i] + " ");
}
} else {
System.out.println("Limit should be >= 2");
}
} finally {
if (input != null) {
input.close();
}
}

}

}

```

## Output :

 Output - How to generate first n Fibonacci terms in Java?

## References :

Thank you friends, I hope you have clearly understood the solution of this problem. If you have any doubt, suggestion or query please feel free to comment below. You can also discuss this solution in our forum.

Tags : Fibonacci terms in Java, Solution in Java,  Dynamic programming, for loop, if else statement.