Hello Alan: My "Chinese Remainder Theorem + Modular Multiplicative Inverse" computer code gives the solution as: n =12x + 9, where x =0, 1, 2, 3......etc. Since the value of "n" falls between 0 and 11, according to his/her question, then the smallest n = 9
