The whole of Chapter 1 on two pages for last-minute revision: every definition, theorem and rule, and the key proof at a glance. The full detailed notes are available separately.
1 The Chapter at a Glance
Real Numbers
1 · Fundamental Theorem of Arithmetic (FTA)Every composite number splits into primes in only one way, apart from the order of the factors
2 · HCF (Highest Common Factor) and LCM (Lowest Common Multiple)Smallest and greatest powers of primes
3 · Theorem 1.2if a prime divides , it divides
4 · Irrationality proofs, , by contradiction
2 Definitions and Theorems
| Term / theorem | Meaning |
|---|---|
| Prime number | Exactly two factors, 1 and itself (2, 3, 5, 7, …) |
| Composite number | More than two factors (4, 6, 9, …); 1 is neither prime nor composite |
| Coprime numbers | No common factor other than 1 (HCF ) |
| Theorem 1.1: Fundamental Theorem of Arithmetic (FTA) | “Every composite number can be expressed (factorised) as a product of primes, and this factorisation is unique, apart from the order in which the prime factors occur.” |
| Theorem 1.2 | If a prime divides , then divides ( a positive integer). Written , where means “divides” and means “implies”. |
| Irrational number | Cannot be written as with integers, |
| Theorem 1.3 | is irrational |
3 HCF and LCM by Prime Factorisation
Rules
HCF = product of the smallest power of each common prime factor
LCM = product of the greatest power of each prime factor involved
| Numbers | Factorised | HCF | LCM |
|---|---|---|---|
| 6, 20 | ; | 2 | 60 |
| 96, 404 | ; | 4 | |
| 6, 72, 120 | ; ; | 6 | 360 |
Common Mistake
For three numbers, HCF × LCM is not in general equal to the product: for 6, 72, 120, but .
Three numbers (NCERT’s Note to the Reader)
for positive integers . Check with 6, 72, 120: LCM , HCF .
Ends in 0?
A number ends in 0 only if its prime factors include both 2 and 5. and have no 5, so they never end in 0 (a prime factorisation has only one form, so no 5 can appear).
4 The Proof in Four Lines
Assume is rational: , coprime, proof by contradiction
; put ( an integer)square, Theorem 1.2
Theorem 1.2 again
2 divides both and , but they were coprime: contradictionso is irrational
Replace 2 by any prime (3, 5, 7, …) and the same four lines prove irrational.
5 Rational and Irrational Together
| Rule | Example | Assume the number ; rearranging gives |
|---|---|---|
| rational ± irrational = irrational | ||
| non-zero rational × or ÷ irrational = irrational |
Two irrationals can give a rational: , .
Last-minute checklist
- State FTA word for word, including “apart from the order”
- Factorise, then smallest powers for HCF, greatest powers for LCM
- Product rule for two numbers; it does not hold in general for three
- Proofs: assume rational, coprime , square, Theorem 1.2 twice, contradiction
- Not in the CBSE 2026-27 syllabus, and no section in the current NCERT reprint: Euclid’s division algorithm, decimal expansions of rational numbers
More for this chapter