⚡ Shortcut Trick

The LCM of two consecutive numbers is always their product.

No matter which two consecutive integers you pick — 3 and 4, 9 and 10, or 100 and 101 — you can skip the long calculations. Just multiply them.

LCM(n, n + 1) = n × (n + 1)
Back to Articles

Guide & Diagrams LCM of Two Consecutive Numbers — Complete Guide

Two consecutive numbers are pairs like (1, 2), (2, 3), (3, 4), (9, 10), or (100, 101). The LCM of any two consecutive numbers is simply their product. This guide explains the shortcut, the mathematical proof behind it, custom site-themed SVG diagrams, worked examples, and where it applies.

What does "Consecutive" mean?

Two numbers are consecutive when they follow each other in order, differing by exactly 1. If the first number is n, the next one is n + 1.

Examples of consecutive number pairs:

Diagram 1: The Euclidean Difference Principle — Why GCD(n, n+1) = 1

Designed with website theme colors: Any divisor d of both n and (n+1) must divide their difference (n+1) - n = 1. Since only 1 divides 1, their GCD is strictly 1 (Coprime).

First Integer: n Divisible by d (d · k₁ = n) Integer n (e.g. 7) − Difference Next Integer: n + 1 Divisible by d (d · k₂ = n + 1) Integer n + 1 (e.g. 8) Fundamental Property: (n + 1) − n = 1 ⟹ Divisor d divides 1 Therefore GCD(n, n+1) = 1 (Always Coprime) ⟹ LCM(n, n+1) = n × (n+1)
Key fact: Any two consecutive integers are always coprime — their GCD (Greatest Common Divisor) is always 1.

The Shortcut Trick — LCM of Consecutive Numbers

Instead of listing multiples or doing prime factorization, you can just multiply the two consecutive numbers. That's the LCM.

Shortcut: LCM(n, n+1) = n × (n+1)

Here's how to use the trick in three quick steps:

1

Check they're consecutive

Confirm the two numbers differ by exactly 1 (like 7 and 8, or 15 and 16).

2

Multiply them directly

Skip the long method — just compute n × (n + 1) in your head or on paper.

3

Verify (optional)

Divide the result by each number. Both divisions should give whole numbers.

Fast example: LCM(7, 8) = 7 × 8 = 56. LCM(12, 13) = 12 × 13 = 156. LCM(99, 100) = 99 × 100 = 9900.

Why Does This Trick Work?

The shortcut works because of a fundamental LCM rule for coprime numbers.

Coprime rule: If GCD(a, b) = 1, then LCM(a, b) = a × b

Now let's apply this rule to consecutive numbers:

Diagram 2: Multiples Timeline — LCM(4, 5) = 20 (Direct Product)

Visualization of multiples of 4 (brand primary) and 5 (accent). Because GCD(4, 5) = 1, they have zero common multiples before their product 4 × 5 = 20.

4 5 8 10 12 15 16 20 24 Multiples of 4 (4, 8, 12, 16...) Multiples of 5 (5, 10, 15...) 20 ✓ LCM (4 × 5)
Rule of thumb: Coprime numbers share no common factors other than 1, so their LCM equals their product. This is true for consecutive integers, and also for any pair of numbers like (2, 3), (4, 9), (7, 11), and (8, 9).

Mathematical Proof of the Trick

Let's prove it formally, step by step.

Theorem

For any positive integer n, the LCM of n and n + 1 equals n × (n + 1).

Proof

  1. Let d = GCD(n, n + 1).
  2. Since d divides both n and n + 1, it must also divide their difference: (n + 1) − n = 1.
  3. So d is a divisor of 1. Therefore, d = 1.
  4. This means n and n + 1 are coprime.
  5. Use the fundamental LCM identity: LCM(a, b) = (a × b) ÷ GCD(a, b).
  6. Substituting: LCM(n, n + 1) = [n × (n + 1)] ÷ 1 = n × (n + 1).
Conclusion: LCM(n, n + 1) = n × (n + 1)   ∎
Takeaway: The trick isn't a magic shortcut — it's a direct consequence of the coprime rule, and it works every single time for consecutive integers.

Worked Examples — Trick Applied

Let's see the shortcut in action with three different pairs.

Example 1: LCM(4, 5)

Step Action Result
1 Check: are 4 and 5 consecutive? Yes (5 − 4 = 1)
2 Multiply directly 4 × 5 = 20
✓ Verify: 20 ÷ 4 and 20 ÷ 5 20 ÷ 4 = 5 ✓; 20 ÷ 5 = 4 ✓

Answer: LCM(4, 5) = 20.

Example 2: LCM(9, 10)

Step Action Result
1 Check: are 9 and 10 consecutive? Yes (10 − 9 = 1)
2 Multiply directly 9 × 10 = 90
✓ Verify: 90 ÷ 9 and 90 ÷ 10 90 ÷ 9 = 10 ✓; 90 ÷ 10 = 9 ✓

Answer: LCM(9, 10) = 90.

Example 3: LCM(99, 100)

Step Action Result
1 Check: are 99 and 100 consecutive? Yes (100 − 99 = 1)
2 Multiply directly 99 × 100 = 9900
✓ Verify: 9900 ÷ 99 and 9900 ÷ 100 9900 ÷ 99 = 100 ✓; 9900 ÷ 100 = 99 ✓

Answer: LCM(99, 100) = 9900.

Quick Reference Table — LCM of Consecutive Numbers

Here are the LCM values for common consecutive number pairs. Notice how each LCM is simply the product.

LCM(1, 2)2
LCM(2, 3)6
LCM(3, 4)12
LCM(4, 5)20
LCM(5, 6)30
LCM(6, 7)42
LCM(7, 8)56
LCM(8, 9)72
LCM(9, 10)90
LCM(10, 11)110
LCM(11, 12)132
LCM(12, 13)156
LCM(15, 16)240
LCM(20, 21)420
LCM(25, 26)650
LCM(50, 51)2550
LCM(99, 100)9900
LCM(100, 101)10100
Pattern: Each LCM grows quadratically (n × (n+1)) — but the shortcut means you never have to list multiples again.

When Does the Trick NOT Work?

The shortcut only applies to consecutive integers (numbers differing by 1). It fails for other kinds of "consecutive" pairs.

Diagram 3: Consecutive Classification — Integers vs Even vs Odd Numbers

Side-by-side comparison of consecutive series: Consecutive integers and consecutive odd numbers have GCD = 1 (Product rule applies), while consecutive even numbers have GCD = 2 (Requires halving).

THIS ARTICLE Consecutive Integers (n, n+1) · e.g. (7, 8) GCD = 1 (Coprime) FULL PRODUCT TRICK n × (n+1) = 56 Trick Works 100% ✓ Consecutive Even (2n, 2n+2) · e.g. (4, 6) GCD = 2 (NOT Coprime) LCM = HALF PRODUCT (a × b) ÷ 2 = 12 Consecutive Odd (2n+1, 2n+3) · e.g. (5, 7) GCD = 1 (Coprime) FULL PRODUCT TRICK a × b = 35 ✓
Pair Type Example GCD LCM Does Trick Work?
Consecutive integers (7, 8) 1 56 ✓ Yes
Consecutive integers (12, 13) 1 156 ✓ Yes
Consecutive even numbers (4, 6) 2 12 ✗ No
Consecutive odd numbers (5, 7) 1 35 ✓ Yes*
Consecutive multiples of 3 (3, 6) 3 6 ✗ No
Consecutive multiples of 10 (10, 20) 10 20 ✗ No
Careful: Consecutive even numbers (like 4 and 6) or consecutive multiples of 3 (like 6 and 9) are NOT coprime — so the trick doesn't apply. Use the standard LCM methods instead.

*Note on consecutive odd numbers: Consecutive odd numbers like 5 and 7 are always coprime (their GCD is 1), so the trick does work for them. For example, LCM(5, 7) = 5 × 7 = 35. But consecutive even numbers are not coprime, so the trick fails for those.

Real-World Applications of the Trick

The shortcut is especially useful when you need fast mental math for scheduling, packing, or any situation involving coprime numbers.

Field Problem Example Using the Trick
Scheduling Two events repeat every n and n+1 minutes Every 9 and 10 minutes → LCM = 9 × 10 = 90 min
Mechanics Gears with consecutive tooth counts realign 11-tooth & 12-tooth gears → 11 × 12 = 132 turns
Commerce Purchase equal quantities from consecutive pack sizes 7-pack & 8-pack → buy 56 of each
Fractions Add fractions with consecutive denominators 1/6 + 1/7 = 13/42 (denominator = 42 = 6 × 7)
Music Rhythm patterns with consecutive beats per bar 5/8 & 6/8 time → realign every 30 beats

Fractions with Consecutive Denominators

One of the cleanest uses of the trick is adding or subtracting fractions with consecutive denominators.

Example: 1/5 + 1/6
Since LCM(5, 6) = 5 × 6 = 30 (from the trick),
1/5 + 1/6 = 6/30 + 5/30 = 11/30

The denominator is always just the product of the two consecutive numbers!

Common Mistakes to Avoid

Even experienced students fall for these traps. Watch out for them.

❌ Mistake Why it's wrong ✅ Correct approach
Applying the trick to 4 and 6 4 and 6 are consecutive even numbers, not consecutive integers. GCD(4, 6) = 2 Use standard methods: LCM(4, 6) = 12
Applying the trick to 6 and 9 6 and 9 are consecutive multiples of 3, not consecutive integers. GCD(6, 9) = 3 Use standard methods: LCM(6, 9) = 18
Forgetting to check GCD first The trick only works when GCD = 1 Always verify the numbers are coprime before multiplying
Multiplying huge numbers by hand Even though the trick works, 999 × 1000 = 999000 is easy to slip up on Use a calculator or double-check via the LCM identity
Pro tip: Whenever you suspect the trick applies, first check GCD(a, b). If the GCD is 1, the trick works. If not, fall back to the standard LCM formula: LCM(a, b) = (a × b) ÷ GCD(a, b).

Frequently Asked Questions

Quick answers to the most common questions about the LCM of two consecutive numbers.

What is the LCM of two consecutive numbers?

The LCM of two consecutive numbers is always their product. For example, LCM(4, 5) = 4 × 5 = 20, and LCM(9, 10) = 9 × 10 = 90.

Why is the LCM of consecutive numbers their product?

Two consecutive integers are always coprime (their GCD is 1). For coprime numbers, LCM(a, b) = a × b. That's why the trick works every single time.

What is the LCM of 1 and 2?

The LCM of 1 and 2 is 2, since 1 × 2 = 2.

What is the LCM of 10 and 11?

The LCM of 10 and 11 is 110, since 10 × 11 = 110.

What is the LCM of 100 and 101?

The LCM of 100 and 101 is 10100, since 100 × 101 = 10100.

Is this trick true for consecutive even or odd numbers?

The trick works for consecutive odd numbers like 5 and 7 (they're coprime), but it does not work for consecutive even numbers like 4 and 6 (their GCD is 2, not 1). Always check the GCD first.

Are consecutive numbers always coprime?

Yes. Any two consecutive integers (like n and n+1) are always coprime — their GCD is always 1. This is because the only common divisor of n and n+1 must also divide their difference, which is 1.

What is the LCM of the largest possible pair of consecutive numbers?

There is no "largest" pair — for any integer n, the pair (n, n+1) has LCM = n(n+1). As n grows, the LCM grows quadratically.

Can I use this trick for three consecutive numbers?

Not directly. Three consecutive numbers like 4, 5, 6 are not pairwise coprime (4 and 6 share 2). For LCM(4, 5, 6) = 60, you'd need standard methods. The trick only applies to pairs of consecutive integers.

Mathematical Glossary

Key terms related to consecutive numbers and the LCM shortcut.

Consecutive Numbers
Two integers that follow each other in order, differing by exactly 1 — like n and n+1 (e.g., 7 and 8).
LCM
Least Common Multiple — the smallest positive integer divisible by every number in a set. For consecutive numbers, LCM = product.
GCD
Greatest Common Divisor — the largest positive integer that divides each number in a set evenly. For consecutive numbers, GCD = 1.
Coprime
Two numbers whose GCD is 1. Consecutive integers are always coprime, which is why the trick works.
Coprime Rule
If GCD(a, b) = 1, then LCM(a, b) = a × b. This is the mathematical foundation of the shortcut.
Consecutive Even Numbers
Even numbers differing by 2 — like 4 and 6, or 8 and 10. They are not coprime, so the trick doesn't apply.
Consecutive Odd Numbers
Odd numbers differing by 2 — like 5 and 7, or 9 and 11. They are coprime, so the trick works.