Question

Write a recursive static method that will return the n’th term in the Fibonacci series, a series of numbers in which each number is the sum of the two preceding numbers. The first terms are 1, 1, 2, 3, 5, 8, 13, … Therefore fibonacci(5) will return 5.

Answer 1

Program :

import java.util.Scanner;
public class Main
{
public static void main(String[] args) {
int n,result;
Scanner sc = new Scanner(System.in);
System.out.print("Enter a number:");
n=sc.nextInt();
result = fib(n);

System.out.printf("Fibonacci series "+n+"th term is:"+result);
}

public static int fib(int n)
{
if (n ==1 ||n==2)
return 1;
else
return fib(n-1)+fib(n-2);
}
}

Screenshot of the program :