2.3, due January 14

This section was...interesting. I had a time following the proofs the first go around so I had to reread them, much more carefully the second go around.  I thought the prrof of Theorem 2.8 was intersting how they did (1) --> (2), then (2) --> (3), and finally (3) --> (1).  I did a proof like this in one of my MTHED classes and it was one of my favorite proofs from the course.  Using one part of a theorem to prove another part seems like a much simpler and more comprhensible of proving the theorem as a whole.  I think it's pretty cool that when n is prime you can find specific answers to modular arithmetic problems in Z_n.  When n is not prime though there could be multiple solutions, which is interesting, but I much prefer solving problems with one solution and knowing that it is right.