Problem:
Find the smallest $x$ such that
$x \equiv 1 \pmod{11}$
$x \equiv 15 \pmod{3}$
$x \equiv 14 \pmod{20}$
$x \equiv 9 \pmod{19}$
Answer:
$11694$
{'source': 'AMPS', 'file': 'amps/mathematica/number_theory/chinese_remainder_theorem/25295.txt'}