Solve problem 70 in Python.
This commit is contained in:
@@ -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():
|
||||
|
||||
Reference in New Issue
Block a user