GCD and LCM calculator

Formula & example

Enter 2–100 integers. The greatest common divisor is the largest nonnegative integer dividing every input; the least common multiple is the smallest positive shared multiple for nonzero inputs. Signs are ignored for these results. gcd(0,0) and any LCM containing zero are reported as zero by convention. The Euclidean recurrence is shown as numbers are combined. Example: 12 and 18 give GCD 6 and LCM 36. Exact arithmetic is bounded to 18 digits per input and 120 output digits for the LCM.

lcm(a,b) = |ab| / gcd(a,b)

12, 18 → gcd = 6; lcm = 36