What is GCD?
The Greatest Common Divisor (GCD) is the largest number that divides two or more integers without leaving a remainder. It is very useful for simplifying fractions, solving math problems, and in programming algorithms.
Examples:
- MDC(12, 18) = 6
- MDC(48, 18) = 6
- MDC(15, 25, 35) = 5
Formula: GCD(a, b) = largest number that divides both a and b