Answers

2016-03-30T01:52:47+05:30
Euclid's division algorithm : a= bq+r
                                          where,  0<r<b
550>300
550 = 300x1+225
300 = 225x1+75
225 = 75x3+0
As we got the remainder as 0 , the process stops
HCF of 550 and 300 is 75
1 5 1