by applying Euclid's division of lemma …

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Nandhini T 6 years, 5 months ago
- 1 answers
Related Questions
Posted by Parinith Gowda Ms 3 months, 3 weeks ago
- 0 answers
Posted by Kanika . 1 month, 1 week ago
- 1 answers
Posted by Lakshay Kumar 1 year, 1 month ago
- 0 answers
Posted by Parinith Gowda Ms 3 months, 3 weeks ago
- 1 answers
Posted by Vanshika Bhatnagar 1 year, 4 months ago
- 2 answers
Posted by Hari Anand 6 months, 2 weeks ago
- 0 answers
Posted by Sahil Sahil 1 year, 4 months ago
- 2 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
Sia ? 6 years, 5 months ago
The largest number which divides 650 and 1170 = HCF (650,1170)
By Euclid’s division algorithm,
1170 = 650 {tex}\times{/tex} 1 + 520
650 = 520 {tex}\times{/tex} 1 + 130
520 = 130 {tex}\times{/tex} 4 + 0
So, HCF = 130
So 130 is the largest number which divides 650 and 1170
0Thank You