Question

use Euclid division algorithm to find the HCF of : 135 and 225
​

Answer 1

$\huge{\underline{\underline{\red{\mathrm{Solution}}}}}:-$

• 135 and 225

225 is Greater than 135 by using Euclid Division Algorithm,

225 = 135 × 1 + 90

Here remainder is 90 which is note equal to 0 then, again by using Euclid division lemma,

135 = 90 × 1 + 45

Here, remainder is 45 which is note equal to 0 again using Euclid division lemma,

90 = 45 × 2 + 0

Here, remainder is 0

Therefore, HCF (225,135) = HCF(135,90) = HCF(90,45) = 45.

So, The HCF of 135 and 225 is 45.

________________________________________________

Euclid Division lemma :-

a = bq + r , r > 0 and r < b.

________________________________________________

Answer 2

$\huge \purple A \purple N \purple s \purple W \purple e \purple \R : -$

135 and 225

225 is Greater than 135 by using Euclid Division Algorithm,

225 = 135 × 1 + 90

Here remainder is 90 which is note equal to 0 then, again by using Euclid division lemma,

135 = 90 × 1 + 45

Here, remainder is 45 which is note equal to 0 again using Euclid division lemma,

90 = 45 × 2 + 0

Here, remainder is 0

Therefore, HCF (225,135) = HCF(135,90) = HCF(90,45) = 45.

So, The HCF of 135 and 225 is 45.

_________________________________

Euclid Division lemma :-

a = bq + r , r > 0 and r < b.

_________________________________