수학

최소공배수 & 최대공약수 계산기

최소공배수와 최대공약수 구하기

사용 방법
  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