def prob10(): limit = 2000000 primes_below = [] for i in range(2, limit): if h.is_prime(i): primes_below.append(i) print(sum(primes_below))
def f(n): j = 1 while n > 0: # evaluation stops when nth prime was found j += 1 while is_prime(j) == False: j += 1 n -= 1 return j
def nth_prime(target): prime_list = [] leading_prime = 2 seed = 2 length = len(prime_list) while (length < target): prime_state = h.is_prime(seed) if (prime_state): leading_prime = seed prime_list.append(leading_prime) length = len(prime_list) seed += 1 return leading_prime
def printall(n,a,b): for x in range(n+1): print gq(a,b,x) print hp.is_prime(gq(a,b,x))
#!/usr/bin/env python from helper import is_prime i = 3 sum = 2 while i < 2000000: if is_prime(i): sum += i i += 2 print sum