Math, asked by seshu5, 1 year ago

solve 867 and 253 using Euclid division algorithm s

Answers

Answered by umesha1
1
In Euclid division algorithm the remainder end with 0
Attachments:
Answered by Golda
0
Solution :-

H.C.F. of 867 and 253 using Euclid's Division Algorithm -

867 = 253*3 + 108

253 = 108*2 + 37

108 = 37*2 + 34

37 = 34*1 + 3

34 = 3*11 + 1

3 = 1*3 + 0

So, H.C.F. of 867 and 253 is 1

Answer.
Similar questions