Question

using Euclid's division algorithm findthe largest no. which divides 1250,9375,15625​
ans fast no spam​

Answer 1

Answer:

Now, 1250, 9375 and 15625 are divisible by the required number. Hence, 625 is the largest number which divides 1251, 9377 and 15628 leaving remainder 1, 2 and 3, respectively.

Answer 2

HOPE THIS ATTACHMENT HELPS YOU