Real Numbers: Class 10 Maths · Chapter 1
Primes as building blocks, and proofs that some numbers are not fractions
Mathematics · Companion notes, simulations and practice · Official NCERT chapter PDF ↗
Published · Updated
What you will learn in Real Numbers
- Write a composite number as a product of prime powers with a factor tree, and explain what uniqueness means in the Fundamental Theorem of Arithmetic
- Use prime factorisations to settle divisibility questions, such as whether a power can end in the digit 0
- Find the HCF and LCM of two or three numbers by prime factorisation, and use HCF × LCM = product for two numbers
- Explain why a prime that divides the square of a positive integer must divide the integer itself
- Prove by contradiction that the square root of 2, and of any prime, is irrational
- Prove that sums, differences, products and quotients of a non-zero rational number with such square roots are irrational
Original companion text aligned to NCERT Mathematics Class 10, Chapter 1, pp. 1–9. Not affiliated with or endorsed by NCERT.
1.1 Introduction
Water is always two hydrogen atoms joined to one oxygen atom, never any other mix. Whole numbers behave in a similar way. Their building blocks are the prime numbers, and every whole number above 1 has its own fixed recipe of primes: 60 is always two 2s, one 3 and one 5. In this chapter we state this fact as a theorem and put it to work.
In Class 9 you met the real numbers: rational numbers such as and together with irrational numbers such as and that no fraction can equal (Fig. 1.1). You marked on the number line, but its irrationality was taken on trust. This chapter supplies the proof.
5/5Irrational numbers fill the gaps; with the rationals they form the real numbers.
Rounded boxes nest inside one another. Step 1 shows only the natural numbers 1, 2, 3. Step 2 adds a larger box of whole numbers around it that also holds 0. Step 3 adds the integers, with −5 and −12 in the new band. Step 4 adds the rational numbers, with three quarters, −2.5 and 0.3 recurring. Step 5 adds a dashed box of irrational numbers beside the rationals, holding root 2, pi and minus root 7, and one outer box labelled real numbers around everything.
One result, the Fundamental Theorem of Arithmetic, drives the whole chapter. It gives a fast method for the HCF and LCM of numbers (HCF and LCM). It also lets us prove that and many similar numbers are irrational (Section 1.3).The introduction in your textbook also mentions Euclid's division algorithm and decimal expansions. Those sections were dropped from the current syllabus, so this chapter does not cover them.
Show answer
Answer (C)
Show answer
- (A) Every integer is a rational number.
- (C) 0 is a whole number but not a natural number.
1.2 The Fundamental Theorem of Arithmetic
Recall that a prime number has exactly two factors, 1 and itself: 2, 3, 5, 7, 11, 13 and so on. A composite number such as 12 or 91 has at least one more factor. The number 1 is neither, because it has only one factor.
Every composite number splits into two smaller factors, and those factors may split again. Where does the splitting stop? Only at numbers that cannot be split any further, which are the primes. A factor tree records the whole process: put the number at the top, split it into any two factors, and keep going until every branch ends in a prime. Fig. 1.2 does this for 13860.
5/5Multiply the ringed primes:
A factor tree for 13860. Composite numbers sit in square boxes and primes in green circles, as the key in the corner shows. Step 1 shows only 13860. Step 2 splits it into 132 and 105. Step 3 splits 132 into 12 and 11, and 105 into 7 and 15; 11 and 7 are primes. Step 4 splits 12 into 4 and 3, splits 15 into 3 and 5, and splits 4 into 2 and 2. In step 5 dashed rings mark the seven primes at the ends of the branches, and the line below reads 13860 equals 2 squared times 3 squared times 5 times 7 times 11.
So 13860 is the product of the primes 2, 2, 3, 3, 5, 7 and 11. Try a bigger number: and these split further into and With big numbers the hard part is checking that the last factors really are prime. To test 37, you only need to try the primes up to that is, 2, 3 and 5.
The process also runs backwards. Pick any primes, repeat some if you like, and multiply them:
Each product is a whole number, and since there are infinitely many primes (Euclid proved this around 300 BCE), the products never run out. Could some composite number be missing from this endless supply? No: every composite number breaks down as 13860 did, and the primes at the end of the branches are always the same. This is the Fundamental Theorem of Arithmetic (अंकगणित की आधारभूत प्रमेय).
Every composite number is a product of primes. Moreover, any two such products for the same number contain exactly the same primes, each the same number of times.
The theorem does not care about order: and are the same factorisation of 28. What it rules out is a different collection of primes. In Fig. 1.3, 360 is factorised with two different first splits. Both trees still end with three 2s, two 3s and one 5.
3/3Both give No factor tree for 360 can give anything else.
Step 1 shows tree A: 360 splits into 8 and 45, 8 into 2 and 4, 4 into 2 and 2, 45 into 5 and 9, and 9 into 3 and 3; a row below lists its primes in order as 2, 2, 2, 3, 3, 5. Step 2 replaces it with tree B: 360 splits into 10 and 36, 10 into 2 and 5, 36 into 6 and 6, and each 6 into 2 and 3; its sorted primes 2, 2, 2, 3, 3, 5 appear in a second row. Step 3 brackets the two identical rows with the label same primes.
To make factorisations easy to compare, we write the primes in increasing order and collect repeated primes as powers. This is called the standard form of the prime factorisation:
- the different primes that divide
- how many times each prime appears (positive integers)
For example, and Once the order is fixed, two people who factorise the same number must write exactly the same thing.
Show answer
Answer (A)
Show answer
Answer False
Show answer
Answer (1) 3, (2) 2
Can a power end in 0?
A number ends in the digit 0 exactly when 10 divides it. Since this happens exactly when both 2 and 5 appear in its prime factorisation. Uniqueness is the key: if the one and only factorisation of a number has no 2 (or no 5), nothing can sneak one in. Fig. 1.5 tests three families of powers.
4/4 has both, so it always ends in 0.
A heading says ending 0 needs 2 and 5, above columns for the power, has 2, has 5 and first values. Step 1 shows only the heading. Step 2 adds powers of 15: the 2 slot is a dashed, crossed-out circle and the 5 slot is filled, and its values 15, 225 and 3375 all end in 5. Step 3 adds powers of 12: 2 is present, 5 is crossed out, and 12, 144 and 1728 end in 2, 4 and 8. Step 4 adds powers of 30 with both 2 and 5 present, and 30, 900 and 27000 all end in 0.
Powers of 15 and the digit 0
Prove that, for every natural number the last digit of is not 0.
Try it yourself first. Then reveal the solution one step at a time.
HCF and LCM by prime factorisation
The HCF (highest common factor) of two or more numbers is the largest number that divides all of them. Their LCM (lowest common multiple) is the smallest positive number that all of them divide. In earlier classes you found these by listing factors and multiples, or by repeated division. Prime factorisation gets both at a glance, and it also explains why the method works.
HCF and LCM of 60 and 72
Find the HCF and LCM of 60 and 72 by prime factorisation.
Try it yourself first. Then reveal the solution one step at a time.
Write each number in standard form. The HCF is the product of the primes that divide every one of the numbers, each raised to the lowest power in which it appears. The LCM is the product of all the primes that divide any of the numbers, each raised to the highest power in which it appears.
Fig. 1.6 shows the rule as stacks of prime blocks. When two numbers share no prime at all, their HCF is 1 and we call them coprime, like 8 and 15. Their LCM is then just their product.
5/5In each column, lower power + higher power = all the blocks. So
Three columns, for the primes 2, 3 and 5. Step 1 shows 72 as square blocks: three 2s and two 3s. Step 2 adds 60 as round blocks beside them: two 2s, one 3 and one 5. Step 3 outlines with dashes the blocks both numbers share in each column, two 2s and one 3, and fades the rest; the HCF is 2 squared times 3, which is 12. Step 4 outlines the taller stack in each column, three 2s, two 3s and one 5, giving the LCM 360. Step 5 labels each column with HCF power plus LCM power equals all its blocks: 2 + 3 = 5, 1 + 2 = 3 and 0 + 1 = 1, so 12 times 360 equals 72 times 60, which is 4320.
- any two positive integers
Why does it work? Take one prime at a time. Say it appears to the power in and in The HCF takes the smaller of and the LCM takes the larger, and smaller + larger which is exactly the power in So once you know the HCF of two numbers, a single division gives the LCM:
From HCF to LCM
Find the HCF of 120 and 405 by prime factorisation, and use it to find their LCM.
Try it yourself first. Then reveal the solution one step at a time.
Three numbers at once
Find the HCF and LCM of 12, 30 and 84 by prime factorisation.
Try it yourself first. Then reveal the solution one step at a time.
Here HCF × LCM but The product rule (1.1) holds for two numbers only.
Show answer
Answer 360
Show answer
Answer (B)
Show answer
Answer False
Practice 1.1: questions with answers
Write each number as a product of primes in standard form.
Show solution
and So
Show solution
Divide by 2, 3 and 5 in turn: 2730, 1365, 455, 91. Then So
Show solution
It ends in 75, so divide by 5 twice: Then So
Show solution
No prime below 97 divides it. Trying 97 gives and both 97 and 101 are prime.
Find the HCF and LCM of each pair by prime factorisation. Then check that HCF × LCM equals the product of the pair.
and
Show solution
and HCF and LCM Check:
and
Show solution
and HCF and LCM Check:
and
Show solution
and HCF and LCM Check:
Use prime factorisation to find the HCF and LCM of each set of three numbers.
and HCF and LCM .
Show answer
Answer (1) 6, (2) 360
and HCF and LCMand HCF and LCM .
Show answer
Answer (1) 1, (2) 7657
All three are different primes, so their only common factor is 1, and the LCM is the productand HCF and LCM .
Show answer
Answer (1) 1, (2) 2940
and share no prime, so HCF and LCM
The HCF of 345 and 552 is 69. Find their LCM without factorising again.
Show answer
Answer 2760
LCM Since this isIs there any natural number for which the last digit of is 0? Give a reason.
Show solution
A number ending in 0 is divisible by so 5 must appear in its prime factorisation. But and by uniqueness it contains no other primes. With no 5, can never end in 0.
Explain why each number is composite.
Show solution
Take out the common factor 17: the number is It has the factors 16 and 17 besides 1 and itself, so it is composite.
Show solution
The first term is since So the number is It has the factor 7 and is bigger than 7, so it is composite.
Two buses leave a depot together at 7:00 a.m. The bus on route A completes a round trip and leaves again every 40 minutes; the bus on route B does so every 75 minutes. After how many minutes do they next leave together, and at what time?
minShow solution
They leave together after a whole number of 40-minute rounds and a whole number of 75-minute rounds, so we need the LCM.
and so LCM minutes, which is 10 hours. They next leave together at 5:00 p.m.
If and where and are different primes, then LCM is
Show answer
Answer (B)
The higher powers are and Option A is the HCF, and option C is the productTwo numbers have HCF 16 and product 3072. Their LCM is
Show answer
Answer 192
LCM For example, 48 and 64 have HCF 16 and LCM 192.
1.3 Revisiting Irrational Numbers
Your calculator says Is that a fraction? Every terminating decimal is one: But squaring it gives not exactly 2. The screen shows only an approximation, and no screen can show enough digits to settle whether is a fraction. We need a proof, and the Fundamental Theorem of Arithmetic will do the heavy lifting.
A real number is irrational when no fraction with integer numerator and non-zero integer denominator equals it.
Example and (the counting numbers written one after another) are irrational.
A prime that divides a square
The proof for needs one fact about primes and squares. Squaring a number doubles every power in its prime factorisation but brings in no new primes. For example, and So any prime that divides 900 must be 2, 3 or 5, and each of these divides 30 (Fig. 1.7). As shorthand, means divides , and means it does not.
Let be a prime and a positive integer. If divides then divides
4/44 is not prime: but because its two 2s come from different copies of 6.
Step 1 shows a = 30 as three tiles: 2, 3 and 5. Step 2 adds a squared = 900 as two copies of the same three tiles. Step 3 brackets the six tiles, notes that only 2, 3 and 5 occur, and states that if a prime divides a squared then it divides a. Step 4, below a dashed line, asks why prime: 6 squared is two copies of the tiles 2 and 3, and a dashed link joins the two 2-tiles, one from each copy, because 4 needs both 2s. So 4 divides 6 squared but 4 does not divide 6.
Proof by contradiction: is irrational
How can anyone prove that something is impossible, that no fraction at all, among infinitely many, squares to exactly 2? We use proof by contradiction. Assume the opposite of what you want to prove. Reason correctly from that assumption. If you reach something that cannot be true, the assumption must have been false.
You already argue like this. A friend says she walked home through heavy rain without an umbrella, yet she arrives completely dry. If her story were true, she would be wet. She is dry, so the story is false. In a proof, the impossible thing is usually a statement that clashes with one of our own starting facts.
There is no fraction of two integers whose square is 2; that is, is irrational.
5/52 divides both and but they were coprime. So is irrational.
Five boxes joined by downward arrows. Step 1 shows the first box: assume root 2 equals a over b in lowest terms. Step 2 adds square both sides, giving a squared equals 2 b squared. Step 3 adds so 2 divides a, with a = 2c. Step 4 adds then b squared equals 2 c squared, so 2 divides b. Step 5 adds a dashed box with a cross saying 2 divides a and b, which clashes with lowest terms, and the conclusion that root 2 is irrational.
Another prime under the root
Prove that is irrational.
Try it yourself first. Then reveal the solution one step at a time.
Look back at Example 5: the only fact we used about 7 was that it is prime. Replace 7 by any prime and every line still works. So and in general for every prime are irrational. The argument fails for a perfect square such as 9, and rightly so, because is rational.
- So put
- 5 divides both: contradiction
- Assume coprime
- Get
- Get so
Show answer
- Assume coprime
- Get
- So put
- Get so
- 5 divides both: contradiction
Show answer
Answer (B) Concluding that 9 divides because 9 divides
Show answer
Answer (C) and have no common factor other than 1
Combining rational and irrational numbers
Is irrational? Is ? Both questions have the same answer and the same short proof. Assume the number is rational, then undo the rational part. Undoing a step with a rational number keeps you among the rationals, so itself would come out rational, which is impossible. Fig. 1.9 shows the plan on the number line.
3/5If then would be rational. Impossible.
A number line from 0 to 5 with root 7 marked just past 2.6. Step 1 shows only root 7. Step 2 draws a solid arc labelled +2 from root 7 to 2 + root 7, near 4.65. Step 3 draws a dashed arc labelled −2 back to root 7 and a cross: if 2 + root 7 were a over b, then root 7 would equal a over b minus 2, a rational number. Step 4 instead draws an arc labelled divide by 3 from root 7 to root 7 over 3, near 0.88. Step 5 draws a dashed arc labelled times 3 back to root 7 and a cross, since root 7 would equal 3a over b.
A sum with an irrational part
Show that is irrational.
Try it yourself first. Then reveal the solution one step at a time.
A quotient with an irrational part
Show that is irrational.
Try it yourself first. Then reveal the solution one step at a time.
Examples 6 and 7 are special cases of two facts you met in Class 9. Let be a rational number and an irrational number. Then:
- and are irrational;
- and are irrational, provided
The proofs are exactly like those of the two examples, with in place of 2 or 3 and in place of
Show answer
- (A)
- (D)
Show answer
Answer False
Show answer
Answer (D) is irrational
Practice 1.2: questions with answers
Prove that is irrational.
Show solution
Suppose with coprime integers and
Then so 11 divides As 11 is prime, 11 divides write
Then so So 11 divides and hence 11 divides
So 11 divides both and which contradicts their being coprime. Hence is irrational.
Prove that is irrational. You may use the fact that is irrational.
Show solution
Suppose with integers and
Then so
The right side is a ratio of integers with so it is rational. But is irrational (Example 5 with 3 in place of 7). This contradiction shows that is irrational.
Prove that each number is irrational.
Show solution
If with integers (both non-zero, since the number is not 0), then would be rational. That is impossible, so is irrational.
Show solution
If then a rational number. But is irrational (5 is prime), so is irrational.
Show solution
If then which is rational. This contradicts Theorem 1.3, so is irrational.
Prove that is irrational.
Show solution
Suppose a rational number. Then so
Then Squaring,
So which gives
The right side is rational, so would be rational, contradicting Theorem 1.3. Hence is irrational.
Which of these numbers is rational?
Show answer
Answer (C)
The others simplify to and which are all irrational.
1.4 Summary
Real Numbers: key points and summary
- A factor tree breaks any composite number into primes (Section 1.2).
- Fundamental Theorem of Arithmetic: a composite number has only one prime factorisation, apart from order (Theorem 1.1).
- Uniqueness settles divisibility questions: never ends in 0, as it has no factor 2 (Example 1).
- HCF: shared primes at their lowest powers. LCM: all primes at their highest powers (HCF and LCM).
- For two numbers, HCF × LCM ((1.1)); for three it usually fails (Example 4).
- If a prime divides then divides (Theorem 1.2).
- and for every prime are irrational: a proof by contradiction (Theorem 1.3, Example 5).
- A rational number combined with an irrational one by or (non-zero rational) gives an irrational (combining numbers).
Quick recall
Board-exam practice
Class 10 board papers test this chapter through multiple-choice and assertion–reason questions, short answers, case studies and proofs of irrationality. The questions below are in those styles.
Practice questions with answers (NCERT “Board-exam practice”)
The HCF of the smallest prime number and the smallest composite number is
Show answer
Answer (B) 2
The smallest prime is 2 and the smallest composite number is 4, so their HCF is 2. (Their LCM is 4.)HCF and LCM Find
Show answer
Answer 72
so Check: and give HCF 12 and LCM 504.Assertion (A): No power with a natural number, has 0 as its last digit. Reason (R): The prime factorisation of contains no 5.
Show answer
Answer (A) Both A and R are true, and R is the correct explanation of A.
has no factor 5, so 10 never divides it. R is true and is exactly why A is true.Assertion (A): HCF LCM Reason (R): The HCF of two positive integers, multiplied by their LCM, always equals the product of the two integers.
Show answer
Answer (D) A is false but R is true.
HCF and LCM so the left side of A is 30 while the product is 900: A is false. R is true, but it is about two numbers, not three.Find the largest number that divides 245 and 1029 and leaves a remainder of 5 in each case.
Show solution
The number must divide and exactly. The largest such number is their HCF.
and so HCF Check: and
Find the smallest three-digit number that leaves a remainder of 3 when divided by 8, by 12 and by 18.
Show solution
and so LCM
The numbers that leave remainder 3 are 3 more than a multiple of 72: 3, 75, 147, …. The smallest three-digit one is 147.
A school has 336 notebooks, 240 pencils and 96 erasers to pack into identical gift kits for a prize day. Every kit must hold the same number of each item, with nothing left over.
What is the largest number of kits the school can make?
Show solution
and The largest number dividing all three is the HCF,
How many notebooks, pencils and erasers go into each kit?
Show solution
notebooks, pencils and erasers.
Could the school make 32 identical kits instead? Give a reason.
Show solution
No. 32 divides 96 but not 336, since so the notebooks would not share out equally. Any possible number of kits must divide the HCF 48, and 32 does not.
Given that is irrational, prove that is irrational.
Show solution
Suppose with integers and
Then so and
The right side is a ratio of integers with so would be rational, a contradiction. So the number is irrational.
A prime divides where is a positive integer. Which statement must be true?
Show answer
Answer (A) divides
Theorem 1.2 gives that divides With and 2 divides 36, but 4 does not divide 6, 6 is not prime and so the other options can fail.
Find your NCERT exercise question
Our practice questions are written for ncert.ai and follow the NCERT exercises. Find the one that matches the question in your textbook; its answer is with it.
| In your NCERT textbook | Practice question here |
|---|---|
| NCERT Exercise 1.1, Q1 | Practice 1.1 · Q1 |
| NCERT Exercise 1.1, Q2 | Practice 1.1 · Q2 |
| NCERT Exercise 1.1, Q3 | Practice 1.1 · Q3 |
| NCERT Exercise 1.1, Q4 | Practice 1.1 · Q4 |
| NCERT Exercise 1.1, Q5 | Practice 1.1 · Q5 |
| NCERT Exercise 1.1, Q6 | Practice 1.1 · Q6 |
| NCERT Exercise 1.1, Q7 | Practice 1.1 · Q7 |
| NCERT Exercise 1.2, Q1 | Practice 1.2 · Q1 |
| NCERT Exercise 1.2, Q2 | Practice 1.2 · Q2 |
| NCERT Exercise 1.2, Q3 | Practice 1.2 · Q3 |
Quick check: MCQs on Real Numbers
- 1.1 Introduction2 questions
- 1.2 The Fundamental Theorem of Arithmetic3 questions
- HCF and LCM by prime factorisation3 questions
- Proof by contradiction: $\sqrt{2}$ is irrational3 questions
- Combining rational and irrational numbers3 questions
Key terms (English–Hindi)
- composite numberभाज्य संख्याbhajya sankhya
- A whole number greater than 1 with a factor other than 1 and itself, such as 9 or 91. The number 1 is neither prime nor composite.First seen in the chapter →
- coprimeसहअभाज्यsah-abhajya
- Two integers are coprime when their only positive common factor is 1, like 8 and 15.First seen in the chapter →
- factor treeगुणनखंड वृक्षgunankhand vriksh
- A diagram that splits a number into two factors, again and again, until every branch ends in a prime.First seen in the chapter →
- Fundamental Theorem of Arithmeticअंकगणित की आधारभूत प्रमेयankganit ki aadharbhoot pramey
- Every composite number is a product of primes, and this product is unique apart from the order of the factors.
- HCF (highest common factor)महत्तम समापवर्तकmahattam samapavartak
- The largest whole number that divides each of the given numbers exactly.First seen in the chapter →
- irrational numberअपरिमेय संख्याaparimey sankhya
- A real number that no fraction of two integers can equal, such as or
- LCM (lowest common multiple)लघुत्तम समापवर्त्यlaghuttam samapavartya
- The smallest positive whole number that is a multiple of each of the given numbers.First seen in the chapter →
- prime factorisationअभाज्य गुणनखंडनabhajya gunankhandan
- A number written as a product of primes, such as First seen in the chapter →
- prime numberअभाज्य संख्याabhajya sankhya
- A whole number greater than 1 whose only factors are 1 and itself, such as 2, 7 or 13.First seen in the chapter →
- proof by contradiction
- A proof that assumes the opposite of the claim, reasons correctly to something impossible, and so rejects the assumption.First seen in the chapter →
- rational numberपरिमेय संख्याparimey sankhya
- A number equal to a fraction of two integers with such as or
- real numberवास्तविक संख्याvastavik sankhya
- Any rational or irrational number; together they fill the whole number line.First seen in the chapter →