Freaks City

Number Theory 1.1 Chinese Remainder Theorem Problem Statement Given a system of congruences: \[ \begin{cases} x \equiv a_1 \pmod{b_1} \\ x \equiv a_2 \pmod{b_2} \\ \vdots \\ x \equiv a_n \pmod{b_n} \end{cases} \] Find the smallest positive integer solution for \(x\), where \(b_i\) (for \(i \in [1,n]\)) are pairwise coprime. Theoretical Analy ...