def nth_prime(n): i, j = 1, 0 while j < n: i += 1 if is_prime(i): j += 1 return i
def sum_of_primes(n): s = 2 for i in xrange(3, n, 2): if is_prime(i): s += i return s