chinese_remainder_theorem(moduli: list[int], remainders: list[int]) -> list[int]
Uses the fast powering algorithm to exponentiate a number modulus.
\( a^b \equiv x \mod m \)