1 service · 3 calls/30d · numtheory.openverbs.com
numtheory.openverbs.com
Euler's totient φ(n) — the count of integers in [1, n] coprime to n — for a positive integer ≤ 10^15 (it is computed from the prime factorization).