用Python寻找前n个质数
来源:学生作业帮 编辑:拍题作业网作业帮 分类:综合作业 时间:2024/05/06 08:51:13
用Python寻找前n个质数
output是这样:
Find the first M prime numbers
10
0 :3 is a prime number
1 :5 is a prime number
2 :7 is a prime number
3 :11 is a prime number
4 :13 is a prime number
5 :17 is a prime number
6 :19 is a prime number
7 :23 is a prime number
8 :29 is a prime number
9 :31 is a prime number
output是这样:
Find the first M prime numbers
10
0 :3 is a prime number
1 :5 is a prime number
2 :7 is a prime number
3 :11 is a prime number
4 :13 is a prime number
5 :17 is a prime number
6 :19 is a prime number
7 :23 is a prime number
8 :29 is a prime number
9 :31 is a prime number
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开始用注释的两行替换这两行下面的行
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开始用注释的两行替换这两行下面的行
python 在一个范围内,寻找另一个数字的所有整数倍数,并计算一共有多少个倍数
python统计个单词数目
An表示前n个质数的和,求证:[An,An+1]中至少有一个完全平方数.
谁知道质数素数寻找
VB 编写程序,请用户输入一个自然数N,求前N个质数,并将其存放一个数组中
VB 编写程序,请用户输入一个自然数N,求前N个质数,并将其存放一个数组中.
一个七位数电话号码,它恰好是n个连续质数的乘积,这个积的末四位数的前三位数的10倍,这个
怎么证明p=n!-1是个质数
从小到大写出5个质数,要求后一个比前一个大12,这5个质数是?
n个质数连乘(n是自然数,n大于1)积是什么
用python怎么抽取中间“>”和“
前20个自然数中的质数之和与这20个自然数之和比是多少?