数学

最小公倍数・最大公約数計算機

最小公倍数と最大公約数を求める

使い方
  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