Find the HCF using euclid's division algorithm of 804 and 4355
Answers
Answered by
27
Hey there!
We try to express the numbers as in a = bq + r where 0 < r ≤ b.
Now,
4355 = 804 * 5 + 335
Again,
804 = 335 * 2 + 134
335 = 134 * 2 + 67
134 = 67 * 2 + 0
Here, r = 0 and we can't proceed any further. Hence, Divisor at this stage is the HCF.
Therefore, HCF of 804 , 4355 is 67
We try to express the numbers as in a = bq + r where 0 < r ≤ b.
Now,
4355 = 804 * 5 + 335
Again,
804 = 335 * 2 + 134
335 = 134 * 2 + 67
134 = 67 * 2 + 0
Here, r = 0 and we can't proceed any further. Hence, Divisor at this stage is the HCF.
Therefore, HCF of 804 , 4355 is 67
Similar questions