Garner's algorithm solves a system for pairwise coprime moduli by constructing a mixed-radix expansionAfter fixing earlier digits, let and . The next digit is . Coprimality ensures that the modular inverse exists.
For , , and , giving modulo fifteen. The mixed-radix form constructs the Chinese remainder theorem solution incrementally.
New to topics? Read the docs here!