Function prime_generator

project_euler/problem_10/sol2.py:10–15

()

    return all(number % i for i in range(3, int(math.sqrt(number)) + 1, 2))
    
def prime_generator():
    num = 2
    while True:
        if primeCheck(num):
            yield num
        num+=1
        
def main():
    n = int(input('Enter The upper limit of prime numbers: '))