Solve problem 70 in Python.

This commit is contained in:
2019-07-21 14:13:28 -04:00
parent 66e4593c4b
commit c47970642a
11 changed files with 168 additions and 12 deletions

View File

@@ -1,13 +1,4 @@
from lib_prime import primes
from lib_misc import gcd
def relative_primes_count(n):
return len([i for i in range(1, n) if gcd(n, i) == 1])
def get_phi(n):
return n / relative_primes_count(n)
def euler_069():