Question

Write a recursive JAVA program to solve the following problem:

P(1) = 4

P(2) = 6

P(n) =P(n-1)+P(n-2) for n>2

To test your code – The output for P(4)=16 P(6) = 42 and P(7) =68

The main program, Main, calls a function int par(int n) that:

returns 3 if n=1

returns 4 if n = 2

returns par(n-1) + par(n-2) if n>2.

Provide a pdf of your code and a screen of your output for n=5 or P(5)

Sample Output: Mike shows P(7)=68

Answer 1

import java.util.Scanner;

public class Main {

  public static int par(int n){
    if(n>0) {
      if (n == 1) {
        return 4;
      } else if (n == 2) {
        return 6;
      } else {
        return par(n - 1) + par(n - 2);
      }
    }
    else{
      System.out.println("Invalid input");
      return -1;
    }
  }

  public static void main(String[ ] args) {
    Scanner scanner = new Scanner(System.in);
    System.out.print("Enter value for n: ");
    int n = scanner.nextInt();
    System.out.println("par("+n+") = "+par(n));
  }
}

Enter value for n: 5
par(5) = 26