title: Project Euler #10 (Python)
body: <p>Why is my algorithm for finding the sum of all prime numbers below 2 million so slow?
  I'm a fairly beginner programmer and this is what I came up with for finding the solution:</p>
  
  <pre><code>import time
  
  sum = 2
  start = time.time()
  
  for number in range(3, 2000000):
      prime = True
      for x in range(2, number):
          if number % x == 0:
              prime = False
      if prime:
          sum += number
  
  print "Sum =", sum
  end = time.time() - start
  print "Runtime =", end
  </code></pre>
  
  <p>Can someone please help me out?
  Thanks!</p>