Q1 (1) Use Euclid’s division algorithm to find the HCF of : 135 and 225
225 > 135. Applying Euclid's Division algorithm we get
since remainder 0 we again apply the algorithm
since remainder 0 we again apply the algorithm
since remainder = 0 we conclude the HCF of 135 and 225 is 45.