GCD & LCM Calculator
Calculate Greatest Common Divisor and Least Common Multiple with Euclidean algorithm
GCD & LCM Calculator
Calculate Greatest Common Divisor and Least Common Multiple for multiple numbers using Euclidean algorithm
Numbers
GCD (Greatest Common Divisor)
6
LCM (Least Common Multiple)
36
Euclidean Algorithm Steps
12 = 0 x 18 + 12
18 = 1 x 12 + 6
12 = 2 x 6 + 0
GCD = 6