Chicago Cubs and modular arithmetic

Find the smallest integer x>15 x>15 satisfying x15(mod77)x15(mod286). \begin{aligned} x &\equiv 15 \pmod{77} \\ x &\equiv 15 \pmod{286}. \end{aligned}

×

Problem Loading...

Note Loading...

Set Loading...