Question

Use Euclid's division algorithm to find the HCF of: 135 and 225 [2 MARKS]

Answer 1

Concept : 1 Mark
Application :1 Mark

Apply Euclid's division lemma to given numbers $c$ and $d$ to find whole numbers $q$ and $r$ such that

$c=dq+r,0\le r<d$

Here, $c=225,d=135$

$225=135\times 1+90$

Remainder is not equal to 0. Therefore, we apply the same process again on 135 and 90

$135=90\times 1+45$

Remainder is not equal to 0 again. Therefore, we apply same process again on 90 and 45.

$90=45\times 2+0$

Remainder is equal to 0.

Therefore, HCF of 135 and 225 is equal to 45 which is equal to value of d in the last step.