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

< Previous Terms |
Terms Containing greatest common divisor |
Next Terms > |

gray code gray-scale GRE greater than |
Euclid's Algorithm |
greatest lower bound Great Renaming Great Runes Great Worm greek |