NCERT Solutions Class 10 Maths Chapter 1 Exercise 1.1 is important for understanding both Real Numbers and concepts related to it, which form a solid base for grasping complex concepts in higher classes. NCERT Solutions for Class 10 Maths chapter 1 exercise solutions, explained here, contains a complete breakdown of these essential concepts. This helps students to get a better understanding of this topic, prepared according to the latest CBSE syllabus and protocols of the examination. So, let’s dive deeper into this foundational topic of class 10.
Real numbers are any value that represents a complete set of rational and irrational numbers along a straight, continuous number line. Real numbers can be any quantity, which can be positive, negative, or 0, a whole number, fractions, or decimals.
Rational numbers are the ratio of any two integers, which can be expressed in the form of , where , p and q are coprime numbers, meaning both numbers don’t have any common factor other than 1. For example, is a rational number while is not. Moreover, rational numbers can either have a terminating or repeating decimal expansion. For example, 1, –1, 0.5, and .
These cannot be written as a fraction of two integers. They have non-terminating (numbers that don’t terminate) and non-repeating (numbers that don’t form a repeating form) decimal expansions. Famous irrational numbers are , , and e.
This is how you represent a given number on a number line:
Real numbers follow the standard rules and guidelines of simple arithmetic for basic operations, which include:
= 3.5 + (-2.1)
= 3.5 – 2.1
= 1.4
5.8 - 2.3 = 3.5
Note that real numbers also follow the same rules as standard arithmetic for sign convention.
Q1. Use Euclid's division algorithm to find the HCF of:
(i) 135 and 225
(ii) 196 and 38220
(iii) 867 and 225
Solution:
(i) 135 and 225
Start with the larger integer, that is, 225. Apply the division lemma to 225 and 135, to get:
225 = 135 × 1 + 90
Since the remainder 90 ≠ 0, we apply the division lemma to 135 and 90 to get:
135 = 90 × 1 + 45
We consider the new divisor 90 and the new remainder 45, and apply the division lemma to get:
90 = 45 × 2 + 0
The remainder has now become zero, so our procedure stops.
Since the divisor at this stage is 45, the HCF of 225 and 135 is 45.
(ii) 196 and 38220
Start with the larger integer, that is, 38220. Apply the division lemma to 38220 and 196, to get:
38220 = 196 × 195 + 0
The remainder at this stage is zero, so our procedure stops.
So, HCF of 196 and 38220 is 196.
(iii) 867 and 225
Start with the larger integer, that is, 867.
Apply the division lemma to 867 and 225, to get:
867 = 225 × 3 + 192
Since the remainder 192 ≠ 0, we apply the division lemma to 225 and 192 to get:
225 = 192 × 1 + 33
Since the remainder 33 ≠ 0, we apply the division lemma to 192 and 33 to get:
192 = 33 × 5 + 27
Since the remainder 27 ≠ 0, we apply the division lemma to 33 and 27 to get:
33 = 27 × 1 + 6
Since the remainder 6 ≠ 0, we apply the division lemma to 27 and 6 to get:
27 = 6 × 4 + 3
Since the remainder 3 ≠ 0, we apply the division lemma to 6 and 3 to get:
6 = 3 × 2 + 0
Now, the remainder at this stage is zero, so our procedure stops.
So, HCF of 867 and 225 is 3.
Q2. Show that any positive odd integer is of the form 6q + 1, or 6q + 3 or 6q + 5, where q is some integer.
Solution:
Let us start with taking a, where a is any positive odd integer. We apply the division algorithm, with a and b = 6. Since 0 ≤ r < 6, the possible remainders are 0, 1, 2, 3, 4, 5. That is, a can be 6q or 6q + 1, or 6q + 2, or 6q + 3, or 6q + 4, or 6q + 5, where q is the quotient. However, since a is odd, we do not consider the cases 6q, 6q + 2 and 6q + 4 (since all the three are divisible by 2). Therefore, any positive odd integer is of the form 6q + 1 or 6q + 3 or 6q + 5.
Q3. An army contingent of 616 members is to march behind an army band of 32 members in a parade. The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march?
Solution:
Let a = 616, b = 32. By Euclid's division algorithm:
616 = 32 × 19 + 8
32 = 8 × 4 + 0
HCF of (616, 32) = 8
Therefore, the maximum number of columns is 8.
Q4. 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 any positive integer. We apply the division lemma with b = 3. Since 0 ≤ r < 3, the possible remainders are 0, 1 and 2. That is, a can be 3q, or 3q + 1, or 3q + 2, where q is the quotient.
Now, (3q)² = 9q² = 3 × 3q², which can be written in the form 3m, where m = 3q².
Again, (3q + 1)² = 9q² + 6q + 1 = 3(3q² + 2q) + 1, which can be written in the form 3m + 1, where m = 3q² + 2q.
Lastly, (3q + 2)² = 9q² + 12q + 4 = (9q² + 12q + 3) + 1 = 3(3q² + 4q + 1) + 1, which can be written in the form 3m + 1, where m = 3q² + 4q + 1.
Therefore, the square of any positive integer is either of the form 3m or 3m + 1 for some integer m.
Q5. Use Euclid's division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9m + 8.
Solution:
Let n be any positive integer. We apply the division lemma with b = 3. Since 0 ≤ r < 3, the possible remainders are 0, 1 and 2. That is, n can be 3q, or 3q + 1, or 3q + 2, where q is the quotient.
Case I: Let n = 3q.
The cube of this will be n³ = 27q³ = 9(3q³).
So, n³ = 9m, where m = 3q³.
Case II: n = 3q + 1.
So, n³ = (3q + 1)³ = 27q³ + 1 + 27q² + 9q = 9(3q³ + 3q² + q) + 1.
n³ = 9m + 1, where m = 3q³ + 3q² + q.
Case III: n = 3q + 2.
So, n³ = (3q + 2)³ = 27q³ + 54q² + 36q + 8 = 9(3q³ + 6q² + 4q) + 8.
n³ = 9m + 8, where m = 3q³ + 6q² + 4q.
So, it means the cube of positive integers is of the form 9m, 9m + 1 or 9m + 8.
Real numbers can be compared with inequalities, which indicate their relative position on the number line. Symbols used in inequalities are:
HCF and LCM are the two most important topics of the NCERT Solutions Class 10 maths chapter 1 exercise 1.1 PDF from the exam point of view, which can be explained as:
HCF
The HCF of two or more numbers is the largest number which divides all of them exactly and can be found with the help of Euclid's Division Algorithm. The Algorithm states that for any two positive integers a and b, the HCF of a and b can be determined as follows:
For Example: Calculate the HCF of 56 and 72.
Solution: Dividing 72 by 56
Now, Divide 56 by 16
Divide 16 by 8
HCF: 8
LCM
The LCM is the lowest number, which is a common multiple of two or more numbers. It can be determined by following the below steps.
For Example: Find LCM of 12 and 18.
Solution:
Highest power: for 2 = 22, for 3 = 32
1. Review of Real Numbers: The whole concept of real numbers is that the numbers are a group of rational and irrational numbers and can be represented on a number line.
2. Representing Real Numbers on the Number Line: It is important to learn to represent real numbers on the number line because it helps in visualising the magnitude and order of the numbers, making them simpler to compare and do addition and subtraction. It also forms the basis for solving inequalities and learning higher-level math concepts.
3. Ordering Real Numbers: Using inequalities to order real numbers assists in solving problems that require comparing values and determining the relative positions of numbers on the number line.
(Session 2025 - 26)