Real Numbers Class 10: Concepts, Formulas and Proofs
Updated 13 October 2026 · Fact-checked
Real Numbers in Class 10 covers the Fundamental Theorem of Arithmetic, which says every composite number has a unique prime factorisation, and proofs that numbers like root 2, root 3 and root 5 are irrational. The board asks for HCF and LCM by prime factorisation, word problems on them, and proofs by contradiction of irrationality.
What Real Numbers is about
This chapter has two big ideas. The first is the Fundamental Theorem of Arithmetic: every composite number breaks into primes in exactly one way. That single fact lets you find HCF and LCM quickly, decide whether a number can end in 0, show that an expression is composite, and solve real-life problems about packing, tiling and repeating events. The second idea is irrational numbers: you learn to prove, by contradiction, that , , and expressions like cannot be written as fractions.
These ideas come back across the book. Irrational roots such as appear in Polynomials and Quadratic Equations, distances like units appear in Coordinate Geometry, and values like appear in Trigonometry. Careful factorisation also helps with fractions in every chapter.
On the board paper, this chapter shows up as MCQs on prime factorisation, HCF and LCM, assertion-reason questions on the HCF-LCM relation or on irrational numbers, 2-mark HCF and LCM questions, 3-mark irrationality proofs, word problems that need you to choose between HCF and LCM, and case studies built on real situations such as bells, tiles or packing.
Weightage: This chapter is Unit I, Number Systems, which carries 6 of the 80 theory marks.Source: CBSE Mathematics syllabus 2026-27, Unit I Number Systems
In real board papers: Standard, asked in 21 of the 21 board papers we hold (2023 to 2026), on average 6 marks per paper; Basic, asked in 21 of the 21 board papers we hold (2023 to 2026), on average 6 marks per paper. See the questions
Key concepts
- The Fundamental Theorem of Arithmetic
- NCERT section 1.2 The Fundamental Theorem of Arithmetic
A prime number has exactly two factors, 1 and itself. A composite number has more than two. The number 1 is neither prime nor composite.
The Fundamental Theorem of Arithmetic says: every composite number can be written as a product of primes, and this factorisation is unique, apart from the order of the factors.
Why must a factorisation exist? Keep splitting a composite number into two smaller factors. The numbers keep getting smaller, so you must eventually reach factors that cannot be split. Those are primes. Uniqueness means that however you start, say a factor tree from or from , you always finish with the same primes and the same powers: .
Use this whenever you need a number's building blocks: HCF, LCM, last digits or divisibility. Always write the final answer in power form, primes in increasing order, with no composite number left inside.
Worked example
If , where x, y and z are whole numbers, then equals
(a) 5
(b) 6
(c) 7
(d) 8Try it first, then show the solutionSolution
- So , giving , , (unique by the Fundamental Theorem of Arithmetic)
- Check:
Answer: (b) 6
- Using uniqueness: can a number end in 0?
- NCERT section 1.2 The Fundamental Theorem of Arithmetic
A number ends in the digit 0 exactly when it is divisible by 10, that is, when its prime factorisation contains both 2 and 5.
Now think about a power . Its prime factors are exactly the primes of , only with larger powers. Raising a number to a power can never create a new prime.
So, to decide whether can end in 0, factorise . If 2 or 5 is missing from , it is missing from too. Because the factorisation is unique, there is no other way of writing that could bring the missing prime in. So never ends in 0.
The same reasoning answers questions like whether can end in 5 (no, 5 is not a factor of 4) or whether can ever be odd (no, 2 always divides it). In your final line, name the Fundamental Theorem of Arithmetic as the reason.
Worked example
Riya says that for some natural number n, ends with the digit 0, because 15 is a multiple of 5. Is she correct? Justify your answer using the Fundamental Theorem of Arithmetic.
Try it first, then show the solutionSolution
- A number ending in 0 is divisible by , so its prime factorisation must contain both 2 and 5.
- , so .
- The only primes in the factorisation of are 3 and 5; the prime 2 does not appear.
- By the Fundamental Theorem of Arithmetic this factorisation is unique, so no other factorisation of can contain 2.
- Hence is not divisible by 2, so it is not divisible by 10.
Answer: Riya is wrong. never ends in 0 for any natural number n. (It is odd and a multiple of 5, so it always ends in 5.)
- Showing that an expression is composite
- NCERT section 1.2 The Fundamental Theorem of Arithmetic
A common board question asks whether an expression like is prime or composite. Do not multiply everything out and then hunt for factors. That wastes time and invites errors.
Instead, look for a common factor in all the terms and take it out. If you can write the number as a product of two natural numbers, each greater than 1, it is composite by definition. The common factor is one factor, and the bracket left behind is the other. Just check that the bracket is bigger than 1, which it clearly is when it looks like .
This connects to the Fundamental Theorem of Arithmetic: a prime has no factorisation other than itself. As soon as you show two factors greater than 1, the number cannot be prime. If the bracket simplifies to a prime, you have also found the full prime factorisation.
Worked example
Show that is a composite number, and write its prime factorisation.
Try it first, then show the solutionSolution
- Both terms contain the factor .
- The number has factors other than 1 and itself (for example 7), so it is composite.
- 7, 11 and 31 are all prime, so this is its prime factorisation; value .
- Check:
Answer: The number is composite; .
- HCF and LCM by prime factorisation
- NCERT section 1.2 The Fundamental Theorem of Arithmetic
Factorise each number into primes first. Then:
- HCF = product of the common primes, each to its smallest power.
- LCM = product of all the primes that appear, each to its greatest power.
Why? The HCF must divide every number, so it can only use primes that all the numbers share. It also cannot use a higher power than the smallest one present, or it would fail to divide that number. The LCM must be a multiple of every number, so it needs every prime that appears anywhere, at the highest power needed by any of the numbers.
This method works for two, three or more numbers. Set out each factorisation on its own line in power form, so the examiner can see where each power came from. Then check: the HCF should divide each number and each number should divide the LCM.
Worked example
Find the HCF and LCM of 72, 120 and 180 by prime factorisation. Then show that HCF × LCM is not equal to the product of the three numbers.
Try it first, then show the solutionSolution
- HCF: common primes are 2 and 3, smallest powers and , so HCF
- LCM: primes 2, 3, 5 with greatest powers, so LCM
- Check: 12 divides 72, 120 and 180; 360 is divisible by 72, 120 and 180.
- HCF × LCM
- Product , which is not 4320.
Answer: HCF = 12, LCM = 360. HCF × LCM = 4320, which is not equal to the product 1555200, so the product rule fails for three numbers.
- HCF × LCM = product of two numbers
- NCERT section 1.2 The Fundamental Theorem of Arithmetic
For any two natural numbers a and b: .
Why it works: take any prime. Say its power is m in a and n in b. The HCF takes the smaller of m and n, the LCM takes the larger. Smaller plus larger equals , which is exactly the power of that prime in . This happens for every prime, so the two products match.
Use it to find a missing number when you know the HCF, the LCM and the other number. It holds only for two numbers; with three numbers, a shared prime gets counted the wrong number of times.
Two quick checks follow. The HCF always divides the LCM, so HCF 18 with LCM 380 is impossible. And if two numbers are in the ratio with m and n co-prime, write them as and : then HCF and LCM .
Worked example
Two numbers are in the ratio and their LCM is 360. Find their HCF and the two numbers. Verify that HCF × LCM equals the product of the numbers.
Try it first, then show the solutionSolution
- Let the numbers be and , where k is a natural number.
- Since 3 and 5 are co-prime, HCF and LCM.
- Given LCM = 360, so , giving .
- The numbers are and , and HCF = 24.
- Check: , ; HCF , LCM .
- Verify: HCF × LCM and .
Answer: HCF = 24; the numbers are 72 and 120. Both products equal 8640.
- Real-life problems: choosing HCF or LCM
- NCERT section 1.2 The Fundamental Theorem of Arithmetic
Many board questions hide HCF or LCM inside a story. Decide which one by asking what the answer must do.
- If you are splitting quantities into equal groups, pieces, rows or bags, and want the greatest size, the size must divide every quantity. Use HCF.
- If events repeat at different intervals and you want when they coincide again, or the least quantity that every group size divides, use LCM.
Remainders need one extra step. If a number must leave remainder r when it divides x and y, then it divides and exactly, so find the HCF of those. The answer must be greater than each remainder; always check this at the end. If the least number must leave remainder r when divided by a, b and c, find the LCM and add r.
Sanity check: an HCF answer is never bigger than the smallest quantity; an LCM answer is never smaller than the largest. Finish with units and a full sentence.
Worked example
A shopkeeper has 245 red marbles and 1029 blue marbles. He keeps 5 marbles of each colour aside. He packs the rest into bags so that every bag holds marbles of one colour only, every bag holds the same number of marbles, and no marble is left over. Find the greatest possible number of marbles in each bag and the number of bags he needs.
Try it first, then show the solutionSolution
- Marbles to be packed: red , blue .
- The bag size must divide both 240 and 1024 exactly, and we want the greatest such number, so we need HCF(240, 1024).
- The only common prime is 2, smallest power , so HCF .
- Red bags ; blue bags ; total .
- Check: and .
Answer: Each bag holds 16 marbles, and he needs 79 bags.
- Proving that √2, √3 and √5 are irrational
- NCERT section 1.3 Revisiting Irrational Numbers
A number is irrational if it cannot be written as with p, q integers and .
The key tool is a theorem: **if a prime p divides , then p divides a** (a a positive integer). It follows from unique factorisation: the primes of are exactly the primes of a, each doubled. So if p appears in , it must already appear in a.
The proof is by contradiction. Assume is rational and write it as in lowest terms, so a and b are co-prime. Squaring gives , so p divides , hence p divides a. Substituting shows p divides b too. Then p is a common factor of a and b, contradicting co-primeness.
The same steps work for , , and any prime. They fail for , because 4 is not prime and is rational.
Worked example
Prove that is irrational.
Try it first, then show the solutionSolution
- Assume, to the contrary, that is rational.
- Then , where a and b are co-prime integers and .
- Squaring: , so .
- So 3 divides . Since 3 is prime, 3 divides a (if a prime divides , it divides a).
- Write for some integer c. Then , so .
- So 3 divides , and hence 3 divides b.
- Now 3 divides both a and b, which contradicts the fact that a and b are co-prime.
- So our assumption was wrong.
Answer: is irrational.
- Proving expressions like 3 + 2√5 are irrational
- NCERT section 1.3 Revisiting Irrational Numbers
Once you know is irrational, you can prove that expressions such as or are irrational.
Method: assume the expression equals with a, b co-prime integers and . Rearrange to get the surd alone on one side. The other side is built from integers by adding, subtracting, multiplying and dividing (never by zero), so it is rational. That makes the surd rational, which contradicts the known fact.
The general results behind this are: rational + irrational is irrational, and non-zero rational × irrational is irrational. But when a question says prove, write the full contradiction argument; do not just quote the rule.
Be careful: two irrationals can combine to give a rational. For example and . This is a favourite trap in assertion-reason questions.
Worked example
Given that is irrational, prove that is irrational.
Try it first, then show the solutionSolution
- Assume, to the contrary, that is rational.
- Then , where a and b are co-prime integers and .
- Rearranging:
- So
- Since a and b are integers and , and are integers with , so is rational.
- Then is rational, which contradicts the given fact that is irrational.
- So our assumption was wrong.
Answer: is irrational.
Maths in real life: Real Numbers
Each concept, met in an everyday situation. Read the situation, try the problem, then check the solution. The one-line hook is what to remember.
The Fundamental Theorem of Arithmetic
Suppose you buy some identical notebooks for the new term at a stationery shop. The bill shows a total of Rs 391 but you have lost the itemised slip. You remember that you bought more than one notebook and that each one cost a whole number of rupees between Rs 20 and Rs 30.
Using the prime factorisation of 391, find the price of one notebook and the number of notebooks you bought. Explain why there is only one possible answer.
Try it first, then show the solutionSolution
- Number of notebooks × price of one notebook = 391, and both are whole numbers greater than 1.
- Test primes in order: 391 is odd, so 2 does not divide it; digit sum is 13, so 3 does not divide it; it does not end in 0 or 5, so 5 does not divide it.
- , so 7 does not divide it; , so 11 does not divide it; , so 13 does not divide it.
- , and both 17 and 23 are prime.
- By the Fundamental Theorem of Arithmetic this prime factorisation is unique, so the only way to write 391 as a product of two whole numbers greater than 1 is .
- The price lies between Rs 20 and Rs 30, so the price is Rs 23 and the number of notebooks is 17.
- Check: .
Answer: Each notebook cost Rs 23 and you bought 17 notebooks. No other answer is possible because is its only prime factorisation.
Memory hook: A bill total is a product in disguise: factorise it and uniqueness tells you exactly what was bought.
HCF and LCM by prime factorisation
Imagine your school takes Classes 8, 9 and 10 on a trip and books rooms in a guest house. There are 140 students from Class 8, 168 from Class 9 and 196 from Class 10. Every room must hold the same number of students, and each room must have students from only one class.
Find the greatest number of students that can be put in each room, and the least number of rooms needed.
Try it first, then show the solutionSolution
- The room size must divide all three numbers, and you want the greatest such size, so you need the HCF.
- Common primes are 2 and 7; smallest powers are and .
- Rooms for Class 8 ; Class 9 ; Class 10 .
- Total rooms .
- Check: .
Answer: Each room holds 28 students, and the least number of rooms needed is 18.
Memory hook: Equal rooms, no mixing: the room size must divide every class, so take the HCF.
HCF × LCM = product of two numbers
Suppose a tailor's shop buys two rolls of lace for festival kurtas. The lengths of the two rolls are in the ratio 4 : 7. The longest equal piece that cuts both rolls exactly, with no lace left over, is 9 m.
Find the lengths of the two rolls. Then find the shortest length of lace that could be cut exactly into whole pieces of either roll's length, and verify that HCF × LCM equals the product of the two lengths.
Try it first, then show the solutionSolution
- The longest equal piece that divides both lengths is their HCF, so HCF = 9 m.
- Since 4 and 7 are co-prime, write the lengths as and with HCF , so .
- Lengths are m and m.
- The shortest length that both 36 and 63 divide is the LCM.
- and , so m.
- Check: .
- Product of lengths , so the result is verified.
Answer: The rolls are 36 m and 63 m long; the shortest such length is 252 m, and .
Memory hook: Ratio 4 : 7 with HCF k means lengths 4k and 7k, and HCF × LCM always gives back their product.
Real-life problems: choosing HCF or LCM
Imagine three friends start jogging together at 6:30 am from the same starting line on the school ground track. One takes 252 seconds per lap, the second takes 308 seconds and the third takes 198 seconds. Each keeps a steady pace.
At what time will all three next be together at the starting line, and how many laps will each have completed by then?
Try it first, then show the solutionSolution
- The three laps repeat at different intervals and you want when they coincide, so you need the LCM.
- Take every prime to its greatest power: seconds.
- seconds seconds min 12 s.
- Next meeting time am min 12 s am.
- Laps: , , .
Answer: They are next together at the starting line at 7:16:12 am, after 2772 seconds (46 min 12 s), having run 11, 9 and 14 laps respectively.
Memory hook: Repeating laps meeting again means LCM; splitting into equal parts means HCF.
Proving that √2, √3 and √5 are irrational
Suppose you draw a square rangoli of side 1 metre in your courtyard for a festival and stretch a string along one diagonal. Your cousin says the diagonal must be some exact fraction of a metre, like m, if you just measure carefully enough.
Find the exact length of the diagonal and prove that it cannot be written as any fraction of whole numbers.
Try it first, then show the solutionSolution
- By Pythagoras, diagonal, so diagonal m.
- Assume is rational: with a, b co-prime positive integers.
- Squaring, , so .
- So 2 divides ; since 2 is prime, 2 divides a. Write for some integer c.
- Substituting, , so .
- So 2 divides , and since 2 is prime, 2 divides b.
- Then 2 is a common factor of a and b, contradicting that a and b are co-prime.
- So the assumption is wrong and is irrational.
Answer: The diagonal is exactly m, which is irrational, so no fraction of whole numbers (such as m) can equal it exactly; a fraction can only be a close approximation.
Memory hook: The rangoli diagonal is √2: you can measure it closely, but never as an exact fraction.
Topics in this chapter
Real Numbers formula sheet
- Fundamental Theorem of Arithmetic
- Every composite number factorises into primes in exactly one way. Quote it for last-digit and divisibility arguments.
- Prime divides a square
- The key step in every proof that a square root of a prime is irrational. State it; you do not need to prove it.
- Rational number
- In proofs, take p and q co-prime (fraction in lowest terms). A number that cannot be written this way is irrational.
- HCF by prime factorisation
- Works for any number of numbers. HCF divides every given number.
- LCM by prime factorisation
- Works for any number of numbers. Every given number divides the LCM.
- Product relation (two numbers only)
- Use to find a missing number: other number = (HCF × LCM) ÷ known number. Never use for three numbers.
- Three numbers
- For three numbers always use prime factorisation directly.
- Size and divisibility checks
- Quick way to reject impossible HCF-LCM pairs and catch errors.
- Co-prime numbers
- Two consecutive natural numbers are always co-prime.
- One number divides the other
- Saves time in MCQs, e.g. HCF and LCM of 15 and 45.
- Numbers in a co-prime ratio
- Use when the ratio and the HCF or LCM are given.
- Ending in zero
- A power a to the n has only the primes of a, so check whether a contains both 2 and 5.
- Greatest divisor with remainders
- When the number divides x and y leaving remainders r1 and r2. The answer must be greater than each remainder; always check this at the end.
- Least number with the same remainder
- When the number, divided by a, b and c, leaves remainder r each time (r smaller than each divisor).
- Rational and irrational combinations
- Rational + irrational is irrational; non-zero rational × irrational is irrational. Two irrationals may give a rational.
How the board asks Real Numbers
The question patterns to expect, and the method that works for each.
| Question type | How it is asked | Method |
|---|---|---|
| Prime factorisation and exponents | An MCQ gives a number written as a product of prime powers with unknown exponents and asks for the exponents, their sum, or the number itself; or asks for the prime factorisation of a number like 1350 or 4620. | Divide repeatedly by the smallest prime (2, then 3, 5, 7, ...). Write the result in power form and multiply back to check before choosing an option. |
| HCF and LCM from factorised forms | Numbers are given already factorised, often with letters, for example and , or and , and you must find the HCF or LCM. | Line up the same primes. Smallest power of the common primes for HCF, greatest power of every prime for LCM. Do not multiply out unless the answer needs a value. |
| Missing number, ratio or impossible pair | HCF and LCM of two numbers are given with one number, and you find the other; or the ratio and LCM are given; or an assertion-reason asks whether a pair like HCF 18, LCM 380 can exist. | Use HCF × LCM = product for two numbers. For ratios, write the numbers as mk and nk. Reject any pair where the HCF does not divide the LCM. |
| HCF or LCM word problems | Stories about cutting ribbons into the longest equal pieces, arranging students in equal rows, packing items, or bells and traffic lights that change at different intervals and coincide again. | Greatest size that fits every quantity: HCF. Next time things happen together, or least amount every group divides: LCM. Adjust remainders first, then finish with units and a sentence. |
| Last digit or composite check | Asked whether a power like or can end in 0 or 5, or whether an expression like is prime or composite. | For last digits, factorise the base and look for 2 and 5, then quote the Fundamental Theorem of Arithmetic. For composite checks, take out the common factor. |
| Irrationality proofs | Prove that , or is irrational (often 3 marks), or prove an expression like is irrational, sometimes in two parts as a 5-mark question. | Contradiction: assume rational, write as with a, b co-prime, . For a single root, square and use the prime-divides-square theorem twice. For an expression, isolate the root and show it would be rational. |
| Assertion-reason on number facts | Pairs such as A: the HCF of two numbers is 1 so their LCM is their product, R: HCF × LCM = product; or A: a sum of two irrationals is irrational, R: some counterexample fact. | Judge A and R separately as true or false, using a quick counterexample where possible. Only then ask whether R actually explains A. |
| Case-based (Section E style) | A real situation, such as a hall being tiled with the largest square tiles, or buses leaving a depot at different intervals, followed by 1-mark and 2-mark parts on factorisation, HCF and LCM. | Pull the numbers out of the story, factorise once, and reuse the factorisations for each part. Read each part carefully to decide HCF or LCM. |
Tricks to remember Real Numbers
Short memory aids. Say each one aloud once, then use it on a question the same day.
Low-Common, High-All
HCF takes the LOW powers of the COMMON primes. LCM takes the HIGH powers of ALL the primes.
Use it when: Say it to yourself before writing any HCF or LCM from factorisations, so you never swap the rules.
Split or Sync
Splitting into the largest equal parts means HCF. Syncing events or finding the least common amount means LCM.
Use it when: Decide the operation in word problems before you start calculating.
The sandwich check
HCF ≤ smallest number ≤ largest number ≤ LCM, and the HCF must divide the LCM.
Use it when: A 10-second check on every HCF and LCM answer, and a quick way to spot impossible pairs in MCQs.
Proof skeleton: A-C-S-D-S-D-C
Assume rational, Co-prime a and b, Square, Divides a, Substitute a = pc, Divides b, Contradiction.
Use it when: Write the irrationality proof in this order so no mark-earning step is skipped.
Zero needs a pair
To end in 0, a number needs both a 2 and a 5 in its prime factorisation. Powers never add new primes.
Use it when: Instant answer to any question asking whether a power can end in 0.
Surd alone, then judge
In proofs for expressions like , move everything except the root to the other side, then say that side is rational.
Use it when: Keeps the expression proofs short and clear.
Real Numbers: board-level solved questions
Ordered from board level to HOTS. Cover the solution, write your own, then compare step by step.
Example 1: Ratio of LCM to HCF from index form · 1 mark · MCQBoard level
If and , then is equal to
(a) 105
(b) 210
(c) 36
(d) 420
Try it first, then show the solutionSolution
- HCF = common primes, each to its smallest power
- LCM = all primes, each to its greatest power
Answer: (b) 210
Example 2: Can this HCF–LCM pair exist? · 1 mark · Assertion-reasonBoard level
Assertion (A): There are no two natural numbers whose HCF is 18 and whose LCM is 380.
Reason (R): The HCF of two natural numbers always divides their LCM.
(a) Both A and R are true and R is the correct explanation of A.
(b) Both A and R are true but R is not the correct explanation of A.
(c) A is true but R is false.
(d) A is false but R is true.
Try it first, then show the solutionSolution
- R is true. The HCF divides both numbers, and each number divides the LCM, so the HCF divides the LCM.
- Check A: , which is not a whole number. Also, while has no factor 3.
- So 18 does not divide 380, and no such pair can exist. A is true.
- A is true precisely because of the fact stated in R, so R explains A.
Answer: (a) Both A and R are true and R is the correct explanation of A.
Example 3: Largest divisor leaving given remainders · 3 marks · Short answerBoard level
Find the largest number that divides 398, 436 and 542, leaving remainders 7, 11 and 15 respectively.
Try it first, then show the solutionSolution
- If the number leaves remainder 7 on dividing 398, then it divides exactly. In the same way it divides and . (1 mark)
- , , (1 mark)
- The only common prime is 17, so HCF. (½ mark)
- Check: , so remainders 7, 11 and 15 are all possible. (½ mark)
Answer: The required number is 17.
Example 4: Can $36^n$ end in zero? Making a perfect square · 3 marks · Short answerHarder board level
(i) Show that cannot end with the digit 0 for any natural number .
(ii) Find the smallest natural number such that is a perfect square, and write the square root of in prime-power form.
Try it first, then show the solutionSolution
- (i) A number ends in 0 only if it is divisible by 10, that is by both 2 and 5. Now , so . (½ mark)
- By the Fundamental Theorem of Arithmetic this factorisation is unique, so the only primes in are 2 and 3. The prime 5 never appears. (½ mark)
- So is never divisible by 5, and it cannot end with the digit 0. (½ mark)
- (ii) . Check: . (½ mark)
- In a perfect square every prime appears to an even power. To make the powers of 2, 3 and 5 even with the smallest multiplier, . (½ mark)
- , so its square root is . Check: . (½ mark)
Answer: (i) has no factor 5, so it never ends in 0. (ii) ; the square root is .
Example 5: Squares from sheets and a square from sheets · 5 marks · Long answerHarder board level
A printing press has identical rectangular sheets, each 672 mm long and 432 mm wide.
(i) Each sheet is to be cut into equal squares that are as large as possible, with no paper wasted. Find the side of each square and the number of squares from one sheet.
(ii) Some sheets are placed side by side, all in the same orientation and without overlapping, to form the smallest possible complete square. Find the side of this square and the number of sheets used.
Try it first, then show the solutionSolution
- (1 mark, together with the next line)
- (i) The side of the square must divide both 672 and 432 exactly, and be as large as possible. So side = HCF mm. (1 mark)
- Number of squares (1 mark)
- (ii) The side of the big square must be a multiple of both 672 and 432, and as small as possible. So side = LCM mm. (1 mark)
- Sheets along the length . Sheets along the width . Number of sheets . (1 mark)
Answer: (i) Squares of side 48 mm; 126 squares per sheet. (ii) Smallest square of side 6048 mm (6.048 m), using 126 sheets.
Example 6: √5 is irrational, and so is √3 + √5 · 5 marks · Long answerHarder board level
Prove that is irrational. Hence prove that is irrational.
Try it first, then show the solutionSolution
- Assume is rational. Then , where and are integers, , and and are coprime (no common factor other than 1). (½ mark)
- Squaring: , so . Hence 5 divides . (½ mark)
- 5 is prime, and a prime that divides divides . So 5 divides . Write for some integer . (½ mark)
- Then , so . Hence 5 divides , and so 5 divides . (1 mark)
- So 5 is a common factor of and . This contradicts the fact that they are coprime. Hence is irrational. (½ mark)
- Now suppose , where is rational. Since the sum is positive, . (½ mark)
- Then . Squaring: , so . (½ mark)
- So . The right side is rational because is a non-zero rational. (½ mark)
- This says is rational, which contradicts what we just proved. So is irrational. (½ mark)
Answer: is irrational, and is irrational (both proved by contradiction).
Example 7: Find the error in a 'proof' · 3 marks · Short answerHOTS / competency
A student wrote this proof.
'Let , where and are coprime integers and . Then , so 4 divides , and hence 4 divides . Write . Then , so . So 4 divides , and hence 4 divides . Then 4 divides both and , a contradiction. So is irrational.'
(i) Without checking the steps, how do you know the proof must be wrong?
(ii) Identify the wrong step and give a counter-example.
(iii) Explain why the same method does work for .
Try it first, then show the solutionSolution
- (i) , which is rational. A proof that ends with a false statement must contain a wrong step. (1 mark)
- (ii) The wrong step is '4 divides , hence 4 divides '. The result 'if divides then divides ' holds only when is prime, and 4 is not prime. (½ mark)
- Counter-example: take . Then is divisible by 4, but 6 is not divisible by 4. (½ mark)
- (iii) 5 is prime. Write as a product of primes. Then . If 5 divides , then by uniqueness of prime factorisation 5 must be one of the . So 5 divides . (1 mark)
Answer: (i) is rational, so the proof must be wrong. (ii) '4 divides implies 4 divides ' is false, because 4 is not prime; for example 4 divides 36 but not 6. (iii) For the prime 5, uniqueness of prime factorisation guarantees that 5 divides implies 5 divides .
Example 8: Three traffic signals · 3 marks · Short answerHOTS / competency
On a busy road in Pune, three traffic signals change colour every 48 seconds, 72 seconds and 108 seconds respectively. They all change together at 7:00:00 am.
(i) At what time will they next change together?
(ii) How many times will they change together from 7:00:00 am to 8:00:00 am, counting 7:00:00 am itself?
Try it first, then show the solutionSolution
- The signals change together after every common multiple of 48, 72 and 108 seconds. The first such time is their LCM. (½ mark)
- , , (½ mark)
- LCM seconds minutes 12 seconds. (½ mark)
- (i) Next change together at 7:07:12 am. (½ mark)
- (ii) One hour is 3600 seconds. The joint changes happen at seconds. Since and , the multiples from to count. (½ mark)
- That gives times. (½ mark)
Answer: (i) 7:07:12 am (ii) 9 times, including 7:00:00 am
Case-study practice (Section E style)
Read the situation, then answer every part. In the board paper this is a 4-mark question split into 1 + 1 + 2 marks.
Packing Diwali sweets in Lucknow
Before Diwali, a sweet shop in Lucknow has 420 pieces of kaju barfi, 504 besan laddoos and 588 rasgullas ready for packing. The owner wants every box to contain only one kind of sweet. Every box must hold the same number of pieces, and no sweet should be left over. To save on boxes and packing time, she wants to use as few boxes as possible, so each box should hold as many pieces as possible. She asks her daughter, a Class 10 student, to work out the packing plan using prime factorisation.
(i) · 1 mark
Write the prime factorisation of 588.
Answer
Answer:
.
(ii) · 1 mark
What is the greatest number of sweets that can be put in each box?
Answer
Answer: 84 sweets
, , . HCF = common primes with smallest powers .
(iii) · 2 marks
How many boxes are needed in all? If instead each box held only 42 sweets, how many more boxes would be needed?
Answer
Answer: 18 boxes; 18 more boxes
With 84 per box: boxes (1 mark). With 42 per box: boxes, so more boxes are needed (1 mark).
Where the marks are
How a typical answer is split into step marks. Show every step: a right final answer alone rarely earns full marks.
Find the HCF and LCM of 90 and 144 using prime factorisation. (2 marks)
| Step | Marks |
|---|---|
| 0.5 | |
| 0.5 | |
| HCF = product of smallest powers of common primes | 0.5 |
| LCM = product of greatest powers of all primes | 0.5 |
Prove that is irrational. (3 marks)
| Step | Marks |
|---|---|
| Assume, to the contrary, that , where a and b are co-prime integers and | 0.5 |
| Squaring: , so 2 divides | 0.5 |
| Since 2 is prime and divides , 2 divides a | 0.5 |
| Write : , so | 0.5 |
| So 2 divides , hence 2 divides b | 0.5 |
| 2 is a common factor of a and b, contradicting that they are co-prime; hence is irrational | 0.5 |
Prove that is irrational. Hence show that is irrational. (5 marks)
| Step | Marks |
|---|---|
| Assume, to the contrary, that is rational | 0.5 |
| Write , where a and b are co-prime integers and | 0.5 |
| Squaring: , so 5 divides | 0.5 |
| Since 5 is prime and divides , 5 divides a | 1 |
| Write : , so | 0.5 |
| So 5 divides , hence 5 divides b | 0.5 |
| 5 divides both a and b, contradicting co-primeness; so is irrational | 0.5 |
| Hence part: if (p, q co-prime integers, ), then , which is rational, contradicting the result above; so is irrational | 1 |
Where students lose marks in Real Numbers
The slips examiners see most often, and what to write instead.
Mistake: Using HCF × LCM = product for three numbers
The relation is learnt as a formula without the condition that it works only for two numbers.
Wrong working
HCF(6, 10, 15) = 1, so LCM
Right working
, , , so LCM
Do this: For three or more numbers, always find the LCM by prime factorisation. Use the product rule only for exactly two numbers.
Usually costs: The whole LCM part, usually 1 to 2 marks.
Mistake: Swapping the HCF and LCM rules
Students remember that powers matter but mix up smallest and greatest under exam pressure.
Wrong working
, , so HCF
Right working
HCF and LCM ; check
Do this: Use Low-Common, High-All, then run the sandwich check: the HCF can never exceed the smaller number.
Usually costs: ½ to 1 mark in a 2-mark question, plus any later parts that use the wrong value.
Mistake: Leaving out 'a and b are co-prime' in an irrationality proof
Students write without saying it is in lowest terms, so the final contradiction has nothing to contradict.
Wrong working
Let . Then ... so 2 divides a and b. This is a contradiction.
Right working
Let , where a and b are co-prime integers and . ... So 2 divides both a and b, which contradicts that a and b are co-prime.
Do this: Write the full assumption line every time, and name exactly what is contradicted in the final line.
Usually costs: Usually ½ to 1 mark.
Mistake: Not using the prime-divides-square theorem correctly
Students write the square as a multiple of 3 instead of the number itself, and the proof goes in circles.
Wrong working
Since 3 divides , write . Then , so .
Right working
Since 3 divides and 3 is prime, 3 divides a. Write . Then , so , and 3 divides b.
Do this: Always go from 'p divides ' to 'p divides a', quoting the theorem, then substitute .
Usually costs: 1 to 1½ marks of a 3-mark proof.
Mistake: Quoting a rule instead of proving
Students know rational + irrational is irrational and think stating it is enough.
Wrong working
3 is rational and is irrational, so is irrational.
Right working
Assume (a, b co-prime, ). Then , which is rational, contradicting that is irrational.
Do this: When the question says prove or show, use the contradiction method with every step written.
Usually costs: Most of the marks for that part; often only ½ to 1 mark is given.
Mistake: Ignoring remainders in HCF word problems
Students take the HCF of the given numbers directly without asking what must divide exactly.
Wrong working
Greatest number dividing 245 and 1029 leaving remainder 5: , , so HCF
Right working
Subtract the remainder first: , , so HCF . Check:
Do this: Remove the remainders, then find the HCF. Always check by dividing back.
Usually costs: Usually 2 or more marks, since everything after the first step is wrong.
Mistake: Leaving composite numbers in a factorisation
The factor tree is stopped early, often at 9, 15 or 25.
Wrong working
Right working
Do this: Before moving on, check that every base in your factorisation is prime.
Usually costs: ½ mark for the factorisation, and the HCF or LCM built on it may also be wrong.
NCERT exercise guide: Real Numbers
What each exercise in the NCERT chapter tests, how to approach it, and a question of the same kind solved step by step. Questions here are written in our own words.
Exercise 1.1
What it tests: Writing numbers as a product of prime factors. Finding HCF and LCM by prime factorisation, including for three numbers. Checking that HCF × LCM equals the product of two numbers. Finding a missing number from the HCF and LCM. Deciding whether a power such as can end in the digit 0. Showing that expressions like are composite. Real-life problems where things repeat and you need the LCM, such as people walking round a circular path.
How to approach it: Factorise each number fully with a factor tree or repeated division, and write the result in index form with primes in increasing order. For HCF, take only the common primes with their smallest powers. For LCM, take every prime with its greatest power. For last-digit questions, ask whether both 2 and 5 appear in the prime factorisation. For composite checks, take out a common factor so the expression becomes a product of two numbers, each greater than 1.
Like the circular-track word problem in Exercise 1.1
On a circular track, Arjun completes one round in 24 minutes and Kabir completes one round in 36 minutes. They start together from the same point at the same time and walk in the same direction. After how many minutes will they next meet at the starting point? How many rounds will each have completed by then?
Show the solutionSolution
- They meet at the start again after a time that is a multiple of both 24 and 36. The first such time is the LCM of 24 and 36.
- LCM = each prime to its greatest power
- They next meet at the starting point after 72 minutes.
- Rounds by Arjun . Rounds by Kabir .
Answer: They meet again at the starting point after 72 minutes. By then Arjun has completed 3 rounds and Kabir 2 rounds.
Exercise 1.2
What it tests: Proofs by contradiction that numbers are irrational. Proving that is irrational. Using a known irrational number to prove that expressions like , , and are irrational.
How to approach it: For a square root of a prime, assume it equals with and coprime integers and . Square both sides and use the fact that if a prime divides it divides . Show that the prime divides both and , which contradicts coprimality. For an expression, assume it equals a rational number , rearrange so the surd is alone on one side, and point out that the other side is rational. This contradicts the given fact that the surd is irrational.
Like the questions in Exercise 1.2 that use a known irrational number to prove a quotient irrational
Given that is irrational, prove that is irrational.
Show the solutionSolution
- Assume the opposite: suppose is rational. Then for some rational number .
- , because a fraction with a non-zero numerator 3 cannot be 0.
- Cross-multiply: , so .
- Since is a non-zero rational number, is rational. Rationals are closed under multiplication and under division by a non-zero rational.
- So would be rational. This contradicts the given fact that is irrational.
- The contradiction came from our assumption, so the assumption is false.
Answer: is irrational.
Real Numbers: previous year questions
- Standard: Asked in 21 of the 21 board papers we hold (2023 to 2026), on average 6 marks per paper; 83 questions in all, counting OR alternatives. In 4 of 4 sample papers.
- Basic: Asked in 21 of the 21 board papers we hold (2023 to 2026), on average 6 marks per paper; 82 questions in all, counting OR alternatives. In 4 of 4 sample papers.
Counted from the real papers on our previous year papers page, not estimated. Average marks are over every board paper we hold, with an OR pair counted once. Chapter tags are ours.
Solved board questions from Real Numbers
Real questions from recent papers. Try each one first, then open our step-by-step solution with marks per step.
2026 Basic, set 430/1/1, Q1 · 1 mark · MCQ
If the HCF of two positive integers and is , then their LCM is :
- (A)
- (B)
- (C)
- (D)
Try it first, then show our solutionSolution
For any two positive integers, .
- 1 mark
Here HCF , so LCM . The answer is option (D).
Answer: ab, option (D)
Where the marks are
- Uses HCF × LCM = ab to get LCM = ab (1 mark)
2026 Basic, set 430/1/1, Q26(a) · 3 marks · Short answer
Prove that is an irrational number.
Try it first, then show our solutionSolution
- ½ mark
Assume, on the contrary, that is rational.
Then , where are integers, , and are coprime.
Squaring: .
- 1 mark
So is divisible by 3. Since 3 is prime, 3 divides means 3 divides . ... (1)
- 1 mark
Let for some integer . Then , so .
So is divisible by 3, and hence is divisible by 3. ... (2)
- ½ mark
From (1) and (2), 3 divides both and . This contradicts the fact that and are coprime.
So our assumption is wrong. Hence is irrational.
Answer: Assuming (coprime) leads to 3 dividing both p and q, a contradiction; hence is irrational
Where the marks are
- Assumes with p, q coprime and gets (1/2 mark)
- Shows 3 divides p (1 mark)
- Substitutes and shows 3 divides q (1 mark)
- States the contradiction and concludes (1/2 mark)
2026 Basic, set 430/5/1, Q22 · 2 marks · Very short answer
Find the H.C.F. and L.C.M. of 1530 and 2040.
Try it first, then show our solutionSolution
- ½ mark
- ½ mark
- ½ mark
HCF = product of smallest powers of common primes
- ½ mark
LCM = product of greatest powers of all primes
Answer: HCF = 510, LCM = 6120
Where the marks are
- Prime factorisation of 1530 (½ mark)
- Prime factorisation of 2040 (½ mark)
- HCF = 510 (½ mark)
- LCM = 6120 (½ mark)
Every Real Numbers question, by year
Standard (98 questions, sample papers included)
- For 2027
Sample paper 2026-27: Q1 (1 mark, solved), Q21(A) (2 marks, solved), Q21(B) (2 marks, solved), Q26 (3 marks, solved)
- 2026
Set 30/1/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q3 (1 mark, solved), Q26 (3 marks, solved)
Set 30/2/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q3 (1 mark, solved), Q26 (3 marks, solved)
Set 30/3/1: Q4 (1 mark, solved), Q21 (2 marks, solved), Q28 (3 marks, solved)
Set 30/4/1: Q20 (1 mark, solved), Q24(a) (2 marks, solved), Q24(b) (2 marks, solved), Q31 (3 marks, solved)
Set 30/5/1: Q20 (1 mark, solved), Q21 (2 marks, solved), Q31 (3 marks, solved)
Sample paper 2025-26: Q1 (1 mark, solved), Q10 (1 mark, solved), Q19 (1 mark, solved), Q27 (3 marks, solved)
- 2025
Set 30/1/1: Q6 (1 mark, solved), Q9 (1 mark, solved), Q14 (1 mark, solved), Q29 (3 marks, solved)
Set 30/2/1: Q4 (1 mark, solved), Q10 (1 mark, solved), Q18 (1 mark, solved), Q30 (3 marks, solved)
Set 30/3/1: Q2 (1 mark, solved), Q23(a) (2 marks, solved), Q23(b) (2 marks, solved), Q27 (3 marks, solved)
Set 30/4/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q19 (1 mark, solved), Q26(A) (3 marks, solved), Q26(B) (3 marks, solved)
Set 30/5/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q3 (1 mark, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Set 30/6/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q19 (1 mark, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Sample paper 2024-25: Q19 (1 mark, solved), Q21(A) (2 marks, solved), Q21(B) (2 marks, solved), Q31 (3 marks, solved)
- 2024
Set 30/1/1: Q5 (1 mark, solved), Q25(A) (2 marks, solved), Q25(B) (2 marks, solved), Q27 (3 marks, solved)
Set 30/2/1: Q5 (1 mark, solved), Q21 (2 marks, solved), Q27 (3 marks, solved)
Set 30/3/1: Q5 (1 mark, solved), Q13 (1 mark, solved), Q14 (1 mark, solved), Q38 (4 marks, solved)
Set 30/4/1: Q2 (1 mark, solved), Q21 (2 marks, solved), Q30 (3 marks, solved)
Set 30/5/1: Q10 (1 mark, solved), Q13 (1 mark, solved), Q14 (1 mark, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Sample paper 2023-24: Q1 (1 mark, solved), Q21 (2 marks, solved), Q26 (3 marks, solved)
- 2023
Set 30/1/1: Q20 (1 mark, solved), Q24 (2 marks, solved), Q27 (3 marks, solved)
Set 30/2/1: Q4 (1 mark, solved), Q21 (2 marks, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Set 30/4/1: Q1 (1 mark, solved), Q21 (2 marks, solved), Q27 (3 marks, solved)
Set 30/5/1: Q20 (1 mark, solved), Q23 (2 marks, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Set 30/6/1: Q1 (1 mark, solved), Q21(A) (2 marks, solved), Q21(B) (2 marks, solved), Q27(A) (3 marks, solved), Q27(B) (3 marks, solved)
Basic (98 questions, sample papers included)
- For 2027
Sample paper 2026-27: Q1 (1 mark, solved), Q21(A) (2 marks, solved), Q21(B) (2 marks, solved), Q26 (3 marks, solved)
- 2026
Set 430/1/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q19 (1 mark, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Set 430/2/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q19 (1 mark, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Set 430/3/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q3 (1 mark, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Set 430/4/1: Q1 (1 mark, solved), Q5 (1 mark, solved), Q17 (1 mark, solved), Q20 (1 mark, solved), Q29 (3 marks, solved)
Set 430/5/1: Q1 (1 mark, solved), Q22 (2 marks, solved), Q26 (3 marks, solved)
Sample paper 2025-26: Q1 (1 mark, solved), Q21(A) (2 marks, solved), Q21(B) (2 marks, solved), Q26 (3 marks, solved)
- 2025
Set 430/1/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q19 (1 mark, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Set 430/2/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q19 (1 mark, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Set 430/3/1: Q1 (1 mark, solved), Q2 (1 mark, solved), Q3 (1 mark, solved), Q26(a) (3 marks, solved), Q26(b) (3 marks, solved)
Set 430/4/1: Q1 (1 mark, solved), Q21 (2 marks, solved), Q28 (3 marks, solved)
Set 430/5/1: Q1 (1 mark, solved), Q21 (2 marks, solved), Q29 (3 marks, solved)
Set 430/6/1: Q19 (1 mark, solved), Q25 (2 marks, solved), Q28 (3 marks, solved)
Sample paper 2024-25: Q1 (1 mark, solved), Q9 (1 mark, solved), Q20 (1 mark, solved), Q26 (3 marks, solved)
- 2024
Set 430/1/1: Q5 (1 mark, solved), Q23(A) (2 marks, solved), Q23(B) (2 marks, solved), Q26 (3 marks, solved)
Set 430/2/1: Q1 (1 mark, solved), Q21 (2 marks, solved), Q28 (3 marks, solved)
Set 430/3/1: Q20 (1 mark, solved), Q23(a) (2 marks, solved), Q23(b) (2 marks, solved), Q26 (3 marks, solved)
Set 430/4/1: Q13 (1 mark, solved), Q21 (2 marks, solved), Q30 (3 marks, solved)
Set 430/5/1: Q1 (1 mark, solved), Q7 (1 mark, solved), Q8 (1 mark, solved), Q26 (3 marks, solved)
Sample paper 2023-24: Q1 (1 mark, solved), Q2 (1 mark, solved), Q20 (1 mark, solved), Q26 (3 marks, solved)
- 2023
Set 430/1/1: Q1 (1 mark, solved), Q23 (2 marks, solved), Q30 (3 marks, solved)
Set 430/2/1: Q7 (1 mark, solved), Q22(a) (2 marks, solved), Q22(b) (2 marks, solved), Q27 (3 marks, solved)
Set 430/4/1: Q2 (1 mark, solved), Q4 (1 mark, solved), Q37 (4 marks, solved)
Set 430/5/1: Q6 (1 mark, solved), Q21 (2 marks, solved), Q27 (3 marks, solved)
Set 430/6/1: Q5 (1 mark, solved), Q9 (1 mark, solved), Q10 (1 mark, solved), Q30 (3 marks, solved)
Practice questions on Real Numbers
Write each answer on paper first. Open the hint only if you are stuck, and the answer only when you have finished.
Q1 · 1 mark · MCQBoard level
If and are two different prime numbers, then LCM is
(a)
(b)
(c)
(d)Hint
For LCM, take each prime with its greatest power.
Answer
(b) . The greatest power of is and the greatest power of is .
Q2 · 2 marks · Very short answerBoard level
The HCF of two numbers is 23 and their LCM is 1449. If one of the numbers is 161, find the other number.
Hint
For two numbers, HCF × LCM = product of the numbers.
Answer
Other number , since . Check: and , so HCF = 23 and LCM .
Q3 · 2 marks · Very short answerBoard level
Explain why is a composite number.
Hint
Both terms have a common factor. Take it out.
Answer
. It has factors other than 1 and itself, so it is composite.
Q4 · 3 marks · Short answerHarder board level
Given that is irrational, prove that is irrational.
Hint
Assume it equals a rational number , then make the subject.
Answer
Suppose , with rational. Then , so , which is rational. This contradicts the irrationality of , so the number is irrational.
Q5 · 5 marks · Long answerHarder board level
Prove that is irrational. Hence show that is irrational.
Hint
For the second part, rationalise the denominator first.
Answer
Assume with , coprime and . Then , so 3 divides . Write ; then , so 3 divides . This contradicts coprimality, so is irrational (3 marks).
. If were rational, then would be rational, a contradiction. So the number is irrational (2 marks).
Q6 · 3 marks · Short answerHarder board level
Find the smallest four-digit number that leaves a remainder of 5 when divided by each of 28, 42 and 63.
Hint
The number minus 5 must be a common multiple of 28, 42 and 63.
Answer
, , , so LCM . The smallest four-digit multiple of 252 is (since ). Required number .
Q7 · 3 marks · Short answerHarder board level
Let and , where and are natural numbers. If HCF and LCM, find and , and hence find and .
Hint
Write 36 and 7560 in prime factorised form and compare the powers of 2 and of 3.
Answer
and . From HCF, the smaller power of 2 is 2, so . From LCM, the greater power of 3 is 3, so . Then and .
Q8 · 5 marks · Long answerHarder board level
A tailor has three pieces of cloth of lengths 360 cm, 480 cm and 672 cm.
(i) He wants to cut all of them into pieces of equal length, as long as possible, with no cloth wasted. Find the length of each piece and the total number of pieces.
(ii) Find the shortest length of a single roll of cloth from which pieces of exactly 360 cm, or exactly 480 cm, or exactly 672 cm can each be cut with nothing left over. Give your answer in metres.Hint
Part (i) needs the HCF and part (ii) needs the LCM. Factorise all three lengths first.
Answer
, , . (i) HCF cm; pieces . (ii) LCM cm m.
Q9 · 1 mark · Assertion-reasonHOTS / competency
Assertion (A): is an irrational number.
Reason (R): The sum of two irrational numbers is always irrational.
(a) Both A and R are true and R is the correct explanation of A.
(b) Both A and R are true but R is not the correct explanation of A.
(c) A is true but R is false.
(d) A is false but R is true.Hint
Simplify first. Then try added to .
Answer
(c) A is true but R is false. , so the sum is , which is irrational. But is rational, so R is false.
Q10 · 3 marks · Short answerHOTS / competency
Aman says: 'If 15 divides for a natural number , then 225 must divide .' Is he right? Justify using prime factorisation.
Hint
15 is not prime, but 3 and 5 are. Apply 'prime divides implies prime divides ' to each.
Answer
Yes. 15 divides , so 3 divides and 5 divides . Since 3 and 5 are primes, 3 divides and 5 divides . Both distinct primes appear in the factorisation of , so 15 divides . Write ; then , which is divisible by 225.
Test your recall
Answer in your head or on paper first, then open the card. Pulling an answer out of memory makes it stick far better than re-reading.
1.State the Fundamental Theorem of Arithmetic.Show answer
Every composite number can be expressed as a product of primes, and this factorisation is unique apart from the order of the factors.
2.Is 1 prime, composite or neither?Show answer
Neither. It has only one factor.
3.Which powers does the HCF use, and which does the LCM use?Show answer
HCF: smallest powers of the common primes. LCM: greatest powers of all the primes.
4.For two numbers a and b, what is HCF × LCM?Show answer
. It holds only for two numbers.
5.If a prime p divides , what can you conclude?Show answer
p divides a.
6.Can two numbers have HCF 18 and LCM 380?Show answer
No. The HCF must divide the LCM, and 18 does not divide 380.
7.What is the LCM of two co-prime numbers?Show answer
Their product, since their HCF is 1.
8.Is the sum of two irrational numbers always irrational?Show answer
No. For example , which is rational.
Best order to study it
- Revise primes, composites and factor trees until you can factorise any 3- or 4-digit number quickly and correctly.
- Learn the Fundamental Theorem of Arithmetic and use uniqueness for last-digit and composite-number questions.
- Find HCF and LCM by prime factorisation, then learn the product relation for two numbers and the sandwich checks.
- Practise word problems: decide HCF or LCM from the situation, and handle remainders.
- Learn the theorem that a prime dividing a square divides the number, then write the proofs for root 2, root 3 and root 5 until the steps are automatic.
- Move on to proving expressions like 3 + 2 root 5 irrational, then mix all question types under timed conditions.
Quick revision checklist
The night before the exam: can you do each of these without looking?
- Can you state the Fundamental Theorem of Arithmetic in one sentence?
- Can you write 4620 as a product of prime powers?
- Can you find the HCF and LCM of three numbers by prime factorisation and check them?
- Can you find a missing number using HCF × LCM = product, and say why it fails for three numbers?
- Can you explain, citing the theorem, why never ends in 0?
- Can you show that an expression like is composite?
- Can you decide HCF or LCM from the words of a problem and adjust for remainders?
- Can you write the full proof that is irrational, naming the contradiction?
- Can you prove that is irrational using the known irrationality of ?
- Can you give an example of two irrational numbers whose sum or product is rational?
Real Numbers: frequently asked questions
Are Euclid's division lemma and decimal expansions of rational numbers in the 2026-27 syllabus?
No. Euclid's division lemma, Euclid's division algorithm and the topic of decimal expansions of rational numbers are not in the 2026-27 syllabus.
Do I need to prove that if a prime divides a squared then it divides a?
No. You need to state it and use it correctly inside your irrationality proofs. Mention it in words at the step where you go from p divides a squared to p divides a, because that step carries marks.
Can I use HCF times LCM equals product for three numbers?
No. The relation is true only for two numbers. For three numbers, find the HCF and LCM directly from the prime factorisations.
Can I just write that rational plus irrational is irrational to answer a proof question?
Not when the question asks you to prove or show it. The examiner expects the contradiction method: assume the expression is rational, isolate the root, and show that the root would then be rational, which is false.
How do I know whether a word problem needs HCF or LCM?
If you are dividing things into the largest possible equal parts, use HCF. If you want the earliest time events happen together, or the smallest amount that every group size divides, use LCM. A quick check is that an HCF answer cannot exceed the smallest number given and an LCM answer cannot be less than the largest.
Why is 1 not counted as a prime number?
A prime must have exactly two different factors, and 1 has only one. If 1 were prime, factorisations would stop being unique, because you could multiply by 1 as many times as you like.
Based on: CBSE Mathematics syllabus 2026-27; NCERT Mathematics, Textbook for Class X (Reprint 2026-27)