计算公因子和公倍数 算法（Algorithm for calculating common factor and common multiple）.docVIP

计算公因子和公倍数 算法（Algorithm for calculating common factor and common multiple） Well ordering principle: In Z+ each nonempty set X contains an integer a, which has a=x for all x in X. That is, there is a minimum element in X. Q+ and R+ do not have such properties. Division algorithm: If a, B, Z, and B! =0, if there exists an integer n such that a = b*n, then B and b|a divisible by a. In this case, B is called the a factor, or a is a multiple of B. The important properties of the division algorithm: For some x, y, Z, Z, y+z and a if x = divisible by integer x, y, Z in two, the a integer divisible left. Division: If a, B, Z, b0, there is only Q, R, Z, such that a = q*b + R. 0=rb. Common factor: The A, B and Z, if a positive integer C satisfying c|a and c|b, then C is called factors A and B. The greatest common factor: A, B, Z, a or =0! B! =0. C said, Z+ is the largest common factor of a and B, if (1) c|a and c|b (C for male factor A and b), and (2) for arbitrary a and B a common factor D, d|c. For all a, B, Z+, a and B of the greatest common factor exists, and only one, denoted as GCD (a, B). Theorem: For all a, B and Z+, there is only C in Z+, the C is the greatest common factor of a and B. Proof: given a, B, Z+, S = {a*s + b*t | s, t, Z+, a*s + b*t 0}. Because S! = phi, by order theorem S has a minimum element C. That C is the greatest common factor of a and b: Because the C in S, so for some x, y, Z c= a*x + b*y. Therefore, if D, Z and d|a, d|b, d| (ax+by), so d|c. If |a is a, c! = QC + R. The Q, R, Z+, and 0rc. There are r = a-q*c = a - q* (ax+by) = (1-qx) *a + (-qy) *b, so r in S, and that C is the smallest element of S contradiction, so c|a. Similarly, c|b. The C is not only a, the greatest common factor of B, and can be written as C = x*a + y*b. Coprime: GCD (a, b) = = 1 Euclidean algorithm: Let a, B, Z+. Let R0 = A and r1=b, and using N time division algorithm is as follows: R0 = q1*r1 + R2 (0=r2r1) R1 = q2*r2 + R3 (0=r3r2) R2 = q3*r3 + R4 (0=r4r3) ...... RI = qi+1