演算法-透過輾轉相除法求出最大公因數, 再透過最大公因數求最小公倍數,最大公因數(GCD)可以使用輾轉相除法來求，最小公倍數(LCM)則由這個公式來求 :

GCD * LCM = 兩數乘積-Algorithm- through Euclidean division to find the greatest common factor, through the greatest common factor and least common multiple and greatest common divisor (GCD) can use the Euclidean algorithm to seek the least common multiple (LCM) from this formula to seek: GCD* LCM = product of the two numbers