Question

proof for euclid division lemma by steps plz say me how to do​

Answer 1

Answer:

Euclid's division lemma

Let a and b are two positive integers such that a>b and a is divided by b having quotient q and remainder r, then Euclid's division lemma is written as.

a = bq+r.........where,0 =< r < b