随笔分类 -  奇它

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 阅读全文
posted @ 2024-02-19 22:10 Bubble_e 阅读(44) 评论(0) 推荐(0)