GCD Calculator
Calculate the Greatest Common Divisor (GCD) of two or more numbers using the Euclidean algorithm — all in your browser, instant results.
About the GCD Calculator
This GCD calculator runs entirely in your browser. Enter two or more integers separated by commas, and the tool computes the greatest common divisor using the Euclidean algorithm, with the steps shown for verification.
How it works
The Euclidean algorithm repeatedly replaces the larger number by the remainder of the larger divided by the smaller, until one of them becomes zero. The non-zero number at that point is the GCD. For more than two numbers, the calculator reduces pairwise: GCD(a, b, c) = GCD(GCD(a, b), c).
Frequently asked questions
Does this tool upload my data? No. All calculations happen locally in your browser.
Can I enter decimals? The GCD is defined for integers. Decimals are rejected — please round or truncate to whole numbers first.
What if one of the numbers is zero? The GCD of any non-zero number and 0 is the non-zero number itself.
Are negative numbers supported? Yes. The sign is ignored — GCD is always non-negative.