Greatest Common Divisor of n Integers and Multipliers (Algorithm C386) CACM April, 1973 Ragland, L. C. Good, D. I. proof of algorithms, greatest common divisor, Euclidean algorithm, inductive assertion method 3.15 4.42 5.10 5.24 CA730408 JB January 24, 1978 9:27 AM 2520 5 2520 2520 5 2520 2520 5 2520