Function primeCheck

project_euler/problem_07/sol3.py:10–13

(number)

import math
import itertools
def primeCheck(number):
    if number % 2 == 0 and number > 2:
        return False
    return all(number % i for i in range(3, int(math.sqrt(number)) + 1, 2))

def prime_generator():
    num = 2