Find

GCD(12, 18)

6

6

The greatest common divisor of 12 and 18 is 6, the least common multiple is 36.

How this was calculated
18 = 1 × 12 + 6
12 = 2 × 6 + 0
ggT = 6

Euclidean algorithm: divide the larger number by the smaller one, then the divisor by the remainder, until the remainder is 0. The last divisor is the GCD.

12 = 2² × 3
18 = 2 × 3²

Using prime factors: the GCD takes each shared factor with the smaller exponent, the LCM takes each factor with the larger one.

Both numbers consist of whole blocks of length 6; no larger common block fits.

LCM(12, 18)
36

GCD and LCM Calculator by Rechnerzentrale(opens in a new tab)