Xam Idea Solutions Class 10 Maths Chapter 1 Real Numbers Long Answer Type Questions

Download Class 10 Mathematics Textbook Solutions: Chapter 01 Real Numbers

Access comprehensive textbook solutions for Chapter 01 Real Numbers using the reference material for Class 10 Mathematics. Designed to align with the 2026 academic curriculum, these detailed answers help students reinforce core academic concepts and master complex problem-solving methods.

Access Textbook Answers and Solutions

Navigate directly to the solved Mathematics textbook exercises using the digital viewer below. Each solution includes detailed step-by-step explanations, allowing students to instantly cross-check their work and identify areas requiring further revision.

Long Answer Type Questions

Question 1. Use Euclid’s division Lemma to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m.

Solution. Let a be an arbitrary positive integer.
Then by Euclid’s Division algorithm, corresponding to the positive integers a and 3 there exist non-negative integers q and r such that
a = 3q + r where 0 < r < 3
⇒a2 = 9q2 + 6qr + r2…. (i) 0 ≤ r < 3
Case-I: When r = 0 putting on (i)
a2 = 9q2 = 3(3q2) = 3m where m = 3q2
Case-II: r = 1
A2 = 9q2 + 6q + 1 = 3(3q2 + 2q) + 1 = 3m + 1 where m = 3q2 + 2q Case-III: r = 2
A2 = 9q2 + 12q + 4 = 3(3q2 + 4q + 1) + 1 = 3m + 1 where m = (3q2 + 4q + 1)
Thus, square of any positive integer is either of the form 3m or 3m + 1 for some integer m.

Teacher's Note: Check each possible remainder when dividing by three and square the resulting forms.

Exam Note: Cover all three remainder cases for the square.

Question 2. Prove that one and only one out of n, n+2, n+4 is divisible by 3, where n is any positive integer.

Solution. Let q be the quotient and r be the remainder when n is divided by 3.
So, n = 3q + r where r = 0, 1,2
⇒n = 3q or n = 3q + 1 or n = 3q + 2
Case (i) if n = 3q, then n is divisible by 3, n + 2 and n + 4 are not divisible by 3.
Case (ii) if n = 3q + 1 then n + 2 = 3q + 3(q + 1), which is divisible by 3 and n + 4 = 3q + 5, which is not divisible by 3.
So, only (n + 2) is divisible by 3.
Hence one and only one out of n, (n+2), (n+4) is divisible by 3.

Teacher's Note: Divide n by three and check each remainder case to see which expression is divisible.

Exam Note: Use n equal to 3q, 3q plus 1, 3q plus 2.

Question 3. Use Euclid’s division algorithm to find the HCF of:
(i)960 and 432
(ii)4052 and 12576

Solution. (i) since 960 > 432, we apply the division Lemma to 960 and 432.
We have, 960 = 432 × 2 + 96
As the remainder 96 ≠ 0, so we apply the division lemma to 432 and 96.
We have, 432 = 96 × 4 + 48
Again remainder 48 ≠ 0, so we again apply division Lemma to 96 and 48.
We have, 96 = 48 × 2 + 0
The remainder has now become zero. So our procedure stops.
Since the divisor at this stage is 48.
Thus, HCF of 960 and 432 is 48
i.e., HCF (960, 432) = 48
(ii) Since 12576 > 4052, we apply the division lemma to 12576 and 4052 to get
12576 = 4052 × 3 + 420
Since the remainder 420 ≠ 0, we apply the division lemma to 4052 and 420, to get
4052 = 420 × 9 + 272
We consider the new divisor 272 and the new remainder 148, and apply the division lemma to get
420 = 272 × 1 + 148
We consider the new divisor 272 and the new remainder 148, and apply the division lemma to get
272 = 148 × 1 + 124
148 = 124 × 1 + 24
124 = 24 × 5 + 4
24 = 4 × 6 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 12576 and 4052 is 4.

Teacher's Note: Apply repeated division, replacing numbers by divisor and remainder until the remainder reaches zero.

Exam Note: Continue Euclid's steps until zero remainder; last divisor is HCF.

Question 4. Using prime factorization method, find the HCF and LCM of 30, 72 and 432. Also show that HCF × LCM ≠ Product of the three numbers.

Solution. Given numbers = 30, 72, 432
30 = 2 × 3 × 5; 72 = 23× 32 and 432 = 24× 33
In this case, 21 and 31 are the smallest powers of the common factors 2 and 3 respectively.
So, HCF (30, 72, 432) = 21× 31 = 2 × 3 = 6
Again, 24, 33 and 51 are the greatest powers of the prime factors 2,3 and 5 respectively.
So, LCM (30, 72, 432) = 24× 33× 51 = 2160
HCF × LCM = 6 × 2160 = 12960
Product of numbers = 30 × 72 × 432 = 933120
So, HCF × LCM ≠ Product of the numbers.

Teacher's Note: Write each number as prime powers, then take smallest powers for HCF and largest for LCM.

Exam Note: Use least powers for HCF and greatest for LCM.

Question 5. Prove that √7 is an irrational number.

Solution. Let us assume, to the contrary, that √7 is a rational number.
Then, there exist co-prome positive integers a and b such that
√7 = a⁄b , b ≠ 0
So, a = √7b
Squaring both sides, we have
a2 = 7b2
⇒7 divides a2⇒ 7 divides a
So, we can write
a = 7c, (where c is any integer)
Putting the value of a = 7c in (i), we have
49c2 = 7b2⇒ 7c2 = b2
It means 7 divides b2 and so 7 divides b.
So, 7 is a common factor of both a and b which is a contradiction.
So, our assumption that √7 is rational is wrong.
Thus, we conclude that √7 is an irrational number.

Teacher's Note: Assume the root is rational in lowest terms and show seven divides both numerator and denominator.

Exam Note: Prove by contradiction using a common factor of seven.

Question 6. Prove that 5-√3 is an irrational number.

Solution. Let us assume that 5-√3 is rational.
So, 5-√3 may be written as
5-√3 = p⁄q , where p and q are integers, having no common factor except 1 and q ≠ 0.
⇒5 − p⁄q = √3 ⇒ √3 = 5q − p⁄q
As 5q − p⁄q is a rational number which is a contradiction.
∴√3 is also a rational number which is a contradiction.
Thus, our assumption is wrong.
Thus, 5 - √3 is an irrational number.

Teacher's Note: Assume the number is rational and isolate the root to reach a contradiction.

Exam Note: Assume rational, then isolate the surd to contradict.

Question 7. Using Euclid’s division algorithm, find whether the pair of numbers 847, 2160 are co-prime or not.

Solution. As 2160 > 847 we apply the division lemma to 2160 and 847
We have, 2160 = 847 × 2 + 466
Since remainder 466 ≠ 0. So we apply the division lemma to 847 and 466
847 = 466 × 1 + 381
Again remainder 381 ≠ 0. So we again apply the division lemma to 466 and 381.
466 = 381 × 1 + 85
Again remainder 85 ≠ 0. So we again apply the division lemma to 381 and 85.
381 = 85 × 4 + 41
Again remainder 41 ≠ 0. So we again apply the division lemma to 85 and 41.
85 = 41 × 2 + 3
Again remainder 3 ≠ 0. So we again apply the division lemma to 41 and 3.
41 = 3 × 13 + 2
Again remainder 2 ≠ 0. So we again apply the division lemma to 3 and 2.
3 = 2 × 1 + 1
Again remainder 1 ≠ 0. So we again apply the division lemma to 2 and 1.
2 = 1 × 4 + 0
The remainder now becomes 0. So, our procedure stops.
Since the divisor at this stage is 1.
Thus, HCF of 847 and 2160 is 1 and numbers are co-prime.

Teacher's Note: Apply Euclid's algorithm repeatedly; if the final divisor is one, the numbers are co-prime.

Exam Note: Last divisor one means the pair is co-prime.

Question 8. Check whether 6n can end with the digit 0 for any natural number n.

Solution. If the number 6n, for any n, were to end with the digit zero, then it would be divisible by 5. That is, the prime factorisation of 6n would contain the prime 5. But 6n = (2 × 3)n = 2n× 3nSo the primes in factorisation of 6n are2 and 3. So the uniqueness of the fundamental theorem of arithmetic guarantees that there are no other primes except 2 and 3 in the factrosation of 6n. So there is no natural number n for which 6n ends with digit zero.

Teacher's Note: A power of six has only two and three as prime factors, never five.

Exam Note: Use prime factorisation uniqueness: no factor of five.

Xam Idea Solutions for Class 10 Mathematics: Xam Idea Solutions Class 10 Maths Chapter 1 Real Numbers Long Answer Type Questions

Download Xam Idea Solutions for Class 10

Review detailed solutions for Class 10 Mathematics. The Xam Idea Solutions Class 10 Maths Chapter 1 Real Numbers Long Answer Type Questions PDF provides comprehensive answers mapped to standard Xam Idea Solutions textbooks, ensuring targeted revision for weekly tests and terminal exams.

Mastering Core Concepts with Xam Idea Solutions

Clear, methodical explanations accompany every challenging problem within the text. Engaging with these detailed mathematical breakdowns lays a solid foundation for advanced learning and improves execution speed for upcoming exams.

Explore More Study Resources for Class 10 Math

In addition to these Xam Idea Solutions chapters, students can explore a wider library of free online mock tests, printable sample papers, and short revision notes aligned with the 2026 academic session.

FAQs

What are these [current-page:node:field_author] Solutions for Class 10 Mathematics?

They are chapter-wise solved questions from the book for Class 10 Mathematics. Each answer is explained step by step so you can check your work and revise.

Are the [current-page:node:field_author] Class 10 Mathematics Solutions free to read?

Yes. All chapters can be read online for free on a phone, tablet or computer, and no sign-up is needed.

How should I use these [current-page:node:field_author] solutions for Class 10 Mathematics?

Try each question on your own first, then read the solution. Use it to check your steps, correct mistakes and learn how a full answer is written.

Will practising [current-page:node:field_author] Class 10 Mathematics questions help in exams?

Regular practice improves accuracy and speed and shows which topics need more revision. It works best alongside your textbook and class notes.

Are these solutions arranged chapter by chapter?

Yes. The chapter list on this page links to every chapter’s solved questions, so you can open the topic you are studying.

Which session are these Class 10 Mathematics Solutions for?

They are listed for the 2026-27 session. Check that the questions match the textbook edition you use.