8.5, Due October 17

Difficult: The most difficult thing to do is to figure out what to do with the symmetric property. Reflexive and transitive seem to happen pretty similarly, but proving symmetry seems to be a little more difficult. It's helpful when you show us writing the skeleton and why you write what you do, so examples like that will be awesome.

Interesting: I thought it was pretty tricky when they showed that not every modulo relation a(congurent)b (mod n) has n equivalence classes. Like a^2(congruent)b^2 (mod 3) only has two distinct equivalence classes. It doesn't make sense intuitively, but it's pretty interesting and makes sense  when you prove it and such.