How to use this calculator

The greatest common divisor is the largest positive integer that divides both numbers without remainder.

The method

GCD uses the Euclidean algorithm

Enter your values in the labeled fields and choose Calculate. The result panel shows the answer and supporting values when useful.

WORKED EXAMPLE INPUT

First integer: 84, Second integer: 126

Select Calculate to evaluate these example values.

Scope and limitations

Inputs are limited to safe whole numbers. Uses real-number arithmetic and rounds display values without changing the entered inputs. Check important results independently.

Common questions

Can I use different units?

Use consistent units unless this page is a unit converter. The result follows the units implied by the inputs.

Are results exact?

Displayed values may be rounded. Keep extra precision for important follow-up calculations.

Methods & verification

Formulas use standard mathematical definitions and fixed unit factors where applicable. See our methodology for numerical conventions, rounding, privacy, and limitations.