GCD & LCM Calculator

Find the Greatest Common Divisor and Least Common Multiple of integers with prime factorizations.

Greatest Common Divisor (GCD)
12
Least Common Multiple (LCM)
72

Prime Factorizations:

24 = 2 × 2 × 2 × 3 = 2³ × 3
36 = 2 × 2 × 3 × 3 = 2² × 3²

Euclidean Algorithm for GCD

Repeated division with remainder:

$$ \gcd(a, b) = \gcd(b, \, a \pmod b) $$

Least Common Multiple (LCM)

Relationship between product and GCD:

$$ \operatorname{lcm}(a, b) = \frac{|a \times b|}{\gcd(a, b)} $$

Related Calculators