How does the Chinese Remainder Theorem Calculator work?
Free Chinese Remainder Theorem Calculator - Given a set of modulo equations in the form: x ≡ a mod b x ≡ c mod d x ≡ e mod f
the calculator will use the Chinese Remainder Theorem to find the lowest possible solution for x in each modulus equation. Given that the ni portions are not pairwise coprime and you entered two modulo equations, then the calculator will attempt to solve using the Method of Successive Subsitution This calculator has 1 input.
What 1 formula is used for the Chinese Remainder Theorem Calculator?