0We know that Euclid's Division lemma states if a and b are two positive integers and a>b, then a=bq+r where q and r are two integers, where the value of r is given by 0<=r<b, This principle is applied to find HCF between two positive integers.To find HCF we have to continue division by the remainder at each step and HCF is obtained when the remainder is zero.
135 and 225.
Step 1) Divide 225 by 135, So we get 225=135x1+90
Step 2) As we get a remainder 90, so we divide 135 by 90.Now 135=90x1+45,
Step 3)Now we divide 90 by 45, Now 90=45x2+0
As we get remainder 0 so the HCF is 45
Verification 225=45x5 and 135=45x3, So 45 is the greatest common factor.
