The Lowest Common Multiple (LCM) of two or more positive integers is the smallest positive integer that is divisible by all of them without a remainder. Understanding how to calculate the LCM using the prime factorisation method is a core requirement of CBSE Class 10 Mathematics.
Beyond purely algebraic computations, LCM plays a vital role in solving real-world word problems involving periodic events, such as bells ringing simultaneously, runners completing circular laps, or traffic lights changing at synchronized intervals.
What You Will Learn
- Definition and conceptual foundation of LCM
- The greatest powers rule for prime factorisation
- Step-by-step method to compute LCM of two and three numbers
- Solving algebraic variable LCM problems
- Solving real-life word problems (circular tracks, traffic signals, alarm clocks)
- Verification using the relationship
- Common student mistakes to avoid
1. What is LCM?
The Lowest Common Multiple (LCM) of two or more positive integers is the smallest positive integer that is a multiple of every one of the numbers.
Prime Factorisation Rule for LCM
LCM is the product of the greatest power of each prime factor involved in the numbers.
Important: <u>Unlike HCF, which takes only common prime factors, LCM includes EVERY prime factor that appears in ANY of the numbers, raised to its highest observed power.</u>
2. Step-by-Step Procedure
To find the LCM of numbers using prime factorisation:
- Step 1: Write the prime factorisation of each number in exponential form.
- Step 2: List all unique prime factors that appear in any of the factorisations.
- Step 3: For each prime factor, identify its highest exponent across all numbers.
- Step 4: Multiply these highest powers together to obtain the LCM.
3. Solved Numerical Examples
Solved Example 1: Two Numbers
Problem: Find the LCM of and using prime factorisation. Hence, verify that .
Solution:
- Step 1 (Prime factorisation):
- Step 2 (Identify all unique primes): The primes involved are , , and .
- Step 3 (Select greatest powers):
- Highest power of :
- Highest power of :
- Highest power of :
- Step 4 (Compute LCM):
Verification:
- Calculate HCF (smallest powers of common primes):
- Check product:
- Since , the relationship is verified.
Solved Example 2: Algebraic Variables (CBSE Board Question)
Problem: If two positive integers and can be expressed as and , where and are prime numbers, find .
Solution:
- We are given:
- Primes involved: and .
- Highest power of each factor:
- For prime :
- For prime :
- Therefore:
4. Real-World Word Problems (CBSE Board Classics)
Word Problem: Circular Sports Track
Problem: There is a circular path around a sports field. Sonia takes minutes to drive one round of the field, while Ravi takes minutes for the same. Suppose they both start at the same point and at the same time, and go in the same direction. After how many minutes will they meet again at the starting point?
Solution:
- Sonia returns to the start line at multiples of minutes:
- Ravi returns to the start line at multiples of minutes:
- They will meet at the starting point again after a duration that is a common multiple of and . To find the first time they meet, we need the Least Common Multiple (LCM) of and .
- Prime factorise both times:
- Compute LCM:
- Therefore, <u>Sonia and Ravi will meet again at the starting point after minutes</u>.
5. HCF vs LCM Comparison
| Property | Highest Common Factor (HCF) | Lowest Common Multiple (LCM) |
|---|---|---|
| Prime Factor Selection | ONLY common prime factors | ALL prime factors present in any number |
| Exponent Rule | Smallest exponent () | Greatest exponent () |
| Magnitude | Less than or equal to smallest number | Greater than or equal to largest number |
| Word Problem Clues | "Maximum size", "greatest length", "equal dividing" | "Repeat together", "minimum time", "meet again" |
Remember: For any two numbers and , their is always a factor of their . If HCF does not divide LCM evenly, an arithmetic error has occurred!
Common Mistake: Confusing HCF with LCM in word problems. If the question asks for when recurring events will coincide next, you must always find LCM!