求解一次同余式组的快速算法

A Fast Algorthm of the solution of a System of Linear Congruences

对于不要求模两两互素的一次同余式组ｘ≡ｂ＿ｉ（ｍｏｄｍ＿ｉ），１≤ｉ≤ｋ，给出了一种新的快速解法，其特点是避免了传统解法中对各ｍ＿ｉ作标准分解，同时，也不需要预先判断解的存在性。

To solve a system of linear congruences x=b_i(modm_i),1≤i≤k,without requiring m_i co-prime in pairs.a new fast algorithm is established in this paper,which avoids finding the standardfactorization of every m_i as by the old method,and also dispenses with the verification of the exis-tence uf the solution at the first place.