Euclidean Algorithm

(redirected from Euclid algorithm)

euclidean algorithm

[yü′klid·ē·ən ′al·gə‚rith·əm]
(mathematics)
A method of finding the greatest common divisor of a pair of integers.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

Euclidean Algorithm

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
In a special case, the working of the map corresponds to the Euclid algorithm and, more generally, to terms in the continuing fractions.
It is clear (at least in an informal way) that each version of Gauss algorithm is an extension of the (centered) Euclid algorithm:
This is the analog (for the F-EUCLID algorithm) of the celebrated Gauss density associated to the standard Euclid algorithm and equal to (1/ log 2)1/(1 + x).
These functionals [W.sub.(c)], [DELTA] are also central in the analysis of the bit-complexity of the Euclid Algorithm [16], [3].
Provide a precise description of the phase transition for the behaviour of the bitcomplexity between the Gauss algorithm for a valuation r [right arrow] -1 and the Euclid algorithm.