给博客引个流:https://blog.slightwind.cn/
打LaTeX太费手了,这篇文章已经停止维护(因为我已经考完啦)
第 1 章
1. 设 a = 1859 , b = 1573 , a=1859, \quad b=1573, a=1859,b=1573, 计算 s , t , s, t, s,t, 使得 a s + b t = ( a , b ) a s+b t=(a, b) as+bt=(a,b) 。
运用广义欧几里得除法:
1859
=
1
⋅
1573
+
286
1573
=
5
⋅
286
+
143
286
=
2
⋅
143
+
0
\begin{array}{rr} 1859&=&1 \cdot 1573&+&286 \\ 1573&=&5 \cdot 286&+&143 \\ 286&=&2 \cdot 143&+&0 \end{array}
18591573286===1⋅15735⋅2862⋅143+++2861430
然后:
143
=
(
−
5
)
⋅
286
+
1573
=
(
−
5
)
⋅
(
(
−
1
)
⋅
1573
+
1859
)
+
1573
=
6
⋅
1573
+
(
−
5
)
⋅
1573
=
(
−
5
)
⋅
1859
+
6
⋅
1573
\begin{array}{rr} 143&=&(-5) \cdot 286&+&1573 \\ &=&(-5) \cdot ((-1)\cdot 1573+1859)&+&1573 \\ &=&6\cdot 1573&+&(-5)\cdot 1573 \\ &=&(-5)\cdot 1859&+&6\cdot 1573 \end{array}
143====(−5)⋅286(−5)⋅((−1)⋅1573+1859)6⋅1573(−5)⋅1859++++15731573(−5)⋅15736⋅1573
因此,整数
s
=
−
5
,
t
=
6
s=-5,t=6
s=−5,t=6 使得
a
s
+
b
t
=
(
a
,
b
)
.
as+bt=(a,b).
as+bt=(a,b).
2. 最大公约数 (4655, 12075)=
运用广义欧几里得除法:
12075
=
2
⋅
4655
+
2765
4655
=
1
⋅
2765
+
1890
2765
=
1
⋅
1890
+
875
1890
=
2
⋅
875
+
140
875
=
6
⋅
140
+
35
140
=
4
⋅
35
+
0
\begin{array}{rr} 12075&=&2 \cdot 4655&+&2765 \\ 4655&=&1 \cdot 2765&+&1890 \\ 2765&=&1 \cdot 1890&+&875 \\ 1890&=&2 \cdot 875&+&140 \\ 875&=&6 \cdot 140&+&35 \\ 140&=&4 \cdot 35&+&0 \end{array}
12075465527651890875140======2⋅46551⋅27651⋅18902⋅8756⋅1404⋅35++++++27651890875140350
所以
(
4655
,
12075
)
=
35
(4655, 12075) = 35
(4655,12075)=35.
3. 满足 125 x + 17 y = ( 125 , 17 ) 125 x+17 y=(125,17) 125x+17y=(125,17) 的 x x x 和 y y y 分别为
运用广义欧几里得除法:
125
=
7
⋅
17
+
6
17
=
2
⋅
6
+
5
6
=
1
⋅
5
+
1
5
=
5
⋅
1
+
0
\begin{array}{rr} 125&=&7 \cdot 17&+&6 \\ 17&=&2 \cdot 6&+&5 \\ 6&=&1 \cdot 5&+&1 \\ 5&=&5 \cdot 1&+&0 \end{array}
1251765====7⋅172⋅61⋅55⋅1++++6510
所以
(
125
,
17
)
=
1.
(125, 17) = 1.
(125,17)=1.
1
=
(
−
1
)
⋅
5
+
6
=
(
−
1
)
⋅
(
(
−
2
)
⋅
6
+
17
)
+
6
=
3
⋅
6
+
(
−
1
)
⋅
17
=
3
⋅
(
(
−
7
)
⋅
17
+
125
)
+
(
−
1
)
⋅
17
=
3
⋅
125
+
(
−
22
)
⋅
17
\begin{array}{rr} 1&=&(-1) \cdot 5&+&6 \\ &=&(-1) \cdot ((-2)\cdot 6+17)&+&6 \\ &=&3\cdot 6&+&(-1)\cdot 17 \\ &=&3\cdot ((-7)\cdot 17+125)&+&(-1)\cdot 17\\ &=&3\cdot 125&+&(-22)\cdot 17 \end{array}
1=====(−1)⋅5(−1)⋅((−2)⋅6+17)3⋅63⋅((−7)⋅17+125)3⋅125+++++66(−1)⋅17(−1)⋅17(−22)⋅17
因此,整数
x
=
3
,
y
=
−
22
x=3,y=-22
x=3,y=−22 使得
125
x
+
17
y
=
(
125
,
17
)
.
125x+17y=(125,17).
125x+17y=(125,17).
4. a , b a, b a,b 是两个正整数,则其最小公倍数 [ a , b ] = a ⋅ b ( a , b ) [a, b]=\frac{a\cdot b}{(a,b)} [a,b]=(a,b)a⋅b
5. 设 a , b a, b a,b 是两个正整数,且有素因数分解:
a = p 1 α 1 ⋯ p s α s , α i ≥ 0 ; b = p 1 β 1 ⋯ p s β s , β i ≥ 0 ; i = 1 , … , s \large a=p_{1}^{\alpha_{1}} \cdots p_{s}^{\alpha_{s}}, \alpha_{i} \geq 0 ; \quad b=p_{1}^{\beta_{1}} \cdots p_{s}^{\beta_{s}}, \beta_{i} \geq 0 ; \quad i=1, \ldots, s a=p1α1⋯psαs,αi≥0;b=p1β1⋯psβs,βi≥0;i=1,…,s
则其最小公倍数 [ a , b ] = [a, b]= [a,b]= 最大公约数 ( a , b ) = (a, b)= (a,b)=
[ a , b ] = p 1 max ( α 1 , β 1 ) ⋯ p s max ( α s , β s ) \large [a, b]=p_{1}^{\max(\alpha_{1},\beta_{1})} \cdots p_{s}^{\max(\alpha_{s},\beta_{s})} [a,b]=p1max(α1,β1)⋯psmax(αs,βs)
( a , b ) = p 1 min ( α 1 , β 1 ) ⋯ p s min ( α s , β s ) \large (a, b)=p_{1}^{\min(\alpha_{1},\beta_{1})} \cdots p_{s}^{\min(\alpha_{s},\beta_{s})} (a,b)=p1min(α1,β1)⋯psmin(αs,βs)
6. 证明: 任意三个连续整数的乘积都被 6 整除。
对于任意的 n ∈ Z n\in Z n∈Z,三个连续整数乘积为 ( n − 1 ) ⋅ n ⋅ ( n + 1 ) (n-1)\cdot n\cdot (n+1) (n−1)⋅n⋅(n+1),
- n = 2 k , k ∈ Z n=2k,k\in Z n=2k,k∈Z 时, 2 k 2k 2k 是 2 2 2 的倍数,所以 2 | ( n − 1 ) ⋅ n ⋅ ( n + 1 ) . 2|(n-1)\cdot n\cdot (n+1). 2|(n−1)⋅n⋅(n+1).
- n = 2 k + 1 , k ∈ Z n=2k+1,k\in Z n=2k+1,k∈Z 时, n − 1 = 2 k n-1=2k n−1=2k 是 2 2 2 的倍数,所以 2 | ( n − 1 ) ⋅ n ⋅ ( n + 1 ) . 2|(n-1)\cdot n\cdot (n+1). 2|(n−1)⋅n⋅(n+1).
所以对于任意的 n ∈ Z n\in Z n∈Z,有 2 | ( n − 1 ) ⋅ n ⋅ ( n + 1 ) . 2|(n-1)\cdot n\cdot (n+1). 2|(n−1)⋅n⋅(n+1). ①
- n = 3 k , k ∈ Z n=3k,k\in Z n=3k,k∈Z 时, 3 k 3k 3k 是 3 3 3 的倍数,所以 3 | ( n − 1 ) ⋅ n ⋅ ( n + 1 ) . 3|(n-1)\cdot n\cdot (n+1). 3|(n−1)⋅n⋅(n+1).
- n = 3 k + 1 , k ∈ Z n=3k+1,k\in Z n=3k+1,k∈Z 时, n − 1 = 3 k n-1=3k n−1=3k 是 3 3 3 的倍数,所以 3 | ( n − 1 ) ⋅ n ⋅ ( n + 1 ) . 3|(n-1)\cdot n\cdot (n+1). 3|(n−1)⋅n⋅(n+1).
- n = 3 k + 2 , k ∈ Z n=3k+2,k\in Z n=3k+2,k∈Z 时, n + 1 = 3 k + 3 n+1=3k+3 n+1=3k+3 是 3 3 3 的倍数,所以 3 | ( n − 1 ) ⋅ n ⋅ ( n + 1 ) . 3|(n-1)\cdot n\cdot (n+1). 3|(n−1)⋅n⋅(n+1).
所以对于任意的 n ∈ Z n\in Z n∈Z,有 3 ∣ ( n − 1 ) ⋅ n ⋅ ( n + 1 ) . 3|(n-1)\cdot n\cdot (n+1). 3∣(n−1)⋅n⋅(n+1). ②
由①②且 ( 2 , 3 ) = 1 (2,3)=1 (2,3)=1,所以 6 ∣ ( n − 1 ) ⋅ n ⋅ ( n + 1 ) . 6|(n-1)\cdot n\cdot (n+1). 6∣(n−1)⋅n⋅(n+1). 所以任意三个连续整数的乘积都被 6 整除。
7. 设 m > n m>n m>n 是正整数,证明 2 n − 1 ∣ 2 m − 1 2^{n}-1 \mid 2^{m}-1 2n−1∣2m−1 的充要条件是 n ∣ m n \mid m n∣m 。
充分性:
已知
n
∣
m
n|m
n∣m 成立,即有
m
=
q
n
m=q n
m=qn,则
2
m
−
1
=
2
q
n
−
1
=
(
2
n
−
1
)
[
2
n
(
q
−
1
)
+
2
n
(
q
−
2
)
+
⋯
+
2
n
+
1
]
=
(
2
n
−
1
)
k
\begin{aligned} 2^{m}-1 &=2^{q n}-1 \\ &=\left(2^{n}-1\right)\left[2^{n(q-1)}+2^{n(q-2)}+\cdots+2^n+1]\right.\\ &=\left(2^{n}-1\right) k \end{aligned}
2m−1=2qn−1=(2n−1)[2n(q−1)+2n(q−2)+⋯+2n+1]=(2n−1)k
因此
2
m
−
1
2^{m}-1
2m−1 可以整除
2
n
−
1
2^{n}-1
2n−1
必要性:
已知
2
m
−
1
2^{m}-1
2m−1 可以整除
2
n
−
1
2^{n}-1
2n−1,则
2
m
−
1
=
(
2
n
−
1
)
k
=
(
2
n
−
1
)
[
2
n
(
q
−
1
)
+
2
n
(
q
−
2
)
+
⋯
+
2
n
+
1
]
=
2
q
n
−
1
\begin{aligned} 2^{m}-1 &=\left(2^{n}-1\right) k \\ &=\left(2^{n}-1\right)\left[2^{n(q-1)}+2^{n(q-2)}+\cdots+2^{n}+1]\right.\\ &=2^{q n}-1 \\ \end{aligned}
2m−1=(2n−1)k=(2n−1)[2n(q−1)+2n(q−2)+⋯+2n+1]=2qn−1
所以
x
m
=
x
q
n
x^{m}= x^{q n}
xm=xqn,
m
=
q
n
m=q n
m=qn
因此 m m m 能够整除 n n n 成立
8. 设 a = 666 , b = 1414 , a=666, \quad b=1414, a=666,b=1414, 计算 s , t , s, t, s,t, 使得 a s + b t = ( a , b ) a s+b t=(a, b) as+bt=(a,b) 。
运用广义欧几里得除法:
1414
=
2
⋅
666
+
82
666
=
8
⋅
82
+
10
82
=
8
⋅
10
+
2
10
=
5
⋅
2
+
0
\begin{array}{rr} 1414&=&2 \cdot 666&+&82 \\ 666&=&8 \cdot 82&+&10 \\ 82&=&8 \cdot 10&+&2 \\ 10&=&5 \cdot 2&+&0 \end{array}
14146668210====2⋅6668⋅828⋅105⋅2++++821020
所以
(
a
,
b
)
=
2
(a, b)=2
(a,b)=2
2
=
(
−
8
)
⋅
10
+
82
=
(
−
8
)
⋅
(
(
−
8
)
⋅
82
+
666
)
+
82
=
(
−
8
)
⋅
666
+
65
⋅
82
=
(
−
8
)
⋅
666
+
65
⋅
(
(
−
2
)
⋅
666
+
1414
)
=
(
−
138
)
⋅
666
+
65
⋅
1414
\begin{array}{rr} 2&=&(-8) \cdot 10&+&82 \\ &=&(-8) \cdot ((-8) \cdot 82+666)&+&82 \\ &=&(-8) \cdot 666&+&65\cdot 82 \\ &=&(-8) \cdot 666&+&65\cdot ((-2)\cdot 666 + 1414) \\ &=&(-138) \cdot 666&+&65\cdot 1414 \\ \end{array}
2=====(−8)⋅10(−8)⋅((−8)⋅82+666)(−8)⋅666(−8)⋅666(−138)⋅666+++++828265⋅8265⋅((−2)⋅666+1414)65⋅1414
因此,整数
s
=
−
138
,
t
=
65
s=-138,t=65
s=−138,t=65 使得
a
s
+
b
t
=
(
a
,
b
)
.
as+bt=(a,b).
as+bt=(a,b).
9. 证明: 17 \sqrt{17} 17 是无理数。
假设 17 \sqrt{17} 17 是有理数, 则 ∃ p , q , \exists\ p, q, ∃ p,q, 使 17 = p q \sqrt{17}=\frac{p}{q} 17=qp,
所以存在互质的 p , q , p 2 = 17 q 2 p, q, p^{2}=17 q^{2} p,q,p2=17q2 ,素数 17 17 17 能够整除 p 2 p^2 p2,所以 17 17 17 也能整除 p p p,
由于 q 2 = p 2 17 q^{2}=\frac{p^{2}}{17} q2=17p2 ,所以素数 17 17 17 能够整除 q 2 q^2 q2,那么 17 17 17 也能整除 q q q,
所以 p p p 和 q q q 存在最大公因数 17. 17. 17. 与 p , q p, q p,q 互质矛盾,假设不成立, 17 \sqrt{17} 17 是无理数得证。
第 2 章
1. 设 m = 13 m=13 m=13 ,则其绝对值最小完全剩余系(简化剩余系等)为 { − 6 , − 5 , − 4 , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , 4 , 5 , 6 } \{-6,-5,-4,-3,-2,-1,0,1,2,3,4,5,6\} {−6,−5,−4,−3,−2,−1,0,1,2,3,4,5,6}
2. 写出模 21 的简化剩余系 { 1 , 2 , 4 , 5 , 8 , 10 , 11 , 13 , 16 , 17 , 19 , 20 } \{1,2,4,5,8,10,11,13,16,17,19,20\} {1,2,4,5,8,10,11,13,16,17,19,20}
3. 写出模 9 的完全剩余系(每个数为偶数) { 0 , 2 , 4 , 6 , 8 , 10 , 12 , 14 , 16 } \{0,2,4,6,8,10,12,14,16\} {0,2,4,6,8,10,12,14,16}
4. 证明: 设 m 1 , m 2 m_{1}, m_{2} m1,m2 是两个互素的正整数,若 k 1 , k 2 k_{1}, k_{2} k1,k2 分别遍历 m 1 , m 2 m_{1}, m_{2} m1,m2 的完全剩余系,则
m 1 ⋅ k 2 + m 2 ⋅ k 1 m_{1} \cdot k_{2}+m_{2} \cdot k_{1} m1⋅k2+m2⋅k1 遍历模 m 1 m 2 m_{1} m_{2} m1m2 的完全剩余系。
5. φ ( 450 ) = 120 \varphi(450)=120 φ(450)=120
先分解 450 = 2 ⋅ 3 2 ⋅ 5 2 450=2 \cdot 3^2 \cdot 5^2 450=2⋅32⋅52,所以 φ ( 450 ) = ( 2 − 1 ) ( 3 − 1 ) ( 5 − 1 ) ⋅ 3 ⋅ 5 = 120 \varphi(450)=(2-1)(3-1)(5-1)\cdot 3\cdot 5=120 φ(450)=(2−1)(3−1)(5−1)⋅3⋅5=120.
6. 利用模平方算法计算 50 1 13 m o d 667 501^{13} \bmod 667 50113mod667; 31 2 13 m o d 667 312^{13} \bmod 667 31213mod667
50 1 13 m o d 667 = 163 501^{13} \bmod 667=163 50113mod667=163
31 2 13 m o d 667 = 468 312^{13} \bmod 667=468 31213mod667=468
7. 证明: 如果 p , q p, q p,q 是不同的素数,则 p q − 1 + q p − 1 ≡ 1 ( m o d p q ) p^{q-1}+q^{p-1} \equiv 1(\bmod p q) pq−1+qp−1≡1(modpq) 。
因为p,q是不同的素数,由费马小定理,有 q p − 1 ≡ 1 m o d p , p q − 1 ≡ 1 m o d q q^{p-1}\equiv 1\bmod p,\ p^{q-1}\equiv 1\bmod q qp−1≡1modp, pq−1≡1modq,
所以存在 k 1 , k 2 ∈ Z k_1,k_2 \in Z k1,k2∈Z,使 q p − 1 − 1 = k 1 p , p q − 1 − 1 = k 2 q . q^{p-1}-1=k_1p,\ p^{q-1}-1=k_2q. qp−1−1=k1p, pq−1−1=k2q.
所以 ( q p − 1 − 1 ) ⋅ ( p q − 1 − 1 ) = k 1 k 2 p q (q^{p-1}-1)\cdot (p^{q-1}-1)=k_1k_2pq (qp−1−1)⋅(pq−1−1)=k1k2pq,等式两边对 p q pq pq 取模得 p q − 1 + q p − 1 ≡ 1 ( m o d p q ) p^{q-1}+q^{p-1} \equiv 1(\bmod p q) pq−1+qp−1≡1(modpq)
8. 2003 年 5 月 9 日是星期五,则第 2 20080509 2^{20080509} 220080509 天是星期____
由费马小定理, 2 6 ≡ 1 m o d 7 2^6\equiv 1\bmod 7 26≡1mod7, 20080509 m o d 6 = 3 , 2 3 m o d 7 = 1 20080509\bmod 6=3,\ 2^3\bmod 7=1 20080509mod6=3, 23mod7=1,星期六
9. 求 8 ⋅ 9 ⋅ 10 ⋅ 11 ⋅ 12 ⋅ 13 m o d 7 = 6 8 \cdot 9 \cdot 10 \cdot 11 \cdot 12 \cdot 13 \bmod 7=6 8⋅9⋅10⋅11⋅12⋅13mod7=6
威尔逊(Wilson)定理: ( p − 1 ) ! ≡ − 1 m o d p . (p-1)!\equiv -1\bmod p. (p−1)!≡−1modp.
8 ⋅ 9 ⋅ 10 ⋅ 11 ⋅ 12 ⋅ 13 ≡ 6 ! ≡ − 1 ≡ 6 m o d 7 8 \cdot 9 \cdot 10 \cdot 11 \cdot 12 \cdot 13\equiv 6!\equiv-1\equiv 6\bmod 7 8⋅9⋅10⋅11⋅12⋅13≡6!≡−1≡6mod7
10. 证明: 如果 c 1 , c 2 , … , c φ ( m ) c_{1}, c_{2}, \ldots, c_{\varphi(m)} c1,c2,…,cφ(m) 是模 m m m 的简化剩余系,则 c 1 + c 2 + … + c φ ( m ) ≡ 0 ( m o d m ) c_{1}+c_{2}+\ldots+c_{\varphi(m)} \equiv 0(\bmod m) c1+c2+…+cφ(m)≡0(modm) 。
11. 证明对任意的整数 a , ( a , 561 ) = 1 , a, \quad(a, 561)=1, a,(a,561)=1, 都有 a 560 ≡ 1 m o d 561 , a^{560} \equiv 1\bmod 561, a560≡1mod561, 但 561 561 561 是合数。
12. 设 a , b , c , m a,b,c,m a,b,c,m 是正整数, m > 1 , ( b , m ) = 1 \mathrm{m}>1, \quad(b, m)=1 m>1,(b,m)=1 并且 b a ≡ 1 m o d m , b c ≡ 1 m o d m , b^{a} \equiv 1 \bmod m, \quad b^{c} \equiv 1 \bmod m, ba≡1modm,bc≡1modm, 记 d = ( a , c ) , d=(a, c), d=(a,c), 证明 b d ≡ 1 m o d m ∘ b^{d} \equiv 1 \bmod m_{\circ} bd≡1modm∘
第 3 章
1. 求解一次同余式 33 x ≡ 44 ( m o d 121 ) ; 127 x ≡ 833 ( m o d 1012 ) 。 33 x \equiv 44(\bmod 121) ; 127 x \equiv 833(\bmod 1012) 。 33x≡44(mod121);127x≡833(mod1012)。
33
x
≡
44
(
m
o
d
121
)
33 x \equiv 44(\bmod 121)
33x≡44(mod121):解
33
x
−
121
y
=
44
33x-121y=44
33x−121y=44,
121
=
3
⋅
33
+
22
33
=
1
⋅
22
+
11
22
=
2
⋅
11
+
0
\begin{array}{rr} 121&=&3 \cdot 33&+&22 \\ 33&=&1 \cdot 22&+&11 \\ 22&=&2 \cdot 11&+&0 \end{array}
1213322===3⋅331⋅222⋅11+++22110
所以
(
33
,
121
)
=
11.
(33,121)=11.
(33,121)=11.
11
=
(
−
1
)
⋅
22
+
33
=
(
−
1
)
⋅
(
(
−
3
)
⋅
33
+
121
)
+
33
=
(
−
1
)
⋅
121
+
4
⋅
33
\begin{array}{rr} 11&=&(-1) \cdot 22&+&33 \\ &=&(-1) \cdot ((-3)\cdot 33+121)&+&33 \\ &=&(-1)\cdot 121 &+& 4\cdot 33 \end{array}
11===(−1)⋅22(−1)⋅((−3)⋅33+121)(−1)⋅121+++33334⋅33
33
⋅
4
−
121
⋅
1
=
11
33\cdot 4-121\cdot 1=11
33⋅4−121⋅1=11,
4
(
33
⋅
4
−
121
⋅
1
)
=
44
4(33\cdot 4-121\cdot 1)=44
4(33⋅4−121⋅1)=44,
x
=
5
+
11
k
,
k
=
1
,
2
,
⋯
,
10
x=5+11k,k=1,2,\cdots,10
x=5+11k,k=1,2,⋯,10
127
x
≡
833
(
m
o
d
1012
)
127 x \equiv 833(\bmod 1012)
127x≡833(mod1012):
127
x
−
1012
y
=
833
127x-1012y=833
127x−1012y=833
1012
=
7
⋅
127
+
123
127
=
1
⋅
123
+
4
123
=
30
⋅
4
+
3
4
=
1
⋅
3
+
1
3
=
3
⋅
1
+
0
\begin{array}{rr} 1012&=&7 \cdot 127&+&123 \\ 127&=&1 \cdot 123&+&4 \\ 123&=&30 \cdot 4&+&3 \\ 4&=&1 \cdot 3&+&1 \\ 3&=&3 \cdot 1&+&0 \end{array}
101212712343=====7⋅1271⋅12330⋅41⋅33⋅1+++++1234310
所以
(
127
,
1012
)
=
1
(127,1012)=1
(127,1012)=1
1
=
(
−
1
)
⋅
3
+
4
=
(
−
1
)
⋅
(
(
−
30
)
⋅
4
+
123
)
+
4
=
(
−
1
)
⋅
123
+
31
⋅
4
=
(
−
1
)
⋅
123
+
31
⋅
(
(
−
1
)
⋅
123
+
127
)
=
(
−
32
)
⋅
123
+
31
⋅
127
=
(
−
32
)
⋅
(
(
−
7
)
⋅
127
+
1012
)
+
31
⋅
127
=
(
−
32
)
⋅
1012
+
255
⋅
127
\begin{array}{rr} 1&=&(-1) \cdot 3&+&4 \\ &=&(-1) \cdot ((-30)\cdot4+123)&+&4 \\ &=&(-1) \cdot 123&+&31\cdot 4 \\ &=&(-1) \cdot 123&+&31\cdot ((-1)\cdot 123+127) \\ &=&(-32) \cdot 123&+&31\cdot127 \\ &=&(-32) \cdot ((-7)\cdot 127+1012)&+&31\cdot127 \\ &=&(-32) \cdot 1012&+&255\cdot127 \\ \end{array}
1=======(−1)⋅3(−1)⋅((−30)⋅4+123)(−1)⋅123(−1)⋅123(−32)⋅123(−32)⋅((−7)⋅127+1012)(−32)⋅1012+++++++4431⋅431⋅((−1)⋅123+127)31⋅12731⋅127255⋅127
所以127的逆元是255,
x
=
255
⋅
833
m
o
d
1012
=
907.
x=255\cdot833\bmod 1012=907.
x=255⋅833mod1012=907.
2. 将同余式方程 23 x ≡ 1 m o d 140 23 x \equiv 1\bmod140 23x≡1mod140 化为同余式方程组,并用中国剩余定理求解。
{ 23 x ≡ 1 ( m o d 2 ) 23 x ≡ 1 ( m o d 2 ) 23 x ≡ 1 ( m o d 5 ) 23 x ≡ 1 ( m o d 7 ) \left\{\begin{array}{l}23x \equiv 1(\bmod 2) \\23x \equiv 1(\bmod 2) \\ 23x \equiv 1(\bmod 5) \\ 23x \equiv 1(\bmod 7)\end{array}\right. ⎩ ⎨ ⎧23x≡1(mod2)23x≡1(mod2)23x≡1(mod5)23x≡1(mod7) => { x ≡ 1 ( m o d 2 ) x ≡ 2 ( m o d 5 ) x ≡ 4 ( m o d 7 ) \left\{\begin{array}{l}x \equiv 1(\bmod 2) \\ x \equiv 2(\bmod 5) \\ x \equiv 4(\bmod 7)\end{array}\right. ⎩ ⎨ ⎧x≡1(mod2)x≡2(mod5)x≡4(mod7) M 1 = 35 , M 2 = 28 , M 3 = 20 M_1=35,M_2=28,M_3=20 M1=35,M2=28,M3=20
x = 1 ⋅ 35 ⋅ 1 + 2 ⋅ 28 ⋅ 2 + 4 ⋅ 20 ⋅ 6 m o d 140 = 627 m o d 140 = 67 x=1\cdot 35\cdot 1+2\cdot 28\cdot 2+4\cdot 20\cdot 6\bmod 140=627\bmod 140=67 x=1⋅35⋅1+2⋅28⋅2+4⋅20⋅6mod140=627mod140=67
x ≡ 67 m o d 140 x\equiv 67\bmod 140 x≡67mod140
3. 解同余方程组 { x ≡ 1 ( m o d 5 ) x ≡ 5 ( m o d 6 ) x ≡ 4 ( m o d 7 ) \left\{\begin{array}{l}x \equiv 1(\bmod 5) \\ x \equiv 5(\bmod 6) \\ x \equiv 4(\bmod 7)\end{array}\right. ⎩ ⎨ ⎧x≡1(mod5)x≡5(mod6)x≡4(mod7)
m = 5 ⋅ 6 ⋅ 7 = 210 , M 1 = 42 , M 2 = 35 , M 3 = 30 m=5\cdot 6\cdot 7=210,M_1=42,M_2=35,M_3=30 m=5⋅6⋅7=210,M1=42,M2=35,M3=30
x = 1 ⋅ 42 ⋅ 3 + 5 ⋅ 35 ⋅ 5 + 4 ⋅ 30 ⋅ 4 m o d 210 = 1481 m o d 210 = 11 m o d 210 x=1\cdot 42\cdot 3 + 5\cdot 35\cdot 5 + 4\cdot 30\cdot 4 \bmod 210=1481\bmod 210=11\bmod 210 x=1⋅42⋅3+5⋅35⋅5+4⋅30⋅4mod210=1481mod210=11mod210
x ≡ 11 m o d 210 x\equiv 11\bmod 210 x≡11mod210
4. 同余方程 x 4 + 7 x + 4 ≡ 0 ( m o d 3 ) x^{4}+7 x+4 \equiv 0(\bmod 3) x4+7x+4≡0(mod3) 的解为
由欧拉定理 x 2 ≡ 1 m o d 3 x^2\equiv 1\bmod 3 x2≡1mod3,所以 x 4 ≡ 1 m o d 3 x^4\equiv 1\bmod 3 x4≡1mod3. 1 + 7 x + 4 ≡ 0 ( m o d 3 ) 1+7x+4\equiv 0(\bmod 3) 1+7x+4≡0(mod3)
7 x ≡ − 5 ≡ 1 ( m o d 3 ) 7x\equiv -5\equiv 1(\bmod 3) 7x≡−5≡1(mod3),即求解 7 x ≡ 1 ( m o d 3 ) 7x\equiv 1(\bmod 3) 7x≡1(mod3),可以枚举一下 0 , 1 , 2 0,1,2 0,1,2,发现只有 x ≡ 1 m o d 3 x\equiv1\bmod 3 x≡1mod3 成立。
所以解为 x ≡ 1 ( m o d 3 ) . x\equiv 1 (\bmod 3). x≡1(mod3).
5. (判断) 同余方程的解数一定不超过同余方程的次数: 错
参考《信息安全数学基础》P109 - 3.3.1 高次同余式的解数
P110 - 例 3.3.1, 四次同余式,有 6 个解,解数超过了次数。
第 4 章
1. 计算 ( 6 53 ) ; ( 137 227 ) ; ( 17 37 ) \left(\frac{6}{53}\right) ;\left(\frac{137}{227}\right) ;\left(\frac{17}{37}\right) (536);(227137);(3717)
( 6 53 ) = ( 2 53 ) ⋅ ( 3 53 ) = ( − 1 ) ⋅ ( 2 3 ) = ( − 1 ) ⋅ ( − 1 ) = 1 \left(\frac{6}{53}\right)=\left(\frac{2}{53}\right)\cdot\left(\frac{3}{53}\right)=(-1)\cdot \left(\frac{2}{3}\right)=(-1)\cdot(-1)=1 (536)=(532)⋅(533)=(−1)⋅(32)=(−1)⋅(−1)=1
( 137 227 ) = ( 227 137 ) = ( 90 137 ) = ( 2 137 ) ⋅ ( 3 137 ) ⋅ ( 3 137 ) ⋅ ( 5 137 ) = ( 1 ) ⋅ ( 1 ) ⋅ ( 2 5 ) = − 1 \left(\frac{137}{227}\right)=\left(\frac{227}{137}\right)=\left(\frac{90}{137}\right)=\left(\frac{2}{137}\right)\cdot\left(\frac{3}{137}\right)\cdot\left(\frac{3}{137}\right)\cdot \left(\frac{5}{137}\right)=(1)\cdot(1)\cdot\left(\frac{2}{5}\right)=-1 (227137)=(137227)=(13790)=(1372)⋅(1373)⋅(1373)⋅(1375)=(1)⋅(1)⋅(52)=−1
( 17 37 ) = ( 3 17 ) = ( 2 5 ) = − 1 \left(\frac{17}{37}\right)=\left(\frac{3}{17}\right)=\left(\frac{2}{5}\right)=-1 (3717)=(173)=(52)=−1
2. 求所有的奇素数,它以 5 5 5 为其二次非剩余。
( 5 p ) = ( p 5 ) = − 1 \left(\frac{5}{p}\right)=\left(\frac{p}{5}\right)=-1 (p5)=(5p)=−1, p ≡ 2 m o d 5 p\equiv 2\bmod 5 p≡2mod5 或 p ≡ 3 m o d 5 p\equiv 3\bmod 5 p≡3mod5
3. x 2 ≡ − 2 ( m o d 67 ) x^{2} \equiv-2(\bmod 67) x2≡−2(mod67) 的解数为
( − 2 67 ) = ( − 1 67 ) ⋅ ( 2 67 ) = ( − 1 ) ⋅ ( − 1 ) = 1 \left(\frac{-2}{67}\right)=\left(\frac{-1}{67}\right)\cdot\left(\frac{2}{67}\right)=(-1)\cdot(-1)=1 (67−2)=(67−1)⋅(672)=(−1)⋅(−1)=1,解数为 2. 2. 2.
4. 求所有奇素数 p p p, 它以 3 3 3 为其二次剩余。
( 3 p ) = ( p 3 ) ⋅ ( − 1 ) p − 1 2 = 1. \left(\frac{3}{p}\right)=\left(\frac{p}{3}\right)\cdot(-1)^{\frac{p-1}{2}}=1. (p3)=(3p)⋅(−1)2p−1=1.
p ≡ 1 m o d 4 p\equiv 1\bmod 4 p≡1mod4 且 p ≡ 1 m o d 3 p\equiv 1\bmod 3 p≡1mod3,即 p ≡ 1 m o d 12. p\equiv 1\bmod 12. p≡1mod12.
p ≡ − 1 m o d 4 p\equiv -1\bmod 4 p≡−1mod4 且 p ≡ − 1 m o d 3 p\equiv -1\bmod 3 p≡−1mod3,即 p ≡ − 1 m o d 12. p\equiv -1\bmod 12. p≡−1mod12.
所以 p ≡ ± 1 m o d 12. p\equiv ±1\bmod 12. p≡±1mod12.
5. 已知素数 p p p 满足 p ≡ 3 ( m o d 4 ) , x 2 ≡ a ( m o d p ) p \equiv 3(\bmod 4), \quad x^{2} \equiv a(\bmod p) p≡3(mod4),x2≡a(modp) 有解,则解是 ± a p + 1 4 ±a^{\frac{p+1}{4}} ±a4p+1
6. 已知素数 p = 47 p=47 p=47 ,则其二次剩余的个数为 23
47 − 1 2 = 23 \frac{47-1}{2}=23 247−1=23
7. 已知 p p p 是奇素数,证明: 模 p p p 的所有二次剩余的乘积对模 p p p 的剩余是 ( − 1 ) ( p + 1 ) / 2 (-1)^{(p+1) / 2} (−1)(p+1)/2 。
1 2 ⋅ 2 2 ⋅ 3 2 ⋯ ( p − 1 2 ) 2 ≡ ( − 1 ) p − 1 2 ⋅ 1 ⋅ 2 ⋅ 3 ⋯ ( p − 1 2 ) ⋅ ( − p − 1 2 ) ⋯ ( − 3 ) ⋅ ( − 2 ) ⋅ ( − 1 ) ( m o d p ) ≡ ( − 1 ) p − 1 2 ⋅ 1 ⋅ 2 ⋅ 3 ⋯ ( p − 1 ) ( m o d p ) ≡ ( − 1 ) p − 1 2 ( p − 1 ) ! ( m o d p ) ≡ ( − 1 ) p − 1 2 ( − 1 ) ( m o d p ) ≡ ( − 1 ) p + 1 2 ( m o d p ) \begin{aligned} 1^2\cdot 2^2\cdot 3^2\cdots(\frac{p-1}{2})^2 &\equiv (-1)^{\frac{p-1}{2}}\cdot 1\cdot2\cdot3\cdots (\frac{p-1}{2})\cdot(-\frac{p-1}{2})\cdots(-3)\cdot(-2)\cdot(-1)&(\bmod\ p)&\\ &\equiv (-1)^{\frac{p-1}{2}}\cdot1\cdot2\cdot3\cdots(p-1)&(\bmod\ p)&\\ &\equiv (-1)^{\frac{p-1}{2}}(p-1)!&(\bmod\ p)&\\ &\equiv (-1)^{\frac{p-1}{2}}(-1)&(\bmod\ p)&\\ &\equiv (-1)^{\frac{p+1}{2}}&(\bmod\ p)& \end{aligned} 12⋅22⋅32⋯(2p−1)2≡(−1)2p−1⋅1⋅2⋅3⋯(2p−1)⋅(−2p−1)⋯(−3)⋅(−2)⋅(−1)≡(−1)2p−1⋅1⋅2⋅3⋯(p−1)≡(−1)2p−1(p−1)!≡(−1)2p−1(−1)≡(−1)2p+1(mod p)(mod p)(mod p)(mod p)(mod p)
8. p p p 是奇素数,求模 p p p 的所有二次剩余之和对模 p \mathrm{p} p 的剩余。
模 p p p 的二次剩余之和为 1 2 + 2 2 + 3 2 + ⋯ + ( p − 1 2 ) 2 = ( p − 1 ) ⋅ p ⋅ ( p + 1 ) 24 . 1^2+2^2+3^2+\cdots +\left(\frac{p-1}{2}\right)^2=\frac{(p-1)\cdot p\cdot (p+1)}{24}. 12+22+32+⋯+(2p−1)2=24(p−1)⋅p⋅(p+1).
因为 p p p 一定为奇数,所以 ( p + 1 ) , ( p − 1 ) (p+1),(p-1) (p+1),(p−1) 中有一个能被 4 4 4 整除,另外一个一定被 2 2 2 整除,所以 8 8 8 能够整除 ( p + 1 ) ⋅ ( p − 1 ) . (p+1)\cdot (p-1). (p+1)⋅(p−1).
另外只要 p p p 不是 3 3 3 的倍数,那么 ( p + 1 ) ⋅ ( p − 1 ) (p+1)\cdot (p-1) (p+1)⋅(p−1) 就能被 3 3 3 整除。
所以当 p p p 不是 3 3 3 的倍数时, 24 ∣ ( p + 1 ) ⋅ ( p − 1 ) 24|(p+1)\cdot (p-1) 24∣(p+1)⋅(p−1) ,所以此时 p ∣ ( p − 1 ) ⋅ p ⋅ ( p + 1 ) 24 p|\frac{(p-1)\cdot p\cdot (p+1)}{24} p∣24(p−1)⋅p⋅(p+1), ( ( p − 1 ) ⋅ p ⋅ ( p + 1 ) 24 p ) = 0. \left(\frac{\frac{(p-1)\cdot p\cdot (p+1)}{24}}{p}\right)=0. (p24(p−1)⋅p⋅(p+1))=0.
素数 p p p 是 3 3 3 的倍数即 p = 3 p=3 p=3 时,二次剩余之和为 1 1 1, ( 1 p ) = 1. \left(\frac{1}{p}\right)=1. (p1)=1.
9. 设 a a a 和 b b b 是正奇数,求 ( 2 a 4 a + b ) \left(\frac{2 a}{4 a+b}\right) (4a+b2a) 和 ( a b ) \left(\frac{a}{b}\right) (ba) 之间的关系。
( 2 a 4 a + b ) = ( − 1 ) ⋅ ( 2 b ) ⋅ ( a b ) \left(\frac{2 a}{4 a+b}\right)=(-1)\cdot\left(\frac{2}{b}\right)\cdot\left(\frac{a}{b}\right) (4a+b2a)=(−1)⋅(b2)⋅(ba)
第 5 章
1. 已知 g g g 是模 19 19 19 的原根,则 g 3 g^{3} g3 模 19 19 19 的指数为
o r d ( g 3 ) = o r d ( g ) ( 3 , o r d ( g ) ) = φ ( 19 ) ( 3 , φ ( 19 ) ) = 18 3 = 6 ord(g^3)=\frac{ord(g)}{(3,ord(g))}=\frac{\varphi(19)}{(3,\varphi(19))}=\frac{18}{3}=6 ord(g3)=(3,ord(g))ord(g)=(3,φ(19))φ(19)=318=6
2. 模 53 53 53 的最小正原根为
φ ( m ) = φ ( 53 ) = 52 = 2 2 ⋅ 13 , q 1 = 2 , q 2 = 13 \varphi(m)=\varphi(53)=52=2^2\cdot 13,q_1=2,q_2=13 φ(m)=φ(53)=52=22⋅13,q1=2,q2=13,因此 φ ( m ) / q 1 = 26 , φ ( m ) / q 2 = 4. \varphi(m)/q_1=26,\varphi(m)/q_2=4. φ(m)/q1=26,φ(m)/q2=4.
2 4 ≡ 16 , 2 26 ≡ 52 ≡ − 1 ( m o d 53 ) . 2^4\equiv 16,2^{26}\equiv 52\equiv -1(\bmod\ 53). 24≡16,226≡52≡−1(mod 53).
所以模 53 53 53 的最小正原根为 2. 2. 2.
3. 3 3 3 模 19 19 19 的指数为 18
φ ( 19 ) = 18 = 2 ⋅ 3 2 , 3 9 ≡ 18 m o d 19 , 3 2 ≡ 9 m o d 19 , 3 18 ≡ 1 m o d 19 , o r d 19 ( 3 ) = 18 \varphi(19)=18=2\cdot 3^2, 3^9\equiv 18\bmod\ 19,3^2\equiv 9\bmod 19,3^{18}\equiv 1\bmod\ 19,ord_{19}(3)=18 φ(19)=18=2⋅32,39≡18mod 19,32≡9mod19,318≡1mod 19,ord19(3)=18
4. 求模 43 43 43 的所有原根。
φ ( 43 ) = 42 = 2 ⋅ 3 ⋅ 7 , q 1 = 2 , q 2 = 3 , q 3 = 7 , 42 q 1 = 21 , 42 q 2 = 14 , 42 q 3 = 6. \varphi(43)=42=2\cdot 3\cdot 7,q_1=2,q_2=3,q_3=7,\frac{42}{q_1}=21,\frac{42}{q_2}=14,\frac{42}{q_3}=6. φ(43)=42=2⋅3⋅7,q1=2,q2=3,q3=7,q142=21,q242=14,q342=6.
2 21 ≡ 42 , 2 14 ≡ 1 2^{21}\equiv 42,2^{14}\equiv 1 221≡42,214≡1
3 21 ≡ 42 , 3 14 ≡ 36 , 3 6 ≡ 41 , ( m o d 43 ) 3^{21}\equiv 42,3^{14}\equiv 36,3^{6}\equiv 41,(\bmod\ 43) 321≡42,314≡36,36≡41,(mod 43)
所以 3 3 3 是模 p p p 的原根。
遍历 ( d , p − 1 ) = 1 (d,p-1)=1 (d,p−1)=1 时模 42 的简化剩余系: 1 , 5 , 11 , 13 , 17 , 19 , 23 , 25 , 29 , 31 , 37 , 41. 1,5,11,13,17,19,23,25,29,31,37,41. 1,5,11,13,17,19,23,25,29,31,37,41. 共 φ ( p − 1 ) = φ ( 42 ) = 1 ⋅ 2 ⋅ 6 = 12 \varphi(p-1)=\varphi(42)=1\cdot 2\cdot 6=12 φ(p−1)=φ(42)=1⋅2⋅6=12 个。
所有原根为: 3 1 ≡ 3 , 3 5 ≡ 28 , 3 11 ≡ 30 , 3 13 ≡ 12 , 3 17 ≡ 26 , 3 19 ≡ 19 , 3 23 ≡ 34 , 3 25 ≡ 5 , 3 29 ≡ 18 , 3 31 ≡ 33 , 3 37 ≡ 20 , 3 41 ≡ 29 ( m o d 43 ) 3^1\equiv3,3^5\equiv 28,3^{11}\equiv 30,3^{13}\equiv 12,3^{17}\equiv 26,3^{19}\equiv 19,3^{23}\equiv 34,3^{25}\equiv 5,3^{29}\equiv 18,3^{31}\equiv 33,3^{37}\equiv 20,3^{41}\equiv 29(\bmod\ 43) 31≡3,35≡28,311≡30,313≡12,317≡26,319≡19,323≡34,325≡5,329≡18,331≡33,337≡20,341≡29(mod 43)
5. 模 m m m 存在原根的充要条件是 m = 2 , 4 , p α , 2 p α m= 2,4,p^{\alpha},2p^{\alpha} m=2,4,pα,2pα
P187