Greatest Common Divisor (GCD) Definition/Meaning:

Greatest Common Divisor of two integers m and n. The largest integer, d. that exactly divides both m and n. If d = 1 then m and n are said to be relatively prime. For example, the GCD of 18 and 24 is 6; 21 and 25 are relatively prime.

Near by Terms: Graceful Degradation Grammar Grandfather File, Grandfather Tape Granularity Graph Graphics Characters Gray Code Gray-Level Array Gray Scale Greatest Common Divisor (GCD) Greedy Method Greibach Normal Form Grosch's Law Group   Group Code Group Code Recording (GCR) Group Graph    Group Mark