Problem:
Find the smallest $x$ such that
$x \equiv 10 \pmod{13}$
$x \equiv 0 \pmod{3}$
$x \equiv 7 \pmod{14}$
Answer:
$231$
{'source': 'AMPS', 'file': 'amps/mathematica/number_theory/chinese_remainder_theorem/23416.txt'}