
Learn in your speed, with individual attention - Teachoo Maths 1-on-1 Class
Euclid's Division Algorithm
Question 1 (ii) Deleted for CBSE Board 2024 Exams
Question 1 (iii) Important Deleted for CBSE Board 2024 Exams
Question 2 Important Deleted for CBSE Board 2024 Exams
Question 3 Important Deleted for CBSE Board 2024 Exams
Question 4 Important Deleted for CBSE Board 2024 Exams
Question 5 Deleted for CBSE Board 2024 Exams
Euclid's Division Algorithm
Last updated at May 29, 2023 by Teachoo
Ex 1.1 , 1 Use Euclid’s division algorithm to find the HCF of : (i) 135 and 225 Since 225 > 135, We divide 225 by 135 Since remainder is not 0 We divide 135 by 90 Again, since remainder is not 0 We divide 90 by 45 Since remainder is now 0 HCF of 135 and 225 is 45