Euler Totient Solver
FunctionsMediumCompute Euler's Totient function φ(N) values and expand prime products.
Alt+Shift+0
Configuration Panel
Complexity Indices
Time ComplexityO(sqrt(N))
Auxiliary SpaceO(log N)
Conceptual Overview
Euler's totient function φ(N) counts positive integers up to N that are relatively prime (coprime) to N (i.e. gcd(i, N) = 1).
Source: CP-Algorithms reference guide