Question

what is euclid division algorith​

Answer 1

a=bq+r

WHERE À IS ANY POSITIVE INTEGER B IS THE DIVISOR,Q IS THE QUOTIENT AND R IS THE REMAINDER

Answer 2

Answer:

for any two positive integers a and b there exist unique integers q and r satisfying =a=bq+r where 0<r<b.