Question

Using Euclid’s division algorithm, find gcd(135, 225). (NCERT Class 10 – Important)

Answer

Apply Euclid: 225 = 135×1 + 90; 135 = 90×1 + 45; 90 = 45×2 + 0. The last non‑zero remainder is 45, so gcd(135,225)=45.

Advertisement

More Algebra questions

Practise more questions with answers

Question bank →
  1. Prove sum of first n natural numbers is n(n+1)/2 (induction).
  2. Find HCF and LCM of 12 and 18 and verify HCF×LCM=product.
  3. Solve: (x/3) + (x/4) = 7.
  4. Prove that for any integer n, n²−n is always even.
  5. Find k if x² + kx + 16 = 0 has equal roots.
  6. Solve 3x + 2y = 12 and x − y = 1 by elimination. (NCERT Class 10 – Important)
  7. A number when divided by 7 gives remainder 3. Find remainder when its square is divided by 7.
  8. Find the sum of roots of 4x² + 7x − 2 = 0. (NCERT Class 10 – Quick Important)
  9. Solve: 2x − 3y = 4 and 4x + y = 14. (NCERT Class 10 – Important)
  10. If a polynomial p(x)=x³−6x²+11x−6, find its zeroes. (NCERT Class 10 – Very Important)