use euclids division algorithm to find the HCF of 870 and 225.
Answers
Answered by
17
Let a and b are two positive integers.
From Euclid division algorithm,
a = bq + r, where 0=< r<b
870 =225×3+195
225 =195×1+30
195 =30×6+15
30 =15 ×2+0
HCF = 15 Answer
225)870(3
- 675
= 195)225(1
- 195
= 30)195(6
- 180
=15)30(2
- 30
= 0
HCF=15
Hope it helps.......!!!
From Euclid division algorithm,
a = bq + r, where 0=< r<b
870 =225×3+195
225 =195×1+30
195 =30×6+15
30 =15 ×2+0
HCF = 15 Answer
225)870(3
- 675
= 195)225(1
- 195
= 30)195(6
- 180
=15)30(2
- 30
= 0
HCF=15
Hope it helps.......!!!
Similar questions