Noun
gcd (plural gcds)
(mathematics) Initialism of greatest common divisor.
GCD (plural GCDs)
Alternative letter-case form of gcd
A Bézout domain is thus a GCD domain, and (4) gives yet another proof that a PID is a UFD. Source: Internet
A key advantage of the Euclidean algorithm is that it can find the GCD efficiently without having to compute the prime factors. Source: Internet
An integral domain is a Bézout domain if and only if any two elements in it have a gcd that is a linear combination of the two. Source: Internet
Footnote 27, p. 9: "For example, the natural numbers with gcd (greatest common divisor) as meet and lcm (least common multiple) as join operation determine a (complete distributive) lattice." Source: Internet
In a unique factorization domain (or more generally, a GCD domain ), an irreducible element is a prime element. Source: Internet
Modern algorithmic techniques based on the Schönhage–Strassen algorithm for fast integer multiplication can be used to speed this up, leading to quasilinear algorithms for the GCD. Source: Internet