Question

using euclid's division algorithm find the largest number that divides 1251 9377 15628 leaving remainder 1 2 3 4 respectively​

Answer 1

Answer:

Step-by-step explanation:

1251-1=1250

9377-2=9375

15628-3=15625

Hcf(1250,9375,15625)=625