Use Euclid division algorithm to find …

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Satyam Kumar 5 years, 6 months ago
- 2 answers
Yogita Ingle 5 years, 6 months ago
By using Euclid division algorithm
a = bq + r
where a is > b
so a = 867 and b = 255
867 = 255 × 3 + 102
here r ≠ 0 so a = 255 and b = 102
255 =102 × 2 + 51
here r≠0 so a = 102 and b = 51
102 = 51 × 2 + 0
here r = 0
so, Hcf of (867,255) is = 51
Related Questions
Posted by Kanika . 1 week ago
- 1 answers
Posted by Hari Anand 5 months, 2 weeks ago
- 0 answers
Posted by Sahil Sahil 1 year, 3 months ago
- 2 answers
Posted by Parinith Gowda Ms 2 months, 3 weeks ago
- 1 answers
Posted by Vanshika Bhatnagar 1 year, 3 months ago
- 2 answers
Posted by Parinith Gowda Ms 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
myCBSEguide
Neha Kakkar ?? 5 years, 6 months ago
0Thank You