GCD Calculator – Greatest Common Divisor
Find the Greatest Common Divisor (GCD) of two numbers.
How It Works
Enter two positive integers. The tool uses the Euclidean algorithm to find their GCD efficiently.
Formula
GCD(a, b) = largest integer that divides both a and b.
Frequently Asked Questions
What is GCD?
The Greatest Common Divisor (GCD) of two integers is the largest positive integer that divides both without a remainder.
What is GCD(0, n)?
GCD(0, n) = n for any positive n, since every integer divides 0.