Problem:
Find the smallest $x$ such that
$x \equiv 12 \pmod{13}$
$x \equiv 1 \pmod{6}$
$x \equiv 13 \pmod{15}$
Answer:
$103$
{'source': 'AMPS', 'file': 'amps/mathematica/number_theory/chinese_remainder_theorem/11900.txt'}