I think I'm missing something about equivalence classes here. My answer is very different from the books answer and I'm confused as to what is happening.
The task:
On the set of nonnegative integers, we can define a relation x (triple bar) y if and only if x mod 3 = y mod 3.
Use this this equivalence to partition the set {2, 4, 5, 6,9,22,24,25,31,37} into equivalence classes.
My answer: [0] = {6,9,24} [1] = {4,22,25,31,37} [2] = {2,5}
The books answer: [0] = {6,9,24} [1] = {1,4,25,31,37} [2] = {2,5,23}
My question: Where did 1 and 23 come from and where did 22 go? Aren't the union of all partitions supposed to equal the given set?
Edit: Fixed a typo.