Question

using Euclid's division algorithm,find the largest number that divides 1251,9377 and 15678 leaving remainders 1,2,3​

Answer 1

Answer:

Okay!!

Step-by-step explanation:

Since, 1,2 and 3 are the remainders of 1251, 9377 and 15628 respectively. Thus after subtracting these remainder from the number.

We have the number, 1251−1=1250,9377−2and15628−3=15625

By Euclid's division algorithium,

d=cq+r [From Eq.(i)]

⇒3125=1250×2+625

⇒=1250=625×2+0

∴HCF(1250,9375,15625)=625

Hence, 625 is the largest number which divides 1251, 9377 and 15628 leaving remainder 1, 2 and 3 respectively.