用python找出1000以内的所有素数_使用python查找第1000个素数时出现问题

您的代码有一些问题，我将试图指出：count = 0

prime = [] # this is obviously meant to collect all primes

candidate = [] # what is this supposed to do then though?

x = 2

y = 1 # never used

while count < 1000: # you start at `count = 0` but never increase the count

# later on, so would loop forever

x = x+1

if x > 1: # x is always bigger than 1 because you started at 2

# and only increase it; also, you skipped 2 itself

if x%2 != 0: # here, all you do is check if the

if x%3 != 0: # number is dividable by any prime you

if x%5 != 0: # know of

if x%7 != 0: # you can easily make this check work

if x%11 != 0: # for any set (or list) of primes

if x%13 != 0: #

candidate.append(x) # why a candidate? If it’s

# not dividable by all primes

# i