LCM Calculator

What does this lcm calculator compute?

For nonzero integer inputs, the least common multiple (LCM), also called lowest common multiple, is the smallest positive integer divisible by every input. Under CalculatorX's zero convention, if any input is 0, the LCM is 0. When the integers are denominators, the LCM is the least common denominator (LCD). Enter two or more integers separated by commas or spaces. Negative values are treated by absolute value.

The published formula or method is LCM(a,b,c,…) = LCM(LCM(a,b),c,…); LCM(a,b)=|a/GCF(a,b)×b|. The following references support the stated mathematics or method:

• MIT Mathematics for Computer Science — Chapter 8: Number Theory: Divisibility, prime factorization, gcd and the Euclidean algorithm, lcm via prime exponents, division with remainder, modular congruence and multiplicative inverses. CalculatorX’s signed-remainder and zero-input policies are stated separately on the page. Mathematical reference only; not validation or endorsement of this implementation.

Which inputs and limits should you check?

Follow the input domain, units, branch or solve direction, and rounding policy in the specification. Preserve exact outputs and any additional candidates or warnings.

The worked example uses 8 and 12 with multiples meet at 24. Compare it with the Example calculations and the complete result for the same inputs.

How can you verify and cite this result?

CalculatorX is responsible for this page. The mathematical references above explain the model; implementation checks and their scope are documented separately in the math.lcm v1.0.4 Evidence and capability contract. Read the displayed verification and production state together with the specification's numerical limits.

Use the clean calculator URL to cite the tool. A shared input link identifies a particular calculation. Content updates, numerical verification, and domain reviews have separate dates and scopes.

What is the LCM?

For nonzero integers, the least common multiple (also lowest common multiple) is the smallest positive integer divisible by each of them.

LCM(a,b,c,…)=LCM(LCM(a,b),c,…)

Negative inputs use absolute value. Under CalculatorX’s zero convention, if any input is 0 the LCM is 0. If those integers are denominators, the LCM is the least common denominator (LCD) used to add or subtract fractions.

Methods

Listing multiples

List positive multiples until a common value appears.

LCM(6, 7, 21): multiples of 6 include 42; of 7 include 42; of 21 include 42 → 42.

Prime factorization

Take each prime to the highest power that appears in any number, then multiply.

LCM(12, 30): 12=2²×3, 30=2×3×5 → 2²×3×5=60.

LCM(12, 18, 30): 2²×3²×5=180.

GCF identity

Divide by the GCF first so the intermediate product stays smaller:

LCM(a,b)=|a/(GCF(a,b))× b|

LCM(6, 10): GCF(6,10)=2 → (6/2)×10=30. This identity requires a nonzero GCF, so it applies when at least one argument is nonzero.

For three or more numbers, compute pairwise (order does not matter if done consistently). When the values are small enough to list, the page shows listing, prime powers, and the GCF identity and reports whether they agree.

LCM and zero

• If any input is 0, LCM=0.
• For a zero/nonzero pair, the GCF identity yields 0: GCF(0,5)=5, so |(0/5)×5|=0.
• For (0,0), GCF is undefined in CalculatorX; the identity is not evaluated because |a/GCF(a,b)× b| would divide by zero. CalculatorX explicitly defines LCM(0,0)=0, matching Python math.lcm. Some textbooks leave LCM(0,0) undefined.

Integer range

Calculation uses exact BigInt, so integers larger than Number.MAX_SAFE_INTEGER stay exact. Use 2–32 integers; each input may have at most 48 decimal digits (a product bound, not a mathematical bound). Values beyond the IEEE-754 safe integer range must be sent to the API as decimal strings.

Example: LCM(9007199254740993, 3)=9007199254740993.

Agent / API notes

Capability id: math.lcm · tool id: lcm · pin calculation_version: 1.0.4.

POST /api/v1/calc/lcm
{ "inputs": { "values": [8, 12] } }

Share URL: /calc/math/lcm?numsInput=8,12. Aliases: numbers, numsInput.

Aliases must describe the same ordered list; explicit empty input is an error. List strings are bounded to4096 characters, array token strings to128; whitespace/comma/semicolon separators are accepted. Integers beyond the safe JSON number range require decimal strings; leading zero digits count toward the48-digit bound. Unknown fields are rejected. Results can reach1536 digits. Listing checks use inputs≤500 and LCM≤5000; each displayed row stops at80 multiples with an omission note. Prime checks use inputs≤1000000; GCF identity always applies with the explicit zero branch.

Stable error codes: MISSING_REQUIRED_INPUT, NEED_TWO_NUMBERS, INVALID_NUMBER, VALUE_ABOVE_MAX, INPUT_TOO_LARGE, TOO_MANY_VALUES, INPUT_ALIAS_CONFLICT, UNKNOWN_INPUT.

Precision and data paths

BigInt results are exact for the accepted normalized integer list. JSON numeric literals first use binary64 and may already have rounded near an integer; send exact decimal strings to preserve original integers. Nonzero raw JSON underflow is rejected. Decimal/exponent/hex strings and fractional inputs are not integers in this contract.

Interactive arithmetic runs locally. Share URLs send their parameters to the server and may enter request logs; REST/MCP also send inputs. Browser history may retain up to20 result snapshots on this device; Clear empties this form, not stored history. Analytics may load conditionally; retention, deletion and processing region are not established by this review. CVP and method agreement are not third-party certification.