Section 2.1 due on Sept 3

The most difficult part of the material was the concept of congruence classes. Theorem2.3 describes equal congruence classes, but aren't there only supposed to be n classes?

From what I do understand of congruence classes, it seems like a cool idea. It seems like it relates to the form that the division algorithm takes in because an integer is multiplied by something and then a remainder is added to get the desired integer.