# NCERT Exemplar Class 10 Maths Solutions Chapter 1 Real Numbers

In this chapter, we provide NCERT Exemplar Problems Solutions for Class 10 Maths Solutions Chapter 1 Real Numbers for English medium students, Which will very helpful for every student in their exams. Students can download the latest NCERT Exemplar Problems Solutions for Class 10 Maths Solutions Chapter 1 Real Numbers pdf, free NCERT Exemplar Problems Solutions for Class 10 Maths Solutions Chapter 1 Real Numbers book pdf download. Now you will get step by step solution to each question.

## NCERT Exemplar Problems Class 10 Maths Solutions Chapter 1 Real Numbers

Exercise 1.1 Multiple Choice Questions (MCQs)

Question 1:
For some integer m, every even integer is of the form
(a) m                  (b) m +1              (c) 2m +1              (d) 2m
Solution:
(c) We know that, even integers are 2, 4, 6,…
So, it can be written in the form of 2m.

For more information about NCERT Solutions Class 10 Maths

Question 2:
For some integer q, every odd integer is of the form
(a) q                            (b) q +1                   (c) 2g                        (d) 2q +1
Solution:

Question 3:

Solution:

You can also download NCERT Solutions For Class 10 Maths to help you to revise complete syllabus and score more marks in your examinations.

Question 4:
If the HCF of 65 and 117 is expressible in the form 65m -117, then the value of m is
(a) 4                          (b) 2                           (c) 1                          (d) 3
Solution:

Question 5:
The largest number which divides 70 and 125, leaving remainders respectively, is
(a) 13                         (b) 65                        (c) 875                       (d) 1750
Solution:
(a) Since, 5 and 8 are the remainders of 70 and 125, respectively. Thus, after subtracting these remainders from the numbers, we have the numbers 65 = (70-5),
117 = (125 – 8), which is divisible by the required number.
Now, required number = HCF of 65,117                                     [for the largest number]

Question 6:
If two positive integers a and b are written as a = x3y2 and b = xy3, wfiere x, y are prime numbers, then HCF (a, b) is
(a) xy                         (b) xy2                      (c)x3y3                          (d) xy2
Solution:

Question 7:
If two positive integers p and q can be expressed’ as p=ab2 and q = a3b; where 0, b being prime numbers, then LCM (p, q) is equal to
(a) ab                       (b) a2b2                      (c) a3b2          (d) a3b3
Solution:

Question 8:
The product of a non-zero rational and an irrational number is
(a) always irrational                                   (b) always rational
(c) rational or irrational                             (d) one
Solution:

Question 9:
The least number that is divisible by all the numbers from 1 to 10 (both inclusive)
(a) 10                        (b) 100                      (c) 504                      (d) 2520
Solution:
(d) Factors of 1 to 10 numbers

Question 10:

(a) one decimal place                               (b) two decimal places
(c) three decimal places                           (d) four decimal places
Solution:

Exercise 1.2 Very Short Answer Type Questions

Question 1:
Write whether every positive integer can be of the form 4q + 2, where q is an integer. Justify your answer.
Solution:
No, by Euclid’s Lemma, b = aq + r,0<,r<a [-.-dividend = divisor x quotient + remainder] Here, b is any positive integer a = 4, b = Aq + r for 0 ^ r < 4 i.e., r = 0,1,2, 3 So, this must be in the form Aq, 4q + 1, Aq + 2 or 4q + 3.

Question 2:
The product of two consecutive positive integers is divisible by 2′. Is this statement true or false? Give reasons.
Solution:
yes, two consecutive integers can be n, (n +1). So, one number of these two must be divisible by 2. Hence, product of numbers is divisible by 2.

Question 3:
The product of three consecutive positive integers is divisible by 6′ Is this statement true or false? Justify your answer.
Solution:
yes, three consecutive integers can be n, (n + 1)and (n + 2).
So, one number of these three must be divisible by 2 and another one must be divisible by 3. Hence,
product of numbers is divisible by 6.

Question 4:
Write whether the square of any positive integer can be of the form 3m + 2, where m is a natural number. Justify your answer.
Solution:

Question 5:
A positive integer is of the form 3q +1, q being a natural number. Can you write its square in any form other than 3m+1, i.e., 3m or 3m + 2 for some integer ml Justify your answer.
Solution:

Hence, square of a positive integer is of the form 3g + 1 is always in the form 3 m + 1 for some integer m.

Question 6:
The numbers 525 and 3000 are both divisible only by 3, 5, 15, 25 and 75. What is HCF (525, 3000)? Justify your answer.
Solution:
Since, the HCF (525, 3000) = 75

and the numbers 3, 5, 15, 25 and 75 divides the numbers 525 and 3000 that mean these terms are common in both 525 and 3000. So, the highest common factor among these is 75.

Question 7:
Explain why3 x 5 x 7 + 7 is a composite number,
Solution:

So, it is the product of prime factors 2 and 7. i.e., it has more than two factors.
Hence, it is a composite number.

Question 8:
Can two numbers have 18 as their HCF and 380 as their LCM? Give reasons.
Solution:
No, because HCF is always a factor of LCM but here 18 is not a factor of 380.

Question 9:

Solution:
Yes, after simplification denominator has factor 53 -22 and which is of the type 2m . 5″. So, this is terminating decimal.

Question 10:
A rational number in its decimal expansion is 327.7081. What can you say about the prime factors of q, when this number is expressed in the form p/q ? Give reasons.
Solution:
327.7081 is terminating decimal number. So, it represents a rational number and also its denominator must have the form 2m x5n .

Hence, the prime factors of q is 2 and 5.

Exercise 1.3 Short Answer Type Questions

Question 1:
Show that the square of any positive integer is either of the form 4q or 4g + 1 for some integer q.
Solution:
Let a be an arbitrary positive integer. Then, by, Euclid’s division algorithm, corresponding
to the positive integers a and 4, there exist non-negative integers m and r, such that

Hence, the square of any positive integer is either of the form 4 q or 4 q + 1 for some integer q.

Question 2:
Show that cube of any positive integer is of the form 4m, 4m + 1 or Am + 3, 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 4, there exist non-negative integers q and r such that a = 4q + r, where 0< r< 4

Hence, the cube of any positive integer is of the form 4m, 4m + 1 or 4m + 3 for some integer m.

Question 3:
Show that the square of any positive integer cannot be of the form 5q + 2 or 5q + 3 for any integer q.
Solution:
Let a be an arbitrary positive integer.
Then, by Euclid’s divisions Algorithm, corresponding to the positive integers a and 5, there exist non-negative integers m and r such that

Hence, the square of any positive integer cannot be of the form 5q + 2 or 5q + 3 for any integer q.

Question 4:
Show that the square of any positive integer cannot be of the form 6m+ 2 or 6m + 5 for any integer m.
Solution:
Let a be an arbitrary positive integer, then by Euclid’s division algorithm, corresponding to the positive integers a and 6, there exist non-negative integers q and r such that a = 6q + r, where 0< r< 6

Hence, the square of any positive integer cannot be of the form 6m + 2 or 6m + 5 for any integer m.

Question 5:
Show that the square of any odd integer is of the form 4m + 1, for some integerm
Solution:
By Euclid’s division algorithm, we have a = bq + r, where 0 <r< 4                                              …(i)
On putting b = 4 in Eq. (i), we get

which is of the form 4m + 1, where m = (4q2 + 6q + 2) is an integer.
Hence, for some integer m, the square of any odd integer is of the form 4m + 1.

Question 6:
If n is an odd integer, then show thatn2 – 1 is divisible by 8.
Solution:

Question 7:
Prove that, if x and y are both odd positive integers, then x2 + yz is even but not divisible by 4.
Solution:
Let x = 2m + 1 and y = 2m + 3 are odd positive integers, for every positive integer m.

Hence, x2 +’ y2 is even for every positive integer m but not divisible by 4.

Question 8:
Use Euclid’s division algorithm to find the HCF of 441, 567 and 693.
Solution:
Let a = 693, b = 567 and c = 441 By Euclid’s division algorithms,

Question 9:
Using Euclid’s division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3, respectively.
Solution:
Since, 1, 2 and 3 are the remainders of 1251, 9377 and 15628, respectively. Thus, after subtracting these remainders from the numbers.
We have the numbers, 1251-1 = 1250,9377-2 = 9375 and 15628-3 = 15625 which is divisible by the required number.
Now, required number = HCF of 1250,9375 and 15625                    [for the largest number]
By Euclid’s division algorithm,

Hence, 625 is the largest number which divides 1251,9377 and 15628 leaving remainder 1, 2 and 3, respectively.

Question 10:
Prove that√3 + √5 is irrational.
Solution:
Let us suppose that √3 + √5 is rational.
Let √3 + √5 = a, where a is rational.

As the right hand side is rational number while V5 is irrational. Since, 3 and 5 are prime numbers. Hence, √3 + √5 is irrational.

Question 11:
Show that ${{12}^{n}}$ cannot end with the digit 0 or 5 for any natural number n.
Solution:
If any number ends with the digit 0 or 5, it is always divisible by 5.
If ${{12}^{n}}$ ends with the digit zero it must be divisible by 5.
This is possible only if prime factorisation of ${{12}^{n}}$ contains the prime number 5.

Hence, there is no value of n e N for which ${{12}^{n}}$ ends with digit zero or five.

Question 12:
On a morning walk, three persons step off together and their steps measure 40 cm, 42 cm and 45 cm, respectively.What is the minimum distance each should walk, so that each can cover the same distance in complete steps?
Solution:
We have to find the LCM of 40 cm, 42 cm and 45 cm to get the required minimum distance.

Minimum distance each should walk 2520 cm. So that, each can cover the same distance in
complete steps.

Question 13:
Write the denominator of rational number $frac{257}{5000}$ in the form 2m x${{5}^{n}}$,where m, n are non-negative integers. Hence, write its decimal expansion, without actual division
Solution:
Denominator of the rational number $frac{257}{5000}$ is 5000.

Hence, which is the required decimal expansion of the rational $frac{257}{5000}$ and it is also a 5000 terminating decimal number.

Question 14:
Prove that √p + √q is irrational, where p and q are primes.
Solution:

Exercise 1.4 Long Answer Type Questions

Question 1:
Show that the cube of a positive integer of the form 6q + r,q is an integer and r = 0, 1, 2, 3, 4, 5 is also of the form 6m + r.
Solution:
Let a be an arbitrary positive integer. Then, by Euclid’s division algorithm, corresponding to the positive integers ‘a’ and 6, there exist non-negative integersg and r such that a = 6 q + r, where, 0 < r < 6

Hence, the cube of a positive integer of the form 6q + r,q is an integer and r = 0,1,2, 3, 4,5 is also of the forms 6m, 6m + 1, 6m + 2, 6m + 3,6m + 4 and 6m + 5 i.e.,6m + r.

Question 2:
Prove that one and only one out of n, (n + 2) and (n + 4) is divisible by 3, where n is any positive integer,
Solution:
Let a = n, b = n + 2 and c =n + 4
Order triplet is (a, b, c) = (n, n + 2, n + 4)                                                                      … (i)
Where, n is any positive integer i.e.,n = 1,2, 3,…
At n = 1;   (a, b, c) = (1,1 + 2,1 + 4) = (1, 3, 5)
At n = 2;   (a, b, c) = (2,2 + 2,2 + 4)= (2, 4, 6)
At n = 3;  (a, b,c) =  (3, 3 + 2,3 + 4) = (3,5,7)
At n =4;   (a,b, c) =(4, 4 + 2, 4 +4)  = (4, 6, 8)
At n = 5;   (a, b,c) = (5, 5 + 2, 5 +4)= (5,7,9)
At n = 6;   (a,b, c) =   (6, 6 + 2, 6 + 4)= (6,8,10)        ‘
At n = 7;   (a, b,c) =  (7,7 + 2,7 + 4)= (7, 9,11)
At n = 8;   (a, b,c) =  (8,8+ 2, 8+ 4)= (8,10,12)
We observe that each triplet consist of one and only one number which is multiple of 3 i.e., divisible by 3.
Hence, one and only one out of n,(n + 2) and (n + 4) is divisible by 3, where, n is any positive integer.
Alternate Method
On dividing ‘n’ by 3, letg be the quotient and r be the remainder.
Then, n =,3 q  + r, where, 0< r< 3

Hence, one and only one out of n, (n + 2) and (n + 4) is divisible by 3.

Question 3:
Prove that one of any three consecutive positive integers must be divisible by 3.
Solution:
Any three consecutive positive integers must be of the form
n, (n + 1)and (n + 2), where n is any natural number, i.e., n = 1,2, 3…
Let,                                   a = n,b = n+ 1 and c = n + 2
Order triplet is (a, b, c) = (n, n + 1, n + 2), where n = 1,2, 3,…                                      …(i)
At n = 1; (a, b, c) = (1,1 + 1,1 + 2) = (1,2, 3)
At n = 2; (a,b,c) = (1,2 + 1,2 + 2) = (2, 3, 4)
At n = 3; (a, b, c) = (3, 3 + 1, 3 + 2) = (3, 4, 5)
At n = 4; (a, b, c) = (4, 4 + 1, 4 + 2) = (4, 5, 6)
At n = 5; (a, b, c) = (5, 5 + 1, 5 + 2) = (5, 6,7)
At n= 8 (a, b, c) = (6, 6+ 1, 6 + 2) = (6,7, 8)
Atn = 7; (a, b, c) = (7,7 + 1,7 + 2) = (7, 8, 9)
At n = 8; (a, b, c) = (8 8 + 1, 8 + 2) = (8, 9,10)
We observe that each triplet consist of one and only one number which is multiple of 3 i.e., divisible by 3.
Hence, one of any three consecutive positive integers must be divisible by 3.

Question 4:
For any positive integer n, prove that n3 – n is divisible by 6.
Solution:

We know that,

1. If a number is completely divisible by 2 and 3, then it is also divisible by 6.
2. If the sum of digits of any number is divisible by 3, then it is also divisible by 3.
3. If one of the factor of any number is an even number, then it is also divisible by 2.

∴                                       a = (n – 1) . n . (n + 1)                                                 [from Eq. (i)]
Now, sum of the digits =n-1+n+n+1=3n
= multiple of 3, where n is any positive integer,
and (n -1)- n- (n + 1) will always be even, as one out of (n -1) or n or (n + 1) must of even. Since, conditions II and III is completely satisfy the Eq. (i).
Hence, by condition I the number n3 – n is always divisible by 6, where n is any positive
integer.                                                                                                               Hence proved.

Question 5:
Show that one and only one out of n, n + 4 , n + 8, n + 12 and n + 16 is divisible by 5, where n is any positive integer.
Solution:
Given numbers are n, (n+ 4), (n + 8), (n + 12) and (n + 16), where n is any positive integer.
Then, let n = 5q, 5g + 1, 5g + 2, 5g + 3, 5q + 4 for q∈ N                           [by Euclid’s algorithm]
Then, in each case if we put the different values of n in the given numbers. We definitely get one and only one of given numbers is divisible by 5.
Hence, one and only one out of n, n+ 4, n+ 8, n+12 and n+16 is divisible by 5.
Alternate Method
On dividing on n by 5, letq be the quotient and r be the remainder.
Thenn=5q + r, where 0<r< 5.

All Chapter NCERT Exemplar Problems Solutions For Class 10 maths

—————————————————————————–

All Subject NCERT Exemplar Problems Solutions For Class 10

*************************************************

I think you got complete solutions for this chapter. If You have any queries regarding this chapter, please comment on the below section our subject teacher will answer you. We tried our best to give complete solutions so you got good marks in your exam.

If these solutions have helped you, you can also share ncertexemplar.com to your friends.