Question

Can someone help me with this?

Answer 1

@Hero ?

Answer 2

@.Sam.

Answer 3

i kinda started it.. public class Fibonacci {
public static void main (String [] args) {
for (int i=1; i <=13; i++) {
System.out.print(
but got stuck here!

Answer 4

@radar

Answer 5

`public class Fibonacci {
public static int fib(int n) {
if (n < 2) {
return n;
}
else {
return fib(n-1)+fib(n-2);
}
}

test main
}
`

Answer 6

//code for find the first 15 fib no in java
class Fib {
public static void main(String []arg) {
System.out.println("First Fibonacci nos are:");
int c=1, n1=0, n2=1, temp;
while(c != 16) {
System.out.println(c+"th Fib no is :"+n2);
temp=n2;
n2=n2+n1;
n1=temp;
c++;
}
}
}

Answer 7

This program prints out the first 15numbers in the Fibonacci sequence. Each
term is formed by adding together the previous two terms in the sequence,
starting with the terms 1 and 1.

public class Fibonacci {
public static void main(String[] args) {
int n0 = 1, n1 = 1, n2; // Initialize variables
System.out.print(n0 + " " + // Print first and second terms
n1 + " "); // of the series

for (int i = 0; i < 15; i++) { // Loop for the next 18 terms
n2 = n1 + n0; // Next term is sum of previous two
System.out.print(n2 + " "); // Print it out
n0 = n1; // First previous becomes 2nd previous
n1 = n2; // And current number becomes previous
}
System.out.println(); // Terminate the line
}
}

Answer 8

code is not needed... you can just use the reccurence relation

f(n)={ 0, n=1
1, n=2
f(n-1)+f(n-2), n>2 }

Answer 9

thank you all.. :)

Answer 10

you are welcomed!