Formula
For two positive integers a and b, LCM(a,b) = |a × b| ÷ GCF(a,b). For three numbers, calculate LCM(LCM(a,b),c). The prime-factor method keeps the highest power of each prime that appears in any number.
Percentage, Math & Everyday Arithmetic
Find the least common multiple of two or three whole numbers, with prime-factor notes, common-multiple checks, classroom wording and a printable arithmetic worksheet record.
Calculator
For two positive integers a and b, LCM(a,b) = |a × b| ÷ GCF(a,b). For three numbers, calculate LCM(LCM(a,b),c). The prime-factor method keeps the highest power of each prime that appears in any number.
This is the method behind the answer, so the result can be checked rather than simply trusted.Visual grid
Least Common Multiple is not just a final answer. It is a step on a line: before and after, input and output, assumption and result.
CalculationTime keeps the path visible: the input, the method and the final number belong together.
CalculationTime
For two positive integers a and b, LCM(a,b) = |a × b| ÷ GCF(a,b). For three numbers, calculate LCM(LCM(a,b),c). The prime-factor method keeps the highest power of each prime that appears in any number.
Use this space on the printed report for client, supplier, classroom, job-location, measurement, quote or approval notes.
For two positive integers a and b, LCM(a,b) = |a × b| ÷ GCF(a,b). For three numbers, calculate LCM(LCM(a,b),c). The prime-factor method keeps the highest power of each prime that appears in any number.
For 12 and 18, the greatest common factor is 6. LCM = |12 × 18| ÷ 6 = 216 ÷ 6 = 36. If a third number is blank, the answer stays 36; if a third number such as 24 is added, calculate LCM(36,24) = 72.
Master’s Tip: for worksheets, write both the GCF shortcut and the prime-factor check. The shortcut gives the answer fast, while prime factors explain why no smaller common multiple works.
Standard or basis: elementary number theory for positive integers. The calculator uses the Euclidean algorithm for GCF, then applies LCM(a,b) = |a × b| ÷ GCF(a,b).
Methodology & Accuracy
CalculationTime pages are built around visible arithmetic: the formula, assumptions, worked example and practical limitations are shown so the result can be checked rather than simply trusted.
For two positive integers a and b, LCM(a,b) = |a × b| ÷ GCF(a,b). For three numbers, calculate LCM(LCM(a,b),c). The prime-factor method keeps the highest power of each prime that appears in any number.
Standard or basis: elementary number theory for positive integers. The calculator uses the Euclidean algorithm for GCF, then applies LCM(a,b) = |a × b| ÷ GCF(a,b).
Where a calculator follows a named legal, trade or industry standard, that standard is cited visibly. Otherwise the page uses transparent general arithmetic and states its limits.Master’s Tip: for worksheets, write both the GCF shortcut and the prime-factor check. The shortcut gives the answer fast, while prime factors explain why no smaller common multiple works.
The least common multiple is the smallest positive whole number that each entered number divides evenly into.
Find the greatest common factor, then use LCM(a,b) = |a × b| ÷ GCF(a,b). For 12 and 18, the GCF is 6, so the LCM is 36.
Find the LCM of the first two numbers, then find the LCM of that result with the third number.
No. The greatest common factor divides the entered numbers. The least common multiple is a number the entered numbers divide into.
Print the entered numbers, LCM result, GCF cross-check, formula, prime-factor note, common-multiple examples, assumptions, page URL, date and room for teacher or student notes.
Least common multiples sit behind common denominators, repeating schedules and many divisibility problems. A good LCM record shows not only the answer, but why each original number divides it evenly.
If one event repeats every 12 days and another every 18 days, the least common multiple tells when the cycles meet again. The same idea supports fraction denominators and timetable problems.
Listing multiples works for small classroom numbers, but the GCF relationship is faster and easier to audit. It uses the fact that common factors should not be counted twice in the product.
The prime-factor method keeps only the highest required power of each prime. That is why the result is a common multiple, but not larger than necessary.