Unverified Commit 275560ed authored by Siyuan's avatar Siyuan Committed by GitHub
Browse files

Update inverse.md

parent 10f25161
Loading
Loading
Loading
Loading
+1 −3
Original line number Diff line number Diff line
@@ -29,12 +29,10 @@ void exgcd(int a,int b,int c,int &x,int &y){

### 快速幂法:

这个要运用费马小定理:
这个要运用 [费马小定理](https://oi-wiki.org/math/fermat/)

> 若 $p$ 为质数,$a$ 为正整数,且 $a$、$p$ 互质,则 $a^{p-1} \equiv 1 \pmod p$。

关于费马小定理在[这里]()

因为 $ax \equiv 1 \pmod b$;

所以 $ax \equiv a^{b-1} \pmod b$(根据费马小定理);