how can I prove that if gcd(a,m) == 1
then there exists module multiplicative inverse, and also there exists only 1 inverse
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
how can I prove that if gcd(a,m) == 1
then there exists module multiplicative inverse, and also there exists only 1 inverse
Name |
---|
Proof of existence:
The equation $$$ax+mk=1$$$ always has solution if $$$\gcd(a,m)=1$$$ (Bézout's lemma), so $$$x\bmod m$$$ is a modular multiplicative inverse of $$$a$$$.
Proof of uniqueness:
Assume that $$$p,q\,(0\le p < q < m, q - p = k)$$$ are two modular multiplicative inverses of $$$a$$$. This means $$$ap\equiv aq\equiv 1\pmod{m}$$$. If $$$\gcd(a,m)=1$$$, then $$$p\equiv q\pmod{m}$$$. This implies $$$p=q$$$, which leads to a contradiction.
Consider $$$0 \cdot a, 1 \cdot a, 2 \cdot a, ..., (m - 1) \cdot a$$$ mod $$$m$$$. They are different, because if $$$a \cdot i = a \cdot j$$$, then $$$a \cdot (i - j) = 0$$$ mod $$$m$$$, which is impossible since $$$gcd(a, m) = 1$$$ and $$$|i - j| < m$$$. Then, there exists and only one $$$b$$$: such $$$a \cdot b = 1$$$ mod $$$m$$$.