Use Euclid division algorithm to find the HCF of 441, 567 and 693.

Explanation

Let a=693, b=567 and c=441
Euclid's division algorithms, a=bq+r `[therefore "dividend"="divisor" xx "quotient" + "remainder"]`….(i)
First we take, a=693 and b=567 and their HCF.
693=`537xx1+126`
`567=126xx4+63`
`126=63xx2+0`
HCF (293,567)=63
Now, we take=441 and say d=63 then find their HCF.
Again using Euclid's divison algorithm, c=dq+r
`Rightarrow =441=63xx7+0`
`therefore HCF(693,567,441)=63`