Least Common Multiple (LCM)
Compute the least common multiple (LCM) of two natural numbers
LCM Calculator
Least common multiple
The LCM is the smallest positive number that is a multiple of both input numbers. Relation to GCD: lcm(a,b) × gcd(a,b) = a × b.
LCM Info
Properties
LCM: Smallest number that both input values divide
Relation to GCD: lcm(a,b) × gcd(a,b) = a × b
Formula: lcm(a,b) = |a×b|/gcd(a,b)
Computation methods
Formulas and definitions
Definition
Smallest natural number divisible by both
Fundamental formula
Relation between LCM and GCD
Generalization
Extension to multiple numbers
Properties
Fundamental relation between LCM and GCD
Prime factorization
LCM via prime factorization
Special cases
Important LCM special cases
Example: lcm(18, 30)
Method 1: Multiples sets
Step 1: Determine multiples sets
V₃₀ = {30, 60, 90, 120, 150, 180, 210, 240, ...}
Common multiples: 90, 180, 270, ...
Step 2: Identify smallest
The least common multiple is 90
lcm(18, 30) = 90
Method 2: GCD formula
18 = 1 × 12 + 6
12 = 2 × 6 + 0 → gcd(18, 30) = 6
Verification
Prime factorization
Highest powers of all prime factors
Comparison of computation methods
Different ways lead to the same result
Applications of the LCM
The least common multiple has many practical applications:
Fractions
- Common denominator for fraction addition
- Create like-denominator fractions
- Simplify fraction comparisons
- Repeating decimals
Scheduling & cycles
- Recurring events
- Coordinate shift plans
- Period calculations
- Synchronize processes
Engineering & technology
- Optimize gear ratios
- Frequency synchronization
- Clock cycles in computers
- Coordinate machine fleets
Mathematics & computer science
- Number theory and algebra
- Modular arithmetic
- Cryptographic algorithms
- Discrete mathematics
The LCM: Duality with GCD and practical importance
The least common multiple together with the greatest common divisor forms a dual pair of fundamental number-theoretic concepts. While the GCD is the largest number dividing both, the LCM is the smallest number that both numbers divide. This duality is expressed in the elegant formula lcm(a,b) × gcd(a,b) = a × b and connects abstract number theory with practical applications in fractions, scheduling and engineering.
Properties
- lcm(a,b) ≥ max(a,b)
- lcm(a,b) × gcd(a,b) = a × b
- Commutative: lcm(a,b) = lcm(b,a)
- Associative for multiple numbers
Significance
- Common denominator in fractions
- Synchronization of periodic processes
- Basis for modular arithmetic
- Optimization in combinatorics
Computation methods
- Multiples sets (small numbers)
- GCD formula (efficient)
- Prime factorization (systematic)
- Euclidean algorithm (indirect)
Summary
The least common multiple links elementary number theory with practical applications in mathematics, engineering and everyday life. The elegant duality with the GCD shows the deep structure of natural numbers and enables efficient algorithms. From fraction arithmetic to synchronization of complex systems, the LCM remains an indispensable tool that unites mathematical beauty with practical utility.