Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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)$.

share|improve this question
What have you tried? –  wj32 Oct 14 '12 at 1:30

2 Answers 2

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}$.

share|improve this answer

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?

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.