GCD
Free GCD calculator with clear step-by-step results.
About GCD
The greatest common divisor is the largest number dividing both inputs.
Formula
Formula
GCD via Euclidean algorithm; LCM = a×b ÷ GCD
Worked example
With the default values below, GCD returns GCD of 12.00. Change any input above and every figure here is recalculated in your browser.
Inputs used
- First numberminimum 1
- 48
- Second numberminimum 1
- 36
Results
- GCD
- 12.00
- LCM
- 144.00
- Coprime?
- No
Step by step
- 1Values used
- 2Formula
- 3GCD= 12
- 4LCM= 144
- 5Coprime?= No
Assumptions and limits
- The result is derived only from the 2 inputs listed above. Anything not among them is not part of the calculation.
- In particular, this calculator does not take inflation, tax, fees or charges or compounding frequency into account.
How these calculators are built and tested is described on the Methodology page. If a figure looks wrong, please report it.
Frequently Asked Questions
How does this calculator work?
The greatest common divisor is the largest number dividing both inputs.
Why does this matter?
LCM follows directly from the GCD.