Question

Use euclid division algorithm to find hcf of 3696 and 273

Answer 1

Your answer is in the above attachment . Pls refer to it.

Euclid's division algorithm is based on Euclid's division lemma.

Euclid's division lemma states that for every two integers a & b , there exists q & r such that a = bq + r.

Here , we can compare :

a to dividend

b to divisor

q to quotient

r to remainder.