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 n_i portions are not pairwise coprime and you entered two modulo equations, then the calculator will attempt to solve using the Method of Successive Subsitution

Free Greatest Common Factor and Least Common Multiple Calculator - Given 2 or 3 numbers, the calculator determines the following:
* Greatest Common Factor (GCF) using Factor Pairs
* Rewrite Sum using the Distributive Property and factoring out the GCF
* Least Common Multiple (LCM) / Least Common Denominator (LCD) using Factor Pairs
* GCF using the method of Successive Division
* GCF using the Prime Factorization method
* Determine if the numbers are coprime and twin prime