Euclid's Division Algorithm
Question 1 (ii) Deleted for CBSE Board 2025 Exams
Question 1 (iii) Important Deleted for CBSE Board 2025 Exams You are here
Question 2 Important Deleted for CBSE Board 2025 Exams
Question 3 Important Deleted for CBSE Board 2025 Exams
Question 4 Important Deleted for CBSE Board 2025 Exams
Question 5 Deleted for CBSE Board 2025 Exams
Euclid's Division Algorithm
Last updated at April 16, 2024 by Teachoo
Ex 1.1 , 1 Use Euclid’s division algorithm to find the HCF of : (iii) 867 and 255 Since 867 > 255, We divide 867 by 255 Since remainder is not 0 We divide 255 by 102 Again, remainder is not 0 So, we divide 102 by 51 Since remainder is zero Hence, HCF of 255 and 867 is 51