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 (Real Numbers) • Exercise 1.1
Fundamental Theorem of Arithmetic — finding HCF and LCM through prime factorisation.
Aligned to the latest NCERT 2024-25 edition • 7 questions in this exercise • Free plan, no credit card
7 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.1 expects the prime factorisation method. The earlier Euclid's Division Algorithm approach was deprioritised in the rationalised 2023-24 edition.