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.

Last updated: 1999-11-02

Nearby terms:

greater than ♦ greatest common divisor ♦ greatest lower bound ♦ Great Renaming

Try this search on Wikipedia, Wiktionary, Google, OneLook.

Loading