Use Euclid’s division algorithm to find the HCF of:(I) 135 and 225

Solution:

We start with the larger number i.e 225 By Euclid’s division algorithm, we have 225=1×135+90
135=1×90+45
90=2×45+0
Hence, HCF(225,135)=HCF(135,90)=HCF(90,45)=45

There...

See more