The LCM of 7 and 14 is 14. This is a special case: since 7 divides 14 evenly, the LCM is simply the larger number. Learn why, along with visual Venn diagrams, three methods, worked examples, the GCD relationship, and real-world applications.
The LCM of 7 and 14 is 14. The Least Common Multiple (LCM) of two numbers is the smallest positive integer that is divisible by both numbers without leaving a remainder.
For 7 and 14, the LCM is 14 because:
Visualization of the first 10 multiples of 7 and 14. The very first number that appears in both lists is 14.
Visualizing prime factors: because 7 is a divisor of 14 (14 = 2 × 7), all of 7's prime factors lie inside the intersection. The intersection forms the GCD (7), while the entire union (2 × 7) equals the LCM (14).
The fastest way to find LCM(7, 14) is to notice that 7 divides 14 evenly. When one number divides the other, the LCM is simply the larger number.
Let's verify. Does 7 divide 14 evenly? Yes: 14 ÷ 7 = 2. So 14 is already a multiple of 7. That means every multiple of 14 is automatically a multiple of 7, and the smallest common multiple is 14 itself.
This shortcut works whenever one number is a multiple of the other. Common cases include:
There are three standard methods to find the LCM of 7 and 14. All three give the same answer: 14.
Notice that 7 divides 14, so the LCM is simply the larger number: 14.
List multiples of 7 (7, 14, 21, …) and 14 (14, 28, 42, …) — the smallest common is 14.
Break 7 and 14 into primes, take the highest power of each: 2 × 7 = 14.
Even though the shortcut is faster, let's verify using prime factorization.
| Number | Prime Factorization | 2 | 7 | Highest Power |
|---|---|---|---|---|
| 7 | 71 | — | 71 | — |
| 14 | 21 × 71 | 21 | 71 | — |
| LCM | 21 × 71 | 21 | 71 | 2 × 7 = 14 |
List the multiples of 7 and 14 until you find the smallest common multiple.
| Number | Multiples | First Common |
|---|---|---|
| 7 | 7, 14, 21, 28, 35, 42, … | 14 |
| 14 | 14, 28, 42, 56, 70, 84, … |
The LCM and GCD (Greatest Common Divisor) of 7 and 14 are different values — but there's an interesting relationship when one divides the other.
| Aspect | LCM of 7 and 14 | GCD of 7 and 14 |
|---|---|---|
| Definition | Smallest number divisible by both 7 and 14 | Largest number that divides both 7 and 14 |
| Value | 14 | 7 |
| Relationship | LCM(7, 14) × GCD(7, 14) = 14 × 7 = 98 = 7 × 14 ✓ | |
| Size | Always ≥ 14 (the largest input) | Always ≤ 7 (the smallest input) |
| Primary Use | Adding fractions, scheduling | Simplifying fractions, grouping |
The LCM of 7 and 14 appears in many practical situations where repeating events need to align.
| Field | Problem | LCM Role | Example |
|---|---|---|---|
| Mathematics | Adding fractions | Find common denominator | 1/7 + 1/14 = 2/14 + 1/14 = 3/14 |
| Scheduling | Repeating events | When events align | Bus every 7 min & 14 min → every 14 min |
| Mechanics | Gear rotation | Re-alignment point | 7-tooth & 14-tooth gears → realign after 14 turns |
| Commerce | Package sizes | Equal quantities | 7-pack & 14-pack → buy 14 of each |
| Music | Rhythm pattern | Pattern re-sync | 7/8 & 14/8 time → realign every 14 beats |
To add 1/7 + 1/14, find the LCD (Least Common Denominator), which is LCM(7, 14) = 14.
If one bus leaves every 7 minutes and another every 14 minutes, they will depart together every LCM(7, 14) = 14 minutes. (In fact, the slower bus's schedule fully contains the faster bus's schedule.)
Three fully solved examples using different methods.
| Step | Action | Result |
|---|---|---|
| 1 | Check if 7 divides 14 | 14 ÷ 7 = 2 ✓ |
| 2 | Apply divisor rule: LCM = larger | LCM = 14 |
| ✓ | Verify | 14 ÷ 7 = 2 ✓; 14 ÷ 14 = 1 ✓ |
Find LCM(7, 14) using GCD(7, 14) = 7.
Find the first common multiple of 7 and 14.
Here are LCM values for pairs that commonly appear alongside LCM(7, 14), especially other divisor-shortcut cases.
Here are the most common errors students make on this pair — and how to avoid them.
| ❌ Mistake | Why it's wrong | ✅ Correct approach |
|---|---|---|
| Saying the LCM is 98 | 98 is the product 7 × 14, but not the least common multiple | The LCM of 7 and 14 is 14 |
| Multiplying 7 × 14 = 98 | Only works when numbers are coprime (GCD = 1). Here GCD(7, 14) = 7 | Since 7 divides 14, LCM = 14 |
| Confusing LCM with GCD | LCM(7, 14) = 14 (bigger), GCD(7, 14) = 7 (smaller) | Remember: LCM ≥ max(7, 14) = 14; GCD ≤ min(7, 14) = 7 |
| Applying the divisor shortcut wrongly | Assuming 7 divides 14 is enough — but you still need to check exactly | Confirm 14 ÷ 7 = 2 (whole number), then LCM = 14 |
Quick answers to the most common questions about the LCM of 7 and 14.
The LCM of 7 and 14 is 14. Since 7 divides 14 evenly, the LCM is simply the larger number.
The fastest way is the divisor shortcut: since 14 ÷ 7 = 2 (a whole number), 7 divides 14, so the LCM is 14. You can also use prime factorization: 7 = 7 and 14 = 2 × 7, so LCM = 2 × 7 = 14.
The GCD (Greatest Common Divisor) of 7 and 14 is 7, because 7 divides both numbers evenly.
For any two numbers: LCM(a, b) × GCD(a, b) = a × b. For 7 and 14: LCM(7, 14) × GCD(7, 14) = 14 × 7 = 98 = 7 × 14 ✓
The LCM of 7, 14, and 21 is 42. Prime factorization: 7 = 7, 14 = 2 × 7, 21 = 3 × 7. Highest powers: 2 × 3 × 7 = 42.
No. 98 is the product 7 × 14, but the LCM is smaller. Since 7 divides 14, the LCM of 7 and 14 is 14. 98 is simply one of the common multiples.
The LCM of 7 and 14 is 14, which is an integer. The formula for LCM of fractions is different: LCM(a₁/b₁, a₂/b₂) = LCM(numerators) ÷ GCD(denominators).
LCM(7, 14) = 14 is used when adding fractions with denominators 7 and 14 (LCD = 14), when scheduling events that repeat every 7 and 14 minutes (they align every 14 minutes), and when finding when two gears with 7 and 14 teeth will realign.
Key terms related to the LCM of 7 and 14.