H" FILE 'GCD/BEZOUT.128' REVISED 1989 FEBRUARY 18" FOR THE COMMODORE 128 WITH 80 COLUMN SCREEN" JOHAN G. F. BELINFANTE ATLANTA, GA"" EXTENDED EUCLIDEAN ALGORITHM FINDS THE GREATEST COMMON DIVISOR (GCD)T" OF A AND B AND THE BEZOUT RELATION: GCD = N1 * A + N2 * B" REFERENCE: D. E. KNUTH, 'THE ART OF COMPUTER PROGRAMMING, VOL. 2," SEMINUMERICAL ALGORITHMS,' PAGE 302. :" "1ST NON-NEGATIVE INTEGER";A: N(0)A: N(1)1: N(2)0\"2ND NON-NEGATIVE INTEGER";B: D(0)B: D(1)0: D(2)1y D(0): Q(N(0)D(0))( I0 2: R(I)N(I)QD(I): N(I)D(I): D(I)R(I): I: 2"GREATEST COMMON DIVISOR = "N(0)" = "N(1)"*"A" + "N(2)"*"B