Math calculator
GCD & LCM Calculator
Find the greatest common divisor and least common multiple of two integers.
How this calculation works
GCD uses Euclid’s algorithm; LCM(a,b) = |a × b| ÷ GCD(a,b). Use the calculator above to enter your values. Inputs are checked before a result is shown, and calculations run locally in your browser.
Example: GCD(12, 18) = 6; LCM = 36 Results are rounded for display where needed.
Keep calculating
Related math calculators
Percentage CalculatorFind a percentage of a number, or work out what percentage one value is of another.Percentage Increase CalculatorMeasure the percentage increase from an original value to a new value.Percentage Decrease CalculatorMeasure the percentage decrease between an original value and a new value.