Problem:
Find the smallest $x$ such that
$x \equiv 1 \pmod{2}$
$x \equiv 13 \pmod{9}$
$x \equiv 15 \pmod{19}$
$x \equiv 15 \pmod{7}$
Answer:
$1345$
{'source': 'AMPS', 'file': 'amps/mathematica/number_theory/chinese_remainder_theorem/24905.txt'}