Math, asked by raunakkesharwani2001, 1 year ago

Using Euclid's Algorithm, Find the HCF of 240 and 228?
Answer:
By applying a Euclid Division of the HCF of 228and240....
240>228,so we apply the division of 240and 228
240=228*1+12
12Does not =0
So 228>12,so we apply division of 228 and 12
228=12*19+0
Hence remainder becomes 0...so 0=0by remainder
And the HCF of 240and 228 is 12

Answers

Answered by TheMist
40
you have asked question and answer it yourself.....


raunakkesharwani2001: It's OK or not??
TheMist: yeah yeah it's right
raunakkesharwani2001: Tqq
Similar questions
Math, 1 year ago