ex1.py

import math


def get_fibonnacci(n_numbers):
    fibo = [1,1]
    if n_numbers <= 2:
        return fibo[:n_numbers]
    for i in range(2,n_numbers):
        fibo.append(fibo[-1] + fibo[-2])
    return fibo

def is_prime(number):
    if number < 2 :
        return False
    if number == 2:
        return True

    for test in range(2,int(math.sqrt(number))+1):
        if (number % test) == 0:
            return False
    return True


n_numbers = int(input("Combien de nombres voulez-vous ?"))

for (index,fib) in enumerate(get_fibonnacci(n_numbers)):
    to_print = "Number {0} : {1} ; ".format(index,fib)
    if is_prime(fib):
        to_print += "is prime"
    else:
        to_print += "isn't prime"
    print(to_print)