1. Chapter 1 Class 10 Real Numbers
  2. Serial order wise
  3. Euclid's Division Algorithm
Check sibling questions

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

Last updated at Dec. 13, 2024 by Teachoo

 

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
  1. Chapter 1 Class 10 Real Numbers
  2. Serial order wise

    3. Euclid's Division Algorithm

    Decimal Expansion →
Decimal Expansion →
Chapter 1 Class 10 Real Numbers
Serial order wise

About the Author

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 and Computer Science at Teachoo