Question

explain euclid's division algorithm.​

Answer 1

Answer:

dividend=divisor* quotient + remainder

or

a=bq+r

Answer 2

Answer:

Euclid's division lemma stated that, if two possitive integers "a" and "b",then there exist unique integers "q" and "r" such that which satisfies the condition a=bq+r where 0<=r<=b.

Step-by-step explanation:

hope it will help u ☺️

mark as a brilliant answer