Use Euclid’s division algorithm to find the HCF of 441, 567, 693
Solution:
The Euclidean Algorithm to determine the HCF (A,B) is:
If A = 0 then HCF (A, B) = B,
As HCF (0, B) = B we can stop.
If B = 0 then HCF (A, B) = A,
As HCF (A, 0) = A we can stop.
Now let us write A in quotient remainder form i.e A = BQ + R
By using the Euclidean Algorithm as HCF (A, B) = HCF(B, R) we can determine the HCF (B, R)
We know that, HCF of 441 and 567 is
567 = 441 × 1 + 126
441 = 126 × 3 + 63
126 = 63 × 2 + 0
Remainder is 0,
Therefore, H.C.F of (441, 567) is = 63.
H.C.F of 63 and 693 is 693 = 63 × 11 + 0
Therefore, H.C.F of (441, 567, 693) = 63
✦ Try This: Use Euclid’s division algorithm to find the HCF of 196 and 38220
38220 > 196
Using Euclid’s division algorithm,
38220 = 196 × 195 + 0
Here, the remainder is 0
Therefore, the HCF of 196 and 38220 is 196
☛ Also Check: NCERT Solutions for Class 10 Maths Chapter 1
NCERT Exemplar Class 10 Maths Exercise 1.3 Problem 8
Use Euclid’s division algorithm to find the HCF of 441, 567, 693
Summary:
Using Euclid’s division algorithm H.C.F of (441, 567, 693) is 63
☛ Related Questions:
visual curriculum