badge image

Enroll For Free Now & Improve Your Performance.

×
User Icon
User Icon
User Icon
User Icon
User Icon

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

                        

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

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

3 months ago

Answers : (1)

Anand Kumar Pandey
askIITians Faculty
3170 Points
							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
3 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

Post Question

 
 
Answer ‘n’ Earn
Attractive Gift
Vouchers
To Win!!! Click Here for details