数学

最小公倍数和最大公约数计算器

求最小公倍数和最大公约数

使用方法
  1. Type a list of integers separated by commas or spaces into the box above.
  2. Results update instantly — no button press needed.
  3. The 最小公倍数 is the smallest number divisible by all your inputs.
  4. The 最大公因数 (also called HCF) is the largest number that divides all your inputs evenly.

公式

GCD(a, b) Euclidean algorithm: divide repeatedly until remainder = 0
LCM(a, b) = |a × b| / GCD(a, b)
LCM(a,b,c) = LCM(LCM(a,b), c) — applied iteratively