Practice30Create account

Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively.
Use Euclid's algorithm.

Class 10Euclid's Division LemmaNumber Systems
  • A123
  • B138
  • C153
  • D276

Step-by-Step Solution

Subtract remainders: 285-9 = 276, 1249-7 = 1242. HCF(276,1242): ; . HCF = 138.
Answer: B) 138

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

Two tankers contain 850 litres and 680 litres of milk. The milk is to be measured…Show that one and only one out of n, n+2, n+4 is divisible by 3. For n = 7, exactly one…Find the largest number that divides 398, 436 and 542 leaving remainders 7, 11 and 15…Using Euclid's algorithm, HCF(a, b) = HCF(b, r) where a = bq + r. If HCF(1620, 1725) is…Find the largest number which divides 626, 3127 and 15628 leaving remainders 1, 2 and 3…