#### Thank you for registering.

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

Click to Chat

1800-5470-145

+91 7353221155

CART 0

• 0
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:  867 and 225

Harshit Singh
10 months ago
Dear Student

867 and 225
As we know, 867 is greater than 225. Let us apply nowEuclid’s division algorithm on 867, to get,
867 = 225 × 3 + 102
Remainder 102 ≠ 0, therefore taking 225 as divisor andapplying the division lemma method, we get, 225 = 102 × 2 + 51
Again, 51 ≠ 0. Now 102 is the new divisor, so repeating the same step we get,
102 = 51 × 2 + 0
the remainder is now zero, so our procedure stops here. Since, in the last step, the divisor is 51, therefore, HCF (867,225) = HCF(225,102) = HCF(102,51) = 51.
Hence, the HCF of 867 and 225 is 51.

Thanks