Answers for "what is a fibonacci sequence"

fibonacii sequence code

# Program to display the Fibonacci sequence up to n-th term

nterms = int(input("How many terms? "))

# first two terms
n1, n2 = 0, 1
count = 0

# check if the number of terms is valid
if nterms <= 0:
   print("Please enter a positive integer")
elif nterms == 1:
   print("Fibonacci sequence upto",nterms,":")
   print(n1)
else:
   print("Fibonacci sequence:")
   while count < nterms:
       print(n1)
       nth = n1 + n2
       # update values
       n1 = n2
       n2 = nth
       count += 1

fibonacci sequence

public class Numbers {
	public static void FibannaciNumbers(int n) {
        int x = 0;
        int y = 1;
        if(n >= 1) {
            System.out.print(x + " ");
        }
        if(n >= 2) {
            System.out.print(y);
        }
        if (n > 2) {
            for(int a = n - 2; a > 0; a--) {
                int z = y + x;
                System.out.print(" " + z);
                x = y;
                y = z;
            }
        }
    }
}

fibinachi

def fib(n):
  lisp = []
  
  for i in range(n):
    if len(lisp) < 3:
      if len(lisp) == 0:
        lisp.append(0)
      else:
        lisp.append(1)
    
    else:
      lisp.append(lisp[len(lisp)-1]+lisp[len(lisp)-2])
  
  return lisp

fibonacci sequence

//x is the index number in the fibonnacci sequence. 
//The function will return that index's fibonacci value
function fib(x) {
    let a = 0;
    let b = 1;
    for (var i = 0; i < x-1; i++) {
        let c = b;
        b += a;
        a = c;
    }
    return b;
}

fibonacci sequence

// Copy pastecode here https://play.golang.org/
package main

import "fmt"

func fibo(n int) int {
	x, y := 0, 1
	for i := 0; i < n; i++ {
		x, y = y, x+y
	}
	return x
}

func main() {
	for i := 0; i < 10; i++ {
		fmt.Println("fibo of", i, "is", fibo(i))
	}
}

fibonacci sequence

int n ; 
double feb  = (1/Math.pow(5,0.5)) * (Math.pow((1+Math.pow(5,0.5))/2,n)) - (1/Math.pow(5,0.5))* (Math.pow((1-Math.pow(5,0.5))/2,n));

fibonacii sequence code

# Program to display the Fibonacci sequence up to n-th term

nterms = int(input("How many terms? "))

# first two terms
n1, n2 = 0, 1
count = 0

# check if the number of terms is valid
if nterms <= 0:
   print("Please enter a positive integer")
elif nterms == 1:
   print("Fibonacci sequence upto",nterms,":")
   print(n1)
else:
   print("Fibonacci sequence:")
   while count < nterms:
       print(n1)
       nth = n1 + n2
       # update values
       n1 = n2
       n2 = nth
       count += 1

fibonacci sequence

public class Numbers {
	public static void FibannaciNumbers(int n) {
        int x = 0;
        int y = 1;
        if(n >= 1) {
            System.out.print(x + " ");
        }
        if(n >= 2) {
            System.out.print(y);
        }
        if (n > 2) {
            for(int a = n - 2; a > 0; a--) {
                int z = y + x;
                System.out.print(" " + z);
                x = y;
                y = z;
            }
        }
    }
}

fibinachi

def fib(n):
  lisp = []
  
  for i in range(n):
    if len(lisp) < 3:
      if len(lisp) == 0:
        lisp.append(0)
      else:
        lisp.append(1)
    
    else:
      lisp.append(lisp[len(lisp)-1]+lisp[len(lisp)-2])
  
  return lisp

fibonacci sequence

//x is the index number in the fibonnacci sequence. 
//The function will return that index's fibonacci value
function fib(x) {
    let a = 0;
    let b = 1;
    for (var i = 0; i < x-1; i++) {
        let c = b;
        b += a;
        a = c;
    }
    return b;
}

fibonacci sequence

// Copy pastecode here https://play.golang.org/
package main

import "fmt"

func fibo(n int) int {
	x, y := 0, 1
	for i := 0; i < n; i++ {
		x, y = y, x+y
	}
	return x
}

func main() {
	for i := 0; i < 10; i++ {
		fmt.Println("fibo of", i, "is", fibo(i))
	}
}

fibonacci sequence

int n ; 
double feb  = (1/Math.pow(5,0.5)) * (Math.pow((1+Math.pow(5,0.5))/2,n)) - (1/Math.pow(5,0.5))* (Math.pow((1-Math.pow(5,0.5))/2,n));