2.3 Due January 13

Difficult concept:
theorem 2.8 had a challenging proof concept map.  I spent 15 minutes working through the proof in order to catch onto the steps in the proof.  I really needed the illustration techniques explained in order to better write and formulate a proof.


Reflective:
the set of all congruence classes modulo p (where p is prime) is a powerful statement and I can see a lot of application for applying this to number theory.
I spent some time to memorize the theorem 2.8
let p > 0 then p is prime => for each a!=0 in Zp, ax = 1 has a solution in Zp =>
Whenever ab = 0 in Zp then a=0 or b=0 => that p is prime.
it can also be states that each of the three points of the theorem are equivalent for  p > 0.