use euclids division algorithm to find the HCF of 184 , 230 , 276 .
Answers
Answered by
1
Answer:
The HCF is 189.
Hope this answer helps.
Please mark me as brainliests answer.
Answered by
2
Let’s first choose 184 and 230 to find the HCF by using Euclid’s division lemma.
Thus, we obtain
230 = 184 x 1 + 46
Since the remainder 46 ≠ 0. So we apply the division lemma to the divisor 184 and remainder 46.
We get,
184 = 46 x 4 + 0
The remainder at this stage is 0, the divisor will be the HCF i.e., 46 for 184 and 230.
Now, we again use Euclid’s division lemma to find the HCF of 46 and 276. And we get,
276 = 46 x 6 + 0
So, this stage has remainder 0.
Similar questions