def main(argv=sys.argv): if len(argv) == 1: print "Input error" return n = int(argv[1]) p = primes[-1] while p < n: p = next_prime() sum = reduce(lambda x, y: x + y, primes[:-1]) print "Total: %d, at %d primes." % (sum, len(primes) - 1) return
def get_nth_prime(n): for i in range(n-1): # n-1 because primes has 2 hardcoded to start p = next_prime() print 'We calculated %d primes.' % len(primes) return p