i − 1 ∗ i ≡ 1 ( m o d p ) {\LARGE i^{-1}*i\equiv1 \pmod{p} } i−1∗i≡1(modp)
p
=
k
∗
i
+
r
(
k
=
⌊
p
i
⌋
)
(
r
=
p
m
o
d
i
)
\LARGE p=k*i+r(k=\left \lfloor \frac{p}{i} \right \rfloor ) (r=p \bmod i)
p=k∗i+r(k=⌊ip⌋)(r=pmodi)
k
∗
i
+
r
≡
0
(
m
o
d
p
)
{\LARGE k*i+r\equiv0 \pmod p }
k∗i+r≡0(modp)
k
∗
r
−
1
+
i
−
1
≡
0
(
m
o
d
p
)
{\LARGE k*r^{-1}+i^{-1}\equiv0 \pmod p }
k∗r−1+i−1≡0(modp)
i
−
1
≡
−
⌊
p
i
⌋
∗
p
m
o
d
i
(
m
o
d
p
)
{\LARGE i^{-1}\equiv -\left \lfloor \frac{p}{i} \right \rfloor*p \bmod i\pmod p }
i−1≡−⌊ip⌋∗pmodi(modp)
i
−
1
≡
(
p
−
p
/
i
)
∗
i
n
v
[
p
m
o
d
i
]
(
m
o
d
p
)
{\LARGE i^{-1}\equiv (p-p/i)*inv[p \ \ mod\ \ i]\pmod p }
i−1≡(p−p/i)∗inv[p mod i](modp)
阶乘逆元
i
n
v
[
i
+
1
]
=
1
(
i
+
1
)
!
inv[i+1]= \frac{1}{(i+1)!}
inv[i+1]=(i+1)!1
i n v [ i + 1 ] ∗ ( i + 1 ) = 1 i ! = i n v [ i ] {\LARGE \displaystyle inv[i+1]*(i+1)=\frac{1}{i!}=inv[i]} inv[i+1]∗(i+1)=i!1=inv[i]
870
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
