basic

GCD and LCM Calculator

Greatest common divisor and least common multiple of two integers.

Compute the greatest common divisor (GCD) and the least common multiple (LCM) of two positive integers using the Euclidean algorithm.

Daniel Oh By Daniel Oh
Published Last reviewed 1 min read

Inputs

Results

Enter values and click Calculate to see results.
Was this helpful?

How to use this calculator

  1. Fill in the inputs above using the units you already have.
  2. Values update automatically as you type — no submit button needed.
  3. Hover any result row for the underlying formula and intermediate values.

Formula

GCD via Euclidean algorithm.
LCM = |a · b| / GCD(a, b).

In depth

Compute the greatest common divisor (GCD) and the least common multiple (LCM) of two positive integers using the Euclidean algorithm.