def problem214(chain_len, prime_max): # FIXME Too slow result = 0 for prime in sieve_prime(max=prime_max): print prime if len(totient_chain(prime)) == chain_len: result += prime return result
def problem010(max): prime_sum = 0 for prime in sieve_prime(max=max): if prime < max: prime_sum += prime else: break return prime_sum