用Python寻找前n个质数output是这样：FindthefirstMprimenumbers100:3isaprimenumber1:5isaprimenumber2:7isaprimenumber3:11isaprimenumber4:13isaprimenumber5:17isaprimenumber6:19isaprimenumber7:23isapri
更新时间： 2025-08-28 06:55:27
1人问答
问题描述：
用Python寻找前n个质数
output是这样：
FindthefirstMprimenumbers
10
0:3isaprimenumber
1:5isaprimenumber
2:7isaprimenumber
3:11isaprimenumber
4:13isaprimenumber
5:17isaprimenumber
6:19isaprimenumber
7:23isaprimenumber
8:29isaprimenumber
9:31isaprimenumber
倪建克回答：
from itertools import count
from math import sqrt
def format_primes(fn):
def add_descriptoin(n):
primes = fn(n)
for i, p in enumerate(primes):
print("{} : {} is a prime number".format(i, p))
return add_descriptoin
@format_primes
def first_primes(n):
def prime_gen():
primes = []
for n in count(2):
if all(n%p for p in primes if p <= sqrt(n)):
primes.append(n)
yield n
primes = []
for i, j in enumerate(prime_gen()):
# if i < n:
if i < (n+1):
primes.append(j)
else:
break
# return primes
return primes[1:]
print("Find the first M prime numbers")
# python 2.x输入数据的话,要作相应修改
M = input("M? ")
first_primes(M)
按你的示例从3开始打印的,如果要从2开始用注释的两行替换这两行下面的行
其它推荐
其它推荐
最新更新
精品分类
优秀其它推荐
热门其它