Use Python code to find the sum of all the primes below two million.

Question

I tried but did not run. Please help!! Here is my code:

def findPrime(z):

for y in range(2, z):

if (z % y) != 0:

return False

break

else:

return True

break

primesL = []

for x in range(2, 2000000):

temp = x

findPrime(temp)

if findPrime(temp) == False:

primesL.append(int(x))

sumP = 0

q = int(max(primesL))

for n in range (0, q):

sumP = sumP + int(primesL[n])

print(str(sumP))

Answer 1

def IsPrime(x):

returnVal = True

for i in range(2,int(x)):

if (int(x) % i)==0:

returnVal=False

break

return returnVal

###################################3

sum=2

for i in range(3,2000000):

if IsPrime(i):

print("adding " + str(i))

sum = sum + i

print(sum)