Question

Find the largest no. That divides 1251 9377 and 15628 leaving remainder 1 2 and 3 respectively

Answer 1

Using Euclid's division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3 respectively. Answer 9: Since, 1, 2 and 3 are the remainders of 1251, 9377 and 15628, respectively. Thus, after subtracting these remainders from the numbers