For $x,y\in\mathbb{R}$ define x ~ y to mean that $x-y\in\mathbb{Z}$. Prove that ~ is an equivalence relation on $\mathbb{R}$. Describe its equivalence classes.
I've successfully proved x ~ y relation is reflexive, symmetric and transitive.
What I'm not able to do is to describe the equivalence classes. In my view it can be
$\mathbb{Z}$ as every integer $x,y$ is $x~R~y$ as demonstrated above
or more specifically even $\mathbb{R}$ given that $x-y\in\mathbb{Z}$.
Am I missing something?