Chapter Overview & Weightage
Real Numbers is the first chapter of CBSE Class 10 Maths, and it sets the foundation for algebra and number theory throughout the year. The chapter covers the Euclid’s Division Lemma, the Fundamental Theorem of Arithmetic, and proofs of irrationality.
In CBSE Class 10 board exams, Real Numbers carries approximately 6–8 marks. Typical distribution: 1 MCQ (1 mark) + 1 short answer on HCF/LCM (2 marks) + 1 long answer on irrational number proof (3 marks). This is a scoring chapter — most students who prepare it well score full marks.
| Exam Year | Marks | Topics Covered |
|---|---|---|
| 2024 | 7 | HCF by Euclid, LCM, irrational proof |
| 2023 | 6 | Prime factorisation, LCM, √2 irrational |
| 2022 | 8 | Euclid’s algorithm, HCF×LCM property, decimal expansions |
| 2021 | 6 | Fundamental theorem, irrational number |
Key Concepts You Must Know
1. Euclid’s Division Lemma: For any two positive integers and , there exist unique integers and such that:
This lemma is the basis for the Euclid’s Division Algorithm for finding HCF.
2. Euclid’s Division Algorithm for HCF: Apply the lemma repeatedly until the remainder becomes 0. The last non-zero remainder is the HCF.
3. Fundamental Theorem of Arithmetic: Every composite number can be expressed as a product of primes in a unique way (except for the order of the prime factors).
4. HCF and LCM relationship: (for two numbers)
5. Decimal Expansions:
- If (lowest terms) has , then it is a terminating decimal
- Otherwise, it is a non-terminating repeating decimal
6. Irrational Numbers: Cannot be expressed as where are integers and .
Important Formulas
Note: This property holds for exactly two numbers. Do NOT apply it to three numbers.
(in lowest terms) terminates iff for non-negative integers .
Solved Previous Year Questions
PYQ 1 — Find HCF of 420 and 130 using Euclid’s Algorithm
Solution:
Last non-zero remainder = 10. HCF(420, 130) = 10.
Using this: LCM = .
PYQ 2 — Prove is irrational (CBSE 2023)
Solution (Proof by contradiction):
Assume is rational. Then where are integers, , and .
Squaring:
So is even is even. Let .
Then is even.
But if both and are even, they have a common factor 2, contradicting .
This contradiction proves is irrational.
PYQ 3 — Decimal Expansion
Determine whether has a terminating or non-terminating decimal expansion.
Solution: . Since (of the form with ), the decimal expansion terminates.
Difficulty Distribution
| Difficulty | Example Topics | Approximate % |
|---|---|---|
| Easy | HCF/LCM by prime factorisation, terminating decimals | 50% |
| Medium | Euclid’s algorithm, HCF × LCM property | 30% |
| Hard | Irrational number proofs, three-number LCM problems | 20% |
Expert Strategy
Start with prime factorisation. For most HCF/LCM problems, prime factorisation is faster and more reliable than Euclid’s algorithm for numbers up to 4 digits.
Irrational proofs follow a template. The “assume rational, derive contradiction via common factor” approach works for , , , and . Practise the template until it becomes automatic.
For proofs of the form “prove is irrational,” the approach is: assume it’s rational → rearrange to isolate → note that LHS is rational and RHS () is irrational → contradiction. This covers all Class 10 irrational proof variants.
For HCF × LCM = product of two numbers: This is only for two numbers. For three numbers, use prime factorisation separately.
Decimal expansion: Simplify the fraction first (find lowest terms), then check the denominator. If even a single prime factor other than 2 or 5 appears, it’s non-terminating repeating.
Common Traps
Trap 1: Applying HCF × LCM = a × b to three numbers. The formula only works for two numbers. For three numbers , , : use prime factorisation for both HCF and LCM. Some students write HCF(a,b,c) × LCM(a,b,c) = a × b × c — this is wrong.
Trap 2: Not simplifying the fraction before testing terminating decimal. seems non-terminating (15 = 3 × 5), but , and , which IS terminating. Always reduce to lowest terms first.
Trap 3: Stopping Euclid’s algorithm one step early. Continue until the remainder is exactly 0. The last non-zero remainder is the HCF. Students sometimes stop when they see a “small” remainder and report that as HCF.
Trap 4: In irrational proofs, not showing that “p² even implies p even.” CBSE marks this step. The logic: if is odd, is odd; contrapositive: if is even, is even. This step must be explicitly stated, not assumed.