In the book I'm reading it says that there exist elements with multiplicative inverses in a integer ring if $gcd(a,m)=1$ where $a$ is the element and $m$ is the modulo.
The inverse $a^{-1}$ is defined such that $a \times a^{-1} \equiv 1$ mod $m$
Also it says that if an inverse exist for $a$ we can divide this element since $b/a \equiv b \times a^{-1}$ mod $m$
I'm confused as to what $b$ is in this case? My guess right now is that it is another member in one of the equivalence classes for the modulos $m$.