12.2.71 Number theory
condition: Using the Chinese remainder theorem, solve the system of comparisons: \[ \left\{\begin{array}{l} 7 x \equiv 3(\bmod 16) \\ 2 x \equiv 8(\bmod 17) \end{array}\right. \]
A huge number of interesting olympiad problems in number theory, and its various sections.