LCM Calculator

Definition

The least common multiple of two integers a and b (written LCM(a, b)) is the smallest positive integer m such that a | m and b | m. Equivalently, m is the smallest positive common multiple of the absolute values |a| and |b|. When a = b = 0 the notion is not defined here — the calculator rejects that pair. When exactly one number is zero, this implementation sets LCM(a, 0) = 0 (no positive common multiple in the sense used by this educational tool).

This calculator implements the identity LCM(a, b) = |a·b| / GCD(a, b) for a ≠ 0 and b ≠ 0, with GCD by Euclid’s algorithm on absolute values. Computation: first the GCD, then |a / g · b|. Mathematical model: LCM–GCD identity. Descriptive sources: Euclid, Elements (Book VII); Wikipedia — Least common multiple; MathWorld — Least Common Multiple; Hardy & Wright, An Introduction to the Theory of Numbers.

In teaching practice it helps to separate the number-theoretic definition from computer-arithmetic limits: the calculator requires finite integers and shows the result of that computation. Prime factorization (LCM as a product of highest powers) is equivalent, but this form does not factor — only a pair via GCD.

Historical and conceptual context

Common multiples appear in ancient arithmetic as “common measure” and period-alignment problems. Modern LCM notation and the identity LCM·GCD = |a·b| link two dual questions in the divisibility lattice: greatest common divisor and least common multiple. Euclid’s algorithm on the GCD yields a practical path to the LCM without full factorization.

In school, LCM appears for common denominators, “when do they meet again” problems (periods, gears, signals), and scaling ratios to a shared level. GCD reduces; LCM expands to a common multiple.

Conceptually, LCM is not a single-division remainder (modulo), not GCD, and not the raw product a·b unless GCD = 1. Modulo enters only indirectly in Euclid’s steps for the GCD. Here the only question is: what is the smallest positive integer divisible by both.

Formal properties

Domain of this calculator: a, b ∈ ℤ, not both zero. LCM(a, b) = LCM(|a|, |b|) = LCM(b, a). LCM(a, 0) = 0 in this tool’s convention (a ≠ 0). For nonzero a, b: LCM(a, b)·GCD(a, b) = |a·b|. If d = GCD(a, b), then LCM(a, b) = |a/d|·|b|.

LCM(ka, kb) = |k|·LCM(a, b) for nonzero integer k. When GCD(a, b) = 1 (coprime), LCM(a, b) = |a·b|. LCM is associative and commutative on positive integers in the divisibility lattice sense.

Complexity: dominated by GCD cost, typically O(log min(|a|, |b|)). School examples (6, 8, 12, 18) need only a few Euclid steps plus one division.

In teaching practice it helps to separate the mathematical identity from floating-point arithmetic limits: above 2⁵³ not every integer is exactly representable. Typical school examples fit with room to spare; very large |a·b| may report overflow.

Full derivation

Step 1. Enter two integers a and b. The parser accepts comma or period, but the value must come out integer. An empty field does not substitute zero for a missing entry.

Step 2. Reject the pair 0, 0. If a = 0 or b = 0 (but not both), LCM = 0.

Step 3. Compute d = GCD(|a|, |b|) by Euclid’s algorithm (remainders until zero).

Step 4. Compute m = |a·b| / d. For 6 and 8: d = 2, |6·8| = 48, m = 24.

Step 5. The panel shows d, |a|, |b|, |a·b|, and the formula-step sentence. Chip figure: a, b → GCD → |a·b|/GCD → LCM.

Step 6. Check: m ÷ a and m ÷ b must be integers; no smaller positive common multiple exists when d is correct.

Special cases

LCM(6, 8) = 24; LCM(4, 6) = 12; LCM(7, 5) = 35; LCM(12, 18) = 36; LCM(84, 36) = 252; LCM(144, 96) = 288; LCM(270, 192) = 8640; LCM(0, 25) = 0; LCM(−6, 8) = 24.

Fraction 6.5 with 8: “not integer” error. 0 with 0: domain error. Field order does not change the LCM (commutativity).

When GCD = 1, LCM equals the absolute product. When |a| = |b| ≠ 0, LCM = |a|.

Numerical notes

The product a·b and division by GCD run on floating-point numbers. For very large |a|, |b|, precision artifacts or an out-of-range message can appear — educational tool, not an arbitrary-precision system. Comma and period are equivalent.

The calculator does not prime-factor, does not compute LCM of many arguments at once, and does not list all common multiples — only the least for a pair. Multi-argument LCM needs iteration: LCM(LCM(a, b), c).

Locale display (en-US) does not change the internal value: LCM(6, 8) is exactly 24.

Sources

Related: GCD; ratio of two numbers; modulo (remainder in Euclid); fractions and common denominators; periods / cycle sync. Prime factorization and multi-argument LCM sit one step further — outside this form.

Sources: Euclid, Elements, Book VII; Hardy & Wright, An Introduction to the Theory of Numbers; Knuth, The Art of Computer Programming (GCD/LCM algorithms); Wikipedia — Least common multiple; MathWorld — Least Common Multiple. Educational tool — not a substitute for a textbook or instructor check.