素数生成器

# coding=utf-8 L = [n for n in range(2, 40)] print(L) L = [n for n in L if n == L[0] or n % L[0] > 0] # 除了原来的数，都去掉2的倍数 print(L) L = [n for n in L if n == L[1] or n % L[1] > 0] # 除了原来的数，去掉3的倍数 print(L) L = [n for n in L if n == L[2] or n % L[2] > 0] # 除了原来的数，去掉5的倍数 print(L) def gen_primes(N): primes = set() for n in range(2, N): if all(n % p > 0 for p in primes): primes.add(n) yield n print([*gen_primes(70)])

输出：

[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39] [2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39] [2, 3, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37] [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37] [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67]