About

Incorrect LCM computation leads to misaligned scheduling intervals, broken gear ratios, and wrong denominators in fraction arithmetic. The Least Common Multiple of integers a and b is derived through the Euclidean algorithm: first compute gcd(a, b), then apply lcm = |a × b| ÷ gcd(a, b). This tool extends the computation to n integers by iterative reduction. It performs full trial-division prime factorization for each input and displays the maximum exponent method as verification. Results use BigInt arithmetic internally, so values up to 10¹⁵ remain exact. The tool approximates nothing. Every digit is precise.

Practical applications: synchronizing periodic events (traffic lights cycling at 30s, 45s, 60s), finding common denominators for fraction addition, calculating gear mesh intervals, and tiling problems. Note: input of 0 is mathematically undefined for LCM since gcd(a, 0) = a but a × 0 = 0 collapses the result. This calculator rejects zero and negative inputs to maintain mathematical rigor.

Formulas

The Least Common Multiple is computed from the Greatest Common Divisor. The Euclidean algorithm finds gcd by repeated division:

gcd(a, b) =

{

a if b = 0gcd(b, a mod b) otherwise

Once gcd is known, the LCM of two numbers follows:

lcm(a, b) = |a × b|gcd(a, b)

For n numbers, the LCM is computed by iterative reduction:

lcm(a₁, a₂, …, a_n) = lcm(lcm(a₁, a₂), a₃, …, a_n)

The prime factorization method provides an alternative verification. Each a_i is decomposed as a_i = p₁^e₁ × p₂^e₂ × … Then:

lcm = ∏p p^max(e_p)

Where p ranges over all distinct primes appearing in any factorization, and e_p is the exponent of p in each number. The maximum exponent for each prime is selected.

Variable legend: a, b = input integers. p = prime factor. e = exponent of prime factor. n = total count of input numbers.

Reference Data

Number Set	GCD	LCM	Prime Factorization (per number)
4, 6	2	12	2²; 2 × 3
12, 18	6	36	2² × 3; 2 × 3²
5, 7	1	35	5; 7 (coprime)
8, 12	4	24	2³; 2² × 3
3, 5, 7	1	105	3; 5; 7
6, 10, 15	1	30	2 × 3; 2 × 5; 3 × 5
4, 6, 8	2	24	2²; 2 × 3; 2³
9, 12, 15	3	180	3²; 2² × 3; 3 × 5
14, 21	7	42	2 × 7; 3 × 7
100, 75	25	300	2² × 5²; 3 × 5²
24, 36, 48	12	144	2³ × 3; 2² × 3²; 2⁴ × 3
7, 11, 13	1	1001	7; 11; 13 (all prime)
2, 3, 4, 5	1	60	2; 3; 2²; 5
16, 20, 25	1	400	2⁴; 2² × 5; 5²
1, 1	1	1	1; 1 (trivial)
17, 19	1	323	17; 19 (twin primes)
360, 240	120	720	2³ × 3² × 5; 2⁴ × 3 × 5
1000, 1500	500	3000	2³ × 5³; 2² × 3 × 5³

Frequently Asked Questions

The number 1 is the multiplicative identity. Since gcd(a, 1) = 1 for any positive integer a, lcm(a, 1) = |a × 1| / 1 = a. Adding 1 to your input set never changes the LCM result. It is harmless but redundant.

By definition, lcm(a, 0) would require a common multiple of both a and 0. Every integer is a multiple of 0 (since 0 × k = 0), but the only multiple of 0 is 0 itself. The formula lcm(a, b) = |a × b| / gcd(a, b) yields 0 / a = 0, which contradicts the requirement that LCM be the least positive common multiple. Most mathematical conventions leave lcm(a, 0) undefined or set it to 0 as a degenerate case.

Both methods are mathematically equivalent and produce identical results. The GCD-based method (Euclidean algorithm) is computationally faster - O(log(min(a,b))) per pair. The prime factorization method requires trial division up to √n for each number, which is O(√n) per number. This calculator uses the GCD method for the actual result and displays factorization solely for educational verification.

Yes. The calculator uses JavaScript BigInt internally for all arithmetic when inputs exceed Number.MAX_SAFE_INTEGER (2^53 − 1 = 9,007,199,254,740,991). The input limit is set to 10^15, which remains within safe integer range, but the LCM result of multiple large numbers can exceed this - BigInt handles it exactly. Note: prime factorization of very large numbers (above ~10^12) may take noticeable time due to trial division complexity.

Two integers are coprime when gcd(a, b) = 1. In this case, lcm(a, b) = a × b. For example, lcm(7, 11) = 77. This is the maximum possible LCM for two given numbers. Conversely, when one number divides the other (e.g., 6 and 12), gcd = 6 and lcm = 12, the larger number itself. The product gcd(a,b) × lcm(a,b) = a × b always holds.

To add fractions with different denominators, you need a common denominator. The LCM of the denominators (called the Least Common Denominator, LCD) is the smallest such value. For example, adding 1/4 + 1/6: lcm(4, 6) = 12. Convert to 3/12 + 2/12 = 5/12. Using a larger common denominator (like 24) works but requires simplification afterward. The LCD eliminates that extra step.

No. LCM is both commutative (lcm(a, b) = lcm(b, a)) and associative (lcm(lcm(a, b), c) = lcm(a, lcm(b, c))). The iterative reduction used in this calculator processes numbers left-to-right, but any ordering produces the same result. Duplicate values are also harmless: lcm(a, a) = a.