Practice30Create account

Find the largest number that divides 1230 and 1926 leaving remainder 12 in each case.
Use Euclid's algorithm after subtracting the remainder.

Class 10Euclid's Division LemmaNumber Systems
  • A348
  • B174
  • C159
  • D189

Step-by-Step Solution

Subtract 12: 1230 - 12 = 1218, 1926 - 12 = 1914. Required number = HCF(1218, 1914). ; ; ; . HCF = 174.
Answer: B) 174

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

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…Find the largest number that divides both 245 and 1029, leaving remainder 5 in each…A rectangular courtyard is 18 m 72 cm long and 13 m 20 cm broad. It is to be paved with…