Question

how to find largest no that divides 205 355 and 605 leaving 3 as remainder​

Answer 1

Answer:

Complete step-by-step answer:

Now we need to find the H.C.F. ( 1250, 9375, 15625), which is the required largest number. Euclid's division algorithm is a=bq+r , 0⩽r<b . (When we divide 15625 by 9375 we get the remainder 6250.)

Answer 2

hope it's helpful to you