使用count()的Python素数迭代器

from itertools import count

def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def prime_generator():
    for n in count(2):
        if is_prime(n):
            yield n

# 使用素数迭代器生成前10个素数
primes = []
prime_iter = prime_generator()
for _ in range(10):
    primes.append(next(prime_iter))

print(primes)  # 输出：[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]