Use euclid algorithm to find HCF of 432 and 512
Answers
Answered by
1
Answer:
Using euclid algorithm ,
512=432*1+80
432=80*5+32
80=32*2+16
32=16*2+0
HCF(512,432)=16
Answered by
4
Given:
432 and 512
To find:
HCF of 432 and 512.
Solution:
a = 512 and b = 432
writing in the form of a = bq + r, we get,
512 = 432 * 1 + 80
432 = 80 * 5 + 32
80 = 32 * 2 + 16
32 = 16 * 2 + 0
Conclusion:
Since r = 0, Therefore, 16 is the HCF of 432 and 512.
Extra Information:
The above done method is called as Euclid's division lemma or Division algorithm which is used to find HCF of given numbers.
Euclid's division lemma or Division algorithm:
Given positive integers a and b, there exists unique pair of integers q and r satisfying a = bq + r where 0 ≤ r <b.
Similar questions