计算素数并追加到列表

问题描述

我最近开始尝试使用python解决项目Euler上的问题，并且在尝试计算素数并将其追加到列表时遇到了这一难题.我已经编写了以下代码，但是我对为什么在运行它时不输出任何内容感到困惑.

I've recently started attempting to solve problems on project Euler using python, and have hit this road bump when trying to calculate primes and append them to a list. I have written the following code, but I'm confused as to why it doesn't output anything when I run it.

import math

primes = []

def isPrime(i):
    if number<=1:
        return False
    if number==2:
        return True
    if number%2==0:
        return False
    for i in range(3,int(sqrt(number))+1):
        if number%i==0:
            return False
    return True

for i in range (1, 9999999):
    if isPrime(i) == True:
        primes.append(i)
    else:
        continue
print(primes)

推荐答案

尝试:

import math

primes = []

def isPrime(number):
    if number<=1:
        return False
    if number==2:
        return True
    if number%2==0:
        return False
    for i in range(3,int(math.sqrt(number))+1):
        if number%i==0:
            return False
    return True

for i in range (1, 9999999):
    if isPrime(i) == True:
        primes.append(i)

print(primes)

这篇关于计算素数并追加到列表的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！