Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

Jim_Moriarty_'s blog

Modular Inverse of Powers
By Jim_Moriarty_, history, 7 years ago, In English

Can anyone explain the relation between modular inverse of p^k and p^(k-1) given M. Any help would be appreciated.

  • Vote: I like it
  • -6
  • Vote: I do not like it

»
7 years ago, hide # |
← Rev. 3  
Vote: I like it +6 Vote: I do not like it

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

→ Reply
»
7 years ago, hide # |
 
Vote: I like it +6 Vote: I do not like it

$$${p^{k-1}}^{-1} \equiv p^{-(k-1)} \equiv p^{-k+1} \equiv {p^k}^{-1} \cdot p$$$

→ Reply