{modulo}
By Andrew Mckinney
Chinese Remainder TheoremFree 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
Congruence Modulo n
Free Congruence Modulo n Calculator - Given a possible congruence relation a ≡ b (mod n), this determines if the relation holds true (b is congruent to c modulo n).
Modulus
Free Modulus Calculator - Given 2 integers a and b, this modulo calculator determines a mod b or simplifies modular arithmetic such as 7 mod 3 + 5 mod 8 - 32 mod 5
