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:

1. A cyclic group of order n has ϕ(n) generators
2. Sum of ϕ of divisors
3. Euler's Theorem Used in definition
4. ϕ is multiplicative

Info:

• Depth: 0
• Number of transitive dependencies: 0

Transitive dependencies: None