Least Common Multiple

vCalc Reviewed
Equation / Last modified by KurtHeckman on 2016/08/05 16:26
`"LCM" = `
Rating
ID
vCalc.Least Common Multiple
UUID
687de1f0-0e07-11e3-8615-bc764e049c3d

[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.