Question

find HCF by euclids division algorithm 441,567&693​

Answer 1

Step-by-step explanation:

Use Euclid's division lemma find the hcf of 441 ,567 and 693

Step 1 ⇒ 567 = 441 × 1 + 126.

Step 2 ⇒ 441 = 126 × 3 + 63.

Step 3 ⇒ 126 = 63 × 2 + 0.

Step 1 ⇒ 693 = 63 × 11 + 0.