CRT Basic

Problem - 4200

Find the smallest positive integer $n$ such that $$\left\{  \begin{array}{l} n\equiv 1\pmod{3} \\ n\equiv 3\pmod{5} \\ n\equiv 5\pmod{7} \end{array} \right.$$


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error