Question

*3. Using Euclid's division algorithm, find the
greatest number which on dividing 1251,
9377 and 15628 leaves remainders 1, 2
and 3 respectively.​

Answer 1

Answer:

Solution : Since, 1,2 and 3 are the remainders of 1251, 9377 and 15628 respectively. Thus after subtracting these remainder from the number. Hence, 625 is the largest number which divides 1251, 9377 and 15628 leaving remainder 1, 2 and 3 respectively.