3.4-3.5 The Chinese Remainder Theorem & Modular Exponentiation

• I thought that the most interesting part was the technique to simplify the expression x^(a) (mod n). I had seen something similar but this is method is more practical when n is a large number.
• I thought the hardest part to understand was the Chinese Remainder Theorem. I was confused on how to find x when you have multiple congruencies.