—
—
216
—
—
×
—
×
—
—
—
216
—
—
×
—
×
—
The Least Common Multiple (LCM) is the smallest positive integer that is divisible by two given numbers. This concept is fundamental in number theory, fraction arithmetic, and modular algebra. Our LCM Calculator uses the relationship between the LCM and the Greatest Common Factor (GCF) to deliver instant, exact results.
The core formula connecting these two concepts is elegantly simple:
$$\text{LCM}(a, b) = \frac{a \times b}{\text{GCF}(a, b)}$$
This identity holds because every common multiple of $$a$$ and $$b$$ must be a multiple of their LCM, and the product $$a \times b$$ accounts for all prime factors from both numbers, while the GCF removes the double-counted shared factors. The calculator internally finds the GCF using the Euclidean Algorithm, then applies this division formula. This approach is far more efficient than listing multiples of each number and searching for the first match, especially for large values.
LCM calculations appear throughout mathematics and applied sciences. When adding or subtracting fractions, you need the LCM of the denominators to find a common denominator. In scheduling problems, the LCM tells you when two periodic events will next coincide. In computing, LCM is used in thread synchronization and clock cycle alignment. Understanding LCM also opens the door to deeper topics like the Chinese Remainder Theorem and Diophantine equations.
The calculator finds the GCF first using the Euclidean Algorithm, then computes the LCM through division:
Step 1 — Euclidean Algorithm for GCF: Given integers $$a$$ and $$b$$ where $$a \geq b$$, repeatedly divide the larger by the smaller and replace: $$a = b \cdot q + r$$. When the remainder $$r = 0$$, the last nonzero remainder is the GCF.
Step 2 — LCM Formula:
$$\text{LCM}(a, b) = \frac{a \times b}{\text{GCF}(a, b)}$$
This works because the prime factorization of the LCM takes the maximum power of each prime across both numbers, while the GCF takes the minimum. Multiplying $$a \times b$$ gives the sum of all powers, and dividing by the GCF corrects for double counting.
Why Euclidean Algorithm? It runs in $$O(\log(\min(a,b)))$$ steps, making it extremely efficient even for large numbers. Each step reduces the problem size by at least half.
The LCM result tells you the smallest number both inputs divide into evenly. A large LCM relative to the inputs indicates the numbers share few common factors (they are nearly coprime). If the LCM equals the product of the two numbers, they are coprime (GCF = 1). If the LCM equals the larger number, the smaller number is a factor of the larger. The GCF shown alongside helps you understand the shared factor structure between the two numbers.
Inputs
Results
GCF(12,18) = 6 via Euclidean algorithm (18 = 1×12 + 6, 12 = 2×6 + 0). LCM = 12×18/6 = 36.
Inputs
Results
Since 7 and 13 are both prime and distinct, GCF = 1 and LCM = 7×13 = 91.
The GCF (Greatest Common Factor) is the largest number that divides both inputs. The LCM (Least Common Multiple) is the smallest number both inputs divide into. They are related by the formula $$\text{LCM}(a,b) \times \text{GCF}(a,b) = a \times b$$. The GCF captures shared factors, while the LCM captures the combined factor structure.
To add fractions like $$\frac{1}{4} + \frac{1}{6}$$, you need a common denominator. The LCM of 4 and 6 is 12, so you rewrite as $$\frac{3}{12} + \frac{2}{12} = \frac{5}{12}$$. Using the LCM gives the smallest common denominator, keeping numbers manageable and results in lowest terms.
If $$b$$ divides $$a$$ evenly, then $$\text{GCF}(a,b) = b$$ and $$\text{LCM}(a,b) = a$$. For example, LCM(20, 5) = 20 because 20 is already a multiple of 5. The Euclidean algorithm terminates in one step with remainder 0.
Yes. To find the LCM of three or more numbers, apply the formula iteratively: $$\text{LCM}(a, b, c) = \text{LCM}(\text{LCM}(a, b), c)$$. This works because the LCM operation is associative. You can chain as many numbers as needed using this approach.
If $$a = b$$, then $$\text{GCF}(a,a) = a$$ and $$\text{LCM}(a,a) = a$$. The Euclidean algorithm immediately gives remainder 0, and the LCM formula yields $$a \times a / a = a$$.
If two buses arrive at a stop every 12 and 18 minutes respectively, and both arrive at noon, they will next arrive together after LCM(12, 18) = 36 minutes. This principle applies to gear ratios, signal timing, satellite orbits, and any scenario involving periodic events that must synchronize.
Roboculator Team
The Roboculator Team explains calculations, planning tools, and practical formulas in clear language for real-life situations.
How helpful was this calculator?
Be the first to rate!
