Use Euclid divison algorithm to find …
CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Mihir Gopalak 4 years, 2 months ago
- 1 answers
Related Questions
Posted by Alvin Thomas 2 months, 3 weeks ago
- 0 answers
Posted by T Prudhvi 4 days, 12 hours ago
- 0 answers
Posted by Gnani Yogi 2 months, 3 weeks ago
- 0 answers
Posted by Savitha Savitha 2 months, 3 weeks ago
- 0 answers
Posted by Akhilesh Patidar 2 months, 3 weeks ago
- 0 answers
myCBSEguide
Trusted by 1 Crore+ Students
Test Generator
Create papers online. It's FREE.
CUET Mock Tests
75,000+ questions to practice only on myCBSEguide app
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.
0Thank You