广义中国剩余定理及其Maple解法

An Algorithm for the Generalized Chinese Remainder Theorem and its Maple Programming

对于不要求模两两互素的一次同余式给出了相应的广义中国剩余定理及其程序解法。且计算速度快,尤其当模数很大时其高效性更加明显。

In this paper we give An Algorithm for the Generalized Chinese Remainder Theorem and the program of Maple programming to solve linear congruence without secuiring the moduli co-prime in pairs,and have very high speed of calculating, especially when the solution is very large.