use euclid's division algorithm to find HCF of 441 567 and 693
Answers
Answered by
12
Answer:
HCF ( 441 , 567 , 693 ) = 63
Step-by-step explanation:
Euclid's Division Algorithm states that, a = bq + r
For finding the HCF of 441 , 567 and 693 by Euclid's Division Algorithm the easiest way is to find to find the HCF of first two set of numbers then dividing the third number with the HCF previously obtained. Then,
For the HCF of 441 and 567 =>
On dividing 567 by 441 by long division method we get,
567 = (441×1) + 126
441 = (126×3) + 63
126 = (63×2) + 0
Hence, HCF(441,567) = 63
Now,dividing 693 with 63 ,we get
693 = (63×11) + 0
Thus, HCF ( 441 , 567, 693) = 63
Similar questions