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
Grade: 12

                        

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

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

4 months ago

Answers : (1)

Anand Kumar Pandey
askIITians Faculty
4371 Points
							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
4 months ago
Think You Can Provide A Better Answer ?
Answer & Earn Cool Goodies


Course Features

  • 728 Video Lectures
  • Revision Notes
  • Previous Year Papers
  • Mind Map
  • Study Planner
  • NCERT Solutions
  • Discussion Forum
  • Test paper with Video Solution


Course Features

  • 731 Video Lectures
  • Revision Notes
  • Test paper with Video Solution
  • Mind Map
  • Study Planner
  • NCERT Solutions
  • Discussion Forum
  • Previous Year Exam Questions


Ask Experts

Have any Question? Ask Experts
 
 
Answer ‘n’ Earn
Attractive Gift
Vouchers
To Win!!! Click Here for details