def METHOD_NAME():
    """
    enumerate prime numbers
    """
    # the primes we have found so far
    previous = [2, 3]
    yield 2
    yield 3
    # consider only odd numbers
    for n in itertools.count(5, 2):
        # deemed prime until we find a divisor
        is_prime = True
        # no need to go beyond this
        root = math.sqrt(n)
        # try only primes
        for i in previous:
            # above root, no need to go on
            if i > root:
                break
            # a divisor is found
            # no need to go on either
            if n % i == 0:
                is_prime = False
                break
        # yield, and record in previous
        if is_prime:
            previous.append(n)
            yield n