Use Euclid's divison algorithm to find the H.C.F of 1860 and 201.
Answers
Answered by
1
Answer:
good afternoon everyone how are you all enjoying at home or not please mark me as a brain list answer please and thanks my answer please anyone of you here good one here in the world please mark me as a
Answered by
1
Euclid algorithm a=bq+r
a>b and 0⩽r<b.
1860 and 2015
The positive integers are 1860 and 2015, 2015>1860
Apply Euclid's algorithm to 2015 and 1860
∴2015=(1860∗1)+155
The remainder is 155.
Apply Euclid's algorithm to 1860 and 155
∴1860=(155∗12)+0
The remainder is zero.
∴ HCF of 1860 and 2015 is 156.
Similar questions