Question

Use Euclid division algorithm to find HCF of 135 and 225​

Answer 1

Step-by-step explanation:

Since 225 > 135, we apply the division lemma to 225 and 135 to obtain 225 = 135 × 1 + 90 Since remainder 90 ≠ 0, we apply the division lemma to 135 and 90 to obtain 135 = 90 × 1 + 45 We consider the new divisor 90 and new remainder 45, and apply the division lemma to obtain 90 = 2 × 45 + 0 Since the remainder is zero, the process stops. Since the divisor at this stage is 45, Therefore, the HCF of 135 and 225 is 45

Answer 2

Answer:

45

Step-by-step explanation:

Since, 225>135

Therefore, 225=135×1+90

135=90×1+45

90=45×2+0

So therefore by Euclid's division algorithm , HCF is 45

HOPE IT HELPS!

PLEASE MARK ME BRAINLIEST!