SOLVER7 Study. Nothing Else.
2026 Board Paper Q23(a)

Find the smallest number which is divisible by both 644 and 462.

CBSE Class 10 Maths · Real Numbers

Solution

👶 Simple Explanation

Simple Explanation

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 \]

📖 Find the Smallest Number Divisible by Both 644 and 462

Detailed Explanation

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.

Formula Used

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)} \]

Solution

  1. Step 1: Prime Factorisation of 644: Divide 644 by the smallest prime numbers successively. 644 divided by 2 gives 322. \[ 644 = 2 \times 322 \] 322 divided by 2 gives 161. \[ 322 = 2 \times 161 \] 161 divided by 7 gives 23. \[ 161 = 7 \times 23 \] 23 is a prime number.
    So the prime factorisation of 644 is: \[ 644 = 2^2 \times 7 \times 23 \]
  2. Step 2: Prime Factorisation of 462: Divide 462 by the smallest prime numbers successively. 462 divided by 2 gives 231. \[ 462 = 2 \times 231 \] 231 divided by 3 gives 77. \[ 231 = 3 \times 77 \] 77 divided by 7 gives 11. \[ 77 = 7 \times 11 \] 11 is a prime number.
    So the prime factorisation of 462 is: \[ 462 = 2 \times 3 \times 7 \times 11 \]
  3. Step 3: Identify All Prime Factors and Their Highest Powers: List every prime factor appearing in either number, and take the highest power of each.
    Prime 2: appears as \( 2^2 \) in 644 and \( 2^1 \) in 462. Highest power: \( 2^2 \).
    Prime 3: appears as \( 3^1 \) in 462 only. Highest power: \( 3^1 \).
    Prime 7: appears as \( 7^1 \) in both. Highest power: \( 7^1 \).
    Prime 11: appears as \( 11^1 \) in 462 only. Highest power: \( 11^1 \).
    Prime 23: appears as \( 23^1 \) in 644 only. Highest power: \( 23^1 \).
  4. Step 4: Calculate the LCM: Multiply all the highest powers together to find the LCM. \[ LCM = 2^2 \times 3 \times 7 \times 11 \times 23 \]
    Calculating step by step: \[ 2^2 = 4 \] \[ 4 \times 3 = 12 \] \[ 12 \times 7 = 84 \] \[ 84 \times 11 = 924 \] \[ 924 \times 23 = 21252 \]
    So, \[ LCM(644, 462) = 21252 \]
  5. Step 5: Verify the Answer: Check that 21252 is divisible by both 644 and 462. \[ 21252 \div 644 = 33 \] which is a whole number, so 644 divides 21252 exactly. \[ 21252 \div 462 = 46 \] which is a whole number, so 462 divides 21252 exactly.
    Both give whole number results, confirming the answer is correct.

Final Answer

The smallest number divisible by both 644 and 462 is \[ LCM(644, 462) = 21252 \]

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Prime factorise 644 by dividing repeatedly by the smallest prime that fits. \[ 644 \div 2 = 322 \] \[ 322 \div 2 = 161 \] \[ 161 \div 7 = 23 \] 23 is itself prime, so we stop. Writing the result: \[ 644 = 2^2 \times 7 \times 23 \] Reason: Breaking a number into its prime factors lets us clearly see every building block it contains.
  2. Step 2: Prime factorise 462 in the same way. \[ 462 \div 2 = 231 \] \[ 231 \div 3 = 77 \] \[ 77 \div 7 = 11 \] 11 is itself prime, so we stop. Writing the result: \[ 462 = 2 \times 3 \times 7 \times 11 \] Reason: We need the prime factorisation of both numbers before we can compare their factors.
  3. Step 3: List every distinct prime factor that appears in either number: \( 2, 3, 7, 11, 23 \). Now identify the highest power of each prime across both factorisations. For \( 2 \): appears as \( 2^2 \) in 644 and \( 2^1 \) in 462, so the highest power is \( 2^2 \). For \( 3 \): appears only in 462 as \( 3^1 \), so the highest power is \( 3^1 \). For \( 7 \): appears as \( 7^1 \) in both, so the highest power is \( 7^1 \). For \( 11 \): appears only in 462 as \( 11^1 \), so the highest power is \( 11^1 \). For \( 23 \): appears only in 644 as \( 23^1 \), so the highest power is \( 23^1 \). Reason: The LCM must include every prime factor at its greatest occurrence so that it is divisible by both numbers without leaving a remainder.
  4. Step 4: Multiply all the highest powers together to get the LCM. \[ LCM(644, 462) = 2^2 \times 3 \times 7 \times 11 \times 23 \] Compute step by step: \[ 2^2 = 4 \] \[ 4 \times 3 = 12 \] \[ 12 \times 7 = 84 \] \[ 84 \times 11 = 924 \] \[ 924 \times 23 = 21252 \] Reason: Multiplying the chosen prime powers gives the smallest number that contains all prime factors of both 644 and 462, ensuring divisibility by each.

Final Answer

The smallest number divisible by both 644 and 462 is \[ LCM(644, 462) = 21252 \]

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Prime factorise both numbers: \[ 644 = 2^2 \times 7 \times 23 \] \[ 462 = 2 \times 3 \times 7 \times 11 \]
  2. Step 2: Take highest powers of all prime factors: \( 2^2, 3^1, 7^1, 11^1, 23^1 \)
  3. Step 3: \[ LCM = 2^2 \times 3 \times 7 \times 11 \times 23 = 4 \times 3 \times 7 \times 11 \times 23 = 21252 \]

Answer: The smallest number divisible by both 644 and 462 is \[ LCM(644, 462) = 21252 \]

➕ More Examples

More Examples

Example 1

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

Example 2

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

🎯 Try a Similar Question

Try a Similar Question

Question: Find the smallest number which is divisible by both 560 and 378.

Solution

  1. Step 1: Prime Factorisation of 560: Divide 560 by prime numbers: 560 = 2 \times 280 = 2 \times 2 \times 140 = 2 \times 2 \times 2 \times 70 = 2 \times 2 \times 2 \times 2 \times 35 = 2 \times 2 \times 2 \times 2 \times 5 \times 7. So the prime factorisation is \[ 560 = 2^4 \times 5 \times 7 \]
  2. Step 2: Prime Factorisation of 378: Divide 378 by prime numbers: 378 = 2 \times 189 = 2 \times 3 \times 63 = 2 \times 3 \times 3 \times 21 = 2 \times 3 \times 3 \times 3 \times 7. So the prime factorisation is \[ 378 = 2 \times 3^3 \times 7 \]
  3. Step 3: Find the HCF: The HCF is the product of the lowest powers of all common prime factors. The common prime factors are 2 and 7. Therefore, \[ HCF(560, 378) = 2^1 \times 7^1 = 14 \]
  4. Step 4: Find the LCM using the formula: Using the relation between LCM, HCF, and the two numbers: \[ LCM(560, 378) = \frac{560 \times 378}{HCF(560, 378)} \] Substituting the values: \[ LCM(560, 378) = \frac{560 \times 378}{14} \] \[ LCM(560, 378) = \frac{211680}{14} = 15120 \]
  5. Step 5: Verify using prime factorisation method: The LCM is the product of the highest powers of all prime factors that appear in either number. The prime factors involved are 2, 3, 5, and 7. \[ LCM = 2^4 \times 3^3 \times 5 \times 7 = 16 \times 27 \times 5 \times 7 = 15120 \] This confirms our answer.

Answer: The smallest number divisible by both 560 and 378 is \[ LCM(560, 378) = 15120 \]

Everything you get with Solver7

More questions in Real Numbers

Chapter 1 - Theorem Q1 30/4/1 2023 / Section A Q1 430/1/1 2026 / Section A Q1 430/2/1 2026 / Section A Q1 430/3/1 2026 / Section A Q1 430/4/1 2026 / Section A Q1 430/5/1 2024 / Section A Q1 Chapter 1 - Theorem Q2 30/3/1 2026 / Section A Q2 430/1/1 2026 / Section A Q2 430/2/1 2026 / Section A Q2 430/3/1 2026 / Section A Q2 CBSE-ADDL1 2024 / Section A Q2 Chapter 1 - Theorem Q3 430/3/1 2026 / Section A Q3 Chapter 1 - Examples Q1 30/2/1 2023 / Section A Q4 30/2/1 2026 / Section A Q4 Chapter 1 - Examples Q2 Chapter 1 - Examples Q3 30/1/1 2026 / Section A Q6 430/5/1 2023 / Section A Q6 Chapter 1 - Examples Q4 430/2/1 2023 / Section A Q7 430/5/1 2024 / Section A Q7 Chapter 1 - Examples Q5 430/5/1 2024 / Section A Q8 Chapter 1 - Examples Q6 30/1/1 2026 / Section A Q9 Chapter 1 - Examples Q7 30/2/1 2026 / Section A Q10 Exercise 1.1 Q1 (i) Exercise 1.1 Q1 (ii) Exercise 1.1 Q1 (iii) 430/4/1 2024 / Section A Q13 Exercise 1.1 Q1 (iv) 30/1/1 2026 / Section A Q14 Exercise 1.1 Q1 (v) Exercise 1.1 Q2 (i) Exercise 1.1 Q2 (ii) Exercise 1.1 Q2 (iii) 30/2/1 2026 / Section A Q18 Exercise 1.1 Q3 (i) 430/1/1 2026 / Section A Q19 430/2/1 2026 / Section A Q19 CBSE-ADDL2 2024 / Section A Q19 Exercise 1.1 Q3 (ii) 30/5/1 2023 / Section A Q20 430/3/1 2024 / Section A Q20 Exercise 1.1 Q3 (iii) 30/2/1 2023 / Section B Q21 30/4/1 2023 / Section B Q21 430/4/1 2024 / Section B Q21 430/4/1 2026 / Section B Q21 430/5/1 2023 / Section B Q21 CBSE-ADDL1 2024 / Section B Q21 CBSE-ADDL2 2024 / Section B Q21 Exercise 1.1 Q4 430/2/1 2023 / Section B Q22(a) Exercise 1.1 Q5