Question

How to find the hcf of any number using Euclid's division algorithm

Answer 1

Step 1: Apply the division lemma to find q and r where a=bq+r ,0⩽r<b. Step 2: if r=0, the HCF is b. If r≠0, apply Euclid's lemma to b and r. Step 3: Continue the process till the remainder is zero.