Practice30Create account

Find the largest number which divides 626, 3127 and 15628 leaving remainders 1, 2 and 3 respectively.
Use Euclid's algorithm after subtracting the remainders.

Class 10Euclid's Division LemmaNumber Systems
  • A625
  • B565
  • C685
  • D1250

Step-by-Step Solution

Subtract remainders: 626 - 1 = 625, 3127 - 2 = 3125, 15628 - 3 = 15625. HCF(625, 3125) = 625 since . HCF(625, 15625) = 625 since . So the required number is 625.
Answer: A) 625

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

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)?Any positive odd integer is of the form 2q + 1. The next form for an odd integer is 4q +…The square of any positive integer is of the form 3m or 3m + 1 for some integer m. The…