Can anyone explain the relation between modular inverse of p^k and p^(k-1) given M. Any help would be appreciated.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Can anyone explain the relation between modular inverse of p^k and p^(k-1) given M. Any help would be appreciated.
Name |
---|
if m is prime we have Fermat's little theorem :
$$$ (p^{k}) ^ {m - 1} \equiv 1 mod m $$$
$$$ (p^{k}) ^ {m - 2} \equiv p^{-k} mod m $$$
$$$ (p^{k - 1}) ^ {m - 2} p ^ {m - 2} \equiv p^{-k} mod m $$$
$$$ p^{-k + 1} p ^ {m - 2} \equiv p^{-k} mod m $$$
$$$ p^{-k + 1} p ^ {-1} \equiv p^{-k} mod m $$$
if m is not prime see Euler's theorem
also, check modular-inverce cp algorithms
$$${p^{k-1}}^{-1} \equiv p^{-(k-1)} \equiv p^{-k+1} \equiv {p^k}^{-1} \cdot p$$$