Use Euclid division algorithm find hcf of 867and 225
Answers
Answered by
15
Hey !!
Here is the answer.
Eulids Division Algorithm :
a = bq + r
and, 867 > 225
867 = 225 × 3 + 192
225 = 192 × 1 + 33
192 = 33 × 5 + 27
33 = 27 × 1 + 6
27 = 6 × 4 + 3
6 = 3×1
As remainder here is zero. So, 3 is the HCF of 867 and 192.
Hope You Got It
Here is the answer.
Eulids Division Algorithm :
a = bq + r
and, 867 > 225
867 = 225 × 3 + 192
225 = 192 × 1 + 33
192 = 33 × 5 + 27
33 = 27 × 1 + 6
27 = 6 × 4 + 3
6 = 3×1
As remainder here is zero. So, 3 is the HCF of 867 and 192.
Hope You Got It
Similar questions