GCD Calculator
Calculate the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of two or more numbers. View step-by-step Euclidean algorithm.
Number Input
Enter numbers to calculate GCD and LCM.
What are GCD and LCM?
The Greatest Common Divisor (GCD) is the largest positive integer that divides two or more integers without leaving a remainder. The Euclidean algorithm is one of the oldest algorithms for finding the GCD efficiently.
The Least Common Multiple (LCM) is the smallest positive integer that is divisible by two or more integers.