Question

1. Use the Euclid's Division Algorithm to find the HCF of 441 and 567.​

Answer 1

Answer:

Step 1 ⇒ 567 = 441 × 1 + 126.

Step 2 ⇒ 441 = 126 × 3 + 63.

Step 3 ⇒ 126 = 63 × 2 + 0.

Step 1 ⇒ 693 = 63 × 11 + 0.