Answers for "what is fibonacci numbers"

1

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
Posted by: Guest on October-13-2020
1

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
Posted by: Guest on October-13-2020
-1

fibonacci numbers

f(n) = f(n-1) + f(n-2) 
                                  f(6)
                                   ^
  			                       /\
                f(5)               +                       f(4)
                ^
               /\                                           /\
                
        f(4)    +           f(3)                     f(3)    +    f(2)
       ^                       ^                     ^              ^
      /\                       /\                    /\            /\
   
 f(3)   +       f(2)            f(2) +f(1)       f(2) + f(1)   f(1) +  f(0)             
   ^              ^                ^                ^
   /\             /\                /\              /\
    
f(2) + f(1)      f(1) +  f(0)     f(1)+ f(0)       f(1) + f(0)         
  ^
  /\
f(1) +  f(0) 
  
//f(6) = 8   ==>  f(1)*8    f(1) appears 8 times 
 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));  
  
f(1) == 1;
Posted by: Guest on August-01-2021
-1

fibonacci numbers

f(n) = f(n-1) + f(n-2) 
                                  f(6)
                                   ^
  			                       /\
                f(5)               +                       f(4)
                ^
               /\                                           /\
                
        f(4)    +           f(3)                     f(3)    +    f(2)
       ^                       ^                     ^              ^
      /\                       /\                    /\            /\
   
 f(3)   +       f(2)            f(2) +f(1)       f(2) + f(1)   f(1) +  f(0)             
   ^              ^                ^                ^
   /\             /\                /\              /\
    
f(2) + f(1)      f(1) +  f(0)     f(1)+ f(0)       f(1) + f(0)         
  ^
  /\
f(1) +  f(0) 
  
//f(6) = 8   ==>  f(1)*8    f(1) appears 8 times 
 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));  
  
f(1) == 1;
Posted by: Guest on August-01-2021

Python Answers by Framework

Browse Popular Code Answers by Language