greatest common divisor
<mathematics> (GCD) A function that returns the largest positive integer
that both arguments are integer multiples of.
See also Euclid's Algorithm. Compare: lowest common multiple.
(1999-11-02)
Nearby terms:
« GRE « greater than « greatest common divisor » greatest lower
bound » Great Renaming » Great Runes
|