Official CBSE Study Materials for Class 10 Mathematics
Access comprehensive study materials and useful resources for Real Numbers using the CBSE Class 10 Mathematics Real Numbers Important Questions Set 06. Designed to align with the 2026-27 CBSE academic guidelines, these advanced resources help Class 10 Mathematics students reinforce core concepts beyond standard textbooks.
Advanced Resources for Mathematics
View or download the dedicated CBSE Class 10 Mathematics Real Numbers Important Questions Set 06 resource below. Engaging with these advanced study guides under focused conditions ensures continuous academic progress and mastery of the 2026-27 curriculum for Real Numbers.
Important Questions with Answers
Question 1. A number when divided by 61 gives 27 as quotient and 32 as remainder. Find the number.
Answer:
By Euclid's division lemma, dividend = divisor × quotient + remainder.
Number = 61 × 27 + 32 = 1647 + 32 = 1679.
In simple words: Multiply divisor by quotient, then add the remainder.
Teacher's Note:
1. Use a = bq + r with 0 ≤ r < b.
2. Check that the remainder 32 is less than the divisor 61.
Question 2. By what number should 1365 be divided to get 31 as quotient and 32 as remainder?
Answer:
Let the divisor be x. Then 1365 = x × 31 + 32.
31x = 1365 − 32 = 1333, so x = 1333 ÷ 31 = 43.
Check: 43 × 31 + 32 = 1333 + 32 = 1365, and the remainder 32 < 43.
In simple words: Subtract the remainder first, then divide by the quotient.
Teacher's Note:
1. Always verify that the remainder is smaller than the divisor.
2. Write the lemma first, then substitute.
Question 3. Using Euclid's division algorithm, find the HCF of (i) 405 and 2520, (ii) 504 and 1188, (iii) 960 and 1575.
Answer:
(i) 2520 = 405 × 6 + 90; 405 = 90 × 4 + 45; 90 = 45 × 2 + 0. HCF = 45.
(ii) 1188 = 504 × 2 + 180; 504 = 180 × 2 + 144; 180 = 144 × 1 + 36; 144 = 36 × 4 + 0. HCF = 36.
(iii) 1575 = 960 × 1 + 615; 960 = 615 × 1 + 345; 615 = 345 × 1 + 270; 345 = 270 × 1 + 75; 270 = 75 × 3 + 45; 75 = 45 × 1 + 30; 45 = 30 × 1 + 15; 30 = 15 × 2 + 0. HCF = 15.
In simple words: Keep dividing the divisor by the remainder until the remainder is 0; the last divisor is the HCF.
Teacher's Note:
1. Write every step as a = bq + r.
2. The HCF is the last non-zero remainder, that is, the last divisor.
Question 4. Use Euclid's algorithm to find the HCF of 272 and 1032.
Answer:
1032 = 272 × 3 + 216
272 = 216 × 1 + 56
216 = 56 × 3 + 48
56 = 48 × 1 + 8
48 = 8 × 6 + 0
The remainder is now 0, so HCF(272, 1032) = 8.
In simple words: Repeat the division until nothing is left over; the last divisor is the answer.
Teacher's Note:
1. Start by dividing the larger number by the smaller one.
2. Do not stop at a non-zero remainder.
Question 5. Use Euclid's algorithm to find the HCF of 1651 and 2032. Express the HCF in the form \( 1651m + 2032n \).
Answer:
2032 = 1651 × 1 + 381 … (i)
1651 = 381 × 4 + 127 … (ii)
381 = 127 × 3 + 0, so the HCF is 127.
From (ii): 127 = 1651 − 381 × 4. From (i): 381 = 2032 − 1651.
So 127 = 1651 − 4(2032 − 1651) = 1651 × 5 + 2032 × (−4).
Hence m = 5, n = −4. Check: 8255 − 8128 = 127.
In simple words: Work backwards through the divisions to write the HCF as a combination of the two numbers.
Teacher's Note:
1. Express each remainder using the earlier lines, then substitute step by step.
2. m and n need not be positive.
Question 6. Use Euclid's algorithm to find the HCF of 1190 and 1445. Express the HCF in the form \( 1190m + 1445n \).
Answer:
1445 = 1190 × 1 + 255 … (i)
1190 = 255 × 4 + 170 … (ii)
255 = 170 × 1 + 85 … (iii)
170 = 85 × 2 + 0. So HCF = 85.
From (iii): 85 = 255 − 170. From (ii): 170 = 1190 − 255 × 4.
85 = 255 − (1190 − 4 × 255) = 5 × 255 − 1190 = 5(1445 − 1190) − 1190 = 5 × 1445 − 6 × 1190.
Hence m = −6, n = 5. Check: −7140 + 7225 = 85.
In simple words: Back-substitute the remainders, and the HCF appears as 1190 × (−6) + 1445 × 5.
Teacher's Note:
1. Check your m and n by multiplying out at the end.
2. A negative m or n is perfectly acceptable.
Question 7. Show that every positive integer is either even or odd.
Answer:
Let n be any positive integer. On dividing n by 2, let m be the quotient and r the remainder. By Euclid's lemma n = 2m + r, where 0 ≤ r < 2, so r = 0 or 1.
If r = 0, n = 2m, which is even. If r = 1, n = 2m + 1, which is odd.
Hence every positive integer is either even or odd.
In simple words: Dividing by 2 leaves remainder 0 or 1, so the number is of the form 2m or 2m + 1.
Teacher's Note:
1. Divide by the number named in the form you want.
2. Write the possible remainders as 0 ≤ r < divisor.
Question 8. Show that any positive odd integer is of the form \( 6m + 1 \), \( 6m + 3 \) or \( 6m + 5 \), where m is some integer.
Answer:
Let n be a positive odd integer. By Euclid's lemma, n = 6m + r, where r = 0, 1, 2, 3, 4, 5.
So n = 6m, 6m + 1, 6m + 2, 6m + 3, 6m + 4 or 6m + 5.
But 6m = 2(3m), 6m + 2 = 2(3m + 1) and 6m + 4 = 2(3m + 2) are even.
Since n is odd, n = 6m + 1, 6m + 3 or 6m + 5.
In simple words: Take all six remainders and throw away the ones that give even numbers.
Teacher's Note:
1. List every remainder first.
2. Show clearly why the rejected forms are even.
Question 9. Show that any positive odd integer is of the form \( 4m + 1 \) or \( 4m + 3 \), where m is some integer.
Answer:
Let n be a positive odd integer. n = 4m + r with r = 0, 1, 2, 3.
4m and 4m + 2 = 2(2m + 1) are even, so n cannot be of these forms.
Hence n = 4m + 1 or 4m + 3.
In simple words: Odd numbers leave remainder 1 or 3 when divided by 4.
Teacher's Note:
1. The same method works for 2m + 1, 6m + 1 and so on.
2. Mention that the even forms are rejected.
Question 10. Using Euclid's division lemma, show that the square of any positive integer is either of the form \( 3m \) or \( 3m + 1 \) for some integer m.
Answer:
Let n be any positive integer. n = 3q + r, where r = 0, 1, 2.
n² = 9q² + 6qr + r².
Case I, r = 0: n² = 9q² = 3(3q²) = 3m, where m = 3q².
Case II, r = 1: n² = 9q² + 6q + 1 = 3(3q² + 2q) + 1 = 3m + 1.
Case III, r = 2: n² = 9q² + 12q + 4 = 3(3q² + 4q + 1) + 1 = 3m + 1.
Hence the square of any positive integer is of the form 3m or 3m + 1.
In simple words: No square leaves remainder 2 when divided by 3.
Teacher's Note:
1. Expand (3q + r)² carefully for each r.
2. Pull out a factor 3 in every case.
Question 11. Using Euclid's division lemma, show that the cube of any positive integer is of the form \( 9m \), \( 9m + 1 \) or \( 9m + 8 \) for some integer m.
Answer:
Let n = 3q + r, r = 0, 1, 2. Then n³ = 27q³ + 27q²r + 9qr² + r³.
r = 0: n³ = 27q³ = 9(3q³) = 9m.
r = 1: n³ = 27q³ + 27q² + 9q + 1 = 9(3q³ + 3q² + q) + 1 = 9m + 1.
r = 2: n³ = 27q³ + 54q² + 36q + 8 = 9(3q³ + 6q² + 4q) + 8 = 9m + 8.
Hence the cube is of the form 9m, 9m + 1 or 9m + 8.
In simple words: Write n = 3q + r and expand the cube; every term except r³ is a multiple of 9.
Teacher's Note:
1. Use (a + b)³ = a³ + 3a²b + 3ab² + b³.
2. Identify the multiple of 9 in each case.
Question 12. For any positive integer n, prove that \( n^3 - n \) is divisible by 6.
Answer:
\( n^3 - n = n(n - 1)(n + 1) \), the product of three consecutive integers (n − 1), n, (n + 1).
Divisibility by 2: among any two consecutive integers one is even, so the product is divisible by 2.
Divisibility by 3: on dividing n by 3 the remainder is 0, 1 or 2. If n = 3q, n is divisible by 3. If n = 3q + 1, then n − 1 = 3q is divisible by 3. If n = 3q + 2, then n + 1 = 3(q + 1) is divisible by 3.
The product is divisible by both 2 and 3 (co-prime), hence by 6.
In simple words: Three consecutive numbers always contain a multiple of 2 and a multiple of 3.
Teacher's Note:
1. Factorise n³ − n first.
2. Prove divisibility by 2 and 3 separately, then combine.
Question 13. If n is an odd integer, show that \( n^2 - 1 \) is divisible by 8.
Answer:
Every odd integer is of the form 4q + 1 or 4q + 3.
Case I, n = 4q + 1: n² − 1 = 16q² + 8q = 8(2q² + q).
Case II, n = 4q + 3: n² − 1 = 16q² + 24q + 8 = 8(2q² + 3q + 1).
In both cases the result is a multiple of 8. Hence n² − 1 is divisible by 8.
In simple words: Odd numbers are 4q + 1 or 4q + 3, and squaring either leaves n² − 1 as a multiple of 8.
Teacher's Note:
1. First state that odd numbers have two forms.
2. Show the factor 8 clearly in each case.
Question 14. Show that one and only one out of n, n + 2 and n + 4 is divisible by 3, where n is any positive integer.
Answer:
Let n = 3q + r, r = 0, 1, 2.
r = 0: n = 3q is divisible by 3, while n + 2 = 3q + 2 and n + 4 = 3q + 4 = 3(q + 1) + 1 are not.
r = 1: n + 2 = 3q + 3 = 3(q + 1) is divisible by 3; n = 3q + 1 and n + 4 = 3q + 5 = 3(q + 1) + 2 are not.
r = 2: n + 4 = 3q + 6 = 3(q + 2) is divisible by 3; n = 3q + 2 and n + 2 = 3q + 4 are not.
Hence exactly one of n, n + 2, n + 4 is divisible by 3.
In simple words: Out of three numbers spaced by 2, exactly one is a multiple of 3.
Teacher's Note:
1. Check all three numbers in every case.
2. The words 'one and only one' mean you must also show the other two are not divisible.
Question 15. Show that any number of the form \( 6^n \), where n is a natural number, can never end with the digit 0.
Answer:
If 6ⁿ ended in 0, it would be divisible by 5.
But 6ⁿ = (2 × 3)ⁿ = 2ⁿ × 3ⁿ, whose only prime factors are 2 and 3.
By the Fundamental Theorem of Arithmetic, prime factorisation is unique, so 5 is not a factor of 6ⁿ.
Hence 6ⁿ never ends with 0.
In simple words: A number ending in 0 has 5 as a factor, but 6ⁿ only has the factors 2 and 3.
Teacher's Note:
1. Link 'ends in 0' to 'divisible by 5'.
2. Quote the uniqueness of prime factorisation.
Question 16. Show that each of the following numbers is a composite number: (i) \( 5 \times 11 \times 13 + 13 \) (ii) \( 6 \times 5 \times 4 \times 3 \times 2 \times 1 + 5 \).
Answer:
(i) 5 × 11 × 13 + 13 = 13 × (5 × 11 + 1) = 13 × 56. It has factors other than 1 and itself, so it is composite.
(ii) 6 × 5 × 4 × 3 × 2 × 1 + 5 = 5 × (6 × 4 × 3 × 2 × 1 + 1) = 5 × 145. It has more than two factors, so it is composite.
In simple words: Take out the common factor; if the number is a product of two numbers bigger than 1 it is composite.
Teacher's Note:
1. Factorise before calculating the full number.
2. Say why: more than two factors.
Free study material for Mathematics
Useful Resources and Notes for Class 10 Mathematics Real Numbers
Core Study Kit: Class 10 Mathematics Real Numbers
Access comprehensive study material for Real Numbers, including revision notes, concept maps, and high-probability questions. These resources are designed in alignment with the latest 2026 CBSE syllabus for Class 10 Mathematics to support effective exam preparation.
NCERT-Aligned Solutions for Real Numbers
Each resource draws directly from authorized textbooks to maintain academic accuracy. Evaluating solved examples allows Class 10 students to master the formal presentation and answer-writing standards expected in upcoming school exams.
Next Steps in Your Exam Preparation
Wrap up your chapter revision by testing your knowledge against standard objective question formats. Explore our full library of free, up-to-date sample papers and online assessments to secure top grades in your CBSE examinations.
FAQs
The latest 2026-27 advanced study resources for Class 10 Mathematics are available for free on StudiesToday.com which includes NCERT Exemplars, high-order thinking skills (HOTS) questions, and deep-dive concept summaries.
Our exhaustive Class 10 Mathematics package includes chapter wise revision notes, solved practice sheets, important formulas and Concept Maps to help in better understanding of all topics.
Yes. For Class 10, our resources have been developed to help you get better marks in CBSE school exams and also build fundamental strength needed for entrance tests including Competency Based learning.
in Class 10, students should use Active Recall method, read the concept summary, then solve the Important Questions section without looking at the answers and then check your answers.
All CBSE Mathematics study materials are provided in mobile-friendly PDF. You can download and save them on your device.
Yes, our team has ensured that all Mathematics materials for Class 10 are strictly aligned with the National Education Policy (NEP) 2020 and the latest 2026-27 CBSE syllabus.