Question

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

Answer 1

answer is first steps

since 9377<1251 ,we apply the division algorithm to 9377&1251,to get

9377= 1251×7+620

1251= 650×2+11

650 = 11×56+4

11= 4×2+3

4= 3×1+1

hope this answer is help you