Note: On #14 (which needs the general form of the Chinese Remainder Theorem), your search will probably lead you to problem 3.13.24. Its step 3 should say x = a1y1z1 + ... akykzk (mod m1m2...mk)
Some of these will be mostly or all written, but do submit a printout of your program (or a transcript of your Matlab/Maple session) and your results where appropriate.