Mathematics is like music – Enjoy it!!!
Complete solution of Exercise 1.2, Chapter 1, Real Numbers of NCERT book of Mathematics for Class 10. The exercise is about proving that the square roots of prime numbers are irrational and some more questions around this concept.
Read MoreComplete solution of Exercise 1.1, Chapter 1, Real Numbers of NCERT book of Mathematics for Class 10. The chapter is primarily about prime factorisation, LCM and HCF of the numbers. Easily readable sections and embedded YouTube tutorials will help students understand the solutions quickly.
Read MoreThis playlist covers all the questions, concepts and examples of chapter 1 (Real Numbers) of class 10, NCERT book. Click a thumbnail to watch the tutorial. Watch complete chapter on YouTube
Read MoreQuestion 1: Without actually performing the long division, state whether the following rational numbers will have a terminating decimal expansion or a non-terminating repeating decimal expansion: Question 2: Write down the decimal expansions of those rational numbers in Question 1…
Read MoreQuestion 1: Prove that √5 is irrational. Question 2: Prove that 3 + √5 is irrational. Question 3: Prove that the following are irrationals:(i) 1/√2 (ii) 7√5 (iii) 6 + √2 Class 10 | Exercise 1.2 Class 10 | Exercise…
Read MoreQuestion 1: Express each number as a product of its prime factors: (i) 140 (ii) 156 (iii) 3825 (iv) 5005 (v) 7429 Question 2: Find the LCM and HCF of the following pairs of integers and verify that LCM ×…
Read MoreQuestion 1: Use Euclid’s division algorithm to find the HCF of :(i) 135 and 225 (ii) 196 and 38220 (iii) 867 and 255 Question 2: Show that any positive odd integer is of the form 6q+1, or 6q+3, or 6q+5,…
Read MoreExample 1 : Use Euclid’s algorithm to find the HCF of 4052 and 12576. Example 2: Show that every positive even integer is of the form 2q, and that every positive odd integer is of the form 2q + 1,…
Read MoreTheorem 1.1 (Euclid’s Division Lemma) : Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b. Euclid’s Division Algorithm : This algorithm is used to find…
Read More