Two consecutive odd numbers are pairs like (3, 5), (5, 7), (7, 9), (9, 11), or (99, 101). Unlike consecutive even numbers, they are coprime — their GCD is always 1 — so the shortcut is simple: their LCM equals their product. This guide explains the trick, the math behind it, visual proofs, worked examples, and where it applies.
Two odd numbers are consecutive odd numbers when they differ by exactly 2, with no odd number between them. If the first is 2n + 1, the next is 2n + 3.
Examples of consecutive odd number pairs:
Just like consecutive integers, consecutive odd numbers are coprime. So their LCM is just the product.
Here's how to use the trick in three quick steps:
Confirm both numbers are odd and differ by exactly 2 (like 7 and 9, or 21 and 23).
Skip the long method — just compute a × b in your head or on paper.
Divide the result by each number. Both divisions should give whole numbers.
The shortcut works because consecutive odd numbers — like consecutive integers — are always coprime.
Now let's see why consecutive odd numbers are coprime:
Any common factor of two numbers must divide their difference. Since the difference between consecutive odd numbers is 2, and odd numbers cannot be divided by 2, their GCD is always 1.
Let's prove it formally, step by step.
For any integer n ≥ 0, the LCM of 2n + 1 and 2n + 3 equals (2n + 1)(2n + 3).
Let's see the shortcut in action with three different pairs.
| Step | Action | Result |
|---|---|---|
| 1 | Check: are 5 and 7 consecutive odd? | Yes (7 − 5 = 2, both odd) |
| 2 | Multiply directly | 5 × 7 = 35 |
| ✓ | Verify: 35 ÷ 5 and 35 ÷ 7 | 35 ÷ 5 = 7 ✓; 35 ÷ 7 = 5 ✓ |
Answer: LCM(5, 7) = 35.
| Step | Action | Result |
|---|---|---|
| 1 | Check: are 21 and 23 consecutive odd? | Yes (23 − 21 = 2, both odd) |
| 2 | Multiply directly | 21 × 23 = 483 |
| ✓ | Verify: 483 ÷ 21 and 483 ÷ 23 | 483 ÷ 21 = 23 ✓; 483 ÷ 23 = 21 ✓ |
Answer: LCM(21, 23) = 483.
| Step | Action | Result |
|---|---|---|
| 1 | Check: are 99 and 101 consecutive odd? | Yes (101 − 99 = 2, both odd) |
| 2 | Multiply directly | 99 × 101 = 9999 |
| ✓ | Verify: 9999 ÷ 99 and 9999 ÷ 101 | 9999 ÷ 99 = 101 ✓; 9999 ÷ 101 = 99 ✓ |
Answer: LCM(99, 101) = 9999.
Because consecutive odd numbers differ by 2, their product equals the square of the even number in between minus 1: (M − 1)(M + 1) = M² − 1. This allows lightning-fast mental calculations!
Here are the LCM values for common consecutive odd number pairs. Notice how each LCM is simply the product of the two numbers.
The LCM formula depends on whether the numbers are coprime. Here's a quick comparison.
| Pair Type | Example | GCD | LCM Formula | LCM Value |
|---|---|---|---|---|
| Consecutive integers | (6, 7) | 1 | n × (n+1) | 42 |
| Consecutive odd numbers | (7, 9) | 1 | n × (n+2) | 63 |
| Consecutive even numbers | (6, 8) | 2 | (a × b) ÷ 2 | 24 |
| Consecutive multiples of 3 | (6, 9) | 3 | (a × b) ÷ 3 | 18 |
Understand at a glance why the shortcut trick works for consecutive integers and odd pairs, but fails for consecutive even numbers.
The shortcut is especially useful for scheduling, packing, and any situation involving two coprime odd numbers.
| Field | Problem | Example Using the Trick |
|---|---|---|
| Scheduling | Two events repeat every n and n+2 minutes (both odd) | Every 5 and 7 min → LCM = 5 × 7 = 35 min |
| Mechanics | Two gears with consecutive odd tooth counts realign | 9-tooth & 11-tooth gears → 9 × 11 = 99 turns |
| Commerce | Purchase equal quantities from consecutive odd pack sizes | 7-pack & 9-pack → buy 63 of each |
| Fractions | Add fractions with consecutive odd denominators | 1/7 + 1/9 = 16/63 (denominator = 63 = 7 × 9) |
| Music | Rhythm patterns with consecutive odd beats per bar | 5/8 & 7/8 time → realign every 35 beats |
One of the cleanest uses of the trick is adding or subtracting fractions with consecutive odd denominators.
The denominator is always just the product of the two consecutive odd numbers!
Even experienced students fall for these traps. Watch out for them.
| ❌ Mistake | Why it's wrong | ✅ Correct approach |
|---|---|---|
| Applying the trick to (3, 5) and calling it (3, 4) | 3 and 5 are consecutive odd numbers, not consecutive integers | Use product rule: LCM(3, 5) = 15 (same as integers by coincidence) |
| Applying the trick to (4, 6) | 4 and 6 are consecutive even numbers, not odd. GCD(4, 6) = 2 | Use LCM = (4 × 6) ÷ 2 = 12 |
| Assuming (21, 27) are consecutive odd | 27 − 21 = 6, so they're not consecutive. They share GCD = 3 | Check difference is 2 first; use standard LCM methods |
| Skipping the GCD check | The trick only works when GCD = 1 | Confirm both numbers are odd and differ by exactly 2 |
Quick answers to the most common questions about the LCM of two consecutive odd numbers.
The LCM of two consecutive odd numbers is always their product. For example, LCM(5, 7) = 35, LCM(9, 11) = 99, and LCM(21, 23) = 483.
Two consecutive odd numbers are always coprime (their GCD is 1). For coprime numbers, LCM(a, b) = a × b. That's why the trick works every single time.
The LCM of 3 and 5 is 15, since 3 × 5 = 15.
The LCM of 7 and 9 is 63, since 7 × 9 = 63.
The LCM of 99 and 101 is 9999, since 99 × 101 = 9999. Tip: 99 × 101 = 100² − 1 = 10000 − 1 = 9999.
No. Consecutive even numbers are NOT coprime (their GCD is 2), so their LCM is half their product. The trick only works for consecutive odd numbers and consecutive integers.
Yes. Any two consecutive odd integers (like 2n+1 and 2n+3) are always coprime — their GCD is always 1.
No. 9 − 5 = 4, so they are not consecutive. However, they're still coprime, so LCM(5, 9) = 5 × 9 = 45. The trick works whenever the GCD is 1, not just for consecutive odd numbers.
Not directly solvable with the product rule. Three consecutive odd numbers like 3, 5, 7 share factors (e.g., 3 and 9 if present). Use standard LCM methods for triplets. For (3, 5, 7), LCM = 105.
Key terms related to consecutive odd numbers and the LCM trick.