The most difficult part of this section for me was following the steps of the proof to Theorem 2.8 as it showed step 1 implied 2 and step 3 implied 1. Following the switch of notation during the proof was a little difficult for me because it made me have to remember exactly what they were talking about as I followed the proof, whether it be numbers or congruence classes.
I found the second part of Theorem 2.8 to be especially interesting. I just had never realized that and so it was really cool to learn. I also thought that Theorem 2.11 was a handy pattern that has been discovered. Both Theorems 2.8 and 2.11 reminded me of definitions/theorems in Linear Algebra regarding invertible matrices which was an interesting connection. It made me wonder if there is any sort of use to putting the multiplication/addition tables of the different congruence classes modulo n, into a matrix.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment