1

UNIT – I
CHAPTER
Number Systems
REAL
NUMBER
S
Syllabus
 Euclid’s division lemma, Fundamental Theorem of Arithmetic–statements after reviewing work

@allsamplepaperspdf
done earlier and after illustrating and motivating through examples, proofs of irrationality of 2, 3
and 5 . Decimal representation of rational numbers in terms of terminating/non-terminating recurring
decimals.
Chaptertelegram
Analysis
2016 2017 2018
Delhi Outside Foreign Delhi Outside Foreign Delhi
List of Topics
Delhi Delhi &
Outside Delhi
Questions based on HCF & 1 Q (1 M)
LCM 1 Q (3 M)
Summative Assessment-I
Proving irrational numbers 1 Q (2 M)

TOPIC-1
Euclid’s Division Lemma and Fundamental
Theorem of Arithmetic

Revision Notes
 Algorithm : An algorithm is a series of well defined steps which
gives a procedure for solving mathematical problem. TOPIC - 1
 Lemma : A lemma is a proven statement used for proving another Euclid’s Division Lemma and
Fundamental Theorem of Arithmetic
statement.
.... P. 01
 Euclid’s Division Lemma : For given positive integers
a and b, there exist unique integers q and r, satisfying TOPIC - 2
a = bq + r where 0  r < b. Here, a = Dividend, b = Divisor, q = Irrational Numbers, Terminating and Non-
Quotient and r = Remainder i.e., Terminating Recurring Decimals...........P.
10
Dividend = (Divisor × Quotient) +
Remainder For example,
1  Quotient
Divisor 3) 5  Dividend
–3
2  Remainder
According to the above formula, 5 = (3 × 1) + 2
 We state Euclid’s division algorithm for positive integers only but it can be extended for all integers except zero
i.e., b  0.
 When ‘a’ and ‘b’ are two positive integers such that a = bq + r, where 0  r < b, then HCF (a, b) = HCF (b, r).
 2 ] Oswaal CBSE Chapterwise & Topicwise Question Bank,
MATHEMATICS, Class – X
 The steps to find the HCF of two positive integers by Euclid’s division algorithm are given below :
(i) Let two integers be a and b such that a > b.
(ii) Take greater number a as dividend and the number b as divisor.
(iii) Now, find whole numbers ‘q’ and ‘r’ as quotient and remainder respectively.
 a = bq + r where 0  r < b.
(iv) If r = 0, b is the HCF of a and b. If r  0, then take r as divisor and b as dividend.
(v) Repeat step (iii), till the remainder is zero, the divisor thus obtained at last stage is the required HCF.
 The Fundamental Theorem of Arithmetic
Every composite number can be expressed as a product of primes and this factorisation is unique, apart from the
order in which the prime factors occur. Fundamental theorem of arithmetic is also called a Unique Factorisation
Theorem.
Composite number = Product of prime numbers
Or

@allsamplepaperspdf
Any integer greater than 1 can either be a prime number or can be written as a unique product of prime numbers.
e.g.,

telegram
(i) 2 × 11 = 22 is the same as 11 × 2 = 22.
(ii) 6 can be written as 2 × 3 or 3 × 2, where 2 and 3 are prime numbers.
(iii) 15 can be written as 3 × 5 or 5 × 3, where 3 and 5 are prime numbers.
The prime factorisation of a natural number is unique, except to the order of its factors.
e.g., 12 made by multiplying the prime numbers 2, 2 and 3 together,
12 = 2 × 2 × 3
We would probably write it as 12 = 22 × 3
 By using Fundamental Theorem of Arithmetic, we shall find the HCF and LCM of given numbers (two or
more). This method is also called Prime Factorization Method.
 Prime Factorization Method to find HCF and LCM :
(i) Find all the prime factors of given numbers.
(ii) HCF of two or more numbers = Product of the smallest power of each common prime factor, involved in
the numbers.
(iii) LCM of two or more numbers = Product of the greatest power of each prime factor, involved in the numbers.

Know the Formulae

For two positive integers a and b, we have
HCF (a, b) × LCM (a, b) = a × b
or ab
HCF (a, b) =
LCM  a, b
and ab
LCM (a, b) =
HCF a, b

GREENBOARD ?
How it is done on

Q. Show that 6n can never end with digit 0 for any Therefore, 6n = (2 × 3)n  2n × 3n
natural number n. Hence, prime factors of 6 are 2 and 3.
Sol. : Step I : Any number which ends in zero must Step III : Since, 6n does not contain 5 as a prime factor.
have at least 2 and 5 as its prime factors. Hence, 6n can never end in zero.
Step II : Since, 6=2×3
REAL [ 3
NUMBERS

Objective Type (1 mark each)

Questions
[A] Multiple Choice Questions : (a) xy. (b) xy2 .
Q.1. For some integer m, every even integer is of the form : (c) x3y3. (d) x2y2.
(a) m. (b) m + 1.
AE [NCERT Exemp.]
(c) 2m. (d) 2m + 1.
Sol. Correct option : (b)
U
[NCERT Exemp.] Explanation : Since a  x3y2  x  x  x  y  y and
Sol. Correct option : (c)
b  xy3  x  y  y  y,
4 ] Oswaal CBSE Chapterwise & Topicwise Question Bank,
Explanation : According to Euclid’s MATHEMATICS, Class – X 2
Thus, HCF of a and b = x  y  y  xy
division lemma, a = bm + r, where 0  r  b
. [B] Very Short Answer Type Questions :
If b = 2, then a = 2m or a = 2m + 1 Q. 1. Explain why 13233343563715 is a composite
Since a = 2m is divisible by 2, then 2m is an even number ? R[Board Term-1, 2016 Set LGRKEGO]
integer.
@allsamplepaperspdf
Q.2. For some integer q, every odd integer is of the form :
Sol. Since, the given number ends in 5. Hence, it is a
multiple of 5. Therefore, it is a composite number.

telegram
(a) q (b) q + 1 [CBSE Marking Scheme, 2016] 1
(c) 2q (d) 2q + 1 Q. 2. a and b are two positive integers such that the
least prime factor of a is 3 and the least prime
U [NCERT Exemp.]
factor of b is 5. Then, calculate the least prime
Sol. Correct option : (d) factor of R
Explanation : According to Euclid’s (a + b). [Board Term-1, 2014]
division
lemma, a = bq + r, where 0  r  b . Sol. a and b are two positive integers such that the least
If b = 2, then a = 2q or a = 2q + 1 prime factor of a is 3 and the least prime factor of b
Since a = 2q + 1 is not divisible by 2, then 2q + 1 is 5. Then, least prime factor of (a + b) is 2. 1
is an odd integer. Q. 3. What is the HCF of smallest prime number and
Q.3. n2 – 1 is divisible by 8, if n is : the smallest composite number ?
(a) an integer. (b) a natural number. U [CBSE Delhi, OD, 2018]
(c) an odd integer. (d) an even integer. Sol. The required numbers are 2 and 4 and the HCF of
R [NCERT Exemp.] 2 and 4 is 2. 1
Sol. Correct option : (c) [CBSE Marking Scheme, 2018]
Explanation : Any odd integer can be written Detailed Answer :
as 2m + 1. Since, the smallest prime number is 2 and the
Put n = 2m + 1 in n2 – 1 smallest composite number is 4. Hence, HCF of 2
n2 -1  n  1n -1  2m  22m  4mm  and 4 will be 2.
1 The product of two consecutive numbers is Q. 4. If the HCF of 65 and 117 is expressible in the
divisible by 2. Thus, m(m + 1) is divisible by 2. Let form 65m – 117, find the value of m :
m(m + 1) = 2k A [NCERT Exemp.]
n2 -1  n  1n -1  2m  22m Sol. By the Euclid’s division algorithm, HCF of
 4mm  1  4  2k  8k (65, 117)
Thus, if n is an odd integer then n2 – 1 is divisible by = 13
8. Since 65m – 117 = 13  m = 2
Q.4. The largest number which divides 70 and 125, Q. 5. If two positive integers p and q can be expressed as
leaving remainders 5 and 8, respectively, is : p = ab2 and q = a3b; a, b being prime numbers, Find
(a) 13. (b) 65. LCM of (p, q) : AE [NCERT Exemp.]
(c) 875. (d) 1,750. Sol. Since p  ab  a  b
2

R b

and qa baaab

3

Sol. Correct option : (a) [NCERT Exemp.]

Thus, LCM of p and q = a  a  a  b  b  a3b2
Q. 6. Find the least number that is divisible by all the
Explanation : Required largest number = HCF of numbers from 1 to 10 (both inclusive) :
(70 – 5) and (125 – 8) = HCF of 65 and 117 = 13
R [NCERT Exemp.]
Q.5. If two positive integers a and b are written as
Sol. Required number = LCM (1, 2, 3, 4, 5, 6, 8, 9, 10)
a = x3y2 and b = xy3; x, y are prime numbers, then
HCF (a, b) is : = 1 × 2 × 2 × 2 × 3 × 3 × 5 × 7 = 2,520
REAL [ 5
NUMBERS

Short Answer Type (2 marks each)

Questions-I
Q. 1. Find HCF of the numbers given below : x
k, 2k, 3k, 4k and 5k, where k is a positive integer.
U [Board Term-1, 2015, Set-FHN8MGD]
3 195
Sol. HCF of k 

k. 2  3 y

k. 3  i s k.

k. 22  5 13
and k. 
2
5 

@allsamplepaperspdf
U [Board Term-1, 2015, Set-WJQZQBN]
[CBSE Marking Scheme, 2015]
Q. 2. Find the HCF and LCM of 90 and 144 by the Sol. y = 5 × 13  65

telegram
method of prime factorization. and x = 3 × 195  585 2
U [Board Term-1, 2012, Set–69] Hence, x = 585
Sol. Since, 90 = 2 × 32 × 5 [CBSE Marking Scheme, 2015]
and 144 = 24 × 32 Q. 7. Complete the following factor tree and find the
Hence, HCF = 2 × 32 = 18 1 composite number x :
and LCM = 24 × 32 × 5 = 720 1
x
[CBSE Marking Scheme, 2012]
Q. 3. Using Euclid’s algorithm, find the HCF of 240 and
228. A [Board Term-1, 2012, Set–35] 2 y
Sol. Since, 240 = 228 × 1 + 12 1
and 228 = 12 × 19 + 0
3 1855
Hence, HCF of 240 and 228 = 12 1
Q. 4. Given that HCF (306, 1,314) = 18. Find LCM (306,
1,314). R [Board Term-1, 2013, FFC] 5 371
Sol. Given,. HCF (306, 1,314) = 18
LCM (306, 1,314) = ?
7 z
Let a = 306
and b = 1,314
U [Board Term-1, 2015, Set-DDE-M]
1
LCM (a, b) × HCF (a, b) = a × b Sol.
or LCM (a, b) × 18 = 306 × 1,314
306  1, 314
or LCM (a, b) = = 17 ×
11130 = 5565 2
1314
18
 LCM (306, 1,314) = 22,338 2 5565 = 1855 3
1
Q 5. The HCF and LCM of two numbers are 9 and
3 1855 = 371 5
360
respectively. If one number is 45, find the other
number. R [SQP 2018-19]
5 371 = 53 7

Sol. Since, HCF × LCM = Product of two numbers

1 371
7 53
2nd
Then, ( 945
9 × 360=  × 2nd number =
number = 7
360) 45  x = 11,130 2
nd
Thus, 2 number = 72 1
[CBSE Marking Scheme, 2018] Q. 8. Find the missing numbers a, b, c and d in the given
Q. 6. Complete the following factor tree and find the factor tree : U [Board Term-1, 2012, Set–52]
composite number x.
6 ] Oswaal CBSE Chapterwise & Topicwise Question Bank,
MATHEMATICS, Class – X
18018 Q. 10. Explain whether 3× 12 × 101 + 4 is a prime
number or a composite number.
U [Board Term-1 2016-17 Set; 193RQTQ
2 9009 2015, DDE-E]
Sol. 3 × 12 × 101 + 4 = 4(3 × 3 × 101 + 1)

a
= 4(909 + 1)
3003
= 4(910)
= 2 × 2 × 2 × 5 × 7 × 13
3 1001
= a composite number
[Product of more than two prime factors] 2
[CBSE Marking Scheme, 2015]
b 143 Q. 11. Explain why (7 × 13 × 11) + 11 and (7 × 6 × 5 × 4
× 3 × 2 × 1) + 3 are composite numbers.
A [Board Term-1, 2012, Set–64]
c
d
Sol. Since (7 × 13 × 11) + 11 = 11 × (7 × 13 + 1)
= 11 × (91 + 1)
Sol.
009
@allsamplepaperspdf a=
9,
3, 003
3 = 11 × 92  11 × 2 × 2 × 23 1
and (7 × 6 × 5 × 4 × 3 × 2 × 1) + 3

telegram
½
1, 001 = 3 (7 × 6 × 5 × 4 × 2 × 1 + 1)
b= 7
= 3 × (1681)  3 × 41 × 41
½ Given numbers have more than two prime factors.
143 Hence, both the numbers are composite. 1
Since, 143 = 11 × 13, Q. 12. Find the HCF of 1,656 and 4,025 by Euclid’s division
Or, c = 11 or 13 U
½
and d = 13 or 11.
½
Q. 9. Complete the following factor tree and find the algorithm. [Board Term-1, 2013, Set LK–59]
composite number x : Sol. 1656) 4025
(2
x –3312
713)1656(2
–1426
2 3381
230)713(3
– 690 1
3 ? 23)230(10
–23
00 1
7 161
Hence, HCF (1,656, 4,025) = 23
[CBSE Marking Scheme, 2013]
Q. 13. Find the smallest natural number by which
7 ? 1,200 should be multiplied so that the square
U [Board Term-1, 2012, Set–44] root of the product is a rational number.
Sol. [Board Term-1, 2015, Set-WJQZQBN]
6762 =2 3381 ½ U [Board Term-1, 2016, Set-MV98HN3]

Sol. Since, 1,200 = 4 × 3 × (2 × 5)2

2 ½ = 24 × 3 × 52
3381
Hence, the required smallest natural number is 3.2
[CBSE Marking Scheme, 2015]
3 1127 =7 161
Q. 14. Show that any positive even integer can be written
in the from 6q, 6q + 2 or 6q + 4, where q is an integer.
7 161 A [Board Term-1, 2016 Set ORDAWEZ]

Sol. Let a be any positive integer ½

7 161 By division algorithm
23 = = 23 ½
7 a = 6q + r, where 0  r <
 a6 = 6q, 6q + 1, 6q + 2, 6q + 3, 6q + 4 or 6q +
REAL [ 7
NUMBERS
 Composite number, x = 6762. ½
8 ] Oswaal CBSE Chapterwise & Topicwise Question Bank,
MATHEMATICS, Class – X
Here, 6q, 6q + 2, and 6q + 4 are divisible by 2 and so 50 ) 175 ( 3
6q, 6q + 2, or 6q + 4 are even positive integers. ½ 150
Hence, a is an even integer and can be written as 25 ) 50 ( 2 1½
a = 6q, 6q + 2, or 6q+ 4 ½ 50
[CBSE Marking Scheme, 2016]
0
Q. 15. Show that any positive odd integer is of the form
HCF (625, 850) = 25
4q + 1 or 4q + 3, where q is some integer.
 25 divides 475
A [Board Term-1, 2012, Set–70, 55] [NCERT]
Hence, HCF (625, 850, 475) = 25 ½
Sol. By Euclid’s division algorithm,
a = bq + r = 4q + r Thus, the longest rod that can measure the
dimensions of the room exactly = 25 cm.
Take b =4
[CBSE Marking Scheme, 2016]
Since, 0  r < 4, where, r = 0, 1, 2, 3 1
So, a = 4q, 4q + 1, 4q + 2, 4q + 3 Commonly Made Errors

@allsamplepaperspdf
Clearly, a = 4q, 4q + 2 are even, as
they are divisible by 2. Therefore, 4q + 1, and 4q +
3 are odd, as they are not divisible by 2.
 Mostly candidates are unable to determine about
what they have to find. Actually, mostly candidates

telegram
don’t get to know that the question is about HCF or
 Any positive integer which has the form of
LCM.
(4q + 1) or (4q + 3) is odd. 1
 Sometimes students calculate the longest length of
Q. 16. Can two numbers have 15 as their HCF and 175 rod that lies in the room by finding its diagonal.
as their LCM ? Give reasons.
R [Board Term-1, 2012, Set– Answering Tips
50] Sol. Since, 15 does not divide 175 and
 Adequate Practice is necessary for such type of
LCM of two numbers should be exactly divisible by questions and basic concept of HCF and LCM
their HCF. 1 should be clear.
 Two numbers cannot have their HCF as 15 and  Students should read the question properly.
LCM as 175. 1
Q. 19. If two positive integers p and q are written as p =
Q. 17. Check whether 4n can end with the digit 0 for any
a2b3 and q = a3b, where a and b are prime
natural number n.
numbers then verify.
A [Board Term-1, 2015, Set-FHN8MGD; NCERT]
LCM(p, q) × HCF(p, q) = [SQP 2017]
p.q. A
Sol. If the number 4n, for any n, were to end with the Sol. Since, LCM(p, q) = a3b3 ½
digit zero, then it would be divisible by 5 and 2.
and HCF(p, q) = a2b ½
That is, the prime factorization of 4n would contain
3 3 2
the prime 5 and 2. This is not possible because 4n Hence, LCM(p, q) × HCF(p, q) = a b × a b
= (2)2n; so, the only prime in the factorization of = a 5 b4 ½
4n is 2. So, the uniqueness of the Fundamental 2 3
=ab ×ab 3

Theorem of Arithmetic guarantees that there = pq (Hence verified.) ½

are no other primes in the factorization of 4n. So,
Q. 20. There is a circular path around a sports field.
there is no natural number n for which 4n ends
Priya takes 18 minutes to drive one round of the
with the digit zero. 2
field, while Ravish takes 12 minutes for the
[CBSE Marking Scheme, 2015]
same. Suppose they both started at the same
Q. 18. The length, breadth and height of a room are 8 point and at the same time, and go in the same
m 50 cm, 6 m 25 cm and 4 m 75 cm respectively. direction.
Find the length of the longest rod that can (i)After how many minutes will they meet again at
measure the dimensions of the room exactly. the starting point ?
A [Board Term-1, 2016 Set ORDAWEZ]
(ii)Which mathematical concept is used in this
problem? A;E
Sol. Given Length = 8 m 50 cm= 850 cm Sol. (i) Required number of minutes is the LCM of 18
breadth = 6 m 25 cm = 625 cm and 12.
height = 4 m 75 cm = 475 cm
18 = 2 × 32
Since, the length of the longest rod is equal to
HCF of 850, 625 and 475 and 12 = 22 × 3
625 ) 850 ( 1  LCM of 18 and 12 = 22 × 32 = 36
625 Hence, Ravish and Priya will meet again at the
225 ) 625 ( 2 starting point after 36 minutes.
450
175 ) 225 ( 1 1
175 (ii) LCM of numbers. 1
REAL [ 9
NUMBERS

Short Answer Type (3 marks each)

Questions-II
Q. 1. Find the HCF of 180, 252 and 324 by Euclid’s
Division algorithm. Sol. 867 = 255 × 3 + 1
102 1
U [Board Term-1, 2016 Set MV98HN3]
255 = 102 × 2 + 51 ½
Sol. Since, 324 = 252 × 1 + and 102 = 51
 × 2HCF(867,
+0 255) = 51
72 ½
252 = 36
72 = 72 ×
× 23 +
+ 036 [CBSE Marking
Q. 5. Euclid’s Division Algorithm to findScheme,
the HCF 2018]
of 726
m HCF(324, 252) = 36 and 275. U [CBSE S. Question Paper 2018-19]
180 = 36 × 5 + 0
m HCF(36, 180) = 36
 HCF of 180, 252 and 324 is 36. 3 Sol. Euclid’s Division lemma
726 = 275 × 2 + ½

@allsamplepaperspdf
[CBSE Marking Scheme, 2016]
Q. 2. Find the greatest number of six digits exactly 176 ½
275 = 176 × 1 + 99 ½
divisible by 18, 24 and 36.
176 = 99 × 1 + 77 ½

telegram
18 = 2 × 32
A [Board Term-1, 2016 Set
O4YP6G7] Sol. LCM of 18, 24 and 36
Thus, HCF
99 = 77 × 1 + 22
77 = 22 × 3 + 11
22 =
= 11
11 × 2 + 0
½

½
24 = 23 × 3 [CBSE
Q. 6. 144 cartons of Coke cans Marking Scheme,
and 90 cartons of 2018]
Pepsi
36 = 22 × 32
cans are to be stacked in a canteen. If each stack
LCM (18, 24, 36) = 23 × 32  72 1
is of the same height and if it contain equal
The largest 6 digit number is 999999 1 cartons of the same drink, what would be the
1388 Quotient greatest number of cartons each stack would
72 ) 999999 have ?
–72 A [Board Term-1, 2011, Set–
279 66] Sol. Since, the greatest number of cartons is the HCF
–216 of 144 and 90 1
639 144 = 24 × 32
–576 90 = 2 × 32 × 5 1
639 Therefore, HCF = 2 × 32 = 18
–576 Thus the greatest number of cartons = 18. 1
639 Q. 7. Three bells toll at intervals of 9, 12, 15 minutes
–576 respectively. If they start tolling together, after
63  Remainder ½ what time will they next toll together ?
 The required number = 9,99,999 – 63 = 9,99,936. A [Board Term-1, 2011, Set–
½ 44] Sol. Since, the time to toll next together = LCM (9,
Q. 3. Use Euclid division lemma to show that the 12, 15)1
square of any positive integer cannot be of the 9 = 3 × 3 = 32
form 5m + 2 or 5m + 3 for some integer m. 12 = 2 × 2 × 3 = 22 × 3
A [Board Term-1, 2015, Set–FHN8MGD] and 15 = 3 × 5
 LCM (9, 12, 15) = 32 × 22 × 5
= 180 minutes 1
Hence the bells will toll next together after 180
minutes.

1
Q. 8. Find HCF and LCM of 404
A and 96 and verify that
HCF × LCM = Product of the two given numbers.
[CBSE Delhi O.D., 2018]
 Sol. Let n be any positive integer.
By Eucild’s division lemma, n = 5q + r, where,
0r<5
10 Then, n = 5q, 5q + 1, 5q + 2, 5q + 3 or Oswaal
5q + 4, CBSE Chapterwise & Topicwise Question Bank,
where MATHEMATICS, Class – X
] q W Sol. Since, 404 = 2 × 2 × 101 = 22 ×
q is a whole number and 101
now 2 2 2 2
n = (5q)  25q = 5(5q )  5m 96==225 ×× 23 × 2 × 2 × 2 × 3
 HCF of 404 and 96 = 22 = 4 1
n2 = (5q + 1)2 = 25q2 + 10q + 1  5m +
2 2 2 LCM of 404 and 96 = 101 × 25 × 3 = 9696
1 and, n = (5q + 2) = 25q + 20q + 4  5m HCF × LCM = 4 × 9696 = 38784 1
+ 4 Similarly, n2 = (5q + 3)2 = 5m + 4 Also, 404 × 96 = 38,784
2 2
and n = (5q + 4) = 5m + 1 Hence, HCF × LCM = Product of 404 and 96.
Thus, square of any positive integer cannot be of [Hence verified] 1
the form 5m + 2 or 5m + 3. 3 [CBSE Marking Scheme, 2018]
[CBSE
Q. 4. Using Euclid’s division Markingfind
algorithm Scheme, 2012]
the HCF of Q. 9. The HCF of 65 and 117 is expressible in the form
the numbers 867 and 255. 65m – 117. Find the value of m. Also find the LCM
U [CBSE Comptt. Set I/II/III, of 65 and 117 using prime factorization method.
2018] A [Board Term-1, 2011, Set–40]
REAL [ 11
NUMBERS
Sol. Since, 117 = 13 × 3 × 3
and 65 = 13 × 5 The Panchayat asked the trader, ‘How many eggs
m HCF (117, 65) = 13 1 were broken ?’ He gave the following response :
If counted in pairs one will remain; If counted in
Given, HCF = 65 m – 117 1
3, two will remain; If counted in 4, 3 will remain;
Then, 13 = 65 m – 117
If counted in 5, 4 will remain; If counted in 6, 5
65 m = 117 + 13 =130 will remain; If counted in 7, nothing will remain,
130
my basket cannot accommodate more than 150
eggs.
m= 2 1 So,
65 (i)How many eggs were there ?
12 Oswaal CBSE Chapterwise & Topicwise Question Bank,
] Hence, LCM(117,65) = 13 × 5 × 3 × 3 =MATHEMATICS,
585 Class – X mathematical concept is used to solve the
(ii)Which
Q. 10. Show that any positive odd integer is of the form above question ? A;E
6q + 1, 6q + 3 or 6q + 5, where q is some integer. Sol. (i) Let the number of eggs be a [ a  150, given]
A [Board Term-1, 2011, Set–60] If counted in 7, nothing will remain,
Sol. By Euclid’s division algorithm, for two positive a = 7p + 0, for some natural number p.
integers a and b, we have If counted in 6, 5 will remain, for some natural
a = bq + r, where 0  r < b number q
Letb = 6,
 r = 0, 1, 2, 3, 4 and 5 ½
So, a = 6q, 6q + 1, 6q + 2, 6q + a = 6q + 5
3, If counted in 5, 4 will remain, for some natural
6q + 4, or 6q + 5 number w
a = 5w + 4 ½

@allsamplepaperspdf
1 If counted in 4, 3 will remain, for some natural
number s
Clearly, a = 6q, 6q + 2, and 6q + 4 are
a = 4s + 3
even, as they are divisible by 2.

telegram
If counted in 3, 2 will remain, for some natural
But 6q + 1, 6q + 3, and 6q + 5 are odd, as they are number t
not divisible by 2.
a = 3t + 2
If counted in pairs, one will remain, for some
1 natural number u
 Any positive odd integer is of the form 6q + 1, 6q +
3 or 6q + 5.

1
Q. 11. Show that exactly one of the number n, n + 2 or
n
+ 4 is divisible by 3. A [SQP 2017] a = 2u + 1
Sol. Let n be any positive integer and b = That is, in each case, we have a and a positive
3 Then, n = 3q + r integer (b takes values 7, 6, 5, 4, 3 and 2
respectively) which
where, q is the quotient and r is the remainder and trader requested the Panchayat to as the idler to pay for
0r<3 broken eggs.
So, the remainders may be 0, 1 or 2 and n may be
in the form of 3q, 3q + 1, 3q + 2
Let n = 3q, 3q + 1 or 3q + 2.
(i) When n = 3q :
n is divisible by 3.
n + 2 = 3q + 2  n + 2 is not divisible by 3.
n + 4 = 3q + 4 = 3(q +1) + 1  n + 4 is not
divisible by 3. 1
(ii) When n = 3q + 1 :
n is not divisible by 3.
n + 2 = (3q + 1) + 2 = 3q + 3 = 3(q + 1)  n
+2
is divisible by 3.
n + 4 = (3q + 1) + 4 = 3q + 5 = 3(q + 1) + 2

n + 4 is not divisible by 3.

1
(iii) When n = 3q + 2 :
n is not divisible by 3.
n + 2 = (3q + 2) + 2 = 3q + 4 = 3(q + 1) + 1
 n + 2 is not divisible by 3.
n + 4 = (3q + 2) + 4 = 3q + 6 = 3(q + 2)
 n + 4 is divisible by 3.
Hence, exactly one of the numbers n, n + 2 or n +
4 is divisible by 3.

1
Q. 12. A trader was moving along a road selling eggs.
An idler who did not have much work to do,
started to get the trader into a wordy duel. This
grew into a fight, he pulled the basket with eggs
and dashed it on the floor. The eggs broke. The
 REAL [ 13
divides a and leaves a remainder r (in case, r is 6, 5, 4,
NUMBERS
3, 2 and 1 respectively), that is smaller than b. 1
We must look for the multiple of 7
which satisfy all the conditions. By trial
and error (Using the concept of LCM)
we will get total number of eggs = 119
(ii) Euclid’s division lemma (Real Numbers) 1
Q. 13. Three sets of English, Hindi and
Sociology books dealing with
cleanliness have to be stacked in such
a way that all the books are stored
topicwise and the height of each
stack is the same. The number of
English books is 96, the number of
Hindi books is 240 and the number
of sociology books is 336.
(i)Assuming that the books are of the
same thickness, determine the
number of stacks of English, Hindi
and Sociology books.
(ii)Which mathematical concept is used
in the problem? A;E
Sol. (i) In order to arrange the books as
required, we have to find the largest
number that divides 96, 240 and 336
exactly, clearly, such a number is their
HCF. We have,
96 = 25 × 3
240 = 24 × 3 × 5
and 336 = 24 × 3× 7
 HCF of 96, 240, and 336 is 24 × 3 = 48
So, there must be 48 books in each stack. 1
Number of stacks of English books
96
= 48 = 2
Number of stacks of Hindi books
14 Oswaal CBSE Chapterwise & Topicwise Question Bank,
MATHEMATICS, Class – X
]
240
= 48 = 5 336 = 7 1
= 48
Number of stacks of Sociology books (ii) HCF of numbers. 1

Long Answer Type (4 marks each)

Questions
Q. 1. State Fundamental theorem of Arithmetic. Find LCM
of numbers 2520 and 10530 by prime factorization Sol. HCF of 990 and 945
method. R [Board Term-1, 2016 Set-ORDAWEZ] 945 ) 990 ( 1
– 945
Sol. Fundamental theorem of arithmetic : Every
composite number can be expressed as the product 45 ) 945 ( 21
of powers of primes and this factorization is – 90
unique.
@allsamplepaperspdf
Since, 2520 = 23 × 32 × 5 × 7
and 10530 = 2 × 34 × 5 × 13
1
1
45
– 45

telegram
0 2
 LCM = 23 × 34 × 5 × 7 × 13 1
990 = 945 × 1 +
= 294840 1 45
[CBSE Marking Scheme, 2016] 945 = 45 × 21 + 0 1
Q. 2. Can the number 6n, n being a natural number, Since, HCF of 990 and 945 is 45.
Thus, the fruit vendor should put 45 fruits in each
end with the digit 5 ? Give reasons. basket to have minimum number of baskets. 1
A [Board Term-1, 2015, Set–FHN8MGD] [CBSE Marking Scheme, 2016]

Sol. If 6n ends with 0 or 5, then it must have 5 as a factor. Q. 5. An army contingent of 104 members is to march
behind an army band of 96 members in a parade.
But only prime factors of 6n are 2 and 3. The two groups are to march in the same
 6n = (2 × 3)n = 2n × 3n 2 number of columns. What is the maximum
From the fundamental theorem of arithmetic, the number of columns in which they can march ?
prime factorization of every composite numbers is A [Board Term-1, 2012, Set–
unique. 1
52] Sol. Let the number of columns be x.
 6n can never end with 0 or 5. 1
Then, x is the largest number, which should divide
[CBSE Marking Scheme, 2015] both 104 and 96
Q. 3. State Fundamental theorem of Arithmetic. Is it 104 = 96 × 1 + 8 1
possible that HCF and LCM of two numbers be 24 96 = 8 × 12 + 0 1
and 540 respectively. Justify your answer.
 HCF of 104 and 96 is 8 1
A [Board Term-1, 2015, Set–WJQZQBN] Hence, 8 columns are required. 1
Q. 6. For any positive integer n, prove that n3 – n is
Sol. Fundamental theorem of Arithmetic : Every
divisible by 6.
integer greater than one either is prime itself or
is the product of prime numbers and that this A [Board Term-1, 2015, 2012, Set–48]
factorization is unique. Apart from the order of the Sol. n3 – n = n(n2 –1)
factors. 2
= n(n + 1)(n – 1)
Given, HCF = 24
= (n – 1) n(n + 1)
and LCM = 540
= product of three
LCM 540 consecutive positive integers
Then, =  22·5 not an integer
HCF 24 Since, any positive integer a is of the form 3q, 3q + 1
Since, LCM is always a multiple of HCF, hence, two or 3q + 2 for some integer q.
numbers cannot have HCF and LCM as 24 and 540 Let a, a + 1, a + 2 be any three consecutive integers.
respectively. [CBSE Marking Scheme, 2015] 1 ½
Q. 4. A fruit vendor has 990 apples and 945 oranges. Case I : If a = 3q
He packs them into baskets. Each basket contains a(a + 1)(a + 2) = 3q(3q + 1)(3q + 2)
only one of the two fruits but in equal number.
Find the number of fruits to be put in each basket = 3q (2r)
in order to have minimum number of baskets. = 6qr, which is divisible by 6.
A [Board Term-1, 2016 Set-O4YP6G7] ( Product of two consecutive integers (3q + 1)
and (3q + 2) is an even integer, say 2r) 1
REAL [ 15
NUMBERS
Case II : If a = 3q + 1 Now,
a(a + 1)(a + 2) = (3q + 1)(3q + 2)(3q + 3) 3 = 75 – 6 × 12 [From (iii)]
= (2r) (3)(q + 1) = 75 – (81 – 75 × 1) × 12 [Replace 6 from (ii)]
= 6r(q + 1), 1 = 75 – (81 × 12 – 75 × 1 × 12)
which is divisible by 6. = 75 – 81 × 12 + 75 × 12
Case III : If a = 3q + 2 = 75 + 75 × 12 – 81 × 12
 a(a + 1)(a + 2) = (3q + 2)(3q + 3)(3q + = 75 ( 1 + 12) – 81 × 12
4) = 75 × 13 – 81 × 12 ½
= multiple of 6 for every q = 13(237 – 81 × 2) – 81 × 12 [Replace 75 from (i)]
= 6r (say), 1
= 13 × 237 – 81 × 2 × 13 – 81 × 12
which is divisible by 6.
= 237 × 13 – 81 (26 + 12)
Hence, the product of three consecutive integers is
= 237 × 13 – 81 × 38
divisible by 6 and n3 – n is also divisible by 6.
= 81 × (– 38) + 237 × (13) ½
Q. 7. Prove that n2 – n [CBSE Marking
is divisible by 2Scheme,
for every2012]
= 81x + 237y
positive A

@allsamplepaperspdf
integer n. [Board Term-1, 2012 Set-25]  Hence, x = – 38 and y  13 ½
Sol. Any positive integer is of the form 2q or 2q + 1, for
some integer q. These values of x and y are not unique. ½
 When,
telegram
n = 2q
n2 – n = n(n – 1)  2q(2q – 1)
= 2m, where m = q(2q –
1
Q. 9. Show that the square of any positive integer is of
the forms 4m or 4m + 1, where m is any integer.
A [Board Term-1, 2012 Set-39]
1) which is divisible by 2. Sol. Let a = 4 q + r, where 0  r < 4
When, n = 2q + 1 or a = 4 q, 4 q + 1, 4 q + 2 or 4 q +
n(n – 1) = (2q + 1)(2q + 1 – 1) 3
Case I :
= 2q(2q + 1) 1 a2 = (4q)2 = 16q2 = 4(4q2)  4m, 1
where
= 2m, when m = q(2q + 1) m = 4 q2
1
Case II : a2 = (4 q + 1)2 = 16q2 + 8q + 1
which is divisible by 2.
= 4(4 q2 + 2q) + 1
Hence, n2 – n is divisible by 2 for every positive
 4m + 1,
integer n. Hence Proved.
1 where m = 4 q2 + 2q 1
2 2
Q. 8. Find HCF of 81 and 237 and express it as a linear Case III : a = (4 q + 2)
combination of 81 and 237 i.e., HCF (81, 237) = = 16q2 + 16q + 4
81x = 4(4 q2 + 4 q + 1)  4m,
+ 237y for some x and y.
where m = 4 q2 + 4q + 1 1
A [Board Term-1, 2012 Set-35] [NCERT]
Case IV : a2 = (4 q + 3)2 =16q2 + 24q + 9
Sol. Since, 237 > 81 = 16q2 + 24q + 8 + 1
On applying Euclid’s division algorithm, we = 4(4q2 + 6q + 2) + 1
get 237 = 81 × 2 + 75.........................(i)  4m +1,
81 = 75 × 1 + 6....................................(ii) where m = 4 q2 + 6q + 2 1
75 = 6 × 12 + 3..................................(iii) From cases I, II, III and IV, we conclude that the
6 = 3 × 2 + 0.....................................(iv) square of any +ve integer is of the form 4m or
1 4m +1.
Hence, HCF (81, 237) = 3.
1
In order to write 3 in the form of 81x + 237y,

TOPIC-2
Irrational Numbers, Terminating and Non-
Terminating Recurring Decimals

Revision Notes
p
 Rational Numbers : A number in the form , where p and q are co-prime numbers and q  0, is known as rational
q
number.
16 3 2
Oswaal CBSE Chapterwise & Topicwise Question Bank,
MATHEMATICS,
numbers. Class – X
] For example : 2, – 3, ,  , etc are rational
7 5
REAL [ 17
NUMBERS
p
 Irrational Numbers : A number is called irrational if it cannot be written in the form , where p and q are integers
q
and q  0. For example, 2 , 3 , 5 ,  are irrational numbers.
 Let p be a prime number. If p divides a2, then p divides a, where a is a positive integer.
Terminating
 Decimals : If decimal expansion of rational number comes to an end, then the decimal obtained
p
q
from
p is called terminating decimal.
q
 Non-terminating Repeating (or Recurring) Decimals : The decimal expansion obtained from p
repeats
q
periodically, then it is called non-terminating repeating (or recurring) decimal.
 Just divide the numerator by the denominator of a fraction. If you end up with a remainder of 0, you have a
terminating decimal otherwise repeating or recurring decimal.
 The sum or difference of a rational and an irrational number is irrational.
 The product and quotient of a non-zero rational and an irrational number is irrational.
p

@allsamplepaperspdf
 Let x = be a rational number, such that the prime factorization of q is of the form 2m5n, where n and m are non-
q
negative integers. Then, x has a decimal expansion which terminates.

telegram
p
 Let x be a rational number whose decimal expansion terminates. Then, x can be expressed in the form , where
q
p and q are co-primes and the prime factorisation of q is of the form 2m5n, where m and n are non-negative integers.
Let
 x= be a rational number, such that the prime factorization of q is not of the form 2m5n, where n and m are
p
q
non-negative integers. Then, x has a decimal expansion which is non-terminating repeating.

GREENBOARD ?
How it is done on

Q. Show that 2 3 + 5 is an irrational number.

or 1 a 
3 = -5
 
Sol. : Step I : Let 2 3 + 5 be a rational number. 2 b
1 a 
a Here, R.H.S = - 5 is
A rational number can be expressed as ,

b 2 b 
where b ≠ 0 and a and b are integers. rational while, L.H.S, 3 is irrational which is not possible.
Step a
II : Then, 2 3 +5= Step III : Hence, our assumption that 2 3 + 5 is a
b
a rational number is wrong. Hence, 2 3 + 5 is
or 2 3 = –5 an irrational number.
b

Objective Type (1 mark each)

[A] Questions
Multiple Choice Questions : (a) one decimal place. (b) two decimal places.
Q.1. The product of a non-zero rational and an
(c) three decimal places. (d) four decimal places.
irrational number is :
U [NCERT Exemp.]
(a) always irrational. (b) always rational.
(c) rational or irrational. (d) one. Sol. Correct option : (d)
R Explanation :
[NCERT Exemp.]
Sol. Correct option : (a) 14587 14587 14587 24
Explanation : The product of a non-zero 1250  2  54 2  54 
24
rational
with and an irrational number is always Q.2. The al ansion of the
irrational. decim exp rational number
18 3
Oswaal CBSE Chapterwise & Topicwise Question Bank,
]14587  2 MATHEMATICS, Class – X
116,696
11.6696
4  10000 
10
14587 will terminate after :
Thus, the given rational number terminates after
1250 four decimal places.
 REAL [ 19
NUMBERS
[B] Very Short Answer Type Questions :
Q. 1. What is the condition for the decimal expansion Sol. 4 places. 1
of a rational number to terminate ? Explain with [CBSE Marking Scheme, 2018]
the help of an example. Detailed Answer
R [Board Term-1, 2016 Set–O4YP6G7] 23 23  5 23  5
Sol. The decimal expansion of a rational number 24 3 = = ½
5 4
2 5  3
24  54
terminates, if the denominator of rational
5
number can be expressed as 2m5n where, m and n
are non- negative integers and both p and q co- 115
= 115
primes. 3 3 ( 10) 4 = = 0.0115
e.g. = 1 = =0.3 10000
10 2 
1
[CBSE 5Marking Scheme, 2016] 23
Hence, will terminate after 4 decimal places. ½
24  53

Commonly Made
Q. 2. Find the smallest positive rational number by Error
1

@allsamplepaperspdf
which should be multiplied so that its decimal  Sometimes students make errors in converting the
7
denominator in the form of 2m × 5n.
expansion terminates after 2 places of decimal. Answering

telegram
A [Board Term-1, 2016 Set LGRKEGO] Tip
1 7 1  Students should carefully do the simplification so as
Sol. Since,  = =
7 100 100 to avoid waste of time.
2 45+ 3
Thus, 7 Q. 6. Write whether 20 on simplification
smallest rational number is 1
100 2 5
gives an irrational or a rational number.
[CBSE Marking Scheme, 2016]
U [CBSE Compt Set I, II, III 2018]
Q. 3. What type of decimal expansion does a rational
number has ? How can you distinguish it from Sol. 6 56 5
decimal expansion of irrational numbers ? For writing ½
2 5
R [Board Term-1, 2016 Set–ORDAWEZ]
Sol. A rational number is may has its decimal expansion = 6 which is rational. ½
[CBSE Marking Scheme, 2018]
either terminating or non-terminating repeating.
An irrational number has its decimal expansion Detailed Answer :
non-repeating and non-terminating . 1 2 45  3 20 2 9  5  34 
[CBSE Marking Scheme, 2016] 2 5 = 2 5 5
Q. 7
4. Write whether rational number will have
75 2  5 3  25
3
 =
terminating decimal expansion or a non- 2 5
U
terminating decimal. [SQP 2017]
Sol. 7 6 56 5
7  = 2 5
75 = 3 
52
Since, denominator of given rational number is not ( 6  6) 5
of form 2m × 5n.  =
2 5
Hence, it is non-terminating decimal expansion. 1
Q. 5. After how many decimal places will the decimal
23  = 12 5 = 6
expansion of terminate ? 2
5
2 × 53
4
which is a rational number.
R[SQP 2018]

Short Answer Type (2 marks each)

Questions-I
Q.1. Show that a
5 6 is an irrational number.  6 = ½
U [Board Term-1, 2015, Set-CJTOQ] b
5 a
6 = 5b
Sol. Let 5 6 be a rational number, which can be
a
expressed as , where b  0 and a and b are or, = rational ½
6
co-
20 Oswaal CBSE Chapterwise & Topicwise Question Bank,
primes. b MATHEMATICS, Class – X
]
REAL [ 21
NUMBERS
But
6 is an irrational number. Q. 4. Given that 3 is an irrational number, prove that
Thus, our assumption is wrong. ( 2  3 is an irrational number.
)
Hence, 5 6 is an irrational number. 1
A [CBSE Comptt. Set I, II, III, 2018]
Q. 2. Write the denominator of the rational number
257 Sol. Let 2  3 be a rational number.
in the form 2m × 5n, where m and n are non-
500 p
negative integers. Hence write its decimal expan-  2 3 = , p, where p, q  I and q 
q
sion without actual division. U [NCERT Exemplar] 0
[Board Term-1, 2012, Set–67] p p  2q
 3 = 2  1
q q
Sol. Denominator = 500
= 22 × 53 1 p  2q
Decimal 257  2 is rational = 3 is rational number. ½
257 q
expansion =  
514 500 2  22  53 103 which is contradiction. ½

@allsamplepaperspdf
= 0.514 1
[CBSE Marking Scheme, 2012]
Thus, 2  3 is irrational number
[CBSE Marking Scheme, 2018]
Q. 3. Given that
telegram
2
 
is irrational, prove that 5  3 2
is an irrational number.
Q. 5. Show that 7  5 is irrational, given that

irrational.
U
5 is

[SQP 2018-19]
A [CBSE Delhi Set and O.D. 2018]
Sol. Let us assume, to the contrary that 7  5 is
Sol. Let us assume 5  3 2  is a rational number. rational.
p p
7 5 =

5
3 2 = ½ q , where p and q are co-prime and q 

q (where, q  0 and p and q are integers) 1

7q 
p  5
 2= 5q ½ p q
3q 7q  p
This contradicts the given fact that 2 is irrational. is rational = 5 is rational. which is
q

Hence, ( 5  3 2 ) is an irrational number. 1 contradictory.

[CBSE Marking Scheme, 2018] Hence, 7  5 is irrational 1
[CBSE Marking Scheme, 2018]

Short Answer Type (3 marks each)

Questions-II
Q.1. Express  15 5 as a decimal fraction without and 10x = 3.178178...............................(ii)
 +
 40 Subtracting, equation (ii) from equation (i) we get
4

actual division. U [Board Term-1, 2011, Set–74] 9990x = 3175 1

15 5 3175 635
Sol.  15 25 5 25 or x= 1
=    1 
4 40 4 25 40 25 9990 1998

375 125
= 
Q. 3. Prove that 2 is an irrational number.
1
100 1000 [Board Term-1, 2011, Set–A1] [NCERT]
U
= 3.75 + 0.125 = 3.875
Sol. Let be a rational number.
2
1 p
 ,
=
Q. 2. Express the number 0·3178 in the form of 2
rational
a q
number U [Board Term-1, 2011, Set–21]
. where p and q are co-prime integers and q  0
b
22 Oswaal CBSE Chapterwise & Topicwise Question Bank,
MATHEMATICS, Class – X
] Sol. Let x = 0. 3178
On squaring both the sides, we get,
2
or x = 0.3178178178... 1 p
or 2= ½
Now, 10,000x = 3178.178178........................(i) 2
q
REAL [ 23
NUMBERS
or p2 = 2q2
2
 p is divisible by 2 Let m = pq for some integer q
 p is divisible by 2.......................................................(i) On putting m = pq in eq. (i), we get
½ pn2 = p2q2
Let p =2r for some positive integer r
or n2 = pq2
or p2 = 4r2  p divides n2 [ p divides pq2] 1
 2q2 = 4r2
and p divides n.
or q2 = 2r2
2
or q is divisible by 2 1 [p is prime and p divides n2  p divides n]
 q is divisible by 2. Thus, p is a common factor of m and n but this
....................................................................................................... contradicts the fact that m and n are co-primes.
(ii) The contradiction arises by assuming pthat
From (i) and (ii), p and q are divisible by 2, which
contradicts the fact that p and q are co-primes.
is rational.p
Hence, our assumption is false.
 2 is an irrational number. 1 Hence, is irrational. ½

Q. 4. If p is a prime number, then prove

that p is an Q. 5. Prove that 3 + is an irrational number.
5
irrational.
@allsamplepaperspdf
A [Board Term-1, 2014; 2013, Set-FFC]
Sol. Let 3 +
A [Board Term-1, 2011, Set–52]

5 is a rational number.

rational
m
telegram
Sol. Let p be a prime number and if possible, let p be

p
3 + 5 = , where q  0
q
m p = , where m and n are co-primes and n  p
n 3+ 5 = 1
0. q
p
½ 5
Squaring on both sides, we get  = –3
q
 p =
 m 2
5 = p  3q
   q 1
1 n
2
m p
or p= is irrational and is rational (as assumed).
n2 3q
5
q
2 2
or pn = m ...(i)
1 But rational number cannot be equal to an irrational
number.
 p divides m2 and p divides m. [ p divides pn2]
3+ 5 is an irrational number. 1

Long Answer Type (4 marks each)

Questions
Q. 1. Prove that 3 is an irrational number. Hence,
So, b is divisible by 3............................................................(ii)
From equation (i) and (ii), we have
show that 7 + 3 is also an irrational number. 3 is a factor of a and b which is contradicting the fact
2 [Board Term-1, 2012, Set–DDE-M] that a and b are co-primes.
A
be a rational number. Thus, our assumption that 3 is a rational number
is wrong.
Sol. If possible, let 3
a 3
(i) 3 Hence, is an irrational number. 2
= , where a and b are integers and co-
b
primes 3
and b s 0. (ii)Let us assume to contrary that 7 + is a rational
Squaring on both sides, we have 2
number.
2
a or  a is divisible by 3..................................
=3
2  a2 is divisible Let a = 3c for any integer c.
b by 3
24 Oswaal CBSE Chapterwise & Topicwise Question Bank,
]  7+ 2 p –X
MATHEMATICS, Class p
= , 3 7
q 3 = q
p  7q
q  0 and p and q are co-
primes. 3
or 2
(3c)2 = or 2 = q
3b2 9c2
= 3b2
b = 3c2
2

2
Since, b is divisible by 3 or 3 = p  7q
2q
REAL [ 25
NUMBERS
p – 7q and 2q both are integers, hence
3 is a n - 1- n+ 1 n - 1- n+ 1
rational number. = ( n - 1) - ( n  1) -2
But this contradicts the fact that 3 is a rational 2q
n+ n-
number. Hence, 7 + 3 or 1 – 1 = ...(ii) 1
is an irrational number. p
2
2
Q. 2. Show that there is no positive integer n, for which Adding (i) and (ii), we get
 2q
is rational. 2 2 p2  ...(iii)
n1 p
= 2q
+ =
n n+
1 [Board Term-1, 2012, Set– 48] 1 q p pq
A
Sol. Let us assume that there is a positive integer n for From (i) and (ii),

which p  p2  2q2
n- = ...(iv) 1
n- + is rational and equal to 2pq
, 1
1 n+ q
1
where, p and q are positive integers and (q  ).
From (iii) and (iv), n+ and n- both are
1 1
1
p rational because p and n -q both nare
+ rational. But it

@allsamplepaperspdf
n- + n+ = q ...(i) 1 (n – 1) both are
possible only when (n1 + 1) and
1 1
q 1 perfect squares. But they differ by 2 and two perfect

telegram
or = n - 1  n+ squares never differ by 2. So, both (n + 1) and (n – 1)
p cannot be perfect squares, hence there is no positive
1
n - 1  n+ 1
= integer n for which + is rational. 1
( n -  n+ 1) n- - n+ 1)
1 ( 1

OSWAAL LEARNING TOOLS

To learn from Oswaal Concept Videos
Visit : https://qrgo.page.link/Jo1P

Or Scan the Code

