def run(n): primes = list(eu.primes(int(math.ceil(math.sqrt(n))))) max_quotient = 0 max_n = None for i in range(2,n + 1): phi = eu.eulers_totient(i, primes) rslt = float(i) / phi if rslt > max_quotient: max_quotient = rslt max_n = i
def run(max): sum = 0 for i in range(2, max + 1): sum += eu.eulers_totient(i) print sum
def test(): for i in range(2,11): et = eu.eulers_totient(i)
def test(): for i in range(2,11): et = eu.eulers_totient(i) print i, et, float(i) / et