Garner's algorithm solves a system for pairwise coprime moduli by constructing a mixed-radix expansion
After 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.

Articles by others on the same topic (0)

There are currently no matching articles.