Find the least common multiple of two whole numbers, with the GCD shown too.
Find the least common multiple of two whole numbers, with the GCD shown too.
Enter values above and click Calculate — results will appear here with the formula explained.
The least common multiple is the smallest positive number divisible by both inputs. It's the key to adding fractions with different denominators and aligning repeating events, like finding when two buses that leave every 12 and 18 minutes next depart together (36 minutes).
Rather than listing multiples, the efficient route uses the identity LCM × GCD = a × b. Compute the greatest common divisor with the Euclidean algorithm, then one multiplication finishes the job.
Advertisement
AdSense ready — add NEXT_PUBLIC_GOOGLE_ADSENSE_PUBLISHER_ID
The least common multiple is the smallest positive number divisible by both inputs. It's the key to adding fractions with different denominators and aligning repeating events, like finding when two buses that leave every 12 and 18 minutes next depart together (36 minutes). Formula: LCM(a, b) = (a × b) ÷ GCD(a, b)
LCM Calculator computes find the least common multiple of two whole numbers, with the gcd shown too. Formula: LCM(a, b) = (a × b) ÷ GCD(a, b). Example: LCM(12, 18): GCD(12, 18) = 6, so LCM = 12 × 18 ÷ 6 = 36.
Find the least common multiple of two whole numbers, with the GCD shown too. Formula: LCM(a, b) = (a × b) ÷ GCD(a, b)
| Field | What to enter |
|---|---|
| First number | e.g. 12 |
| Second number | e.g. 18 |
All fields use the exact formulas shown below — results include step-by-step breakdowns you can verify by hand.
The least common multiple is the smallest positive number divisible by both inputs. It's the key to adding fractions with different denominators and aligning repeating events, like finding when two buses that leave every 12 and 18 minutes next depart together (36 minutes).
Rather than listing multiples, the efficient route uses the identity LCM × GCD = a × b. Compute the greatest common divisor with the Euclidean algorithm, then one multiplication finishes the job.
Advertisement
AdSense ready — add NEXT_PUBLIC_GOOGLE_ADSENSE_PUBLISHER_ID
LCM(12, 18): GCD(12, 18) = 6, so LCM = 12 × 18 ÷ 6 = 36. Indeed 36 is the smallest number that both 12 and 18 divide evenly.
Advertisement
AdSense ready — add NEXT_PUBLIC_GOOGLE_ADSENSE_PUBLISHER_ID