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 x 1 +90
Since remainder 90 ≠ 0, we apply the division lemma to 135 and 90 to obtain
135 = 90 x 1 + 45
We consider the new divisor 90 and new remainder 45, and apply the division lemma to obtain
90 =2 x 45 +0
Since the remainder is 0, the process stops.
Since the divisor at this stage is 45
Therefore, the HCF of 135 and 225 is 45.

You may also like...

error: Content is protected !!