Number Theory I

Number Theory Level pending

Find the Smallest Positive Integer \(x\) Such that

\(\begin{cases} x \equiv 5 (mod 7)\\ x \equiv 7 (mod 11)\\ x \equiv 3 (mod 13)\\ \end{cases}\)

×

Problem Loading...

Note Loading...

Set Loading...