defodd():
n =1whileTrue:
n +=2yield n
defdiv(n):returnlambda x: x % n >0defprimes():yield2
it = odd()whileTrue:
n =next(it)yield n
it =filter(div(n), it)for n in primes():if n <100:print(n, end=' ')else:break
Python中利用filter判断素数def odd(): n = 1 while True: n += 2 yield ndef div(n): return lambda x: x % n > 0def primes(): yield 2 it = odd() while True: n = ne