Several methods are presented for determining the greatestcommon divisor of a set of positive integers by solving theninteger program: find the integers x. that minimize Z = E a.x.i = lsubject to Z 2: 1. The methods are programmed for use on a computerand compared with the Euclidean algorithm. Computational resultsand applications are given.
展开▼
机译：通过求解theninteger程序，提出了几种方法来确定一组正整数的最大公约数：找到整数x。使得Z = E a.x.i = 1最小化，但要遵循Z 2：1。这些方法被编程为可在计算机上使用，并与欧几里得算法进行比较。给出了计算结果和应用。
展开▼
