CBSE NCERT Solutions for Class 10 Mathematics Chapter 1 Back of Chapter Questions 1. Use Euclid’s division algorithm to find the HCF of: (i) 135 and 225 (ii) 196 and 38220 (iii) 867 and 255 Solution: (i) 135 and 225 Step 1: Since 225 is greater than 135, we can apply Euclid's division lemma to a = 225 and b = 135 to find q and r such that 225 = 135q + r, 0 ≤ r < 135 So, dividing 225 by 135 we get 1 as the quotient and 90 as remainder. i. e 225 = (135 × 1) + 90 Step 2: Remainder r is 90 and is not equal to 0, we apply Euclid's division lemma to b = 135 and r = 90 to find whole numbers q and r such that 135 = 90 × q + r, 0 ≤ r < 90 So, dividing 135 by 90 we get 1 as the quotient and 45 as remainder. 𝑖𝑖. 𝑒𝑒 135 = (90 × 1) + 45 Step 3: Again, remainder r is 45 and is not equal to 0, so we apply Euclid's division lemma to b = 90 and r = 45 to find q and r such that 90 = 45 × q + r, 0 ≤ r < 45 So, dividing 90 by 45 we get 2 as the quo...