Exercise 1.1 Q1 • 3 marks
Hint (Socratic — try this first)▾
Step-by-step solution▾
We use repeated division by the smallest primes.
(i) 140
So .
(ii) 156
So .
(iii) 3825
So .
CBSE • Class 10 • Mathematics • Chapter 1
Euclid's Division Lemma, the Fundamental Theorem of Arithmetic, and rigorous proofs of the irrationality of √2, √3 and √5 — the foundations of number theory in CBSE Class 10.
Aligned to the latest NCERT 2024-25 edition • 2 exercises covered • Free plan, no credit card
2 exercises • 10 questions covered • Open any exercise for theme, focus topics and Socratic AI walkthroughs
Exercise 1.1 • 7 Qs
Fundamental Theorem of Arithmetic — finding HCF and LCM through prime factorisation.
Exercise 1.2 • 3 Qs
Proving irrationality — showing that √2, √3 and √5 cannot be written as p/q.
10 solved questions • Each solution includes a Socratic hint, full working and a common-mistake callout • Last reviewed 2026-09-03
Exercise 1.1 Q1 • 3 marks
We use repeated division by the smallest primes.
(i) 140
So .
(ii) 156
So .
(iii) 3825
So .
Exercise 1.1 Q2 • 3 marks
Prime factorisation:
HCF = product of lowest powers of common primes .
LCM = product of highest powers of all primes .
Verification:
Since both are equal, the result is verified.
Exercise 1.1 Q3 • 2 marks
We use the identity for any two positive integers and :
Here , , HCF .
So the LCM of 306 and 657 is .
Exercise 1.1 Q4 • 2 marks
If a number ends in the digit , it must be divisible by , i.e. by . So its prime factorisation must contain both and .
Now consider :
The only prime factors of are and . There is no factor of .
By the Fundamental Theorem of Arithmetic, the prime factorisation of a number is unique, so can never appear in .
Therefore can never end with the digit for any natural number .
Exercise 1.1 Q5 • 2 marks
A composite number has at least one factor other than 1 and itself.
First number:
Since it is a product of and (both greater than 1), it is a composite number.
Second number:
Since it is a product of and (both greater than 1), it too is a composite number.
Exercise 1.1 Q6 • 3 marks
Prime factorisations:
HCF = product of the lowest powers of primes common to all three.
The only prime common to all three is (each has ).
LCM = product of the highest powers of every prime that appears.
So HCF and LCM .
Exercise 1.1 Q7 • 3 marks
The bells toll together again after a time that is a multiple of all three intervals, i.e. the LCM of 9, 12 and 15.
Prime factorisations:
LCM = highest powers of all primes
minutes hours.
Starting from 8:00 a.m., adding 3 hours gives 11:00 a.m.
So the bells will next toll together at 11:00 a.m.
Exercise 1.2 Q1 • 3 marks
We use proof by contradiction.
Suppose, on the contrary, that is rational. Then we can write
where and are integers, , and have no common factor other than 1 (the fraction is in lowest terms).
Squaring both sides:
So is even, which means is even. Let for some integer .
Substitute into (1):
So is even, which means is even.
But now both and are even, so they have a common factor 2. This contradicts our assumption that they had no common factor other than 1.
Hence our assumption is wrong, and is irrational.
Exercise 1.2 Q2 • 3 marks
We argue by contradiction.
Assume is rational. Then
where are integers, , and have no common factor other than 1.
Squaring:
So divides . Since is prime, divides . Write .
Substitute into (1):
So divides , and therefore divides .
Thus both and are divisible by 5, contradicting the fact that they have no common factor other than 1.
Hence our assumption is false, and is irrational.
Exercise 1.2 Q3 • 3 marks
We use contradiction, taking as given that is irrational.
Suppose is rational. Then we can write
where are integers and .
Rearranging to isolate :
Since and are integers, the right-hand side is a rational number.
This would make rational — but that contradicts the given fact that is irrational.
Hence our assumption is wrong, and is irrational.
The latest NCERT 2024-25 edition of Class 10 Maths Chapter 1 — Real Numbers — contains two main exercises plus a chapter-end summary. Mindarc provides step-by-step solutions for every exercise question along with a Socratic AI tutor for doubt resolution.
From the rationalised NCERT 2023-24 edition onwards, Euclid's Division Algorithm has been deprioritised in Class 10 Maths Chapter 1, and the chapter focuses on the Fundamental Theorem of Arithmetic and irrationality proofs. Mindarc's solutions follow the latest published edition.
Use proof by contradiction: assume √2 = p/q in lowest terms, square both sides to get p² = 2q², deduce that p is even (so p = 2k), substitute to get 2k² = q², and conclude q is also even — contradicting the assumption that p/q was in lowest terms. Hence √2 is irrational.