Thumbnail
Access Restriction
Subscribed

Author Good, Donald I. ♦ Ragland, Larry C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Euclidean algorithm ♦ Inductive assertion method ♦ Proof of algorithms ♦ Greatest common divisor
Abstract Subroutine GCDN, Algorithm 386 as described in [1, 2], computes the greatest common divisor, IGCD, of n integers A(1), … , A(n) by using the Euclidean algorithm to compute first gcd(A(1), A(2)), then gcd(gcd(A(1), A(2)), A(3)), etc. It also computes integer multipliers Z(1), … , Z(n) such that IGCD = ∑ni=1 A(i)Z(i).
Description Affiliation: Univ. of Texas at Austin, Austin (Ragland, Larry C.; Good, Donald I.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 4


Open content in new tab

   Open content in new tab
Source: ACM Digital Library