Question

find the HCF of 300and600by Euclid's division algorithm​

Answer 1

Answer:

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.

Answer 2

hey Euclid division method is now deleted from the chapter u can use prime factorization