import math
defprime(p):if p ==1:returnFalsefor i inrange(2,int(math.sqrt(p)+1)):if p % i ==0:returnFalsereturnTruedefPrimeSum(m,n):
res =0for i inrange(m, n +1):if prime(i):
res += i
return res
第6章函数-2 使用函数求素数和import mathdef prime(p): if p == 1: return False for i in range(2, int(math.sqrt(p) + 1)): if p % i == 0: return False return Truedef PrimeSum(m,n): res = 0 for i in range(m, n + 1):