find HCF of the following content division method
32, 40.
Answers
Answered by
1
Answer:
HCF of 32 and 40 by Euclidean Algorithm
As per the Euclidean Algorithm, HCF(X, Y) = HCF(Y, X mod Y)
where X > Y and mod is the modulo operator.
Here X = 40 and Y = 32
HCF(40, 32) = HCF(32, 40 mod 32) = HCF(32, 8)
HCF(32, 8) = HCF(8, 32 mod 8) = HCF(8, 0)
HCF(8, 0) = 8 (∵ HCF(X, 0) = |X|, where X ≠ 0)
Therefore, the value of HCF of 32 and 40 is 8.
Step-by-step explanation:
Similar questions