---

Homework: Fibonacci numbers

---

• The Fibonacci numbers are defined recursively as follows:

  fibonacci(0) = 1 fibonacci(1) = 1 fibonacci(n) = fibonacci(n-1) + fibonacci(n-2) for all n ≥ 2

• Assignment:
  Write a recursive method named fibonacci( ) that compute the Fibonacci number according to the definition above.

  Test the method with this main( ) program:

  public class myProg { public static void main(String[] args) { System.out.println("Fibonacci(2) = " + fibonacci(2)); System.out.println("Fibonacci(3) = " + fibonacci(3)); System.out.println("Fibonacci(4) = " + fibonacci(4)); System.out.println("Fibonacci(5) = " + fibonacci(5)); System.out.println("Fibonacci(6) = " + fibonacci(6)); } }

  Your program is correct if you see:

  Fibonacci(2) = 2 Fibonacci(3) = 3 Fibonacci(4) = 5 Fibonacci(5) = 8 Fibonacci(6) = 13