Number Theory Calculator

First number (a)

Second number (b)

GCD (Euclid)

12

LCM

720

Euclid steps

4

Euclid's algorithm steps

48 = 180 × 0 + 48

180 = 48 × 3 + 36

48 = 36 × 1 + 12

36 = 12 × 3 + 0

→ gcd(48, 180) = 12

LCM computed as |a·b| / gcd(a, b).

Check out more tools in my Tools.