如何在 Python 3.5 中找到给定范围内的素数之和? [英] How do I find the sum of prime numbers in a given range in Python 3.5?

问题描述

我设法使用以下方法创建了一个给定范围内的素数列表:

I managed to create a list of prime numbers in a given range using this:

import numpy as np  

num = int(input("Enter a number: "))  

for a in range(2,num+1):         
  maxInt=int(np.sqrt(a)) + 1  
  for i in range(2,maxInt):
    if (a%i==0):  
      break  
  else: 
    print (a)

我现在想找到范围内所有素数的总和，所以我只是放下

I want to now find the sum of all of the prime numbers in the range so I just put down

print (sum(a))

但是当我尝试这样做时，我得到以下回溯:

But when trying to do that, I get the following traceback:

Traceback (most recent call last):
  File "C:/Users/Jason/PycharmProjects/stackidiots/scipuy.py", line 11, in <module>
    print(sum(a))
TypeError: 'int' object is not iterable

推荐答案

在您的情况下，a 是在您的循环中使用的整数变量，不是可迭代的.

In your case, a is an integer variable being used in your loop, not an iterable.

import numpy as np

num = int(input("Enter a number: "))

primes = []

for a in range(2,num+1):

  maxInt= int(np.sqrt(a)) + 1

  for i in range(2,maxInt):

    if (a%i==0):
      break

  else:
    primes.append(a)

print(sum(primes))

因此，如果我们只是在执行过程中将它们附加到列表中而不是打印它们，那么在获取列表 primes 的 sum 时，我们会得到以下输出.

So if we just append them to a list as we go instead of printing them, we get the following output when taking the sum of the list primes.

Enter a number: 43
281

这篇关于如何在 Python 3.5 中找到给定范围内的素数之和?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！