[K-12 Education | Mathematics] The Euclidean algorithm is a method for computing the least common multiple (LCM).  The LCM is the smallest number that can be divided by two numbers without producing a remainder.  Using Euclid's algorithm to find the greatest common divisor (GCD) of two positive integers, leads to the LCM.