The Chinese remainder theorem can be extended to an arbitrary number of simultaneous congruences

x ai (mod ni), for i = 1, 2, . . . , k.

You will study independently this extension in the textbook and solve the following system.

x 3 (mod 11), x 5 (mod 23), x 7 (mod 13).