PYTHON

python code to generate fibonacci series

# Function for nth Fibonacci number
 
def Fibonacci(n):
    if n<= 0:
        print("Incorrect input")
    # First Fibonacci number is 0
    elif n == 1:
        return 0
    # Second Fibonacci number is 1
    elif n == 2:
        return 1
    else:
        return Fibonacci(n-1)+Fibonacci(n-2)
 
# Driver Program
 
print(Fibonacci(10))
 
# This code is contributed by Saket Modi

fibonacci series in python

def Fab(num):
    x=0
    y=1
    while(1):
        print(x)
        fab=x+y
        x=y
        y=fab
        if x>=num:
            break

Fab(100)

fibonacci series in python

i = int(input("Enter the first element :")) #First element in fibonacci series
j = int(input("Enter the second element :"))#second element in fibonacci series
k=0
z = [i,j] 
for k in range(10):
    t = i+j #For getting third element in series
    z.append(t) #Adding elements to list
    i=j #Swapping Positions
    j=t 
f = "".join([str(element) for element in z]) #conversion of list to string
l = int(f) #conversion of string to integer
print(z) #printing the series.

fibonacci series in python

def iterativeFibonacci(n):
  fibList[0,1]
  for i in range(1, n+1):
    fibList.append(fibList[i] + fibList[i-1])
  return fibList[1:]

########################### Output ##################################

""" E.g. if n = 10, the output is --> [1,1,2,3,5,8,13,21,34,55] """
		
        

fibonacci series in python

#Using Recursion
def fib(n, lst = [0]):
  	"""Returns a list for n fib numbers | Time Complexity O(n)"""
    l = []

    if n == 1:
        lst.append(1)
    if n > 1:
        l = fib(n-1, lst)
        lst.append(l[-1]+l[-2])

    return lst

#list of fibonacci numbers
lst = fib(int(input("val: ")))
print(lst)

how to code fibonacci series in python

def fib(n):
    a, b = 0, 1
    while a < n:
        print(a, end=' ')
        a, b = b, a+b
    print()


fib(1000)