An Assessment of Techniques for Proving Program Correctness
ACM Computing Surveys (CSUR)
Algorithm and bound for the greatest common divisor of n integers
Communications of the ACM
Algorithm 386: Greatest common divisor of n integers and multipliers
Communications of the ACM
Toward a man-machine system for proving program correctness
Toward a man-machine system for proving program correctness
| Hi-index | 48.22 |
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).