Groups
Category
Fast exponentiation (binary exponentiation) computes a^n using repeated squaring in O(log n) multiplications.
The Chinese Remainder Theorem (CRT) reconstructs an integer from its remainders modulo pairwise coprime moduli and guarantees a unique answer modulo the product.