Using Gauss' Algorithm to solve simultaneous linear congruences for Chinese Remainder Theorem

Gauss' Algorithm to solve for Chinese Remainder Theorem (CRT)

You are now following this Submission

main executing reference usage: usage_GaussAlgoForCRT.m
This demo gives an insight to using the Gauss' Algorithm to solve simultaneous linear congruences for Chinese Remainder Theorem (CRT).
Caveat: For reference purposes.

Cite As

Michael Chan (2026). Using Gauss' Algorithm to solve simultaneous linear congruences for Chinese Remainder Theorem (https://www.mathworks.com/matlabcentral/fileexchange/47026-using-gauss-algorithm-to-solve-simultaneous-linear-congruences-for-chinese-remainder-theorem), MATLAB Central File Exchange. Retrieved .

Categories

Find more on Numerical Integration and Differential Equations in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Version Published Release Notes Action
1.2.0.0

Extend to support multiple linear congruences apart from just 3 previously.

1.1.0.0

Added modinv.m required by the package.

1.0.0.0