Practice30Create account

Find the largest number that divides 398, 436 and 542 leaving remainders 7, 11 and 15 respectively.
Use Euclid's algorithm.

Class 10Euclid's Division LemmaNumber Systems
  • A34
  • B18
  • C16
  • D17

Step-by-Step Solution

Subtract remainders: 398-7 = 391, 436-11 = 425, 542-15 = 527. HCF(391,425): ; ; > 17. HCF(17,527) = 17 since . Answer 17.
Answer: D) 17

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 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…Euclid's Division Lemma states that for positive integers a and b, there exist unique…In Euclid's Division Lemma a = bq + r, the integer b is called the:Any positive even integer can be written in which form (q is some integer)?