最大公因数使用辗转相除法来求，最小公倍数则由这个公式来求： GCD * LCM = 两数乘积 -The greatest common divisor using Euclidean algorithm to seek, to find the least common multiple by this formula: GCD* LCM = product of two numbers