Euler's Totient Function
Dependencies: None
Euler's totient function $\phi(n)$ is the number of numbers smaller than $n$ and coprime to $n$.
Dependency for:
- Sum of ϕ of divisors
- ϕ is multiplicative
- Euler's Theorem Used in definition
- A cyclic group of order n has ϕ(n) generators
Info:
- Depth: 0
- Number of transitive dependencies: 0