Thank you for registering.

One of our academic counsellors will contact you within 1 working day.

Please check your email for login details.
MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping

Use Euclid’s division algorithm to find the HCF of: 135 and 225

 Use Euclid’s division algorithm to find the HCF of: 
135 and 225

Grade:12

1 Answers

Harshit Singh
askIITians Faculty 5965 Points
9 months ago
Dear Student

135 and 225
As you can see, from the question 225 is greater than 135. Therefore, byEuclid’s division algorithm, wehave,

225 = 135 × 1 + 90
Now, remainder 90 ≠ 0, thus again using division lemma for 90, we get,

135 = 90 × 1 + 45
Again, 45 ≠0, repeating the above step for 45, we get,

90 = 45 × 2 + 0
The remainder is now zero, so our method stops here. Since, in the last step, the divisor is 45, therefore, HCF (225,135) = HCF (135, 90) = HCF (90, 45) = 45.
Hence, the HCF of 225 and 135 is 45.

Thanks

Think You Can Provide A Better Answer ?

Provide a better Answer & Earn Cool Goodies See our forum point policy

ASK QUESTION

Get your questions answered by the expert for free