I need to find the sum of all the prime numbers under 2,000,000. This code takes way too long : <pre><code>##Problem 10
primes=[]
sumofprimes=0
for number in range(1,2000000):
##This goes through all the potential primes.
    p=0
    for tester in range(2,number):
        if ((number%tester)==0):
            break
        else:
##every time the number is not divisible by something it adds 1 to p and when everything up to the number is not divisible by anything then it is a prime.
            p=p+1
        if(p==(number-2)):
</code></pre>

<h2>the "number minus 2" is because lets say you have the prime "3" it will only test "2" so p will equal 1 or (3-2).</h2>

<pre><code>            sumofprimes=sumofprimes+number
print(sumofprimes)
</code></pre>
