number-theory
Greatest common divisor via the Euclidean algorithm
taught
Taught in
-
The greatest common divisor and group structure
Group Theory
Requires
Required by
- Euler's totient function φ(n) required
- Generators of Z_n required
- Modular multiplicative inverses required
- When is a direct product cyclic? required
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.