METHOD
How this tool works
The Euclidean algorithm repeatedly replaces the larger value with a remainder.
CALCULATORS
GCD Calculator
Find the greatest common divisor of two integers.
FreeNo accountRuns locally
Greatest common divisor
EXAMPLE
A quick check
The GCD of 48 and 18 is 6.
Designed for a single task.Inputs are processed in your browser; Utilens does not require an account or intentionally send your entered tool values to an application server.
Quick answers
Are negative integers supported?
Yes. Their absolute values are used.
What is GCD(0, n)?
It is the absolute value of n.