3.2 and 3.3, due September 3

1. Once again, I found some of the proofs to be difficult, especially as I still need to figure out in how much depth I need to understand them.  I also don't fully understand Extended Euler's, but because I have done it before, I think that if it comes up on homework, I should be able to figure it out.
2. I don't know if I've ever thought about fractions with modular arithmetic before.  I don't understand the benefit it provides, except perhaps that it is easier to write and nicer to look at.  It seems like it can cause problems if you're not careful (e.g. the GCD of the denominator and n is not 1).  I think in my work, I may use the book's other suggestions, either the a^-1, or just another integer that serves as the inverse.
   Who knows, maybe I'm wrong, maybe I will find the fraction notation very convenient.