Question

what is the proof of euclid's division lemma

Answer 1

given positive integers a and b,there exists unique pair of integers q and r satisfying a=bq+r,0<r<b

Answer 2

Answer:

Step-by-step explanation

Apply division lemma to find q or r where a=bq+r where 0<r<b

If r=0 then hcf is b.if r not equal to 0 apply division lemma to b and r

Continue the process till the remainder is 0. The divisor at this stage will be the hcf of a and b