Practice30Create account

By Euclid's Division Lemma, the HCF of two numbers also divides their difference. The HCF of 1260 and 7344 is found by the algorithm.
What is HCF(1260, 7344)?

Class 10Euclid's Division LemmaNumber Systems
  • A32
  • B36
  • C72
  • D40

Step-by-Step Solution

7344 = ; ; ; ; . HCF = 36.
Answer: B) 36

Master this chapter in 30 minutes a day.

Don't just memorise the answer — build a daily practice habit.

Practice 5 Similar Questions Free →

All Euclid's Division Lemma practice questions

More Class 10 Euclid's Division Lemma practice

Three bells in a Mumbai temple toll at intervals, and a student wants the greatest…Find the largest number that divides 1230 and 1926 leaving remainder 12 in each case.…Using Euclid's Division Lemma, any positive integer is 5q, 5q+1, 5q+2, 5q+3 or 5q+4. For…A gardener has 1001 roses and 910 marigolds. He makes the maximum number of identical…When a positive integer n is divided by 7 the quotient and remainder are equal. What is…