NCERT Solutions for Maths Class 10 Chapter 1
Exercise 1.1 Question 1: Use Euclid’s division algorithm to find the (HCF) of: (i) (135) and (225) (ii) (196) and (38220) (iii) (867) and (225) Answer: (i) (135) and (225) Since (225 > 135), we apply the division lemma to (225) and (135) to obtain (225 = 135times 1 + 90) Since remainder (90 ≠ […]
NCERT Solutions for Maths Class 10 Chapter 1 Read Post »