Find the least common multiple (LCM) of 2 to 6 numbers instantly, with a full step-by-step pairwise breakdown using the GCD formula and a multiples comparison table.
| Number | First Multiples |
|---|
Enter at least 2 positive whole numbers to find their least common multiple
This free LCM calculator finds the least common multiple of 2 to 6 numbers at once, showing the full pairwise GCD-based working behind the answer along with a first-multiples table for visual verification. The least common multiple is the smallest positive whole number that every one of your input numbers divides into evenly — the same concept behind finding a common denominator for fractions, or figuring out when two repeating schedules next line up. This LCM calculator with steps supports up to six numbers, folding them together two at a time using the fast GCD-based formula rather than tediously listing out multiples by hand.
Enter between 2 and 6 positive whole numbers (up to 1,000,000 each), and the calculator finds their least common multiple, shows every pairwise GCD-based reduction step, and displays a table of each number's first 8 multiples with the shared LCM value bolded wherever it appears.
Students learning to add and subtract fractions, teachers building practice problems, schedulers working out when repeating events coincide, engineers synchronizing repeating cycles, and anyone preparing for a math or aptitude exam that covers LCM and GCF can use this tool to skip manual multiple-listing and verify their work instantly.
LCM shows up any time two or more repeating patterns need a shared point of alignment. Fractions need a common denominator — the LCM of the denominators — before they can be added or subtracted. Recurring schedules, like buses that arrive every 4 and 6 minutes, next align exactly at their LCM. Manufacturing processes with different cycle lengths, and musical rhythms of different note lengths, both realign at intervals equal to their LCM.
Students use LCM to find the least common denominator when adding fractions with different denominators. Transit planners and schedulers use it to predict when repeating events next coincide. Manufacturing and mechanical engineers synchronize gears or production cycles running at different periods. Musicians calculate when rhythmic patterns of different lengths realign. Software engineers size buffers or loop counters that must evenly accommodate multiple step intervals.
The GCD-based method this calculator uses, plus two classic alternative methods
Computing the GCD with the Euclidean algorithm and dividing is far faster for a computer than listing multiples, especially for large numbers.
Writing out each number's multiples until one repeats is the easiest method to understand by hand, and it's exactly what this calculator's verification table shows.
Breaking numbers into prime factors and taking the highest power of each prime scales cleanly to any number of inputs, and is the standard method taught alongside GCF.
From entering numbers to verifying the result
Type each positive whole number into its own field; the calculator starts with two rows.
Use "+ Add Number" for more values (up to 6), or the ✕ button to remove a row (down to a minimum of 2).
The calculator reduces the numbers pairwise using the GCD-based formula to find the least common multiple.
Review the LCM value, the pairwise GCD-based working, and how many numbers were entered.
Check that the bolded value in each number's row of first multiples matches the computed LCM.
Finding the LCM of three numbers: 4, 6, and 10
Three delivery trucks leave the same warehouse and return every 4, 6, and 10 hours respectively. After how many hours will all three trucks be back at the warehouse at the same time?
Explanation: All three trucks will be back at the warehouse together after 60 hours — the smallest time interval that is a multiple of 4, 6, and 10 all at once. Notice that 60 falls outside this calculator's 8-multiple verification window for the number 4 (whose first 8 multiples only reach 32), which is exactly why the formula-based approach is necessary for larger LCMs.
What each part of the result actually represents
| Result Field | What It Means | Example Reading |
|---|---|---|
| Least Common Multiple | The smallest positive integer divisible by every entered number | LCM(4,6,10) = 60 |
| Numbers Entered | The exact list of values you provided, in entry order | 4, 6, 10 |
| How Many Numbers | The count of values combined into the final LCM | 3 numbers |
| Pairwise Steps | Each GCD-based reduction, showing how the running LCM built up | LCM(4,6)=12, then LCM(12,10)=60 |
| First Multiples Table | The first 8 multiples of each number, with any match to the final LCM bolded | 4 → 4,8,…,32 (60 not shown; outside the 8-multiple window) |
Reading the result: the LCM will always be at least as large as the biggest number you entered — if a computed answer is smaller than one of your inputs, double-check your entries.
Typical ranges: when all entered numbers are coprime (share no common factor except 1), the LCM equals their straightforward product, which can grow quickly with more numbers.
Manual verification: divide the computed LCM by each original number — every division should come out to a whole number with no remainder.
Where finding a shared multiple genuinely matters
Check LCM and least common denominator problems step by step.
Practice the LCM and GCF questions common in aptitude and entrance exams.
Find the least common denominator needed before combining fractions with different denominators.
Determine when buses, trains, or shifts on different repeating cycles next align.
Synchronize repeating mechanical or production cycles with different periods.
Calculate when rhythmic patterns of different note lengths realign.
Size buffers or loop counters that must evenly accommodate multiple step intervals.
Work out when two differently-spaced recurring calendar events next fall on the same day.
Determine when multiple traffic signals on different cycle lengths next change together.
Estimate when planets or moons with different orbital periods next roughly align.
Plan rotations or fixture cycles that repeat at different intervals.
Build foundational understanding of shared multiples used in modular arithmetic.
Align batch sizes or shift cycles that repeat on different schedules.
What this LCM calculator does well, and where manual judgment is still needed
Three related but distinct ways to combine two numbers
| Term | Definition | Example (8 and 12) |
|---|---|---|
| LCM | Smallest number divisible by all given numbers | LCM(8,12) = 24 |
| GCF (GCD) | Largest number that divides all given numbers evenly | GCF(8,12) = 4 |
| Simple Product (a × b) | Multiplying the numbers directly, ignoring any shared factors | 8 × 12 = 96 = LCM × GCF |
Summary: This LCM calculator gives you an instant, free way to find the least common multiple of 2 to 6 numbers, with the full pairwise GCD-based working and a multiples table shown. Pair it with related tools like the GCF Calculator and Fraction Calculator for a fuller picture of number theory and fraction math.
Common questions about the least common multiple
Trusted educational references to go deeper on multiples and factors
Explore other math tools