Tuesday, February 16, 2016

5.2 Due February 17

Difficult)))
It would be very challenging to fill out the tables.  When we did this for section 2 it was just exhaustive...but this would actually be really challenging to think through and do the division algorithm on each element for the multiplication tables.


Reflective)))
Um...the whole section is reflective of section 2.2...does that count?
Theorem 5.7 is a very cool introduction to the isomorphism that is created with the set of the modular classes that exist for the set of all congruence classes modulo p(x) is denoted.

I'm excited to go get to work on the homework problems and to do some practice problems on the sets.


No comments: