Question

use Euclid's division algorithm to find the HCF of 135 and 225​

Answer 1

Answer:

45

Step-by-step explanation:

Euclid division algorithm formula : a=b×q+r

HCF is the divisor in the last step of the division when we get the reminder as 0.

225 = 135×1+90

135 = 90×1+45

90 = 45×2+0

Therefore, HCF of 135 and 225 is 45

Check the image for detailed solution

Hope it helps :)

Answer 2

Answer:

On applying the division lemma to 225 and 135

We get

225 = 135 × 1 + 90

 90 = 45 × 2 + 0

Hence HCF(225,135) = 45

Step-by-step explanation:

Hope this helps you ✌️