Question

Use euclid division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainder 1, 2, 3 respectively.

Answer 1

Since, 5 and 8 are the remainders of 70 and 125, respectively. Thus, after subtracting these remainders from the numbers, we have the numbers 65 = (70-5),
117 = (125 – 8), which is divisible by the required number.
Now, required number = HCF of 65,117                                     [for the largest number]
For this, 117 = 65 × 1 + 52 [∵ dividend = divisior × quotient + remainder]
⇒ 65 = 52 × 1 + 13
⇒ 52 = 13 × 4 + 0
∴ HCF = 13 
Hence, 13 is the largest number which divides 70 and 125, leaving remainders 5 and 8.

Hope This Helps :)