Task - Functions - Fibonacci Sequence

[akash-coded]

The Fibonacci numbers are the numbers in the following integer sequence.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..

In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation

Fn = Fn-1 + Fn-2
with seed values

F0 = 0 and F1 = 1.

1. WAP to print the first n terms of the Fibonacci sequence.

2. WAP to print the Fibonacci sequence till a given number n.

[OlvarM]

1. WAP to print the first n terms of Fibonacci

# First n terms of Fibonacci
def main():
    n = int(input("Number of terms in the Fibonacci sequence: "))

    fibonacci = [0,1]
    for i in range(2,n):
        fibonacci.append(fibonacci[i-1]+fibonacci[i-2])

    print(f"First {n} terms of the Fibonacci Sequence \n {fibonacci}")
# run main
main()

2. WAP to print the Fibonacci sequence till a given number n

# Fibonacci until number n
def main():
    num = int(input("Number to find in Fibonacci sequence: "))

    fibonacci = [0,1]
    count = 2
    while fibonacci[-1] < num:
        fibonacci.append(fibonacci[count-1]+fibonacci[count-2])
        count += 1

    print(f"Fibonacci Sequence until {num} \n {fibonacci}")
# run main
main()

[AlfredoITS]

Task 1

def fib(max):
    #Last iteration of recursion
    if max <= 1:
        return max
    else:
    #Recursion gets called twice
       return(fib(max - 1) + fib(max - 2))
    
#Main Function
value = input("Enter max number: ")
#For to print every digit in the sequence
for i in range(int(value)):
    print(fib(i))

Task 2

def fib(max):
    #Last iteration of recursion
    if max <= 1:
        return max
    else:
        
    #Recursion gets called twice
       return(fib(max - 1) + fib(max - 2))
    
#Main Function
value = input("Enter max number of sequence: ")
#For to print every digit in the sequence
i = 1
while 1:
    pr = fib(i)
    if pr <= int(value):
        print(pr)
        i += 1
    else:
        break

[ElijahHorowitz]

def fib(num):
    fib = [0,1]
    for i in range(2,num):
        fib.append(fib[i-1] + fib[i-2])
    print(fib)
    

print("Give n")
num = int(input())
fib(num)

def fib(num):
    fib = [0,1]
    for i in range(2,num):
        if(i != num):
            fib.append(fib[i-1] + fib[i-2])
    print(fib)
    

print("What number of the Fibonacci Sequence do you want?")
num = int(input())
fib(num)

[eusoj2]

1.-

import sys


def fibonacci(n, num1, num2, N):
    if n == N:
        print(num1, end = ",")
        n = n - 1
        fibonacci(n, num1, num2, N)
    if n == 0:
        sys.exit()
    if n == N - 1:
        n = n - 1
        print(num2, end = ",")
        fibonacci(n, num1, num2, N)
    n = n - 1
    num3 = num1 + num2
    print(num3, end = ",")
    fibonacci(n, num2, num3, N)


def main():
    print("how many numbers do you would like to do?")
    n = int(input(">"))
    fibonacci(n, 0, 1, n)


main()

2.-

import sys


def fibonacci(n,sequence):
    if sequence[len(sequence)-1] < n:
        num3 = sequence[len(sequence)-2] + sequence[len(sequence)-1]
        sequence.append(num3)
        if sequence[len(sequence) - 1] <= n:
            print(num3, end = ",")
        fibonacci(n, sequence)
    else:
        sys.exit()


def main():
    print("Fibonacci until?")
    n = int(input(">"))
    sequence = [0, 1]
    fibonacci(n, sequence)

main()

[JesusBel16]

def fibonacci(sum, numb, index):
    if index == 1:
        return
    else:
        print(sum)
        numc = sum
        sum = sum + numb
        index-=1
        fibonacci(sum, numc,index)

num1 = int(input("Enter the number of numbers of the series"))
print(0)
if num1 != 1:
    fibonacci(1, 0,num1)

def fibonacci(sum, numb, index):
    if index < sum:
        return
    else:
        print(sum)
        numc = sum
        sum = sum + numb
        fibonacci(sum, numc,index)

num1 = int(input("Enter the max number of the series"))
print(0)
if num1 != 1:
    fibonacci(1, 0,num1)

[zenberr]

Task 1.

x = int(input("Enter number of sequences to print: "))

def f(x):
    if(x<=1):
        return x
    return f(x-1) + f(x-2)

for i in range(x):
    print(f(i))

Task 2

x = int(input("Enter number of sequences to print: "))
y = int(input("Enter number to break sequence: "))

def f(x):
    if(x<=1):
        return x
    return f(x-1) + f(x-2)

for i in range(x):
    if (f(i)>=y):
        break
    else:
        print(f(i))

[Edson-Rodrigo]

1.-

def fibo(n):
    fibonacci = [0, 1]
    for i in range(2, n):
        fibonacci.append(fibonacci[i-1] + fibonacci[i-2])
    print(fibonacci)
    

num = input("Number of elemets in fibonacci sequence: ")
fibo(int(num))

2.-

def fibo(n):
    fibonacci = [0, 1]
    for i in range(2, n):
        if n <= fibonacci[-1]:
            break
        fibonacci.append(fibonacci[i-1] + fibonacci[i-2])
    print(fibonacci)
    

num = input("Number in the bibonacci number: ")
fibo(int(num))

[rama77605]

n=int(input("enter the value"))
a=0
b=1
print( a ,end=" ")
for i in range (0,n):
 while i<=n:
    n=a+b
    a=b
    b=n
    print (n,end=" ")
    break

[rama77605]

def fib(num):
    fib = [0,1]
    for i in range(2,num):
        if(i != num):
            fib.append(fib[i-1] + fib[i-2])
    print(fib)
    

print("What number of the Fibonacci Sequence do you want?")
num = int(input())
fib(num)

[Jyothig7]

1.FIBONACCI

def fib(n):

    a = 0
    b = 1
    if n == 1:
        print(a)
    else:
        print(a)
        print(b)
        for i in range(2,n):
            c=a + b
            a = b
            b = c
        
            print(c)

fib(6)

2.Fibonacci Sequence

def fib(n):

    a = 0
    b = 1
    print(a)
    print(b)

    for i in range(2,n):
        c=a + b
        a = b
        b = c
    
        print(c)

fib(int(input("Enter n : ")))