number-theory
Euler's totient function φ(n)
taught
Taught in
-
Euler's phi function
Group Theory
Requires
- gcd-euclidean-algorithm required
Required by
- Modular exponentiation required
- The group U(n) helpful
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.