Question

use Euclid's algorithm to find the HCF of 441,567 and 693​

Answer 1

Answer:

To find the HCF of 441, 567 and 693, we will find the prime factorization of given numbers, i.e. 441 = 3 × 3 × 7 × 7; 567 = 3 × 3 × 3 × 3 × 7; 693 = 3 × 3 × 7 × 11.