Hcf by algorithm of 135 and …

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Shivam Tiwari 7 years, 1 month ago
- 2 answers
Yogita Ingle 7 years, 1 month ago
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.
Related Questions
Posted by Vanshika Bhatnagar 1 year, 4 months ago
- 2 answers
Posted by Parinith Gowda Ms 3 months, 2 weeks ago
- 1 answers
Posted by Parinith Gowda Ms 3 months, 2 weeks ago
- 0 answers
Posted by Sahil Sahil 1 year, 4 months ago
- 2 answers
Posted by Lakshay Kumar 1 year, 1 month ago
- 0 answers
Posted by Hari Anand 6 months, 1 week ago
- 0 answers
Posted by Kanika . 1 month ago
- 1 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
myCBSEguide
Sujal Rai 7 years, 1 month ago
0Thank You