No products in the cart.

Use Euclid divison algorithm to find …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Use Euclid divison algorithm to find the h.c.f of 135
  • 1 answers

Gaurav Seth 4 years, 2 months ago

135 and 225 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.

http://mycbseguide.com/examin8/

Related Questions

What is 38747484±393884747
  • 0 answers
3√2×4√2×12√32
  • 0 answers
Ch-1 introduction
  • 0 answers
X³-12x²+39x-28
  • 0 answers
2x+5y
  • 0 answers

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App