Tagged: cbse ncrt Use Euclid’s Division Algorithm to find the HCF of (I) 135 and 225

Use Euclid’s Division Algorithm to find the HCF of (I) 135 and 225 Ans. 135 and 225 Since 225 > 135, we apply the division lemma to 225 and 135 to obtain 225= 135...