how can I prove that if gcd(a,m) == 1
then there exists module multiplicative inverse, and also there exists only 1 inverse
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | 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
Название |
---|
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$$$.