Euclid's divisio
135 and 225
w that any positi
Answers
Answered by
2
Q. Use Euclid's division algorithm to find the HCF of 135 and 225
Euclid's division algorithm
a= bq +r
225>135
225= 135×1+90
135= 90×1+45
90 = 45×2 +0
Since remainder is 0
Therefore ,HCF of 135 and 225 = 45
Similar questions