Question

Euclid division algorithm find largest no that divides 1251,9377,15628 leaving remainder 123 res

Answer 1

Answer:

to find that largest no. which leaves the remainder 123,we need to subtract the remainder frm the no. so that we get that largest no.

that is 1251937715628-123

=1251937715505

here is ur answer

hope it's helpful