Question 1 (i) - HCF using Euclid's Division Algorithm - Chapter 1 Class 10 Real Numbers

Last updated at April 16, 2024 by

Ex 1.1, 1 - Chapter 1 Class 10 - Use Euclid’s division algorithm to

Ex 1.1, 1 - Chapter 1 Class 10 Real Numbers - Part 2

 

Transcript

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

Ask a doubt
Davneet Singh's photo - Co-founder, Teachoo

Made by

Davneet Singh

Davneet Singh has done his B.Tech from Indian Institute of Technology, Kanpur. He has been teaching from the past 14 years. He provides courses for Maths, Science, Social Science, Physics, Chemistry, Computer Science at Teachoo.