The Definition: Let $R$ be an equivalence relation on the set $A$. The set of all equivalence classes is denoted by $A/R$.
The hint I have been given: First, verify that $[5]_3$, $[7]_3$, and $[0]_3$ are three different elements of $\mathbb{Z}/ \equiv 3$. Then, verify that every $m \in \mathbb{Z}$ is in one of these sets. Then explain why those two facts imply that $[5]_3$, $[7]_3$, and $[0]_3$ are the only elements of $\mathbb{Z}/ \equiv 3$.
I am lost to how I should approach this problem or better yet how I should verify that "$[5]_3$, $[7]_3$, and $[0]_3$ are three different elements of $\mathbb{Z}/ \equiv 3$". Any help is appreciated.
Let's do it more generally. Prove that, when $n>0$,
With this at hand, we're almost done, after noticing that, by definition, $a$ is congruent modulo $n$ to the remainder of the division of $a$ by $n$.
Since the remainders are elements in $\{0,1,2,\dots,n-1\}$ and each integer is congruent to exactly one of these, the number of equivalence classes is $n$. Note that each one of these actually appears as a remainder, namely of the division of itself by $n$.