The most difficult part of the reading was trying to figure out how to actually do examples using the Chinese Remainder Theorem. Seeing one or two in class would be super helpful. The theorem and the proof are not that bad.
I really liked seeing how modular exponentiation can be used to find congruences for a massive power of 2 mod some number, without ever using a very large number. It's just a really neat mathematical "trick", and I'm guessing one that will come in handy when we discuss the RSA algorithm.
No comments:
Post a Comment