Prime number generator program (Python)

 

"""

Each subsequent cycle increases the value of last prime number in proportion to the square of the last prime number of the previous cycle

""" 

L=[2]

def filter_getprime(P=L):

    S=list(range(1+P[-1],P[-1]*P[-1]))

    for p in P:

        F1=list(filter(lambda x: x%p!=0,S))

        S=F1

    return F1 

print('')

print('!!! more than five cycles require a powerful computer !!!\n')

print('in the case of five cycles, the calculation time is several minutes\n')

 

M= int(input('how many cycles to do ? = '))

for m in range(1, M+1):

    D=filter_getprime(L)

    L=L+D

   

print('')

print(f'last prime number is = {L[-1]}\n')

print(f'number of primes are ={len(L)}\n')

M1=input('Do you need to see prime numbers?? Y or N =')

if M1=='Y':

    print('')

    print(L)