Real number chapter 1 CBSE class 10

Irrational number numericals

Irrational number



LCM question









Comments

Post a Comment

Popular posts from this blog

Theorem: Fundamental Theorem of Arithmetic Explained with Examples – CBSE Class 10 Maths Notes

Class 10 Maths – Theorem : Fundamental Theorem of Arithmetic 🧠 What Does the Theorem Say? " Every composite number can be expressed (factorised) as a product of prime numbers, and this factorisation is unique , apart from the order of the prime factors. " ✅ Let’s Break It Down: A composite number is a natural number that is not prime and has more than two factors . According to the theorem: Every composite number can be written as a product of prime numbers . This factorisation is unique , except for the order in which the primes are written. πŸ”’ Example Take the number 32760 We can write: 32760 = 2 × 2 × 2 × 3 × 3 × 5 × 7 × 13 = 2³ × 3² × 5 × 7 × 13 Now, whether you write it as: 2 × 3 × 5 × 7 × 13 × 2 × 3 × 2 or 3 × 2 × 2 × 5 × 7 × 3 × 2 × 13 πŸ‘‰ It doesn’t matter — it’s still the same set of prime numbers multiplied together. ✅ That’s what “ unique, except for order ” means. πŸ’‘ Important Notes A prime factorisation is a way to express a ...
Read more

Class 10 Maths Chapter 1 Real Numbers Introduction – Euclid’s Division Algorithm & Fundamental Theorem Explained

Real Numbers – Introduction CBSE Class 10 Maths πŸ” What You Already Know (from Class 9) : Real Numbers = Rational + Irrational numbers Rational Numbers : Can be written as p/q (q ≠ 0) Irrational Numbers : Cannot be written as p/q Examples: √2, √5, Ο€ 🧠 What You Will Learn in This Chapter : In Class 10, we go deeper into the properties of real numbers, especially positive integers , through: Euclid’s Division Algorithm Fundamental Theorem of Arithmetic These concepts form the foundation of number theory , with applications in HCF, irrational numbers, and decimal expansions. πŸ“1. Euclid’s Division Algorithm πŸ“Œ Definition : Given two positive integers a and b (a > b), there exist integers q and r such that: a = bq + r {where } 0≤r< b This is basically the long division method you already know! πŸ”§ Key Use : Helps us find the HCF (Highest Common Factor) of two numbers. Example: To find HCF of 210 and 45, we apply Euclid’s algorithm step by s...
Read more