FIND ME ON

GitHub

LinkedIn

Chinese Remainder Theorem

🌱

Theorem
NumberTheory

Theorem

Suppose that m1,…,mkm_{1},\dots,m_{k} are mutually coprime integers and a1,…,aka_{1},\dots,a_{k} are prescribed integers. Then, the system of congruences x≔a1(modm1)ā‹®x≔ak(modmk)\begin{align*} x&\equiv a_{1}\pmod{m_{1}}\\ &\vdots\\ x&\equiv a_{k}\pmod{m_{k}} \end{align*}has a unique solution(modM)\pmod{M} where M=m1…mkM=m_{1}\dots m_{k}.