Problem:
Find the smallest $x$ such that
$x \equiv 15 \pmod{19}$
$x \equiv 6 \pmod{2}$
$x \equiv 3 \pmod{3}$
$x \equiv 0 \pmod{15}$
Answer:
$300$
{'source': 'AMPS', 'file': 'amps/mathematica/number_theory/chinese_remainder_theorem/2652.txt'}