Enter modulo statements

  

The following practice problem has been generated for you:

Using the Chinese Remainder Theorem, solve:

s ≡ 1 mod 11

s ≡ 2 mod 5

s ≡ 4 mod 8

s ≡ 3 mod 13