Question

al) ure Euclid's division calogithm
to find the HCF og &​

Answer 1

Answer:

Euclid's Division Algorithm works because if a=b(q)+r a = b ( q ) + r then HCF(a,b)=HCF(b,r) HCF ( a , b ) = HCF ( b , r )

Step-by-step explanation:

plz make me brainliest and follow me and like my answer plz plz plz