The most difficult part of this material was trying to understand congruence classes from this perspective. Trying to figure out possible remainders is a little more involved in some F[x]. I would like to know if there is some trick I am not quite understanding that would make me think about this stuff in a faster way. It seemed practically the same yet trying to figure out the equivalence classes for a particular polynomial actually helped me to better understand congruence classes in general.
The most interesting part of this material was observing just how much everything related to the class of integers modulo n. Almost every proof was similar to a past theorem we had already learned. I also thought it was interesting that there are n^k distinct congruence classes in the set of all congruence classes modulo p(x). This is a little different from what we learned before, but still very similar.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment