线性系统理论-Euclid算法.docVIP

来源：/blue/Euclid.shtml Euclids Algorithm Euclids algorithm appears as the solution to the Proposition VII.2 in the Elements: Given two numbers not prime to one another, to find their greatest common measure. The algorithm is based on the following two observations: If b|a then gcd(a, b) = b. This is indeed so because no number (b, in particular) may have a divisor greater than the number itself (I am talking here of non-negative integers.) If a = bt + r, for integers t and r, then gcd(a, b) = gcd(b, r). Indeed, every common divisor of a and b also divides r. Thus gcd(a, b) divides r. But, of course, gcd(a, b)|b. Therefore, gcd(a, b) is a common divisor of b and r and hence gcd(a, b)gcd(b, r). The reverse is also true because every divisor of b and r also divides a. Example Let a = 2322, b = 654. 2322 = 654*3 + 360 ?? gcd(2322, 654) = gcd(654, 360) 654 = 360*1 + 294 ?? gcd(654, 360) = gcd(360, 294) 360 = 294*1 + 66 ?? gcd(360, 294) = gcd(294, 66) 294 = 66*4 + 30 ?? gcd(294, 66) = gcd(66, 30) 66 = 30*2 + 6 ?? gcd(66, 30) = gcd(30, 6) 30 = 6*5 ?? gcd(30, 6) = 6 Therefore, gcd(2322,654) = 6. For any pair a and b, the algorithm is bound to terminate since every new step generates a similar problem (that of finding gcd) for a pair of smaller integers. Let Eulen(a,b) denote the length of the Euclidean algorithm for a pair a,b. Eulen(2322, 654) = 6, Eulen(30, 6) = 1. Ill use this notation in the proof of the following very important consequence of the algorithm: Corollary For every pair of whole numbers a and b there exist two integers s and t such that as + bt = gcd(a, b). Example 2322×20 + 654×(-71) = 6. Proof Let a b. The proof is by induction on Eulen(a, b). If Eulen(a, b) = 1, i.e., if b|a, then a = bu for an integer u. Hence, a + (1 - u)b = b = gcd(a, b). We can take s = 1 and t = 1 - u. Assume the Corollary has been established for all pairs of numbers for which Eulen is less than n. Let Eulen(a, b) = n. Apply one step of the algorithm: a = bu + r. Eulen