The remainder must sit from 0 up to 4.
17 = 5×3 + 2, and 0 ≤ 2 < 5. r = 7 is larger than the divisor.
Class 10 · Maths · Chapter 1 · बिहार बोर्ड (BSEB)CBSE · NCERT 2026-27
Real Numbers
How to use this page:
1. Read — Exercise 1.1 Euclid · 1.2 factors · 1.3 irrational · 1.4 decimals, diagram, worked example, board tip
2. Check — each lesson has its own questions; the number follows the lesson
3. Mastery ★ — all of that lesson correct. Redo the wrong ones
4. The memory figure stops a terminating decimal at one point on the number line and shows a non-terminating repeating decimal with a repeating mark.
Progress stays in this browser.
Last 7 days:
Everything is saved in this phone/browser — no login.
This chapter has no Short on the channel yet, so ten empty cards are not shown. The notes, diagrams and checks are complete.
यूक्लिड की विभाजन प्रमेयिका · NCERT 1.2 · the lemma · the egg puzzle
For positive integers a and b, Euclid’s division lemma says there are whole numbers q and r such that
a = bq + r, 0 ≤ r < b
q is the quotient and r is the remainder. r may be zero, but it cannot be equal to b or larger. Divide 17 by 5: 17 = 5×3 + 2. Here q = 3 and r = 2, and 2 is smaller than 5.
A trader’s basket holds at most 150 eggs. Count by twos and 1 is left, by threes 2, by fours 3, by fives 4, by sixes 5, and by sevens nothing is left.
Write that in the language of the lemma: a = 2u+1 = 3t+2 = 4s+3 = 5w+4 = 6q+5 = 7p. Each time the remainder is 1 less than the divisor, and the remainder on 7 is 0.
Question: Find the number a ≤ 150 that meets the conditions above.
Formula: a = 7p, and a = 6q+5, a = 5w+4, a = 4s+3, a = 3t+2, a = 2u+1.
Check: 119 = 7×17 + 0. 119 = 6×19 + 5. 119 = 5×23 + 4. 119 = 4×29 + 3. 119 = 3×39 + 2. 119 = 2×59 + 1.
119 is smaller than 150. The next such number would be 119+420, which is larger than 150. So there are 119 eggs.
In the answer write both q and r, and also show the line r < b.
Writing a remainder equal to the divisor breaks the lemma. 17 = 5×2 + 7 is the wrong form.
The remainder must sit from 0 up to 4.
17 = 5×3 + 2, and 0 ≤ 2 < 5. r = 7 is larger than the divisor.
False — the condition is 0 ≤ r < b. r does not reach b.
The remainder is smaller than the divisor.
0 ≤ r < b.
119 = 7×17.
119 meets every remainder condition and is smaller than 150.
38 = 7×5 + 3. Here q = 5, r = 3, and 0 ≤ 3 < 7.
यूक्लिड से HCF — अभ्यास 1.1 के भाग · Exercise 1.1 · questions 1 and 3
If a > b, write a = bq + r from the lemma. If r = 0 then HCF = b. If r ≠ 0 then HCF(a, b) = HCF(b, r). Repeat until the remainder is 0. The last divisor is the HCF.
This is different from the lemma. The lemma writes one division. The algorithm carries that division on until the HCF.
In question 1, find the HCF by Euclid’s algorithm: (i) 135 and 225, (ii) 196 and 38220, (iii) 867 and 255.
In question 3, a contingent of 616 and a band of 32 march in the same number of columns. The greatest number of columns is HCF(616, 32).
Question: HCF of 135 and 225.
Steps: 225 = 135×1 + 90.
135 = 90×1 + 45.
90 = 45×2 + 0.
The remainder is 0, so the HCF is 45. Check: 135 = 45×3 and 225 = 45×5.
| Pair | Last divisor | HCF |
|---|---|---|
| 867, 255 | 51 | 51 |
| 616, 32 | 8 | 8 |
| 196, 38220 | 196 | 196 |
In every line write dividend, divisor, quotient and remainder. Marks are cut for only the final number.
For 135 and 225 make the larger number the first dividend. Starting the other way adds steps.
In the third line the remainder is 0 and the divisor is 45.
225 = 135×1 + 90, 135 = 90×1 + 45, 90 = 45×2 + 0. HCF = 45.
True — 867 = 255×3 + 102, 255 = 102×2 + 51, 102 = 51×2 + 0.
616 = 32×19 + 8.
616 = 32×19 + 8 and 32 = 8×4 + 0, so 8.
867 = 255×3 + 102. 255 = 102×2 + 51. 102 = 51×2 + 0. HCF = 51.
The remainder is already 0 at the first step.
38220 = 196×195 + 0, so the HCF is 196.
True — the algorithm stops there. That is the case of 196 and 38220.
विषम, वर्ग और घन के रूप — अभ्यास 1.1 शेष · Exercise 1.1 · questions 2, 4, 5
Any integer leaves remainder 0, 1, 2, 3, 4 or 5 on division by 6. The even forms are 6q, 6q+2 and 6q+4. The odd forms are 6q+1, 6q+3 and 6q+5.
For a square, take divisor 3. For a cube, take divisor 3 as well, then expand the cube. A proof that skips the list of remainders stays incomplete.
Question 2: every positive odd integer is of the form 6q+1, 6q+3 or 6q+5.
Question 4: the square of a positive integer is of the form 3m or 3m+1. Hint: the number is 3q, 3q+1 or 3q+2. Square all three.
Question 5: the cube is of the form 9m, 9m+1 or 9m+8.
Question: Why is the square of a positive integer only of the form 3m or 3m+1?
Forms: the number is 3q, 3q+1 or 3q+2.
(3q)² = 9q² = 3(3q²), which is 3m.
(3q+1)² = 9q² + 6q + 1 = 3(3q²+2q) + 1, which is 3m+1.
(3q+2)² = 9q² + 12q + 4 = 3(3q²+4q+1) + 1, which is also 3m+1.
In all three cases the square is 3m or 3m+1. It never becomes 3m+2.
Expand the square or the cube of all three forms. Stopping after one form is an incomplete proof.
Calling 3m+2 a square is a common slip. The three expansions show that form does not arise.
6q+2 and 6q+4 are even.
After the even forms are removed, the odd forms 6q+1, 6q+3 and 6q+5 remain.
The number is 3q, 3q+1 or 3q+2. (3q)³ = 27q³ = 9(3q³). (3q+1)³ = 27q³+27q²+9q+1 = 9(3q³+3q²+q)+1. (3q+2)³ = 27q³+54q²+36q+8 = 9(3q³+6q²+4q)+8. So the form is 9m, 9m+1 or 9m+8.
False — the squares of the three forms give only 3m or 3m+1.
4 is even and 6q is even.
Even. The odd forms are 6q+1, 6q+3 and 6q+5.
अंकगणित की आधारभूत प्रमेय — अभ्यास 1.2 की शुरुआत · Theorem 1.2 · Exercise 1.2 questions 1, 5, 6
Every composite number can be written as a product of primes, and this writing is unique apart from order. 12 = 2×2×3 = 3×2×2. Both are the same factors.
This is why 4ⁿ cannot end in 0. In 4ⁿ = 2²ⁿ the only prime is 2. A final 0 needs both 2 and 5. 6ⁿ = 2ⁿ×3ⁿ has no 5 either.
Question 1: write 140, 156, 3825, 5005 and 7429 as products of prime factors.
Question 5: can 6ⁿ end with the digit 0?
Question 6: explain why 7×11×13+13 and 7×6×5×4×3×2×1+5 are composite. Take the common factor out.
Question: Why is 7×11×13 + 13 composite?
Factor: 13 is in both terms. 13(7×11 + 1) = 13(77+1) = 13×78.
Both 13 and 78 are greater than 1, so the number is composite.
The other number: 7! + 5 = 5(7×6×4×3×2×1 + 1) = 5×1009. Both 5 and 1009 are greater than 1, so it is composite too.
Write prime powers: 140 = 2²×5×7. Just 2×2×5×7 is also correct, but powers stay clear.
A final 0 means divisibility by 10, so both 2 and 5. Being even is not enough.
4 and 35 are not prime.
140 = 2×70 = 2×2×35 = 2²×5×7.
False — 6ⁿ = 2ⁿ×3ⁿ has no 5, so it is not divisible by 10.
5×7×11 = 385, and 5005÷385 = 13.
13. Also 7429 = 17×19×23 and 3825 = 3²×5²×17.
13 comes out of the bracket.
13(77+1) = 13×78, two factors greater than 1.
156 = 2²×3×13. 3825 = 3²×5²×17. 4ⁿ = 2²ⁿ has only the prime 2. A final 0 also needs the factor 5, which is absent.
HCF और LCM — अभ्यास 1.2 शेष · Exercise 1.2 · questions 2, 3, 4, 7
For two positive integers a and b,
HCF(a, b) × LCM(a, b) = a × b
So LCM = a×b / HCF. For three numbers that product sentence does not hold. 6×72×120 is not equal to the product of their HCF and LCM. The book writes this caution for the reader.
The HCF of 12, 15 and 21 is 3 and the LCM is 420. 12×15×21 = 3780, while 3×420 = 1260. They are not equal. Find the LCM of three numbers from the highest power of each prime.
Question 2: find HCF and LCM of the pairs 26 and 91, 510 and 92, 336 and 54, and check HCF×LCM = product.
Question 3: 12, 15, 21; then 17, 23, 29; then 8, 9, 25. Question 4: HCF(306, 657) = 9 is given, find the LCM.
Question 7: Sonia takes 18 minutes for one round and Ravi takes 12. The time until they meet again at the start is LCM(18, 12). The NCERT reprint marks this question as not for the examination.
Question: If HCF(306, 657) = 9, find the LCM.
Formula: LCM = (first × second) / HCF.
Substitution: LCM = (306 × 657) / 9. 306/9 = 34, so 34 × 657.
657×30 = 19710 and 657×4 = 2628. The sum is 22338.
Write the check line: 13×182 = 26×91. Question 2 is incomplete without the check.
In the LCM take the highest power of each prime. In the HCF take the lowest.
10-second revision
Both contain 13.
26 = 2×13, 91 = 7×13. HCF = 13, LCM = 2×7×13 = 182.
False — the book gives this caution for 6, 72 and 120. 12×15×21 ≠ 3×420.
Divide 306×657 by 9.
22338.
The LCM of 18 and 12.
18 = 2×3², 12 = 2²×3, LCM = 2²×3² = 36 minutes.
336 = 2⁴×3×7, 54 = 2×3³. HCF = 2×3 = 6. LCM = 2⁴×3³×7 = 3024. Check: 6×3024 = 18144 and 336×54 = 18144.
All three are prime and distinct.
There is no common prime, so HCF = 1 and LCM = 17×23×29 = 11339.
अपरिमेय संख्याएँ — अभ्यास 1.3 · Theorem 1.3 · all three questions of Exercise 1.3
If a prime p divides a², then p also divides a. This follows from the fundamental theorem. It is how √2, √3 and √5 are proved irrational.
A rational can be written as p/q with q ≠ 0, and in a proof p and q are taken coprime. An irrational cannot be written in that form. √2, √3, π and 0.101101110… are irrational examples.
Question 1: prove that √5 is irrational.
Question 2: prove that 3 + 2√5 is irrational.
Question 3: prove that (i) 1/√2, (ii) 7√5, (iii) 6 + √2 are irrational.
Question: √5 is irrational.
Suppose √5 = a/b, where a and b are coprime integers and b ≠ 0.
Then a² = 5b². So 5 divides a², and by the theorem 5 divides a. Put a = 5k.
25k² = 5b², so b² = 5k². Then 5 also divides b.
Both a and b became divisible by 5, which clashes with the coprime assumption. So √5 is irrational.
First prove the square root irrational, then lean on it for a sum such as 3+2√5.
“It is irrational because the decimal is long” is not a proof. Write the contradiction step.
10-second revision
The theorem carries the prime from the square onto the number.
From a² = 5b², 5 divides a² and then a.
True — √5 = (that rational − 3)/2. That is the clash, because √5 is irrational.
Suppose 7√5 = a/b is rational, b ≠ 0. Then √5 = a/(7b), which would be rational. That clashes with √5 being irrational. So 7√5 is irrational.
Multiply numerator and denominator by √2.
√2 / 2. If this were rational, √2 would be rational.
दशमलव प्रसार — अभ्यास 1.4 · Theorems 1.5 to 1.7 · Exercise 1.4
In lowest terms p/q, if q = 2ⁿ5ᵐ with n and m non-negative integers, the decimal terminates. If q has any other prime, the decimal is non-terminating and repeating.
Every rational decimal either terminates or repeats. A decimal that neither stops nor repeats is irrational. In the Bihar book this is Exercise 1.4. The NCERT reprint of 2026-27 does not print this exercise.
Question 1: without long division, say whether 13/3125, 17/8, 64/455, 15/1600, 29/343, 23/(2³5²), 129/(2²5⁷7), 6/15, 35/50 and 77/210 terminate or repeat.
Question 2: write the decimals of those that terminate. Question 3: 43.123456789 is a terminating rational; 0.120120012000… neither stops nor repeats, so it is irrational; if 43.123456789 carries a repeat bar, it is a repeating rational and the denominator has a prime other than 2 and 5.
Question: Does 15/1600 terminate? Write the decimal.
Formula: if the lowest denominator is 2ⁿ5ᵐ, it terminates.
Substitution: 15/1600 = 3/320, because a 5 cancels. 320 = 2⁶×5. Only 2 and 5 appear, so it terminates.
To make the denominator 10⁶, multiply numerator and denominator by 5⁵: 3×3125 / 10⁶ = 9375/1000000 = 0.009375.
Simplify the denominator first. 6/15 = 2/5 terminates. Calling it repeating because you saw a 3 before cancelling is a mistake.
77/210 = 11/30. 30 contains a 3, so it repeats. 210 had both 7 and 3.
10-second revision
8 = 2³.
The denominator is 2³, so it terminates. 17/8 = 2.125.
False — 455 = 5×7×13. 7 and 13 remain, so it is non-terminating repeating.
10 = 2×5.
2 and 5.
The run of zeros keeps growing.
It neither stops nor repeats one block, so it is irrational.
3125 = 5⁵, so 13/3125 terminates and equals 0.00416. 343 = 7³, so 29/343 is non-terminating repeating. 35/50 = 7/10, denominator 2×5, so it terminates and the decimal is 0.7.
Pick a type. The 35 lesson checks are separate — each lesson has as many as its topic needs. All correct earns mastery ★.
No question is marked as a verified past paper. The BSEB set is a model for practice. CBSE items are CBSE-style, not a copy of any year’s paper.
The remainder is smaller than the divisor and not negative.
0 ≤ r < b.
The third line of Euclid.
HCF = 45.
616 = 32×19 + 8.
8 columns.
Look at the squares of the three forms.
3m+2 does not arise.
Every factor should be prime.
2²×5×7.
A final 0 means 2×5.
6ⁿ = 2ⁿ×3ⁿ has no 5.
Divide the product by the HCF.
22338.
The rule for two numbers.
13×182 = 26×91.
The product of the highest powers.
2²×3×5×7 = 420.
The coprime assumption breaks.
Both become divisible by 2.
8 = 2³.
It terminates, 2.125.
77/210 = 11/30.
30 = 2×3×5 contains 3, so it repeats.
False — 0 ≤ r < b.
True — 196 divides 38220 exactly.
False — 5 is not a factor.
True — 510 = 2×3×5×17 and 92 = 2²×23.
False — that assumption would make √5 rational.
True — 3125 = 5⁵.
False — the number of zeros grows, so no block repeats.
True — 2²×3² = 36.
a = bq + r.
q is the quotient.
45.
The last divisor.
13.
156÷12 = 13.
HCF.
Only for two numbers.
a.
From the square onto the number.
5ᵐ.
The other prime is 5.
0.7.
7/10.
23.
17×19 = 323.
The lemma is one division, the algorithm is the HCF, the theorem is unique factors, and a terminating denominator is 2ⁿ5ᵐ.
17/8 terminates, 1/3 repeats, √2 is irrational, and 22/7 is a repeating rational.
Assertion (A): The HCF of 135 and 225 is 45.
Reason (R): 225 = 135×1 + 90, 135 = 90×1 + 45 and 90 = 45×2 + 0.
Both are true and R is the calculation that gives A.
Assertion (A): 6ⁿ does not end in 0.
Reason (R): For two numbers, HCF × LCM equals their product.
Both are true, but R does not explain A. The reason for A is that 5 is missing from the factors.
Assertion (A): The decimal of 13/3125 terminates.
Reason (R): 7 is a factor of 3125.
A is true because 3125 = 5⁵. R is false.
Assertion (A): For three numbers, HCF × LCM always equals the product of the three.
Reason (R): For two numbers, HCF × LCM equals the product of those two.
A is false. R is true.
Assertion (A): √5 is irrational.
Reason (R): Assuming √5 = a/b makes both a and b divisible by 5.
Both are true and R is the proof of A.
This is coefficient practice. It is not a result of this maths chapter. These are small equations of water and carbon dioxide forming.
1/2 and 7/8 terminate. 1/3 repeats. √2 is irrational.
The first two lines are the lemma. The last two are the algorithm.
For positive integers a and b, a = bq + r, where 0 ≤ r < b.
196, because 38220 = 196×195 + 0.
HCF × LCM = the product of the two numbers.
In lowest terms the denominator is 2ⁿ5ᵐ.
5(7×6×4×3×2×1 + 1) = 5×1009. Both factors are greater than 1.
510 = 2×3×5×17, 92 = 2²×23. HCF = 2, LCM = 2²×3×5×17×23 = 23460. Check: 2×23460 = 510×92 = 46920.
Suppose 6 + √2 is rational. Then √2 = that rational − 6, which would be rational. This clashes with √2 being irrational.
8 = 2³, 9 = 3², 25 = 5². HCF = 1, LCM = 2³×3²×5² = 1800. For three numbers, HCF × LCM is not equal to the product of the three.
6/15 = 2/5, denominator 5, so it terminates and the decimal is 0.4. The other denominator contains 7, so it is non-terminating repeating.
867 = 255×3 + 102, 255 = 102×2 + 51, 102 = 51×2 + 0, so the HCF is 51. In the parade the greatest number of columns is an HCF. 616 = 32×19 + 8, 32 = 8×4 + 0, so 8 columns.
Suppose √5 = a/b with a and b coprime. From a² = 5b², 5 divides a. Put a = 5k and 5 also divides b. Contradiction. If 3 + 2√5 were rational, √5 = (rational − 3)/2 would be rational, which clashes with the first result.
If the lowest denominator is 2ⁿ5ᵐ the decimal terminates; otherwise it repeats. 15/1600 = 3/320 and 320 = 2⁶×5, so it terminates. 3×5⁵/10⁶ = 0.009375. 455 = 5×7×13 contains 7 and 13, so 64/455 is non-terminating repeating.
This model set is for practice. It is not a question from any year’s annual examination.
Take the HCF.
8.
3825 = 3²×5²×17.
17 is prime.
36.
Sonia and Ravi.
6q+1, 6q+3 and 6q+5, where q is an integer.
225 = 135×1 + 90, 135 = 90×1 + 45, 90 = 45×2 + 0, HCF = 45. LCM = 306×657/9 = 22338. For three numbers, HCF × LCM is not equal to their product.
These are competency-based practice questions. They are not copies of a past paper.
r < b is required.
7 > 5, so this is not the lemma’s form. The correct writing is 17 = 5×3 + 2.
A full ten means a final 0.
6ⁿ has no 5, so it is not divisible by 10.
Assertion (A): The decimal of 15/1600 terminates.
Reason (R): If a 3 is visible in the denominator before cancelling, the decimal is always non-terminating.
A is true, 15/1600 = 3/320 = 0.009375. R is false, because the 3 cancels and the denominator remains 2⁶×5.
Assertion (A): Two buses leave the same stop every 18 and 12 minutes. They leave together again after 36 minutes.
Reason (R): The next shared departure is the LCM of the two intervals.
Both are true and R explains A.
HCF = 3. 12×15×21 / 3 = 1260, but 1260 is not their LCM. From prime powers the LCM is 2²×3×5×7 = 420. The two-number formula does not hold for three numbers.
The pile size is the HCF, 51 rupees. 867/51 = 17 piles and 255/51 = 5 piles. That is 22 piles in all.
Switch board with BSEB | CBSE above. The lessons follow the same NCERT chapter.
This page has no verified annual-exam question, because no source page has been added. The model set below is practice in the board pattern.
🏛️ Model questions on one page →
The verified label will be used only when a source page for the question is available.
These are case and assertion-reason practice items. Do not treat them as past CBSE questions.
Wrong questions return soon; correct ones return after a few days.
What you learned
| What | Keep this |
|---|---|
| Lemma | a = bq + r, 0 ≤ r < b |
| HCF steps | HCF(a, b) = HCF(b, r) |
| Two numbers | HCF × LCM = product |
| Prime and square | p | a² ⇒ p | a |
| Terminating | q = 2ⁿ5ᵐ |
| Repeating | q has another prime |
The notes are original writing. The textbook was used only for activity order and numbers. “Verified” will be used only on a question that has a source page.