1.

Using Euclid's division lemma, find the largest number that divides 1251, 9377and 15628 leaving remainder 1, 2 and 3 respectively.

Answer»

9377 and 15628, respectively. Thus, after subtracting these remainders from the numbers.We have the numbers, 1251-1 = 1250,9377-2 = 9375 and 15628-3 = 15625 which is divisible by the required number.Now, required number = HCF of 1250,9375 and 15625 [for the largest number]By Euclid’s division algorithm,



Discussion

No Comment Found