Question

State Euclid's Division Algorithm :​

Answer 1

Step-by-step explanation:

$\huge \sf {\orange {\underline {\pink{\underline{卂ղsաҽɾ࿐ }}}}}$

Euclid's division lemma,

states that for any two positive integers 'a' and 'b' we can find two whole numbers 'q' and 'r' such that a = b × q + r where 0 ≤ r < b. Euclid's division lemma can be used to find the highest common factor of any two positive integers and to show the common properties of numbers.

Answer 2

Step-by-step explanation:

Hope it's useful to you and helps