同余_费马小定理_逆元

以下内容均在自然数范围讨论

1. 同余

1.1. 由定义得

$$\begin{gathered} (1)kp+r\equiv r(\mathrm{mod}p) \\ (2)若a\equiv b(\mathrm{mod}p)且a\le b，则p|(b-a) \end{gathered}$$

1.2. 加法和减法

$$a\pm b\equiv a\mathrm{mod}p\pm b\mathrm{mod}p(\mathrm{mod}p)$$
证明：
$$\begin{gathered} 设a=k_{a}p+a^{\prime } \\ b=k_{b}p+b^{\prime } \\ \therefore a\mathrm{mod}p=a^{\prime },b\mathrm{mod}p=b^{\prime }, \\ a\pm b=(k_a\pm k_b)p+a^{\prime }\pm b^{\prime } \\ \therefore a\pm b\equiv a^{\prime }\pm b^{\prime }(\mathrm{mod}p) \\ \therefore a\pm b\equiv a\mathrm{mod}p\pm b\mathrm{mod}p(\mathrm{mod}p) \end{gathered}$$

1.3. 乘法

$$ab\equiv (a\mathrm{mod}p)(b\mathrm{mod}p)(\mathrm{mod}p)$$
证明：
$$\begin{gathered} 设a=k_{a}p+a^{\prime } \\ b=k_{b}p+b^{\prime } \\ \therefore a\mathrm{mod}p=a^{\prime },b\mathrm{mod}p=b^{\prime }, \\ ab=(k_{a}p+a^{\prime })(k_{b}p+b^{\prime })=k_a{k}_b{p}^2+k_a{b}^{\prime }p+k_b{a}^{\prime }p+a^{\prime }{b}^{\prime } \\ \therefore ab\equiv a^{\prime }{b}^{\prime }(\mathrm{mod}p) \\ \therefore ab\equiv (a\mathrm{mod}p)(b\mathrm{mod}p)(\mathrm{mod}p) \end{gathered}$$

2. 费马小定理

$$\begin{gathered} 若p为素数且\gcd (a,p)=1 \\ 则a^{p-1}\equiv 1(\mathrm{mod}p) \end{gathered}$$
证明：
设 f ( i ) = i , g ( i ) = i a , ( i ∈ [ 1 , p − 1 ] ∩ Z ) ∴ { y ∣ y = f ( i )   m o d   p } = [ 1 , p − 1 ] ∩ Z 设 1 ≤ j < k ≤ p − 1 ∵ g c d ( a , p ) = 1 , k − j < p − 1 ∴ ( k − j ) a ≠ k p ∴ g ( k ) − g ( j ) ≠ k p ∴ g ( k ) ≢ g ( j ) ( m o d p ) ∵ g ( i )   m o d   p ∈ [ 1 , p − 1 ] ∩ Z ∴ { y ∣ y = g ( i )   m o d   p } = [ 1 , p − 1 ] ∩ Z ∴ ∏ f ( i ) ≡ ∏ g ( i ) ( m o d p ) ∴ ( p − 1 ) ! ≡ ( p − 1 ) ! a p − 1 ( m o d p ) ∴ ( p − 1 ) ! ( a p − 1 − 1 ) = k p ∵ p 是质数 ∴ ( p − 1 ) !   m o d   p ≠ 0 ∴ a p − 1 − 1 = k p ∴ a p − 1 − 1 ≡ 0 ( m o d p ) ∴ a p − 1 ≡ 1 ( m o d p ) 设f(i)=i,g(i)=ia,(i\in[1,p-1]\cap Z) \\ \therefore\{y|y=f(i)\bmod p\}=[1,p-1]\cap Z \\ 设1\le j<k\le p-1 \\ \because \mathrm{gcd}(a,p)=1,k-j<p-1 \\ \therefore (k-j)a\neq kp \\ \therefore g(k)-g(j)\neq kp \\ \therefore g(k)\not\equiv g(j) \pmod p \\ \because g(i)\bmod p \in[1,p-1]\cap Z \\ \therefore \{y|y=g(i)\bmod p\}=[1,p-1]\cap Z \\ \therefore \prod f(i) \equiv \prod g(i) \pmod p \\ \therefore (p-1)!\equiv (p-1)!a^{p-1} \pmod p \\ \therefore (p-1)!(a^{p-1}-1)=kp \\ \because p是质数 \\ \therefore (p-1)! \bmod p\neq 0 \\ \therefore a^{p-1}-1=kp \\ \therefore a^{p-1}-1 \equiv 0 \pmod p \\ \therefore a^{p-1}\equiv 1 \pmod p 设f(i)=i,g(i)=ia,(i∈[1,p−1]∩Z)∴{y∣y=f(i)modp}=[1,p−1]∩Z设1≤j<k≤p−1∵gcd(a,p)=1,k−j<p−1∴(k−j)a=kp∴g(k)−g(j)=kp∴g(k)≡g(j)(modp)∵g(i)modp∈[1,p−1]∩Z∴{y∣y=g(i)modp}=[1,p−1]∩Z∴∏f(i)≡∏g(i)(modp)∴(p−1)!≡(p−1)!ap−1(modp)∴(p−1)!(ap−1−1)=kp∵p是质数∴(p−1)!modp=0∴ap−1−1=kp∴ap−1−1≡0(modp)∴ap−1≡1(modp)

3. 逆元（除法取模）

$$\begin{gathered} 若p为素数 \\ \frac{a}{b}\equiv a{b}^{p-2}(\mathrm{mod}p) \end{gathered}$$
证明
$$\begin{gathered} \because b^{p-1}\equiv 1(\mathrm{mod}p) \\ \therefore b\cdot b^{p-2}\equiv 1(\mathrm{mod}p) \\ \therefore \frac{a}{b}b\cdot b^{p-2}\equiv \frac{a}{b}(\mathrm{mod}p) \\ \therefore a{b}^{p-2}\equiv \frac{a}{b}(\mathrm{mod}p) \end{gathered}$$