def main():
count = 1
num = 2
while count < 10001:
num += 1
if prime_tools.isprime(num):
count += 1
print num
def brute_force_sum_primes():
return sum(x for x in xrange(2, 2000001) if prime_tools.isprime(x))