## greatest common divisor

(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.

(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.