Least Common Multiple
The least common multiple (LCM) is the smallest positive number that is a multiple of two or more given numbers.
Formula
\text{LCM}(a,b) = \frac{a \times b}{\text{GCF}(a,b)}
Definition
The least common multiple (LCM) of two or more numbers is the smallest number that all of them divide into evenly. Using prime factorization, the LCM takes the maximum exponent for each prime factor, and the relation $\text{LCM}(a,b) \times \text{GCF}(a,b) = a \times b$ holds for positive integers. Algebraically, $\text{LCM}(a,b)$ generates the ideal $a\mathbb{Z} \cap b\mathbb{Z}$ in $\mathbb{Z}$: where GCD corresponds to the sum of ideals ($a\mathbb{Z} + b\mathbb{Z}$), LCM corresponds to their intersection, making GCD the meet and LCM the join of the divisibility lattice.
Example
LCM of $4$ and $6$: multiples of $4$ are $4, 8, 12, 16, \ldots$; multiples of $6$ are $6, 12, 18, \ldots$; the first shared number is $12$, so $\text{LCM}(4,6) = 12$, which is exactly the common denominator you would use to add $1/4 + 1/6$. $\text{LCM}(12,18)$: $12 = 2^2 \times 3$, $18 = 2 \times 3^2$, so $\text{LCM} = 2^2 \times 3^2 = 36$, matching the formula $12 \times 18 / \text{GCF}(12,18) = 216/6 = 36$. By the Chinese Remainder Theorem, the system $x \equiv a \pmod m$, $x \equiv b \pmod n$ has period $\text{LCM}(m,n)$ when $\gcd(m,n) \mid (a-b)$, so LCM determines the period of simultaneous congruences.
Key Insight
$\text{LCM}(a,b) \times \text{GCF}(a,b) = ab$ is a beautiful symmetry: GCF uses minimum prime exponents, LCM uses maximum, and min plus max equals the total for each prime. The divisibility partial order on $\mathbb{Z}^+$ is a distributive lattice with GCD as meet and LCM as join, isomorphic to the lattice of ideals of $\mathbb{Z}$, providing an algebraic foundation for elementary number theory.