解n个同余式组是好多学科、好多部门经常碰到的一类问题。例如解雷达距离模糊就属于这类问题。本文在探讨了已有算法基础上,特提出一种解n个同余式组的通解么式,并指出可选用的方法总数及其各算法的计算公式。文中还指出,解同余式组的经典算法——中国余数定理(即孙子定理),仅是该通解公式众多算法中的一种特例而已。 Solution n congruence group is a lot of subjects, many departments often encounter a class of problems. For example, the ambiguity of radar coverage falls into this category. In this paper, based on the existing algorithms, this paper proposes a general solution for solving n congruence groups, and points out the total number of available methods and the formulas for calculating each algorithm. It is also pointed out in the paper that the classical algorithm of the solution congruence group, the Chinese remainder theorem (ie, the Sunzi theorem), is only a special case of many algorithms in this general solution.