chinese_remainder_theorem
chinese_remainder_theorem,
a MATLAB code which
implements the Chinese remainder theorem, which
reconstructs an integer from its remainders relative to a set of bases.
Licensing:
The information on this web page is distributed under the MIT license.
Languages:
chinese_remainder_theorem is available in
a MATLAB version and
an Octave version and
a Python version.
Related Data and Programs:
chinese_remainder_theorem_test
Source Code:
-
boolean_to_string.m,
returns "True" or "False", given a boolean value.
-
crt.m,
uses the Chinese Remainder Theorem to reconstruct a value F
such that F mod m(i) = r(i), for 1 <= i <= n.
-
i4vec_is_coprime.m,
is true if all pairs of entries of an I4VEC are coprime;
Last modified on 13 December 2020.