Breaking News: Grepper is joining You.com. Read the official announcement!

fibonacci series in python

Add Answer

Green Team answered on January 14, 2021 Popularity 9/10 Helpfulness 4/10

answer fibonacci series in python

related fibonacci series in python

related Fibonacci series using Python

related fibonacci series in python

fibonacci series in python

Comment

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

Fab(100)

Popularity 9/10 Helpfulness 4/10 Language python

Source: Grepper

Tags: fibonacci python series

Link to this answer
Share Copy Link

Contributed on Mar 04 2022

Green Team

0 Answers Avg Quality 2/10

Closely Related Answers

fibonacci series in python

Comment

n = int(input("No. of terms in febonacci sequence: "))

'''
Theory:
	Here every number is the sum of the last two numbers
	The sequence startes with 2 numbers that are 0,1

	Sequence looks like: 0,1,1,2,3,5,8
'''

a,b=0,1

for i in range(n):
	print(a,end=" ")
	a,b=a+b,a
    
# END CODE

Popularity 7/10 Helpfulness 4/10 Language python

Source: Grepper

Tags: fibonacci python py

Link to this answer
Share Copy Link

Contributed on Feb 21 2023

Grotesque Goldfinch

0 Answers Avg Quality 2/10

fibonacci series in python

Comment

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.

Popularity 9/10 Helpfulness 4/10 Language python

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Nov 02 2021

Brave Booby

0 Answers Avg Quality 2/10

fibonacci series in python

Comment

# Function for nth Fibonacci number
def Fibonacci(n):
   
    # Check if input is 0 then it will
    # print incorrect input
    if n < 0:
        print("Incorrect input")
 
    # Check if n is 0
    # then it will return 0
    elif n == 0:
        return 0
 
    # Check if n is 1,2
    # it will return 1
    elif n == 1 or n == 2:
        return 1
 
    else:
        return Fibonacci(n-1) + Fibonacci(n-2)
 
# Driver Program
print(Fibonacci(9))
 
# This code is contributed by Saket Modi
# then corrected and improved by Himanshu Kanojiya

Popularity 8/10 Helpfulness 4/10 Language python

Source: www.geeksforgeeks.org

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Nov 30 2022

Rahul Jawale

0 Answers Avg Quality 2/10

Fibonacci series using Python

Comment

user_input = int(input())
f = 0
s = 1
if user_input == 0:
    print("The fibonacci series is", f)
else:
    print(f, s, end=" ")
    for i in range(2, user_input):
        fib = f + s
        print(fib, end=" ")
        f = s
        s = fib

Popularity 8/10 Helpfulness 3/10 Language python

Source: Grepper

Tags: fibonacci python

Link to this answer
Share Copy Link

Contributed on Jan 03 2023

Cruel Chimpanzee

0 Answers Avg Quality 2/10

fibonacci series in python

Comment

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] """

Popularity 10/10 Helpfulness 3/10 Language python

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Jan 14 2021

Gill Bates

0 Answers Avg Quality 2/10

fibonacci series in python

Comment

#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)

Popularity 9/10 Helpfulness 2/10 Language python

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Aug 05 2022

0 Answers Avg Quality 2/10

fibonacci series in python

Comment

Input:

def Fib(n):
   if n <= 1:
       return n
   else:
       return (Fib(n - 1) + Fib(n - 2))  # function calling itself(recursion)


n = int(input("Enter the Value of n: "))  # take input from the user
print("Fibonacci series :")
for i in range(n):
   print(Fib(i),end = " ")


Output:

Enter the value of n:  8
0 1 1 2 3 5 8 13

Popularity 1/10 Helpfulness 1/10 Language python

Source: www.scaler.com

Tags: fibonacci python series

Link to this answer
Share Copy Link

Contributed on Feb 04 2022

codelearner

0 Answers Avg Quality 2/10

fibonacci series in python

Contents

More Related Answers

fibonacci series in python

Closely Related Answers

fibonacci series in python

fibonacci series in python

fibonacci series in python

Fibonacci series using Python

fibonacci series in python

fibonacci series in python

fibonacci series in python

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.