using Euclid division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1,2 and 3, respectively... pls tell the answer the person who answered first will be mark as brainliest...
Answers
Answered by
6
To answer the question, first note that we need to subtract those remainders from the given number and then calculate it's HCF
So basically we need to find the HCF of (1251 - 1) , (9377 - 2) and (15628 - 3)
Which means HCF( 1250, 9375, 15625)
Now
9375 = 1250 * 7 + 625
1250 = 625 * 2 + 0
So HCF of 9275 and 1250 will be 65
Also
156285 = 625 * 25 + 0
HCF for all the three numbers = 625
Hence 625 divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3 respectively.
So basically we need to find the HCF of (1251 - 1) , (9377 - 2) and (15628 - 3)
Which means HCF( 1250, 9375, 15625)
Now
9375 = 1250 * 7 + 625
1250 = 625 * 2 + 0
So HCF of 9275 and 1250 will be 65
Also
156285 = 625 * 25 + 0
HCF for all the three numbers = 625
Hence 625 divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3 respectively.
Dirgh:
it means that the largest no asked is 625??
Similar questions