Gcd, Lcm的关系证明
根据唯一分解定理
- \(n = p_1 ^ {a_1} * p_2 ^ {a_2} * p_3 ^ {a_3}...\)
- \(m = p_1 ^ {b_1} * p_2 ^ {b_2} * p_3 ^ {b_3}...\)
- \(Gcd(n, m) = p_1 ^ {min(a_1, b_1)} * p_2 ^ {min(a_2, b_2)} * p_3 ^ {min(a_3, b_3)}...\)
- \(Lcm(n, m) = p_1 ^ {max(a_1, b_1)} * p_2 ^ {max(a_2, b_2)} * p_3 ^ {max(a_3, b_3)}...\)
- 所以 $ Gcd(n, m) * Lcm(n, m) = n * m$
- 即\(Lcm(n, m) = \frac{n * m}{Gcd(n, m)}\)