2.2, due January 10

1. Difficult: I have a hard time understanding when a problem says _n. I often mix up what exactly that "n" means. I know that it literally means "integers mod n" but unless an equation is actually WRITTEN in the form of I easily get confused. I also have a hard time understanding when equivalence classes are written as equal to each other. I.E. I'm not exactly sure what it means when I see something like: [4]=[8].
2. Relative: I already knew theorem 2.3, which shates that a is congruent to c (mod n) if and only if [a] is congruent to [c]. However, I don't think I EVER realized how easy it is to find all of the different elements in an equivalence class! The examples in this section state that if you want to find all of the values in equivalence class [2] most 3, then you just take all values 2+3k for k in the integers. Looking at that I thought, well DUH, because you'll have a 2 remainder, but I never thought it was that easy! I remember being in 290 and testing value after value after value to see which equivalence class it was in. If I had known this I would have had my homework done in half the time!