Question

state Euclid division algorithm ​

Answer 1

Answer:

Euclid division algorithm:a=bq+r where 0<r<b

Answer 2

Answer:

This is based on Euclid's division lemma.according to this the HCF of any two positive integers a and b,

with a>b,is obtained as follows :

Apply the division lemma to find q and r where a=bq+r,0<r<b if r=0,theHCF is b. If r=0 apply Euclid's lemma to b and r.