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

Explanation

Working : First of all we use Euclid's division algorithm between two larger numbers out of given three numbers and get H.C.F. between these .After that we take the third number and resulting H.C.F. of two numbers and apply again Euclid's division algorithm and get the required H.C.F.
Let a=693 , b=567 adn c =441
by Eulid's division algorithm for two numbers a and b.
`a=bq +r`
Step I : `693 = 567 xx 1+ 126 ("Here r"ne0)`
Step II: `567 =126xx4 +63 ("Here r" ne0)`
Step III : `126 =63 xx 2+0 " (Here r =0)"`
`:. H.C.F. (693 ,567 ) =63` (say d) (Recent divisor)
Now again using Euclid's division algorithm ,
c=dq+r
`rArr " "441 =63 xx7+0" ""(Here r =0)"`
`:. H.C.F. (693 ,567 " and " 441) =63 " ""(Recent divisor)"`