**Himanshi Verma**

(i)135 and 225

*a = 225, b = 135 {Greatest number is ‘a’ and smallest number is ‘b’}*

* Using Euclid’s division algorithm*

* a = bq + r (then)*

* 225 = 135 ×1 + 90*

* 135 = 90 ×1 + 45*

* 90 = 45 × 2 + 0 {when we get r=0, our computing get stopped}*

* b = 45 {b is HCF}*

*Hence: HCF = 45*

(ii)196 and 38220

* a = 38220, b = 196 {Greatest number is ‘a’ and smallest number is ‘b’}*

* Using Euclid’s division algorithm*

* a = bq + r (then)*

* 38220= 196 ×195 + 0 {when we get r=0, our computing get stopped}*

* b = 196 {b is HCF}*

*Hence: HCF = 196*

(iii)867 and 255

*a = 867, b = 255 {Greatest number is ‘a’ and smallest number is ‘b’}*

*Using Euclid’s division algorithm*

*a = bq + r (then)*

*38220= 196 ×195 + 0 {when we get r=0, our computing get stopped}*

*b = 196 {b is HCF}*

*Hence: HCF = 196*

*-Answered by Himanshi Verma* On 29 March 2019:04:55:16 PM