Question

state euclid division lemma. lf euclid lemma is used for a

Answer 1

Euclid division lemma:
                  Dividend=divisor x quotient +remainder

Answer 2

Explanation:

Given positive integers 'a' and 'b', there exists unique pair of integers 'q' and 'r' satisfying "a=bq+r"

Where 0is greater than or equal to 'r' and less than b

Divedend =(divisor)(quotient) +remainder

This is division algorithm....