Browse by Stream
QnA
Home
QnA
Go To Your Study Dashboard

Get Answers to all your Questions

header-bg qa
  • Home
  • NCERT
  • Using Euclid is division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3 respectively.

Using Euclid is division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3 respectively.    

Answers (1)

As we know that 1, 2 and 3 are the remainders of given number 1251, 9377 and 15628
After subtracting remainders, we get
1251 – 1 = 1250
9377 – 2 = 9375
15628 – 3 = 15625
Now HCF of 1250, 9375, 15625 can be calculated as:
First, we will calculate the HCF of 9375 and 15625;

HCF (15625, 9375) = 3125
Now we will calculate the HCF of 3125 and 1250.


HCF of 3125 and 1250 is 625.
Here HCF of (1250, 9375, 15625) = 625
Hence largest number is 625.

Posted by

infoexpert27

View full answer

Similar Questions

Latest Question