SOLVER7 Study. Nothing Else.
2024 Board Paper Q26

Find LCM and HCF of two numbers 336 and 54, using prime-factorization method.

CBSE Class 10 Maths · Real Numbers

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have two bags of marbles — one with 336 marbles and one with 54. You want to split each bag into equal groups. The biggest equal group size that works for both bags is called the HCF. Here, that magic number is 6. The smallest collection where both group sizes fit perfectly is the LCM, which is 3024. Think of it like two drummers beating different rhythms — they play together again after 3024 beats!

Answer: For the numbers 336 and 54: \[ \text{HCF}(336, 54) = 6 \] \[ \text{LCM}(336, 54) = 3024 \]

📖 LCM and HCF by Prime Factorisation

Detailed Explanation

Prime factorisation means writing a number as a product of its prime factors. Once we have the prime factorisations of two numbers, we can find:
HCF (Highest Common Factor) — the largest number that divides both numbers exactly. We get it by taking the LOWEST power of each prime factor that is COMMON to both numbers.
LCM (Least Common Multiple) — the smallest number that is divisible by both numbers. We get it by taking the HIGHEST power of each prime factor that appears in EITHER number.
There is also a beautiful relationship between the two: for any two positive integers, the product of their LCM and HCF equals the product of the two numbers themselves.

Formula Used

HCF = product of the SMALLEST powers of all COMMON prime factors.
LCM = product of the LARGEST powers of ALL prime factors (from either number).
Relationship: \( \text{LCM} \times \text{HCF} = \text{First number} \times \text{Second number} \)

Solution

  1. Step 1: Prime Factorisation of 336: Divide 336 repeatedly by the smallest possible prime at each stage. 336 divided by 2 gives 168. 168 divided by 2 gives 84. 84 divided by 2 gives 42. 42 divided by 2 gives 21. 21 divided by 3 gives 7. 7 is itself prime.
    So the prime factorisation of 336 is: \[ 336 = 2^4 \times 3^1 \times 7^1 \]
  2. Step 2: Prime Factorisation of 54: Divide 54 repeatedly by the smallest possible prime at each stage. 54 divided by 2 gives 27. 27 divided by 3 gives 9. 9 divided by 3 gives 3. 3 divided by 3 gives 1.
    So the prime factorisation of 54 is: \[ 54 = 2^1 \times 3^3 \]
  3. Step 3: Identify All Prime Factors: List the prime factors that appear in both factorisations: \[ 336 = 2^4 \times 3^1 \times 7^1 \] \[ 54 = 2^1 \times 3^3 \]
    The prime factors involved are 2, 3, and 7. The factor 7 appears only in 336 and not in 54.
  4. Step 4: Calculate the HCF: For HCF, take the LOWEST power of each prime factor that is COMMON to both numbers.
    Common primes are 2 and 3 (since 7 does not appear in 54).
    Lowest power of 2: \( 2^1 \) (minimum of powers 4 and 1).
    Lowest power of 3: \( 3^1 \) (minimum of powers 1 and 3).
    Therefore: \[ \text{HCF} = 2^1 \times 3^1 = 2 \times 3 = 6 \]
  5. Step 5: Calculate the LCM: For LCM, take the HIGHEST power of each prime factor appearing in EITHER number.
    Highest power of 2: \( 2^4 \) (maximum of powers 4 and 1).
    Highest power of 3: \( 3^3 \) (maximum of powers 1 and 3).
    Highest power of 7: \( 7^1 \) (appears only in 336).
    Therefore: \[ \text{LCM} = 2^4 \times 3^3 \times 7^1 = 16 \times 27 \times 7 \] \[ \text{LCM} = 16 \times 189 = 3024 \]
  6. Step 6: Verification using the Relationship: We can verify our answer using the relationship: \[ \text{LCM} \times \text{HCF} = 336 \times 54 \]
    Left side: \( 3024 \times 6 = 18144 \)
    Right side: \( 336 \times 54 = 18144 \)
    Both sides are equal, so our answers are correct.

Final Answer

For the numbers 336 and 54: \[ \text{HCF}(336, 54) = 6 \] \[ \text{LCM}(336, 54) = 3024 \]

Common Mistake

A very common mistake is confusing which rule applies to HCF and which applies to LCM. Remember: HCF uses the LOWEST (minimum) powers of COMMON factors only, while LCM uses the HIGHEST (maximum) powers of ALL factors. Many students accidentally swap these rules and end up with the LCM and HCF interchanged.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Find the prime factorisation of 336 by dividing repeatedly by the smallest prime at each stage. 336 ÷ 2 = 168, then 168 ÷ 2 = 84, then 84 ÷ 2 = 42, then 42 ÷ 2 = 21, then 21 ÷ 3 = 7, and 7 is prime. Collecting these: \[ 336 = 2^4 \times 3^1 \times 7^1 \] Reason: Expressing a number as a product of primes gives us a unique 'fingerprint' we can compare with the other number.
  2. Step 2: Find the prime factorisation of 54 by the same repeated-division method. 54 ÷ 2 = 27, then 27 ÷ 3 = 9, then 9 ÷ 3 = 3, then 3 ÷ 3 = 1. Collecting these: \[ 54 = 2^1 \times 3^3 \] Reason: We now have both numbers expressed in terms of their prime factors, so comparing powers becomes straightforward.
  3. Step 3: Identify the prime factors that are common to both 336 and 54. From \( 336 = 2^4 \times 3^1 \times 7^1 \) and \( 54 = 2^1 \times 3^3 \), the primes appearing in both are 2 and 3. The prime 7 appears only in 336, so it is not shared. Reason: Only shared primes contribute to the HCF.
  4. Step 4: Calculate the HCF by picking the lowest power of each common prime factor. For the prime 2: the powers are 4 (in 336) and 1 (in 54), so take \( 2^1 \). For the prime 3: the powers are 1 (in 336) and 3 (in 54), so take \( 3^1 \). Therefore: \[ \text{HCF}(336, 54) = 2^1 \times 3^1 = 2 \times 3 = 6 \] Reason: The lowest power ensures the factor divides both numbers exactly — taking a higher power would exceed what one of them can supply.
  5. Step 5: Calculate the LCM by picking the highest power of every prime factor that appears in either number. For 2: highest power is \( 2^4 \). For 3: highest power is \( 3^3 \). For 7: highest power is \( 7^1 \) (appears only in 336, but we still include it). Therefore: \[ \text{LCM}(336, 54) = 2^4 \times 3^3 \times 7^1 = 16 \times 27 \times 7 \] Evaluating step by step: \( 16 \times 27 = 432 \), then \( 432 \times 7 = 3024 \). So: \[ \text{LCM}(336, 54) = 3024 \] Reason: Taking the highest power guarantees the LCM is divisible by both numbers.
  6. Step 6: Verify using the relationship between HCF and LCM. We check that \( \text{HCF} \times \text{LCM} \) equals the product of the two original numbers. \[ 6 \times 3024 = 18144 \] and \[ 336 \times 54 = 18144 \] Both sides match, confirming our answers are correct. Reason: This cross-check catches any arithmetic errors made during the factorisation or power-selection steps.

Final Answer

For the numbers 336 and 54: \[ \text{HCF}(336, 54) = 6 \] \[ \text{LCM}(336, 54) = 3024 \]

Common Mistake

One common mistake: when computing the HCF, students accidentally take the HIGHEST power of common primes instead of the lowest — for example, writing \( 2^4 \times 3^3 \) for the HCF. Remember: HCF uses the minimum (lowest) shared powers, while LCM uses the maximum (highest) powers.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Prime Factorisations: \[ 336 = 2^4 \times 3^1 \times 7^1 \] \[ 54 = 2^1 \times 3^3 \]
  2. Step 2: HCF: Common prime factors with smallest powers: \[ \text{HCF}(336, 54) = 2^1 \times 3^1 = 6 \]
  3. Step 3: LCM: All prime factors with largest powers: \[ \text{LCM}(336, 54) = 2^4 \times 3^3 \times 7^1 = 16 \times 27 \times 7 = 3024 \]

Answer: For the numbers 336 and 54: \[ \text{HCF}(336, 54) = 6 \] \[ \text{LCM}(336, 54) = 3024 \]

➕ More Examples

More Examples

Example 1

Question: Find the LCM and HCF of 480 and 72 using the prime factorisation method. Also verify that HCF \(\times\) LCM = product of the two numbers.

Solution: Step 1: Prime factorisation of 480. \[ 480 = 2 \times 240 \] \[ 240 = 2 \times 120 \] \[ 120 = 2 \times 60 \] \[ 60 = 2 \times 30 \] \[ 30 = 2 \times 15 \] \[ 15 = 3 \times 5 \]
So the prime factorisation of 480 is: \[ 480 = 2^5 \times 3^1 \times 5^1 \]
Step 2: Prime factorisation of 72. \[ 72 = 2 \times 36 \] \[ 36 = 2 \times 18 \] \[ 18 = 2 \times 9 \] \[ 9 = 3 \times 3 \]
So the prime factorisation of 72 is: \[ 72 = 2^3 \times 3^2 \]
Step 3: Find the HCF by taking the smallest power of each common prime factor. The common prime factors are 2 and 3. \[ \text{HCF} = 2^3 \times 3^1 = 8 \times 3 = 24 \]
Step 4: Find the LCM by taking the greatest power of each prime factor appearing in either number. The prime factors are 2, 3, and 5. \[ \text{LCM} = 2^5 \times 3^2 \times 5^1 = 32 \times 9 \times 5 = 1440 \]
Step 5: Verification.
LHS: \[ \text{HCF} \times \text{LCM} = 24 \times 1440 = 34560 \]
RHS: \[ 480 \times 72 = 34560 \]
Since LHS = RHS, the answer is verified.

Answer: HCF = 24, LCM = 1440

Example 2

Question: Two bells ring at intervals of 252 seconds and 105 seconds respectively. They ring together at 8:00 AM. Using the prime factorisation method to find the LCM of 252 and 105, determine the next time they will ring together.

Solution: Step 1: Prime factorisation of 252. \[ 252 = 2 \times 126 \] \[ 126 = 2 \times 63 \] \[ 63 = 3 \times 21 \] \[ 21 = 3 \times 7 \]
So the prime factorisation of 252 is: \[ 252 = 2^2 \times 3^2 \times 7^1 \]
Step 2: Prime factorisation of 105. \[ 105 = 3 \times 35 \] \[ 35 = 5 \times 7 \]
So the prime factorisation of 105 is: \[ 105 = 3^1 \times 5^1 \times 7^1 \]
Step 3: Find the HCF by taking the smallest power of each common prime factor. The common prime factors are 3 and 7. \[ \text{HCF} = 3^1 \times 7^1 = 3 \times 7 = 21 \]
Step 4: Find the LCM by taking the greatest power of each prime factor appearing in either number. The prime factors are 2, 3, 5, and 7. \[ \text{LCM} = 2^2 \times 3^2 \times 5^1 \times 7^1 = 4 \times 9 \times 5 \times 7 = 1260 \]
Step 5: The bells will ring together again after 1260 seconds.
Converting 1260 seconds to minutes: \[ 1260 \div 60 = 21 \text{ minutes} \]
So the bells will ring together next at 8:00 AM + 21 minutes = 8:21 AM.

Answer: HCF = 21, LCM = 1260; the bells ring together again at 8:21 AM

🎯 Try a Similar Question

Try a Similar Question

Question: Find the LCM and HCF of the numbers 480 and 72 using the prime-factorisation method. Also verify that HCF × LCM = product of the two numbers.

Solution

  1. Step 1: Prime Factorisation of 480: Divide 480 by prime numbers successively: \(480 \div 2 = 240\), \(240 \div 2 = 120\), \(120 \div 2 = 60\), \(60 \div 2 = 30\), \(30 \div 2 = 15\), \(15 \div 3 = 5\), \(5 \div 5 = 1\). So the prime factorisation of 480 is: \[ 480 = 2^5 \times 3^1 \times 5^1 \]
  2. Step 2: Prime Factorisation of 72: Divide 72 by prime numbers successively: \(72 \div 2 = 36\), \(36 \div 2 = 18\), \(18 \div 2 = 9\), \(9 \div 3 = 3\), \(3 \div 3 = 1\). So the prime factorisation of 72 is: \[ 72 = 2^3 \times 3^2 \]
  3. Step 3: Find the HCF: The HCF is the product of the smallest powers of all common prime factors. The common prime factors of 480 and 72 are 2 and 3. Smallest power of 2: \(2^3\). Smallest power of 3: \(3^1\). Therefore: \[ \text{HCF}(480, 72) = 2^3 \times 3^1 = 8 \times 3 = 24 \]
  4. Step 4: Find the LCM: The LCM is the product of the highest powers of all prime factors appearing in either number. The prime factors involved are 2, 3, and 5. Highest power of 2: \(2^5\). Highest power of 3: \(3^2\). Highest power of 5: \(5^1\). Therefore: \[ \text{LCM}(480, 72) = 2^5 \times 3^2 \times 5^1 = 32 \times 9 \times 5 = 1440 \]
  5. Step 5: Verification: We verify using the relation: HCF \(\times\) LCM = product of the two numbers. Left-hand side: \[ 24 \times 1440 = 34560 \] Right-hand side: \[ 480 \times 72 = 34560 \] Since both sides are equal, our answers are verified.

Answer: \[ \text{HCF}(480, 72) = 24 \] \[ \text{LCM}(480, 72) = 1440 \]

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