# Show that $\mathrm{ord}_m(a)=\mathrm{ord}_m(b)$ if…

Let $\gcd(a,m)=1$ for some $m\ge1$. Then we know that $a$ has a multiplicative inverse modulo $m$. Let $b$ be such an inverse. Argue that $\mathrm{ord}_m(a)=\mathrm{ord}_m(b)$.

-
What have you tried? –  wj32 Oct 14 '12 at 1:30
Hint: Since for any positive integer $d$, $$1\equiv (ab)^d \equiv a^db^d \pmod{m},$$ we have $b^d\equiv 1\pmod{m}$ if and only if $a^d\equiv 1\pmod{m}$.
A hint. Let $x$ be the order of $a$. Then you have $$ab \equiv aa^{x-1} \equiv 1 \pmod m$$ From this you can conclude that $b\equiv a^{x-1} \pmod m$. Note that $\gcd(x,\ x-1)=1$. Can you conclude anything from this?