Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Can anyone show me how to find invertible elements in $\mathbb{Z}/m\mathbb{Z}$, $m$ is say $28$?

Also I'm not very clear about what it mean by 'invertible element in $\mathbb{Z}/m\mathbb{Z}$'

share|cite|improve this question
up vote 5 down vote accepted

An invertible element is one which has a "buddy" whom when operated together, produces the identity. In short, if $a\in\mathbb{Z}/m\mathbb{Z}$ is an invertible element, then there exist a $b\in\mathbb{Z}/m\mathbb{Z}$ such that $$ab\equiv1\mod m$$

Expressing the congruence in the usual way, we have $$ab+km=1$$ for some $k\in\mathbb{Z}$.

So, can you see how we can try to use relative primes, the Euclidean algorithm etc. ?

share|cite|improve this answer
so any number that's coprime with m is invertible? – Arch1tect Jan 22 '14 at 7:12
Yup! Well done! – BlackAdder Jan 22 '14 at 7:13
Well and creatively worded indeed! +1! – mathematics2x2life Jan 22 '14 at 7:30

An element, $x\in\mathbb{Z}_m$ is invertible if there is another element $y\in\mathbb{Z}_m$ such that $xy \equiv 1 (mod\ m)$.

An element is invertible iff it is relatively prime with $m$. For example, with $m = 28$, $4$ is not invertible because $\gcd(28,4) = 4$, but $17$ is, because $\gcd(28,17) = 1$.

share|cite|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.