index.py

def prime_eratosthenes(n):    
    numbers = list(range(2, n + 1))    
    primes = []    
    
    divisor = -1    
    while len(numbers) > 0:    
        divisor = numbers[0]    
        primes.append(divisor)    
        numbers = filterNumber(numbers, divisor)    
    
    return primes    
    
def filterNumber(numbers, divisor):    
    i = 0    
    while i < len(numbers):    
        if numbers[i] % divisor == 0:    
            del numbers[i]    
        else:    
            i += 1    
    
    return numbers    
    
def main():    
    n = input("Give a number: ")    
    primes = prime_eratosthenes(int(n))    
    print("The primes are", primes)    
    
main()