2.1, due on January 9

Difficult: Section 2.1 is difficult because, although it makes sense, it is difficult to remember because it isn't something I've used a lot. Divisibility and factoring from the previous sections are part of regular arithmetic that I've used my whole life. It's second nature to me. But modular arithmetic is something I've only used on occasion. Since I don't remember it well, it's going to be hard to use in proofs.

Reflective: Modular arithmetic is interesting because I've actually used it in Computer Science 124 (java programming) a few times. So I know it has practical application. Also it's interesting to see how it matches up with remainders. I wonder, too, how it applies to rings, groups, or both.