Find the Greatest Common Divisor (GCD) of two numbers — the largest positive integer that divides both numbers without a remainder. Essential for fraction simplification and number theory.
Enter your values below
How this calculator works
The GCD is calculated using the Euclidean algorithm: repeatedly replace (a, b) with (b, a mod b) until b becomes 0. The result is the non-zero value. For example, GCD(48, 18) = 6.
Common questions about this calculator
