引理:若
e
,
d
∈
Z
e,d\in\Z
e,d∈Z,且
e
=
d
q
+
r
e=dq+r
e=dq+r,其中
q
,
r
∈
Z
q,r\in\Z
q,r∈Z.则
(
e
,
d
)
=
(
d
,
r
)
(e,d)=(d,r)
(e,d)=(d,r).
定理(Euclid算法):设
a
,
b
∈
Z
+
a,b\in\Z^+
a,b∈Z+且
a
≥
b
a\ge b
a≥b,令
r
0
=
a
,
r
1
=
b
r_0=a,r_1=b
r0=a,r1=b满足
a
≥
b
>
0
a\ge b>0
a≥b>0,连续使用带余除法,得到
r
j
=
r
j
+
1
q
j
+
1
+
r
j
+
2
r_j=r_{j+1}q_{j+1}+r_{j+2}
rj=rj+1qj+1+rj+2且
0
<
r
j
+
2
<
r
j
+
1
(
j
=
0
,
1
,
2
,
⋯
 
,
n
−
2
)
,
r
n
+
1
=
0
0<r_{j+2}<r_{j+1}\quad (j=0,1,2,\cdots,n-2),\quad r_{n+1}=0
0<rj+2<rj+1(j=0,1,2,⋯,n−2),rn+1=0,则
(
a
,
b
)
=
r
n
(a,b)=r_n
(a,b)=rn,它是最后一个非零余数.
证明:令 r 0 = a , r 1 = b r_0=a,r_1=b r0=a,r1=b满足 a ≥ b > 0 a\ge b>0 a≥b>0,用带余除法: r 0 = r 1 q 1 + r 2 0 ≥ r 2 < r 1 r_0=r_1q_1+r_2 \quad 0\ge r_2<r_1 r0=r1q1+r20≥r2<r1 r 1 = r 2 q 2 + r 3 0 ≥ r 3 < r 2 r_1=r_2q_2+r_3 \quad 0\ge r_3<r_2 r1=r2q2+r30≥r3<r2 ⋮ \vdots ⋮ r j − 2 = r j − 1 q j − 1 + r j j − 2 ≥ r j < r j + 1 r_{j-2}=r_{j-1}q_{j-1}+r_j \quad j-2\ge r_j<r_{j+1} rj−2=rj−1qj−1+rjj−2≥rj<rj+1 ⋮ \vdots ⋮ r n − 2 = r n − 1 q n − 1 + r n n − 2 ≥ r n < r n + 1 r_{n-2}=r_{n-1}q_{n-1}+r_n \quad n-2\ge r_n<r_{n+1} rn−2=rn−1qn−1+rnn−2≥rn<rn+1 r n − 1 = r n q n r_{n-1}=r_nq_n rn−1=rnqn 序列 a = r 0 ≥ r 1 > r 2 > ⋯ ≥ 0 \displaystyle a=r_0\ge r_1>r_2>\cdots\ge 0 a=r0≥r1>r2>⋯≥0包含的项数不会超过 a a a,由引理和数学归纳法, ( a , b ) = ( r 0 , r 1 ) = ( r 1 , r 2 ) = ⋯ = ( r n − 1 , r n ) = ( r n , 0 ) = r n \displaystyle (a,b)=(r_0,r_1)=(r_1,r_2)=\cdots=(r_{n-1},r_n)=(r_n,0)=r_n (a,b)=(r0,r1)=(r1,r2)=⋯=(rn−1,rn)=(rn,0)=rn.
因此 ( a , b ) = r n \displaystyle (a,b)=r_n (a,b)=rn.
用相反的步骤可以求出 a , b a,b a,b的Bezout系数.
若 ( a , b ) = m a + n b (a,b)=ma+nb (a,b)=ma+nb,对于 ∀ t ∈ Z , ( a , b ) = ( m + t b ) a + ( n − t a ) b \displaystyle \forall t\in\Z,\quad (a,b)=(m+tb)a+(n-ta)b ∀t∈Z,(a,b)=(m+tb)a+(n−ta)b,所以 a , b a,b a,b的Bezout系数不是唯一的.