Number theory, least common multiple (LCM), greatest common divisor (GCD), primes, factorization, congruences, modular arithmetic.

- Compute the least common multiple and greatest common divisor.
- Apply Euclid’s algorithm
- Solve congruence systems using back substitution.