Use Euclid's division algorithm to find the HCF of: 135 and 225 [2 MARKS]
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
Remainder is not equal to 0. Therefore, we apply the same process again on 135 and 90
Remainder is not equal to 0 again. Therefore, we apply same process again on 90 and 45.
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.