Find the smallest number which is divisible by both 644 and 462.
CBSE Class 10 Maths · Real Numbers
CBSE Class 10 Maths · Real Numbers
Imagine two buses leaving a stop at the same time. One bus comes every 644 minutes and another every 462 minutes. We want to know when both buses arrive together again. That special moment is the smallest number both can reach by counting in their own steps. We call this the Least Common Multiple. Breaking each number into its smallest building blocks helps us find that meeting point. For 644 and 462, that meeting point is 21252.
Answer: The smallest number divisible by both 644 and 462 is \[ LCM(644, 462) = 21252 \]
The smallest number divisible by two given numbers is called their Least Common Multiple (LCM). A number is divisible by both 644 and 462 only if it contains all the prime factors of each number, taken the maximum number of times they appear in either. We find the LCM by first breaking each number into its prime factors, then multiplying together each prime factor raised to its highest power found in either number.
LCM(a, b) = product of each prime factor taken to its highest power appearing in either a or b.
Alternatively, using HCF: \[ LCM(a, b) = \frac{a \times b}{HCF(a, b)} \]
The smallest number divisible by both 644 and 462 is \[ LCM(644, 462) = 21252 \]
A very common mistake is to include each prime factor only once (as if finding the HCF), instead of taking the highest power of each prime. For example, writing \( 2 \times 3 \times 7 \times 11 \times 23 \) instead of \( 2^2 \times 3 \times 7 \times 11 \times 23 \). Always use the highest power of every prime factor from either number when calculating the LCM.
The smallest number divisible by both 644 and 462 is \[ LCM(644, 462) = 21252 \]
One common mistake: Students sometimes take the highest power of only the shared prime factors instead of every prime factor from both numbers, causing them to miss primes like 3, 11, or 23 that appear in only one of the two numbers — this gives a smaller, incorrect LCM.
Answer: The smallest number divisible by both 644 and 462 is \[ LCM(644, 462) = 21252 \]
Question: Find the smallest number that is exactly divisible by both 252 and 198.
Solution: First, find the prime factorisation of each number.
Prime factorisation of 252: \[ 252 = 2 \times 126 = 2 \times 2 \times 63 = 2^2 \times 3^2 \times 7 \]
Prime factorisation of 198: \[ 198 = 2 \times 99 = 2 \times 3 \times 33 = 2 \times 3^2 \times 11 \]
Now find the HCF by taking the lowest powers of common prime factors. The common prime factors are \( 2 \) and \( 3 \). \[ \text{HCF}(252, 198) = 2^1 \times 3^2 = 2 \times 9 = 18 \]
Now apply the formula: \[ \text{LCM}(252, 198) = \frac{252 \times 198}{\text{HCF}} = \frac{252 \times 198}{18} \]
Calculating the numerator: \( 252 \times 198 = 49896 \). Then: \[ \text{LCM} = \frac{49896}{18} = 2772 \]
Therefore, the smallest number divisible by both 252 and 198 is \( 2772 \).
Answer: 2772
Question: A school wants to arrange 840 students and 630 books in groups such that each group has the same number of students and the same number of books, with no one left out. What is the largest group size possible? Also, find the smallest number that is divisible by both 840 and 630.
Solution: Part 1 – Largest group size (HCF):
Prime factorisation of 840: \[ 840 = 2^3 \times 3 \times 5 \times 7 \]
Prime factorisation of 630: \[ 630 = 2 \times 3^2 \times 5 \times 7 \]
The HCF is found by taking the lowest powers of all common prime factors: \[ \text{HCF}(840, 630) = 2^1 \times 3^1 \times 5^1 \times 7^1 = 2 \times 3 \times 5 \times 7 = 210 \]
So the largest group size is \( 210 \).
Part 2 – Smallest number divisible by both (LCM):
Using the formula: \[ \text{LCM}(840, 630) = \frac{840 \times 630}{\text{HCF}} = \frac{840 \times 630}{210} \]
Calculating step by step: \[ \frac{840}{210} = 4 \]
So: \[ \text{LCM} = 4 \times 630 = 2520 \]
Therefore, the smallest number divisible by both 840 and 630 is \( 2520 \).
Answer: Largest group size (HCF) = 210; Smallest number divisible by both (LCM) = 2520
Question: Find the smallest number which is divisible by both 560 and 378.
Answer: The smallest number divisible by both 560 and 378 is \[ LCM(560, 378) = 15120 \]