Free GCD calculator with clear step-by-step results.
The greatest common divisor is the largest number dividing both inputs.
Formula
GCD via Euclidean algorithm; LCM = a×b ÷ GCD
The greatest common divisor is the largest number dividing both inputs.
LCM follows directly from the GCD.