Bs Book

Challenging Mathematical Problems
CHALLENGING
MATHEMATICAL
PROBLEMS
1000 Solved Problems for Bachelor's Entrances
By Tanujit Chakraborty
1
By Tanujit Chakraborty
This page is intentionally left blank.
2
PREFACE
“This book is useful for the BSTAT and BMATH Entrances conducted by Indian Statistical
Institute and Chennai Mathematical Institute. Readers are also suggested to go through
www.ctanujit.in and www.ctanujit.org for other online resources. Since 2013, I am involved with
teaching for different entrance exams at ISI. I tried my best to cover several previous year’s
papers questions asked in ISI CMI BSTAT / BMATH Entrance exams. If you have any queries
you can mail me at tanujitisi@gmail.com.”
With Best Wishes,
- Tanujit Chakraborty,
Founder of Ctanujit Classes.
Research Scholar,
Indian Statistical Institute, Kolkata.
My Blog: www.ctanujit.org
3
Content of the Book:
1. 10 Objective Problem Sets with Solutions (Total Solved Problems : 300) for all ISI BSTAT
& BMATH Entrances.
2. 10 Subjective Problem Sets with Solutions (Total Solved Problems : 100) for all ISI BSTAT
& BMATH Entrances.
3. 175 Subjective Problems with Solutions (Total Solved Problems : 175) for ISI & CMI
Examination.
4. Topic-wise Objective & Subjective Solved Problems (Total Solved Problems: 425) for ISI &
CMI Entrances.
4
ISI B.STAT/B.MATH Alternatively, put p=5,n=100,thus from

OBJECTIVE QUESTIONS & above theorem we have
[100/5]+[100/25]=24 zeros as
SOLUTIONS
the answer.
SET – 1
3. Let P (x) be a polynomial of degree 11
𝟏
such that P (x) = 𝒙+𝟏 𝒇𝒐𝒓 𝒙 = 𝟎 (𝟏)𝟏𝟏.
1. How many zeros are at the end of
1000! ? Then P (12) = ?
(a) 240 (b) 248 𝟏
(c) 249 (d) None (a) 0 (b) 1 (c) (d) none of
𝟏𝟑
these
Ans:- (c) The number of two’s is enough
1
to match each 5 to get a 10. Ans:- (a) P (x)= 𝑥+1
So,
⇒ (x+1)[P (x)]-1 = c (x-0)(x-1)….(x-11)
1
5 ⟶ 200
Putting x= -1, 0- 1= c (-1)(-2)….(-12)
52 ⟶ 40 1
⇒ c = - 12!
53 ⟶ 8
1
∴ [P (x)](x+1)-1= - (x-0)(x-1)….(x-11)
4 12!
5 ⟶1
1
∴Thus, 1000! Ends with 249 zero’s. ⇒ P (12) 13-1 = - 12! 12 .11. ….2.1
[Theorem: (de Polinac's formula) ⇒ P (12) 13-1 = -1

Statement: Let p be a prime and e be the
⇒P (12) = 0.
largest exponent of p such that pe
divides n! , then e=∑ [n/pi ], where i is 4. Let s= {(𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 )| 0≤ 𝒙𝒊 ≤
running from 1 to infinity.] 𝟗 𝒂𝒏𝒅 𝒙𝟏 + 𝒙𝟐 + 𝒙𝟑 is divisible by 3}.
2. The product of the first 100 positive Then the number of elements in s is
integers ends with
(a) 334 (b) 333 (c) 327 (d)
(a) 21 zeros (b) 22 zeros (c) 23 336
zeros (d) 24 zeros.
Ans:- (a) with each (𝑥1 , 𝑥2 , 𝑥3 ) identify a
1
Ans:- 5 ⟶ 20 three digit code, where reading zeros are
(d) 24 zeros . allowed. We have a bijection between s and
the set of all non-negative integers less than
52 ⟶ 4
or equal to 999 divisible by 3. The no. of
5
numbers between 1 and 999, inclusive, (ii) Exactly one digit in each
999 number is even
divisible by 3 is ( ) = 333
3
The sum of all number in S is
Also, ‘0’ is divisible by 3. Hence, the
number of elements in s is = 333 + 1= 334. (a) 96100 (b) 133200 (c) 66600
(d) 99800
Ans:- (b) The sum of the digits in unit place

5. Let x and y be positive real number
of all the numbers in s will be same as the
with x< y. Also 0 < b< a < 1.
sum in tens or hundreds place. The only
𝒚
Define E = 𝐥𝐨𝐠 𝒂 (𝒙) + 𝐥𝐨𝐠 𝒃 (𝒚). Then E
𝒙 even digit can have any of the three
positions,
can’t take the value
i.e. 3𝑐1 ways.
(a) -2 (b) -1 (c) -√𝟐 (d) 2
And the digit itself has 4 choices (2, 4, 6 or
𝑦 𝑥
Ans :- (d) E =log 𝑎 (𝑥 ) + log 𝑏 (𝑦) 8). The other two digits can be filled in 5× 4
= 20 ways.
𝑦 𝑦
log log 𝑦 1 1
𝑥 𝑥
= − = log ( 𝑥 ) {log − log } Then the number of numbers in S = 240.
log𝑎 log𝑏 𝑎 𝑏
𝑦 log −log Number of numbers containing the even

= log ( 𝑥 ) {(log 𝑏)(log𝑎 )}
𝑎 𝑏 digits in units place = 4 × 5 × 4 = 80
𝑏
𝑦 log( ) The other 160 numbers have digits 1, 3, 5, 7
𝑎
= log ( 𝑥 ) . (log
𝑎 )(log𝑏 ) or 9 in unit place, with each digit appearing
𝑎
𝑦 log( ) 160
𝑏
= - log ( 𝑥 ) . (log = 32 times. Sum in units place = 32 (1+
𝑎 )(log𝑏 ) 5
3+ 5+ 7+ 9) + 20 (2+ 4+ 6+ 8)
Log 0< a < 1, 0< b <1 ∴ log 𝑎 and log 𝑏 are
4×5
both negative. = 32.52 + 20 × 2 × = 32× 25 + 20 ×
2
𝑦 𝑎 𝑦 20 = 1200
Also 𝑥 > 1 and 𝑏 > 1 . Thus log ( 𝑥 ) and
𝑎 ∴ Sum of all numbers= 1200 (1+ 10 +102 ) =
log ( 𝑏) are both positive. Finally E turns
1200× 111 = 133200.
out to be a negative value. So, E can’t take
the value ‘2’.
𝒙
6. Let S be the set of all 3- digits 7. Let y = 𝒙𝟐 +𝟏 , Then 𝒚𝟒 (𝟏)is equals
numbers. Such that (a) 4 (b) -3 (c) 3 (d) -4
(i) The digits in each number are
all from the set {1, 2, 3, …., 9} Ans:- (b) Simply differentiating would be
tedious,
6
So we take advantage of ‘i’ the square root ∴ 𝐴2008 = (𝐴4 )502 = 𝐴4 =

−1−𝑖√3
.
2
of ‘-1’
𝑥 1 1 1
y = 𝑥 2 +1 = {(𝑥−𝑖) + (𝑥+𝑖)
}
2
10. Let f(x) be the function f(x)=
𝑑4 𝑦 1 4! 4! 𝒙𝑷
= {(𝑥−𝑖)5 + } 𝒊𝒇 𝒙 > 0
𝑑𝑥 4 2 (𝑥−𝑖)5 {(𝒔𝒊𝒏𝒙)𝒒
𝟎 𝒊𝒇 𝒙 = 𝟎
𝑑𝑛 1 (−1)𝑛 𝑛!
Note that, 𝑑𝑥 𝑛 {𝑥+𝑎} = (𝑥+𝑎)𝑛+1
Then f(x) is continuous at x= 0 if
4! 1! 1!
So, 𝑦 4 (𝑥) = { + (𝑥−𝑖)5 } Then (a) p > q (b) p > 0 (c)
2 (𝑥−𝑖)5
q>0 (d) p < q
1! 1! 1−𝑖
𝑦 4 (1) = 12 {(𝑥−𝑖)5 + (𝑥−𝑖)5 } = 12 {(−2𝑖)3 +
𝑥𝑃
1−𝑖 1−𝑖 1−𝑖 1 1 Ans:- (b) |f(x) - f(0)| = |(𝑠𝑖𝑛𝑥)𝑞 − 0| ≤ |𝑥 𝑃 | <
} = 12 { 8𝑖 + } = 12 (-8 − 8) = -3.
(2𝑖)3 8𝑖
∊
1
Whenever |x-0| < ∊𝑝 = 𝛿 if p > 0.
8. A real 2× 2 matrix. M such that
−𝟏 𝟎 So, f(x)is continuous for p > 0 at x= 0.
𝑴𝟐 = ( )
𝟎 −𝟏−∊
(a) exists for all ∊ > 0
(b) does not exist for any ∊> 0 𝟏 𝒏
11. The limit 𝐥𝐢𝐦 𝐥𝐨𝐠(𝟏 − ) equals
𝒙→∞ 𝒏𝟐
(c) exists for same ∊> 0 𝟏
(d) none of the above (a) 𝒆−𝟏 (b) 𝒆−𝟐

(c) 𝒆−𝟐 (d) 1
Ans:- (b) since 𝑀2 is an diagonal matrix, so
1
𝑖 0 Ans:- (d) L = (1 − 𝑛2 )𝑛
M= [ ],
0 √1−∊
1
 𝑙𝑜𝑔𝐿 = 𝑛𝑙𝑜𝑔(1 − 𝑛2 )
So, M is not a real matrix, for any values of
1 1
∊. M is a non –real matrix.  lim 𝑙𝑜𝑔𝐿 = lim [−𝑛{𝑛2 + 2𝑛4 +
𝑥→∞ 𝑥→∞
𝟐𝟎𝟎𝟖 ⋯ ∞}] = 0
𝟏+𝒊√𝟑
9. The value of ( ) is
𝟐
∴L = 𝑒 0 = 1.
𝟏+𝒊√𝟑 𝟏−𝒊√𝟑
(a) (b) 12. The minimum value of the function
𝟐 𝟐
f(x, y)= 𝟒𝒙𝟐 + 𝟗𝒚𝟐 − 𝟏𝟐𝒙 − 𝟏𝟐𝒚 + 𝟏𝟒
−𝟏−𝒊√𝟑 −𝟏+𝒊√𝟑
(c) (d) is
𝟐 𝟐
(a) 1 (b) 3 (c) 14
1+𝑖√3 −1+𝑖√3
Ans:- (c) A = ( 2
), 𝐴2 = 2
, 𝐴4 = (d) none
−1−𝑖√3
= −𝐴
2
7
Ans:- (a) f(x, y) = 4𝑥 2 + 9𝑦 2 − 12𝑥 − = 2426 − 2326

12𝑦 + 14 < 2426
= (4𝑥 2 − 12𝑥 + 9)+( 9𝑦 2 − Also, R= 2426 − 2326 = (1 + 23)26 − 2326

12𝑦 + 4)+1
= 2326 + 26𝑐1 . 2325 + 26𝑐2 . 2324 + … + 1 −
2 2
= (2𝑥 − 3) + (3𝑦 − 2) + 2326
1 ≥1
= 26. 2325 +26𝑐2 . 2324 + … + 1 >26. 2325
So, minimum value of f(x, y) is 1. > 23. 2325 = 2326
13. From a group of 20 persons, ∴ 2326 < R < 2426
belonging to an association, A
president, a secretary and there 16. A function f is said to be odd if f (-x)=
members are to be elected for the -f (x) ∀ 𝒙. Which of the following is not
executive committee. The number of odd?
ways this can be done is (a) f (x+ y)= f(x)+ f(y) ∀ 𝒙, 𝒚
𝒙
(a) 30000 (b) 310080 𝒙𝒆 ⁄𝟐
(b) f (x)= 𝟏+ 𝒆𝒙
(c) 300080 (d) none
(c) f (x) = x - [x]
20!
Ans:- (b) 20𝑐1 × 19𝑐1 × 18𝑐3 𝑜𝑟 = (d) f (x) = 𝒙𝟐 𝐬𝐢𝐧 𝒙 + 𝒙𝟑 𝐜𝐨𝐬 𝒙
1!1!3!15!
310080 Ans:- (c) f (x+ y)= f(x)+ f(y) ∀ 𝑥, 𝑦
𝐜𝐨𝐬 𝒙−𝐬𝐞𝐜 𝒙
14. The 𝐥𝐢𝐦 is Let x = y = 0
𝒙⟶𝟎 𝒙𝟐 (𝟏+𝒙)
(a) -1 (b) 1 (c) 0
⇒ f (0) = f (0) + f (0)
(d) does not exist
cos 𝑥−sec 𝑥 − sin2 𝑥
∴ f (0)= 0
Ans:- (a) lim = lim
𝑥⟶0 𝑥 2 (1+𝑥) 𝑥⟶0 cos 𝑥 (𝑥 2 )(𝑥+1)
Replacing y with –x , we have
1 sin 𝑥 1
=- lim cos 𝑥 ( 𝑥 )2 . (𝑥+1) = -1. 1. 1 = - 1. f (x- x) = f(x) + f (-x)
𝑥⟶0
𝟒𝟖𝟓𝟐 − 𝟒𝟔𝟓𝟐 ⇒ f (0) = f(x) + f (-x)

15. Let R = 𝟗𝟔𝟐𝟔 + 𝟗𝟐𝟐𝟔 . Then R satisfies
(a) R < 1 (b) 𝟐𝟑𝟐𝟔 < R < 𝟐𝟒𝟐𝟔 ⇒ f(x) + f (-x) = 0
(c) 1 < R < 𝟐𝟑𝟐𝟔 (d) R >
⇒ f (-x) = -f(x)
𝟐𝟒𝟐𝟔
(2.24)52 − (2.23)52 252 (2452 −2352 )
Thus f is odd.
Ans:- (b) R= (4.24)26 + (4.23)26 = 426 (2426 + 2326 )
𝑥
𝑥𝑒 ⁄2
252 (2426 + 2326 )(2426 − 2326 ) Again for f (x) =
= 252 . 1+ 𝑒 𝑥
2426 + 2326
8
𝑥 𝑥 𝑥 4 524
(−𝑥)(𝑒 − ⁄2 ) (−𝑥)(𝑒 − ⁄2 ) .𝑒 𝑥 𝑥𝑒 ⁄2 ∴ a= −8 − =− .
f(-x)= = = - 1+ 𝑒 𝑥 = 65 65
1+ 𝑒 −𝑥 1+ 𝑒 𝑥
-f (x) 18. In a special version of chess, a rook
moves either horizontally or vertically
∴ f is odd.
on the chess board. The number of
f (x) = x- [x] is not odd. ways to place 8 rooks of different
colors on a 8×8 chess board such that
Counter example:- no rook lies on the path of the other
f (-2.3) = -2.3 – [-2.3] =-2.3 – (-3) = 3- 2.3 = rook at the start of the game is
0.7 (a) 8× ⎿𝟖 (b)⎿8 × ⎿𝟖 (c)
64
𝟐𝟖 × ⎿𝟖 (d) 𝟐𝟖 × ( 8 )
f (2.3) = 2.3 – [2.3] = 2.3 -2 =0.3
Ans:- The first rook can be placed in any
∴ f(2.3) ≠ f(-2.3) row in 8 ways & in any column in 8 ways.
Thus f is not odd So, it has 82 ways to be disposed off. Since
no other rook can be placed in the path of
f (x) = 𝑥 2 sin 𝑥 + 𝑥 3 cos 𝑥 the first rook, a second rook can be placed in
72 ways for there now remains only 7 rows
f(-x) = -𝑥 2 sin 𝑥 − 𝑥 3 cos 𝑥 = -f(x)
and 7 columns. Counting in this manner, the
∴ f is odd here. number of ways = 82 . 72 . 62 … 12 = (8!)2
17. Consider the polynomial 𝒙𝟓 + 𝒂𝒙𝟒 + 19. The differential equation of all the
𝒃𝒙𝟑 + 𝒄𝒙𝟐 + 𝒅𝒙 + 𝟒. If (1+2i) and (3- ellipses centered at the origin is
2i) are two roots of this polynomial (a) 𝒚𝟐 + 𝒙(𝒚′)𝟐 − 𝒚𝒚′ = 𝟎
then the value of a is (b) x y y″+ 𝒙(𝒚′)𝟐 − 𝒚𝒚′ = 𝟎
(a) -524/65 (b) 524/65
(c) y y″+ 𝒙(𝒚′)𝟐 − 𝒙𝒚′ = 𝟎
(c) -1/65 (d) 1/65
(d) none
Ans:- (a) The polynomial has 5 roots. Since 𝑥2 𝑦2
complex root occur in pairs, so there is one Ans:- (d) 2
+ = 1, after differentiating
𝑎 𝑏2
real root taking it as m. w.r.t x, we get
So, m, 1+2i, 1-2i, 3+2i, 3-2i are the five 2𝑥 2𝑦𝑦′ 𝑦𝑦′ 𝑥
⤇ 𝑎2 + =0⤇ = − 𝑎2
𝑏2 𝑏2
roots.
(𝑦′)2 𝑦(𝑦″) 1
Sum of the roots= − 1 = 8 + 𝑚.
𝑎 ⤇ + = − 𝑎2
𝑏2 𝑏2
𝑏2
Product of the roots= (1+4)(9+4)m= 65 ⤇(𝑦′)2 + 𝑦(𝑦″)2 = − 𝑎2 .
4
m=65
4
∴ m = 65.
9
20. If f(x)= x+ sinx, then find 𝐿𝑅 𝑃𝐿 𝛼−𝑎 𝑏

⟹ 𝑅𝑀 = 𝑄𝑀 ⟹ =𝑑
𝟐 𝟐𝝅 𝑐−𝛼
. ∫𝝅 (𝒇−𝟏 (𝒙) + 𝒔𝒊𝒏𝒙)𝒅𝒙
𝝅𝟐
(a) 2 (b) 3 ⟹ 𝛼d- 𝛼d= bc –𝛼b
(c) 6 (d) 9 𝑎𝑑+𝑏𝑐
⟹ 𝛼= 𝑏+𝑑
Ans:- (b) Let x= f(t) ⇒ dx= f′(t)dt
⟹ R divides LM internally in the ratio b : d
2𝜋 2𝜋
⇒ ∫𝜋 𝑓 −1 (𝑥)𝑑𝑥 = ∫𝜋 𝑡 f ′ (t)dt = 𝑏
(as 𝑑 > 0)
2𝜋
(t [f(t)])2π π − ∫𝜋 𝑓(t)dt = (4𝜋 2 − 𝜋2) −
2𝜋 22. A point (1, 1) undergoes reflection in
∫𝜋 𝑓(t)dt the x-axis and then the co-ordinate axes
𝝅
2𝜋 are roated through an angle of 𝟒 in
I= ∫𝜋 (𝑓 −1 (𝑥) +
2𝜋 2𝜋 anticlockwise direction. The final position
𝑠𝑖𝑛𝑥)𝑑𝑥 = ∫𝜋 𝑓 −1 (𝑥)𝑑𝑥 + ∫𝜋 𝑠𝑖𝑛𝑥𝑑𝑥 of the point in the new co-ordinate system
2𝜋 2𝜋 is-
= 3𝜋 2 − ∫𝜋 𝑓(t)dt + ∫𝜋 𝑠𝑖𝑛𝑥𝑑𝑥
(a) (0, √𝟐) (b) (0, −√𝟐)
2 2𝜋
= 3𝜋 − ∫𝜋 (𝑓(𝑥) − 𝑠𝑖𝑛𝑥)𝑑𝑥 (c) −√𝟐, 𝟎 (d) none of these
2𝜋 1
= 3𝜋 2 − ∫𝜋 𝑥𝑑𝑥 = 3𝜋 2 − 2 (4𝜋 2 − 𝜋 2 ) Ans:- . (b) Image of (1, 1) in the x-axis is
(1, -1). If (x, y) be the co-ordinates of any
3 point and (x’ , y’) be its new co-ordinates,
= 𝜋2
2
then x’ = x cos 𝜃+ y sin 𝜃,
2
⇒𝜋2 𝐼 = 3.
y’= y cos𝜃 – x sin 𝜃, where 𝜃 is the angle
through which the axes have been roated.
21. Let P= (a, b), Q= (c, d) and 0 < a < b <
c < d, L≡(a, 0), M≡(c, 0), R lies on x-axis 𝜋
Here 𝜃= 4 , x= 1, y= -1
such that PR + RQ is minimum, then R
divides LM ∴ x’= 0, y’= -√2
(a) Internally in the ratio a: b 23. If a, 𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒌 and b, 𝒚𝟏 , 𝒚𝟐 , … , 𝒚𝒌
(b) internally in the ratio b: c from two A.P. with common difference m
(c) internally in the ratio b: d and n respectively, then the locus of point
∑𝒌𝒊=𝟏 𝒙𝟏 ∑𝒌𝒊=𝟏 𝒚𝟏
(d) internally in the ratio d: b (x, y) where x= 𝒊𝒔 𝒂𝒏𝒅 𝒚 = is
𝒌 𝒌
Ans:- (c) Let R = (𝛼, 0). PR+RQ is least (a) (x-a)m= (y-b)n
⟹ PQR should be the path of light (b) (x-m) a= (y-n) b
⟹ 𝛥 PRL and QRM are similar (c)(x-n)a = (y-m)b

(d) (x-a) n-(y-b) m
10
Ans:- (d) (a) 𝒆𝟐 (b) 3

𝑘 (c) √𝟓 (d) √𝟖
(𝑥 +𝑥𝑘 ) 𝑥1 +𝑥𝑘 𝑎+𝑚+𝑎 𝑚𝑘
2 1
X= = = 3 3 3
𝑘 2 2 1 1
Ans. (d) √8 = 22 = (2)−2 = (1 − 2)−2
(𝑘+1)𝑚
𝑜𝑟, 𝑥 = 𝑎 + 2 3 3
1 3 (− )(− −1) 1
= 1+ (2) (2) + 2 2
(− 2)2 + ⋯
or, 2(x-a)= (k+1)m ……………..(1) 2!
3 3.5 3.5.7
Similarly, = 1+4 + 4.8 + 4.8.12 + ⋯
2(y-b)= (k+ 1)n ……………….(2) 26. If f(x) = cos x+ cos ax is a periodic

function, then a is necessarily
We have to eliminate k
(a) an integer (b) a rational number
From (1) and (2)
(c) an irrational number (d) an event
𝑥−𝑎 𝑚 number
=
𝑦−𝑏 𝑛
Ans. (b) Period of cos x= 2𝜋 and period of
or, (x- a)n = (y -b)m 2𝜋
cos ax= |𝑎|
24. The remainder on dividing 𝟏𝟐𝟑𝟒𝟓𝟔𝟕 +
2𝜋 2𝜋
𝟖𝟗𝟏𝟎𝟏𝟏 by 12 is Period of f(x) = L.C.M. of 𝑎𝑛𝑑 =
1 |𝑎|
𝐿.𝐶.𝑀.𝑜𝑓 2𝜋 𝑎𝑛𝑑 2𝜋
(a) 1 (b) 7 𝐻.𝐶.𝐹.𝑜𝑓 1 𝑎𝑛𝑑 |𝑎|
(c) 9 (d) none
Since k= H.C.F. of 1 and |a|
Ans:- ( c) 1234≡1 (mod 3)⇒ 1234567 ≡
1 |𝑎|
1 (𝑚𝑜𝑑 3)𝑎𝑛𝑑 89 ≡ −1(𝑚𝑜𝑑3) ∴ 𝑘= an integer= m (say) and = an integer
𝑘
⇒ 891011 ≡ −1 (𝑚𝑜𝑑 3) = n (say)

𝑛 𝑛
∴ 1234567 + 891011 ≡ 0 (𝑚𝑜𝑑 3) ∴ |a|=𝑚 ⟹ 𝑎 = ± 𝑚 = a rational number.
Here 1234 is even, so 1234567 ≡ 27. Let f : R⟶ R defined by f(x)= 𝒙𝟑 +

0(𝑚𝑜𝑑 4)𝑎𝑛𝑑 89 ≡ 1 (𝑚𝑜𝑑 4) 𝒙𝟐 + 𝟏𝟎𝟎𝒙 + 𝟓 𝐬𝐢𝐧 𝒙, then f is
⇒ 891011 ≡ 1 (𝑚𝑜𝑑 4) (a) many-one onto (b) many-one into

(c) one-one onto (d) one-one into
Thus 1234567 + 891011 ≡ 1 (𝑚𝑜𝑑 4)
Ans. (c)
Hence it is 9 (mod 12)
𝑓(𝑥) = 𝑥 3 + 𝑥 2 + 100𝑥 + 5 sin x
𝟑 𝟑.𝟓
25. The sum of the series 1+𝟒 + 𝟒.𝟖 +
𝟑.𝟓.𝟕 ∴ f’(x)= 3𝑥 2 + 2𝑥 + 100 + 5 cos 𝑥
+ ⋯ is
𝟒.𝟖.𝟏𝟐
= 3𝑥 2 + 2𝑥 + 94 + (6 + 5 𝑐𝑜𝑠𝑥) > 0
11
∴ f is an increasing function and 29 . If k be the value of x at which the

consequently a one –one function. function
𝒙
Clearly f(−∞)=−∞ , f(∞)=∞ and f(x) is f(x) =∫−𝟏 𝒕(𝒆𝒕 − 𝟏)(𝒕 − 𝟏)(𝒕 − 𝟐)𝟑 (𝒕 −
continuous, therefore range f= R= co 𝟑)𝟓 𝒅𝒕 has maximum value and sinx +
domain f. Hence f is onto. cosecx = k, then for n ∊N, 𝒔𝒊𝒏𝒏 𝒙 +
𝒔𝒊𝒏𝟏𝟎𝟏 𝒙 𝒄𝒐𝒔𝒆𝒄𝒏 𝒙 = …
28. Let f(x) = 𝒙 𝟏 , where [x] denotes
[ ]+
𝝅 𝟐
(a) 2 (b) -2
the integral part of x is 𝝅
(c) 𝟐 (d) 𝜋
(a) an odd function
(b) an even function Ans. (a) f’(x) = 𝑥(𝑒 𝑥 − 1)(𝑥 − 1)(𝑥 −
2)3 (𝑥 − 3)5
(c) neither odd nor even function
(d) both odd and even function By Sign Rule we get
Ans. (a) when x= n𝜋, n 𝜖 I, sin x = 0 and f(x) has max. at x = 2

𝑥 1
[𝜋 ] + 2 ≠ 0 ∴k=2
∴ f(x) = 0 Now sin x + cosec x = k ⟹ sin x + cosec x

=2
∴ when x = n𝜋, f(x)= 0 and f(-x)= 0
⟹(sin 𝑥 − 1)2 = 0 ⟹ sin 𝑥 = 1
∴ f(-x)= f(x)
∴ cosec x = 1
𝑥
When x ≠ 𝑛𝜋, 𝑛 𝜖 𝐼, 𝜋 ≠ 𝑎𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟
Hence 𝑠𝑖𝑛𝑛 𝑥 + 𝑐𝑜𝑠𝑒𝑐 𝑛 𝑥 = 2
𝑥 𝑥 𝑥 𝑥
∴ [ ] + [− ] = −1 ∴ [− ] = −1 − [ ] 30. If f(x+ y) = f(x) + f(y) – xy – 1for all x,
𝜋 𝜋 𝜋 𝜋
y ∊R and f(1)=1, then the number of
𝑥 1 𝑥 1 𝑥 1
⟹ [− ] + = − [ ] − = − ([ ] + ) solutions of f(n)= n, n ∊N is
𝜋 2 𝜋 2 𝜋 2
𝑠𝑖𝑛101 (−𝑥) − sin 𝑥
(a) 0 (b) 1 (c)
Now 𝑓(−𝑥) = 𝑥 1 = 𝑥 1 = 2 (d) more than 2
[− ]+ −([ ]+ )
𝜋 2 𝜋 2
sin 𝑥
𝑥 1 = 𝑓(𝑥) Ans. (b)
[ ]+
𝜋 2
Given f(x+ y)= f(x)+f(y) - xy - 1 ∀ 𝑥, 𝑦, 𝜖 𝑅

Hence in all cases f(-x)= f(x)
……………(1)
f(1)= 1 ……………..(2)
f(2) = f(1+1)= f(1)+f(-1)-1-1= 0
f(3 )= f(2+1)= f(2)+f(1)-2.1-1= -2
12
f(n+1) = f(n) +f(1) – n – 1 = f(n)- n< f(n) Ans:- (c) 𝐸 2 = 1 + 𝑎 +

1 1 1
+ 𝑎𝑏 =
𝑎+𝑏+1
+
𝑏 𝑎𝑏
𝜆+1
Thus f(1) > f(2) > f(3)> …and f(1)= 1 1= 1+ , it will be minimum when ab
𝑎𝑏
is maximum. Now we know that if sum of
∴f(1)= 1 and f(n)< 1, for n> 1
two quantities is constant, then their product
Hence f(n)= n, n 𝜖 N has only one solution is maximum when the quantities are equal.
n= 1 𝜆
∴ a+ b = 𝜆 ⇒a = b = 2
𝜆+1 𝜆+2 2 2
∴ 𝐸2 = 1 + 𝜆2
=( ) ⇒ E = 1+ 𝜆,
ISI B.STAT/B.MATH 4
𝜆
OBJECTIVE QUESTIONS & which is the required result.

SOLUTIONS
1 1
Alternative: (c) √(1 + 𝑎) (1 + 𝑏) will
SET – 2
minimum when a and b will take the
maximum value.
1. 𝒂𝟏 = 𝒂𝟐 = 𝟏, 𝒂𝟑 = −𝟏, 𝒂𝒏 = a+b = 𝜆, then the max. Value of a and b is

𝜆
𝒂𝒏−𝟏 . 𝒂𝒏−𝟑 . The value of 𝒂𝟏𝟗𝟔𝟒 is a= b=2,
(a) 1 (b) -1
(c) 0 (d) none 1 1
Putting these, we get, √(1 + 𝑎) (1 + 𝑏)
Ans:- (b) 𝑎1 = 𝑎2 = 1, 𝑎3 = 𝑎4 = 𝑎5 = 2 2 2
−1, 𝑎6 = 1, 𝑎7 = −1 min = √(1 + 𝜆) (1 + 𝜆) = 1+ 𝜆.
+1, +1, −1, −1, −1, 1, −1 ,

⏟
1, 1, −1, −1, −1, 1, −1, …………
⏟
3. The number of pairs of integers (m, n)
Since 1964= (7×280)+4= 7×280 +4. Thus satisfying 𝒎𝟐 + 𝒎𝒏 + 𝒏𝟐 = 1 is
we have 𝑎1964 = -1. (a) 8 (b) 6
(c) 4 (d) 2
2. If a, b are positive real variables
whose sum is a constant 𝜆, then the Ans:- (b) Consider 𝑚2 + 𝑚𝑛 + 𝑛2 − 1
𝟏 𝟏 The equation is symmetric in m and n, we
minimum value of √(𝟏 + 𝒂) (𝟏 + 𝒃)
make the substitution
is
𝟏 𝟐 u = m + n and v= m- n
(a) 𝜆 - 𝝀 (b) 𝜆 + 𝝀
𝟐
(c) 1+ 𝝀 (d) none So that 𝑢2 + 𝑣 2 = 2 (𝑚2 + 𝑛2 ), 𝑢2 −
𝑣 2 = 4𝑚𝑛
13
Multiplying the given equation by 4, we 5. The great common divisor (gcd) of

have 𝟐𝟐 𝟐𝟐𝟐
𝟐𝟐 + 𝟏 𝒂𝒏𝒅 𝟐𝟐 + 𝟏 is
𝟐𝟐
4𝑚2 + 4𝑚𝑛 + 4𝑛2 = 4 (a) 1 (b) 𝟐𝟐 +𝟏
𝟐 𝟏𝟏
(c) 𝟐 −𝟏 (d)
⇒ 4 (𝑚2 + 𝑛2 ) + 4mn = 4
𝟐 𝟐𝟏
𝟐 −𝟏
2 2 2 2
⇒ 2 (𝑢 + 𝑣 ) + 𝑢 − 𝑣 = 4 𝑛
Ans:- (a) let 𝐹𝑛 = 22 + 1 , with m > n
⇒3𝑢2 + 𝑣 2 = 4
𝑛 𝑛
𝐹𝑛 − 2 = 22 + 1 − 2 = 22 − 1 =
Set 𝑢2 = 𝑥, 𝑣 2 = 𝑦 with x, y ≥ 0, then we 𝑛−1 2 𝑛−1 𝑛−1
(22 ) − 1 = (22 + 1)( 22 − 1)
get 3x+ y= 4
𝑛−1 𝑛−2
= (22 + 1) (22 −
The ordered pairs (x, y) satisfying the above
2 𝑛−2 2𝑚 2𝑚
equation in integers are (0, 4) and (1, 1). 1)( 2 + 1) =( 2 + 1) (2 − 1)
2 𝑚−𝑛−1
(2 + 1)
We have,
= 𝜆 𝐹𝑚 ; Now, 𝐹𝑛 − λ 𝐹𝑚 =2
𝑢2 = 0 and 𝑢2 = 1 & 𝑣 2 = 4, and 𝑣 2 = 1
Let d | 𝐹𝑛 and d |𝐹𝑚 then d|2. Then d= 1 or 2.
I.e. u= 0, v= 2; u=0, v= -2; But 𝐹𝑚 & 𝐹𝑛 are both odd, hence gcd = 1.
u=1, v= 1; u =1, v= -1;
6. The number of real roots of the
𝒙 𝒙𝟐 𝒙𝟑 𝒙𝟕
u =-1, v =1; u = -1, v= -1; equation 1+ + + +⋯+ =0
𝟏 𝟐 𝟑 𝟕
Giving 6 ordered pair solutions (m, n) viz (1, (without factorial) is

-1), (-1, 1), (1, 0), (0, 1), (0, -1), (-1, 0)
(a) 7 (b) 5
4. The sum of the digits of the number (c) 3 (d) 1
𝟏𝟎𝟎𝟏𝟑 − 𝟐𝟔, written in decimal
notation is Ans:- (d) let f has a minimum at x = 𝑥0 ,
(a) 227 (b) 218 where then f′(𝑥0 ) = 0
(c)228 (d) 219
𝑥 𝑥2 𝑥3 𝑥6
f (x)= 1+ 1 + + +⋯+ ;
2 3 6
Ans:- (a) 1026 − 26 = ⏟
100 … . .0 − 26
⇒ 1+ 𝑥0 + 𝑥0 2 + 𝑥0 3 + 𝑥0 4 + 𝑥0 5 = 0
=⏟
999 … .974
𝑥0 6 −1
⇒ =0
with 24 9’s 𝑥0 −1
(𝑥0 3 −1)(𝑥0 3 +1)

∴ The sum of the digits = 24 × 9 + 7 + 4 = ⇒ =0
𝑥0 −1
227.
⇒ (𝑥0 2 + 𝑥0 + 1)( 𝑥0 2 − 𝑥0 + 1)( 𝑥0 +
1)= 0
14
Which has a real root 𝑥0 = -1 divisibility by 8, the last three digits must be
divisible by 8.
1 1 1 1 1
But, f (-1)= 1-1 + (2 − 3)+ (4 − 5) +6 > 0
i.e. 800+ 90+b |8.
The f (x)> 0 and hence f has no real zeros.
so (b+2)| 8 ; ∴ b = 6
𝑥 𝑥2 𝑥3 𝑥7
Now let, g (x)= 1+ 1 + + + ⋯+ For divisibility by 9, the sum of the digits A
2 3 7
+ 7 +3 +8+ 9 +b should be divisible by 9.
An odd degree polynomial has at least one
real root. i.e. a+ 7+ 3+ 8+ 9+ 6≡ 0 (mod 9)
If our polynomial g has more than one zero, ⇒ a+ 6 ≡ 0 (mod 9)

say 𝑥1 , 𝑥2
⇒ a ≡ -6(mod 9)
Then by Role’s theorem in (𝑥1 , 𝑥2 ) we have
‘𝑥3 ’ such that g′ (𝑥3 ) = 0 ⇒ a ≡ 3 (mod 9)
⇒ 1+ 𝑥3 + 𝑥3 2 + ⋯ + 𝑥3 6 = 0 ∴ a= 3 only. Hence a+ b= 9
But this has no real zeros. Hence the given 9. 3 balls are distributed to 3 boxes at
polynomial has exactly one real zero. random. Number of way in which we
set at most 1 box empty is (a) 20
7. Number of roots between –𝜋 and 𝜋 of (b) 6 (c) 24 (d) none
𝟐
the equation 𝐬𝐢𝐧 𝒙. 𝒙= 1 is
𝟑 Ans:- (c) zero box empty + 1 box empty
(a) 1 (b) 2
(c) 3 (d) 4 = 3 balls in 3 boxes + {3C1 × 3 balls in 2
boxes}
3
Ans:- (d) sin 𝑥 = 2𝑥
= 3! + 3× (3)2 = 24.
3
Now, draw the curve of y= sin 𝑥 and y = 2𝑥
or xy = 3⁄2
10. The value of 𝐌𝐚𝐱 𝑰 (𝒂), 𝒘𝒉𝒆𝒓𝒆 𝑰(𝒂) =
𝒂
∴ there are 4 real roots. (Draw the graph 𝒂+𝟏
∫𝒂−𝟏 𝒆−|𝒙| 𝒅𝒙 is
yourself)
(a) ea (b) 2- 𝒆𝒂−𝟏 − 𝒆𝒂+𝟏
8. The number 𝒂𝟕𝟑𝟖𝟗𝒃 , a, b are digits, is (c) 𝒆𝒂−𝟏 − 𝒆𝒂+𝟏 (d) none
divisible by 72 , Then a+ b equals 𝑎
Ans:- (b) 𝐼 (𝑎) = ∫𝑎−1 𝑒 −|𝑥| 𝑑𝑥 +
(a) 10 (b) 9
𝑎+1 −|𝑥|
(c) 11 (d) 12 ∫𝑎 𝑒 𝑑𝑥
Ans:- (b) 72 = 8× 9, and 8 and 9 are co 𝑎 0

Let 0< a< 1 , then ∫𝑎−1 𝑒 −|𝑥| 𝑑𝑥 = ∫𝑎−1 𝑒 𝑥 𝑑𝑥
prime. As the number 𝑎7389𝑏 is divisible by 𝑎−1 −𝑥
+∫0 𝑒 𝑑𝑥
72, it is divisible by 9 and 8 both. For
15
= 1- 𝑒 𝑎−1 − (𝑒 −𝑎 − 1) ∴ 𝜃= 0, 𝜋, 2𝜋
𝑎+1 −|𝑥| Hence 3 roots are three between [0, 2𝜋]
And, ∫𝑎 𝑒 𝑑𝑥 = 𝑒 −𝑎 − 𝑒 −𝑎−1
𝟏 𝟏 𝟏
∴ I (a) = 2 - (𝑒 𝑎−1 + 𝑒 −𝑎−1 ) 13. If 𝒖𝒏 = + 𝟐(𝒏−𝟏) + 𝟑 (𝒏−𝟐) +
𝟏.𝒏
𝟏
𝑑 … . . + (𝒏−𝟏) ; Then 𝐥𝐢𝐦 𝒖𝒏 equals
∴ 𝑑𝑥 𝐼 (𝑎) = 0 𝒏⟶∞
(a) 0 (b) 1
𝑎−1 −𝑎+1
⇒𝑒 =𝑒 (c) ∞ (d) π
⇒ a= 0 1 1
Ans:- (a) 𝑢𝑛 = [(1 + 𝑛) +
(𝑛+1)
𝑎 1 1 1 1 1
Also, -1 < a < 0 ; ∫𝑎−1 𝑒 𝑥 𝑑𝑥 𝑎
= 𝑒 −𝑒 𝑎−1
(2 + 𝑛−1) + (3 + 𝑛−2) + ⋯ + (𝑛 + 1)]
𝑎+1 −|𝑥| 0 𝑎+1 −𝑥 1 1 1
And ∫𝑎 𝑒 𝑑𝑥 = ∫𝑎 𝑒 𝑥 𝑑𝑥 + ∫0 𝑒 𝑑𝑥 = (𝑛+1) 2 (1 + + ⋯ + 𝑛)
2
= (1- 𝑒 𝑎 ) – (𝑒 𝑎+1 − 1) 1 1
1+ + +⋯+
1
2 3 𝑛 𝑛
∴ lim 𝑢𝑛 = 2 lim . lim =
𝑎 𝑎+1 𝑛⟶∞ 𝑛⟶∞ 𝑛 𝑛⟶∞ 𝑛+1
= 2 -𝑒 − 𝑒
2. 0.1= 0.
𝑎−1 𝑎+1
∴ I (a) = 2- 𝑒 −𝑒 𝟏 𝟏
14. If x+ (𝒙) = -1, The value of 𝒙𝟗𝟗 + (𝒙𝟗𝟗 )
∴ I(a) is maximum at a = 0. is
𝟏 (a) 1 (b) 2
11. The value of ∏∞
𝒏=𝟐(𝟏 − 𝒏𝟐 ) is
(c) 0 (d) none
(a) 1 ( b) 0 (c) ½
1
(d) none Ans:- (b) If 𝑎𝑛 = 𝑥 𝑛 + 𝑥 𝑛
1
Ans:- (c) ∏∞ ∞
𝑛=2 (1 − 𝑛2 ) =∏𝑛=2 (1 + Then, 𝑎𝑛+1 = 𝑎𝑛 . 𝑎1 − 𝑎𝑛−1 𝑓𝑜𝑟 𝑛 ≥ 1
1 1 𝑛+1 𝑛−1
) (1 − 𝑛) = ∏∞
𝑛=2 . 𝑎0 = 2 , 𝑎2 = −𝑎1 − 𝑎0 = −1, 𝑎3 = 2, 𝑎4
𝑛 𝑛 𝑛
= −1, 𝑎5 = 2, 𝑎1 = −1 ; 𝑎𝑛
2+1 2−1 3+1 3−1
=( . )( . )……… = = −1, 𝑎𝑛−1 = −1.
2 2 3 3
3 1 4 2 1
. . . ……. = 2 .
2 2 3 3 𝑠𝑜 , 𝑎99 = 2
12. 𝒄𝒐𝒔𝟖 𝜽 − 𝒔𝒊𝒏𝟖 𝜽= 1. Number of roots 1 1
Or , ∴𝑎𝑛+1 = 𝑥 99 + 𝑥 99 = (𝑥 98 + 𝑥 98 ) (𝑥 +
are there in between [0, 2𝜋] is
1 1
(a) 1 (b) 2 (c) ) − (𝑥 97 + 𝑥 97 )
𝑥
3 (d) 0
= - 𝑎𝑛 − 𝑎𝑛−1 = +1 + 1 = 2
Ans:- (c) Note that , 𝑐𝑜𝑠 8 𝜃 = 1 + 𝑠𝑖𝑛8 𝜃 is
possible only if, 15. Consider the equation of the form𝒙𝟐 +
𝒃𝒙 + 𝒄 = 𝟎. The number of such,
𝑐𝑜𝑠 8 𝜃 = 1 𝑎𝑛𝑑 𝑠𝑖𝑛8 𝜃 =0 equations that have real roots and
16
have coefficients b and c in the set {1, Ans:- (c) 𝑓 ″ (𝑥) = 4 = 𝑐𝑜𝑛𝑠𝑡𝑎𝑛𝑡
2, 3, 4, 5,6} , (b may be equal to c) is
(a) 16 (b) 19 ⇒ f(x)= 2𝑥 2 + 𝑎𝑥 + 𝑏
(c) 21 (d) none f(0)= 1 ⇒ b= 1
Ans:- (b) Let 𝑥 2 + 𝑏𝑥 + 𝑐 = 0 has real f(1)= 3+ a
roots, then 𝑏 2 − 4𝑐 ≥ 0, and also , s= {1, 2,
3, 4, 5, 6}. f(x) ≥f(1) ⇒ f′(1)=0
Now 𝑠1 = {4, 8, 12, 16, 20, 24}= set of ⇒ 4+ a= 0

possible values of 4c.
⇒ a = -4
Thus the number of equations will be same
∴ f(x)= 2𝑥 2 + 4𝑥 + 1
as the number of pairs of elements (𝑎1 , 𝑎2 ),
∴ f(2)= 1.
𝑎1 ∊ s, 𝑎2 ∊𝑠1 such that
𝟏−𝟑𝑷 𝟏+𝟒𝑷 𝟏+𝑷
𝑎1 2 − 4𝑎2 ≥ 0, i.e. 1+ 2+ 4+ 6+6 = 19 18. Let , , are the
𝟐 𝟑 𝟔
probabilities of 3 mutually exclusive
16. If f: R ⟶R, satisfies f(x +y)= and exhaustive events, then the set of
f(x)+f(y)∀ 𝒙, 𝒚 ∊ ℝ and f(1)=7, all values of P is
then∑𝒏𝒓=𝟏 𝒇(𝒓) is (a) [-1/4, 1/3] (b) (0, 1)
𝟕 (𝒏+𝟏)
(a) (b) 7n (n+1) (c) (0, ∞) (d) none
𝟐
𝟕 𝒏(𝒏+𝟏)
(c) (d)none 1−3𝑃 1+4𝑃 1+𝑃
𝟐 Ans:- (a) ≥ 0, ≥ 0, ≥ 0 and
2 3 6
Ans:- (c) putting x= 1, y=0, then f(1)= 1 − 3𝑃 1 + 4𝑃 1 + 𝑃
f(1)+f(0) + + =1
2 3 6
⇒f(0)=0, ⇒ f(1)=7 1 1 1 1
⇒− 4 ≤ 𝑃 ≤ 3 ⇒ 𝑃 ∊ [− 4 , 3]
Again , putting x=1, y=1, then f(2)= 2f(1)=
𝝅 𝒙
14, similarly, 19. If √𝟓𝒙 − 𝒙𝟐 − 𝟔 + 𝟐 ∫𝟎 𝒅𝒕 >
𝝅
𝑥 ∫𝟎 𝐬𝐢𝐧𝟐 𝒕𝒅𝒕, then x ∊
f(3)=21 and so on.
(a) (2, 3) (b) (-∞, 𝟐) ∪ (𝟑, ∞)
7 𝑛(𝑛+1)
∑𝑛𝑟=1 𝑓(𝑟)= 7 {1+ 2+ 3+…..+ n}= . (c) (5/2 , 3) (d) none
2
𝜋𝑥
17. Let f(0)= 1, 𝐥𝐭 𝒇″ (𝒙) = 𝟒 𝒂𝒏𝒅 𝒇(𝒙) ≥ Ans:- (a) √5𝑥 − 𝑥 2 − 6 + >
2
𝒙→∞ 𝜋
1
𝒇(𝟏). Let f(x) is polynomial ∀ x∊ℝ. 𝑥 {2 ∫0 (1 − 𝑐𝑜𝑠2𝑡)𝑑𝑡}
The value of f(2) is
𝜋𝑥 1
(a) 4 (b) 0 ⤇ √5𝑥 − 𝑥 2 − 6 + > 𝑥 {2 (𝑡 −
2
(c) 1 (d) none 1
sin 2𝑡) 𝜋0}
2
17
𝜋𝑥 𝜋𝑥
⤇√5𝑥 − 𝑥 2 − 6 + > Taking dot product with c⃗ on both sides, we
2 2
get
⤇ √5𝑥 − 𝑥 2 − 6 > 0
a⃗. c⃗ = b⃗ .c⃗
2
⤇𝑥 − 5𝑥 + 6 < 0,
22. Let f(x)=
⤇ (x-2)(x-3)< 0, i.e. , x ∊ (2, 3). 𝒙|𝒙|; 𝒙 ≤ −𝟏
{[𝒙 + 𝟏] + [𝟏 − 𝒙]; −𝟏 < 𝑥 < 1
20. If f(x)= (𝟒 + 𝒙)𝒏 , n ∊ N and 𝒇𝒓 (𝟎) −𝒙 |𝒙|; 𝒙 ≥𝟏
represents the 𝒓𝒕𝒉 derivative of f(x) at 𝟐
𝒇𝒓 (𝟎) Then the value of ∫−𝟐 𝒇(𝒙)𝒅𝒙 is
x= o, then the value of ∑∞𝒓=𝟎 𝒓! =
𝒏 𝒏
(a) 𝟐 (b) 𝒆 (c) (a) - 𝟑
𝟖 𝟕
(b) - 𝟑
𝟓𝒏 (d) none 𝟕
(c) (d) none
𝟑
𝑛−1
Ans:- (c) f′(x)= n (4 + 𝑥)
−𝑥 2 , 𝑥 ≤ −1
𝑛−2
f″(x)= n (n-1) (4 + 𝑥) 1 , −1<𝑥 <0
Ans:- (a) f(x) = 2 , 𝑥=0
𝑓 𝑟 (𝑥)= n (n-1)….. (n- r+1) . (4 + 𝑥)𝑛−𝑟 , r 1 , 0<𝑥<1
≤𝑛 { 𝑥2 , 𝑥 ≥1
𝑛! 2
𝑓 𝑟 (0)= (𝑛−𝑟)! . 4𝑛−𝑟 , r ≤ 𝑛 ∴ f(x) is an even function, i.e. ∫−2 𝑓(𝑥)𝑑𝑥 =
2
2 ∫0 𝑓(𝑥)𝑑𝑥
= 0, r >𝑛
1 2
𝑓 𝑟 (0) = 2 {∫0 𝑓(𝑥)𝑑𝑥 + ∫1 𝑓(𝑥)𝑑𝑥 }
∴∑∞
𝑟=0 = ∑𝑛𝑟=0(𝑛𝑟). 4𝑛−𝑟 = (1 + 4)𝑛 =
𝑟!
5𝑛 . 𝑥3 2 8
= 2 (1 − )1 = − 3 .
3
21. The two lines r⃗ = a⃗ + 𝜆(b⃗ +c⃗) and r⃗
= b⃗ + 𝜇(c⃗ +a⃗) intersects at a point, 23. Area bounded by y = g(x), x-axis and
the lines x= - 2,
where 𝜆 and 𝜇 are scalars, then
Where g (x)=
(a) a⃗, b⃗ and c⃗ are non-coplanar
𝐦𝐚𝐱{ 𝒇(𝒕): −𝟐 ≤ 𝒕 ≤ 𝒙}, 𝒘𝒉𝒆𝒓𝒆 − 𝟐 ≤ 𝒙 < 0;
(b) |a⃗| = |b⃗| = |c⃗| {
𝐦𝐢𝐧{ 𝒇(𝒕): 𝟎 ≤ 𝒕 ≤ 𝒙}, 𝒘𝒉𝒆𝒓𝒆 𝟎 ≤ 𝒙 ≤ 𝟑
(c) a⃗.c⃗ = b⃗.c⃗
And f(x)= 𝒙𝟐 − |𝒙|, is equal to
(d) 𝜆(b⃗×c⃗) + 𝜇(c⃗×a⃗)=c⃗
𝟏𝟏𝟑 𝟏𝟏𝟏
Ans. (c) (a) (b)
𝟐𝟒 𝟐𝟒
𝟏𝟏𝟕
(c) (d) none
The two lines intersect 𝟐𝟒
∴ a⃗ + 𝜆(b⃗ × 𝑐⃗) = 𝑏⃗⃗ + 𝜇(𝑐⃗ × 𝑎⃗)
18
Ans:- (a) g(x)= Ans:- (b) Let (h, h) be the centre of the
2 ; −2 ≤ 𝑥 < 0 required circle.
2 1
{𝑥 − 𝑥 ; 0≤𝑥≤2 𝜋
1 1 ∴∠COD= ∠CBE= 4 , CB= h+ 2 AND BD=
−4 ; <𝑥≤3
2 h- 2.
1
0 h− 2 𝜋 1
∴ Required area = ∫−2 2𝑑𝑥 + ∫02(𝑥 − ∴ h+ 2 = 𝑐𝑜𝑠 4 = ,
√2
3 1 113
𝑥 2 )𝑑𝑥 + ∫1 (4) 𝑑𝑥 = 𝑢𝑛𝑖𝑡 2
2 24 2(√2+1)
⤇ h= = 2(3 + 2√2) .
(√2−1)
26. Tangents and normal drawn to

24. Total number of positive integral parabola at A (𝒂𝒕𝟐 , 𝟐𝒂𝒕), 𝒕 ≠ 𝟎 meet
values of n such that the equations the X- axis at point B and D,
𝐜𝐨𝐬 −𝟏 𝒙 + (𝐬𝐢𝐧−𝟏 𝒚)𝟐 = respectively. If the rectangle ABCD is
𝒏𝝅𝟐 𝝅𝟐
𝒂𝒏𝒅 (𝐬𝐢𝐧−𝟏 𝒚)𝟐 − 𝐜𝐨𝐬 −𝟏 𝒙 = 𝟏𝟔 (a) y-2a= 0 (b) y+ 2a= 0
𝟒
are constant, is equal to (c) x-2a= 0 (d) none
(a) 1 (b) 2 Ans:- (c) Evolution of tangent & normal at
(c) 3 (d) none A are 𝑦 𝑡 = 𝑋 + 𝑎𝑡 2 , 𝑦 = −𝑡𝑥 + 2𝑎𝑡 + 𝑎𝑡 3 .
4𝑛+1
Ans:- (a) Here 2 (sin−1 𝑦)2 = 𝜋2 ∴ B = (-𝑎𝑡 2 , 0) and D= (2a+ 𝑎𝑡 2 , 0)
16
4𝑛+1 𝜋2 Suppose ABCD is rectangle,

⤇0≤ 𝜋2 ≤ ,
16 4
1 7
Then midpoints of BD and AC will be
⤇ -4 ≤ 𝑛 ≤ 4. coincident,
Also. 2(cos −1 𝑥)=

4𝑛−1
𝜋2 ∴ h+𝑎𝑡 2 = 2𝑎 + 𝑎𝑡 2 − 𝑎𝑡 2 𝑎𝑛𝑑 𝑘 +
16
2𝑎𝑡 = 0
4𝑛−1
⤇0≤ 𝜋 2 ≤ 𝜋,
16 i.e. h= 2a, k= -2at.
1 8
⤇4 ≤ 𝑛 ≤ 𝜋 + 1. Hence, the locus is X= 2a, i.e. X-2a=0.
𝟏
Hence, the least positive integral value of n 27. The series ∑∞
𝒌=𝟐 ( ) converges to
𝒌(𝒌−𝟏)
is 1.
(a) -1 (b) 1 (c)
25. Radius of bigger circle touching the 0 (d) does not
circle 𝒙𝟐 + 𝒚𝟐 − 𝟒𝒙 − 𝟒𝒚 + 𝟒 = 𝟎 and converges
both the 𝑛 1 1
Ans:- (b) 𝑠𝑛 = ∑∞
𝑘=2 𝑘(𝑘−1) = ∑𝑘=2((𝑘−1) −
co-ordinate axis is
1 1
(a) 3+2√𝟐 (b) 2(3+2√𝟐) 𝑘
) = (1 − 𝑛)
(c) 3- 2√𝟐 (d) none
19
1
∴ lim 𝑠𝑛 = lim (1 − 𝑛) = 1. ISI B.STAT/B.MATH
𝑛→∞
𝑛→∞ OBJECTIVE QUESTIONS &
SOLUTIONS
𝟑𝒙−𝟏
28. The limit 𝐥𝐢𝐦 ( 𝟑𝒙+𝟏)𝟒𝒙 equaqls
𝒙→∞
(a) 1 (b) 0 (c) SET – 3
𝟖 𝟒
−
𝒆 𝟑 (d) 𝒆 𝟗
1. Number of solutions are possible in
1
1−
1 −
𝑒 3 8 0≤ 𝒙 ≤ 𝟗𝟗 for the equation
Ans:- (c) lim {( 3𝑥
1 ) 𝑥 }4 = ( 1 ) 4 = 𝑒 −3
𝑥→∞ 1+ 𝑒3
3𝑥 𝟑−𝒙
|𝟑 − 𝟑𝒙 | + |𝟏 − 𝟑𝒙 | = 𝟏 − 𝟑𝒙 − is
𝟒
𝑘 𝑥
[since lim (1 + ) = 𝑒 𝑘 ].
𝑥→∞ 𝑥
(a) 1 (b) 0 (c) 2
(d) none
𝟏 𝒏 𝒏 𝒏 Ans:- (b) LHS= |3 − 3𝑥 | + |3𝑥 − 1| ≥

29. 𝐥𝐢𝐦 𝒏 (𝒏+𝟏 + 𝒏+𝟐 + ⋯ + 𝟐𝒏) equals
𝒙→∞ |(3 − 3𝑥 ) + (3𝑥 − 1)| ≥ 2
(a) ∞ (b) 0 (c) 3−𝑥
But RHS= 1 - (3𝑥 + )
𝐥𝐨𝐠 𝒆 𝟐 (d) 1 4
𝑥 𝑥
1 1 1 1 𝑥 − 𝑥 −
3 2 3 2
Ans:- (c) lim 𝑛 ( 1 + 2 + ⋯+ 𝑛 ) =1- {(3 +
2 ) - 2. 3 .
2 }
𝑥→∞ 1+ 1+ 1+ 2 2
𝑛 𝑛 𝑛
𝑥
1 1 𝑥 −
= ∫0 𝑑𝑥 = [log(1 + 𝑥)] 10 = log 𝑒 2. = 2 - (32 +
3 2 2
) <2
1+𝑥 2
∴ given equation has no solution for any

real x.
30. Let k be an integer greater than 1.
𝒏 𝒏
Then 𝐥𝐢𝐦 [𝒏+𝟏 + 𝒏+𝟐 + ⋯ ] is 2. If f(x) = 𝐥𝐨𝐠 𝒆 (𝟔 − |𝒙𝟐 + 𝒙 − 𝟔|), then
𝒏→∞
domain of f(x) has how many integral
(a) 𝐥𝐨𝐠 𝒆 𝒌 (b) (k-1) 𝐥𝐨𝐠 𝒆 𝒌 values of x?
(c) 0 (d) ∞ (a) 5 (b) 4
1
(c) infinite (d) none
Ans:- (a) lim [∑𝑛(𝑘−1)
𝑟=1 ]= of these
𝑛→∞ 𝑛+𝑟
𝑘−1 𝑑𝑥
∫0 = log(1 + 𝑥)] 𝑘−1
0
= log 𝑒 𝑘 . Ans:- (b) f(x) is defined only when 6 −
1+𝑥
|𝑥 2 + 𝑥 − 6| > 0
i.e. |𝑥 2 + 𝑥 − 6| < 6
⇒ -6 < 𝑥 2 + 𝑥 − 6 < 6
20
⇒ 𝑥 2 + 𝑥 > 0 and 𝑥 2 + 𝑥 − 12 < 0 (iii) If 1 ≤ 𝑥 < 2, then |x-1 -1|+x ≤ 2

⇒ |x-2|+x ≤ 2
⇒ x (x+1)>0 and (x+4)(x-3)< 0 ⇒ 2- x +x ≤ 2
⇒ (x< -1 or x > 0) and (-4 < x < 3) ⇒ 2 ≤ 2 (true)
(iv) If x ≥ 2, then |x-1 -1|+x ≤ 2
⇒ x ∊ (-4, -1) ∪(0, 3) ⇒ x= -3, -2, 1, 2 as ⇒ x-2 +x ≤ 2
integral values. ⇒x ≤2
∴ x=2 [∵ x≥ 2]
3. The sum of the real solution of 2|𝒙|𝟐 +
∴ Required solution set is
51= |1+ 20x| is
(−∞, 2]
(a) 5 (b) 0
𝟏
(c) 24 (d) none of 5. If domain of f(x)= √|𝒙−𝟏|+[𝒙] be (a, b),
these
then ([ .] denotes greatest integer
2 function)
Ans:- (d) 2𝑥 + 51 = ±(1 + 20𝑥)
(a) a= 1, b=∞ (b) a= -∞, b= 0
⇒ 𝑥 2 − 10𝑥 + 25 = 0 𝑜𝑟 𝑥 2 + 10𝑥 + 26 = (c) a= -∞, b= 1 (d) none of
0 these
⇒ (𝑥 − 5)2 = 0 𝑜𝑟(𝑥 + 5)2 + 1 = Ans:- (c) we must have, |x-1|> [x]…….(1)
0(impossible)
∴ x-1 < [x]≤ x, i.e. [x]> x – 1……….(2)
⇒ x= 5, 5
∴ on combining (1) and (2), we have |x -1|>
∴ Sum of the real solution = 5+ 5= 10. x -1
4. The solution set of ||x- 1|-1| + x ≤ 𝟐 is This is true only if x-1< 0, i.e. if x < 1, i.e. if
(a) (−∞, 𝟐] (b) [0, 1) x ∊ (-∞, 1)
(c) [0, 2) (d) [1, 2)
∴𝐷𝑓 = (−∞, 1) ⇒ a = −∞, b= 1
Ans:- (a) (i) If x < 0, then |1- x- 1|+x ≤ 2
6. If there are 4 distinct solutions of ||x -
⇒ |x|+x ≤ 2 2012| + 𝐥𝐨𝐠 𝟐 𝒂| = 3, then a ∊
𝟏
⇒ -x +x ≤ 2 (a) (−∞, −𝟔) (b) (−∞, 𝟖)
𝟏
(c) (−∞, − ) (d) none of
⇒ 0 ≤ 2 (true) 𝟖
these
∴x<0
Ans:- (b) we have | x -2012|+log 2 𝑎 = ±3
(ii) If 0 ≤ 𝑥 ≤ 1, then |1- x- 1|+x ≤
2 ⇒ | x -2012| = -log 2 𝑎+ 3, -log 2 𝑎 − 3
⇒ |x|+x ≤ 2
∴ If there are 4 distinct solutions of the
⇒ 2x ≤ 2
above equation, then we must have
⇒ x ≤ 1, ∴0 ≤ 𝑥 < 1
21
-log 2 𝑎+ 3> 0 and -log 2 𝑎 − 3 > 0 f″(x)

⇒ =1
f′(x)
i.e. log 2 𝑎 < 3 and log 2 𝑎 < -3 ⇒ a < 2−3
On integrating f′(x) = c 𝑒 𝑥
1
∴ a ∊ (−∞, 8) Which gives f(x)= c 𝑒 𝑥 +D
7. The number of value of k for which But f(0) = 1 ⇒ c+ D = 1
the equation 𝒙𝟑 − 𝟑𝒙 + 𝒌 = 𝟎 has two
distinct roots lying in the interval (0, ∴ f(x)= c 𝑒 𝑥 + 1 − 𝑐
1) are
So, f′(x)= c 𝑒 𝑥 putting it in f′(x)=
(a) 3 (b) 2 (c) infinitely many 1
f(x)+ ∫0 𝑓(𝑥)𝑑𝑥
(d) no value of k satisfies the
requirement 1
⇒ c 𝑒 𝑥 = c 𝑒 𝑥 + 1 − 𝑐 + ∫0 (c 𝑒 𝑥 + 1 −
Ans:- (d) Let there be a value of k for which 𝑐)𝑑𝑥
𝑥 3 − 3𝑥 + 𝑘 = 0 has two distinct roots
2 2𝑒 𝑥 −𝑒+1
between 0 and 1. Let, a, b are two distinct ⇒ c = 3−𝑒. So, f(x)= 3−𝑒
roots of 𝑥 3 − 3𝑥 + 𝑘 = 0 lying between 0
and 1 such that a < b 9. A staircase has 10 steps, a person can
go up the steps one at a time, or any
Let f (a)= f(b)= 0. Since between any two combination of 1’s and 2’s . The
roots of a polynomial f(x) there exist at least number of ways in which the person
one roots of its derivative f′(x). can go up the stairs is
(a) 89 (b) 144
Therefore, f′(x) = 3𝑥 3 − 3 has at least one
(c) 132 (d) 211
root between a and b
Ans:- (a)
But f′(x) =0 has two roots equal to ± 1
which don’t lie between 0 and 1 for any x+ 2y= 10, where x is the number of times
value of k. he takes single steps, and y is the number
times he takes two steps
𝒅𝒚 𝟏 Case Total no. of ways

8. If 𝒅𝒙 = 𝒇(𝒙) + ∫𝟎 𝒇(𝒙)𝒅𝒙 then the
1 X=0, y=5 5! /5!=1
equation of the curve y=f(x) passing
2 X=2, y= 4 6! /2! 4! =15
through (0, 1) is 3 X=4, y=3 7! /3!4!= 35
𝟐𝒆𝒙 −𝒆+𝟏
(a) f(x)= (b) f(x)= 4 X=6, y=2 8! /2! 6!= 28
𝟑−𝒆
𝟑𝒆𝒙 −𝟐𝒆+𝟏 𝒆𝒙 −𝟐𝒆+𝟏 5 X=8, y=1 9! /8! = 9
(c) f(x)= 6 X=10, y=0 10! /10! =1
𝟐(𝒙−𝒆) 𝒆+𝟏
(d) none of these
∴ P= 89
Ans:- (a) f″(x)= f′(x)
22
10. The remainder when 𝟏𝟔𝟗𝟎𝟐𝟔𝟎𝟖 + them are equal and not equal to other
𝟐𝟔𝟎𝟖𝟏𝟔𝟗𝟎 is divided by 7 is variable (say, i= j≠ 𝑘).
(a) 1 (b) 2 (c)
Case –I:- when i= j= k
3 (d) none
1
Ans:- (a) 1690= 7× 241 + 3; In this case ∑∞ ∞ ∞
𝑖=0 ∑𝑗=0 ∑𝑘=0 3𝑖 3𝑗 3𝑘 =
1 27
2608= 7 ×372 +4 ∑∞
𝑖=0 = 16
3𝑖
Let s =16902608 + 26081690 Case – II:- i= j≠ 𝑘

= (7 × 241 + 3)2608 + (7 × 372 + 1
1690 In this case, ∑∞ ∞ ∞
𝑖=0 ∑𝑗=0 ∑𝑘=0 3𝑖 3𝑗 3𝑘 =
4)
1 1
(∑∞ ∞
𝑖=0 32𝑖 ) (∑𝑘=0 3𝑘 )
= a number multiple of 7+32608 +
41690 = ∑∞
1 3 1
𝑖=0 32𝑖 (2 − 3𝑖 )
Let s′= 32608 + 41690 3 9 27 135

= 2 . 8 − 26 = 8.26
Clearly remainder in s and s′ will be same
27 27 135
when divided by 7. Hence required sum = 8 − 26 − (8.26) . 3=
81
s′= 3× 33×867 + 4 × 43×563 208
= 3× 27867 + 4 × 64563 12. The solution of the differential

𝒅𝒚
equation f(x) + 𝒇′ (𝒙)𝒚 = 𝟏 is given
= 3(28 − 1)867 + 4 (63 + 1)563 𝒅𝒙
by f(x) =
= 3[multiple of 7- 1]+ 4[ multiple of 7+ 1] (a) yx + c (b)
𝒙+𝒄
𝒚
= multiple of 7+ 1 (c) yc (d) none
∴ Hence remainder is 1. Ans:- (b) f(x)dy +f′(x)ydx = dx
∞ 𝟏
11. The value of ∑∞ ∞
𝒊=𝟎 ∑𝒋=𝟎 ∑𝒌=𝟎 𝟑𝒊 𝟑𝒋 𝟑𝒌
is i.e. d (f(x), y) = d (x)
(𝒊 ≠𝒋≠𝒌)
Integrating we get, y. f(x) = x+ c
(a) 80/207 (b) 81/208
(c) 1/208 (d) none 𝑥+𝑐
or, f(x) = 𝑦
Ans:- (b) Let us first of all find the sum
𝒙
without any restriction i, j, k. 13. If ∫𝟎 𝒇(𝒙)𝒔𝒊𝒏𝒕𝒅𝒕 = constant, 0 < x <
2𝜋 and f(𝜋)= 2 Then find the value of
1 1 3 27
∑∞ ∞ ∞
𝑖=0 ∑𝑗=0 ∑𝑘=0 = (∑∞
𝑖=0 3𝑖 ) =
𝝅
f( 𝟐 )
3𝑖 3𝑗 3𝑘 8
For the requirement sum we have to remove (a) 2 (b) 4 (c) 6

the cases when i= j= k or when any two of (d) 8
23
Ans:- (b) Differentiable both sides, we get 𝟏

16. If f(x)= max (𝝅 𝐜𝐨𝐬 −𝟏 (𝒄𝒐𝒔𝝅𝒙), {𝒙})
f′(x) (1- cosx)+ f(x)sinx= 0 and g (x) min
𝟏
(𝝅 𝐜𝐨𝐬 −𝟏 (𝒄𝒐𝒔𝝅𝒙) , {𝒙}) (where { .}
f′(x) 𝑠𝑖𝑛𝑥
⇒ ∫ f(x) 𝑑𝑥 = ∫ 1−𝑐𝑜𝑠𝑥 𝑑𝑥 represents fractional part of x). Then
𝟐
𝑥 find the value of ∫𝟏 𝒇(𝒙)𝒅𝒙/
⇒ ln(f (x)| = -2ln sin2 + 𝑙𝑛𝑐
𝟐
∫𝟏 𝒈(𝒙)𝒅𝒙 is
𝑐 𝜋
⇒ f (x)= 𝑥 ⇒ f(𝜋)=2 ⇒ c=2: f(2 )=4 (a) 1 (b) 3 (c) 5
(sin )2
2
(d) 7
14. For a ∊ R if |x+ a-3| + |x- 2a|= |2x –a -
Ans:- (b)
3| is three for all x ∊R, then exhaustive
set of a is 2 3 2 1
⇒∫1 𝑓(𝑥)𝑑𝑥 = 𝑎𝑛𝑑 ∫1 𝑔(𝑥)𝑑𝑥 =
4 4
(a) a ∊ [-4, 4] (b) a ∊ [-3, 2]
(c) a ∊ {-2, 2} (d) a ∊ {1} ⇒ Ratio = 3
Ans:- (d) |x|+ |y| = |x+y| 17. If sin (sinx +cosx)= cos (cosx- sinx)
𝝅
⇒ xy ≥ 0, therefore (x- (3- a)) (x- 2a)≥ and largest possible value of sinx is 𝒌,
0∀𝑥 ∊𝑅 then the value of k is
(a) 2 (b) 3
⇒ 𝑥 2 − 𝑥(3 + 𝑎) + 2𝑎(3 − 𝑎) ≥ 0 ∀ 𝑥 ∊ (c) 4 (d) none
𝑅
Ans:- (c) sin (sinx +cosx)= cos (cosx- sinx)
⇒(𝑎 + 3)2 − 8𝑎(3 − 𝑎) ≤ 0 ⇒
𝜋
(𝑎 − 1)2 ≤ 0 ⇒ 𝑎 = 1 which is true ∀ 𝑥 ∊ cos (cosx- sinx) = cos (2 − (𝑠𝑖𝑛𝑥 + 𝑐𝑜𝑠𝑥))
𝑅 𝜋
∴𝑐𝑜𝑠𝑥 − 𝑠𝑖𝑛𝑥 = 2𝑛𝜋 ± ( 2 − (𝑠𝑖𝑛𝑥 +
𝑐𝑜𝑠𝑥))
15. If A is skew–symmetric matrix, then
Taking + ve sign
B = (I- A) (𝑰 + 𝑨)−𝟏 is (where I is the
𝜋
identity matrix of the same order as 𝑐𝑜𝑠𝑥 − 𝑠𝑖𝑛𝑥 = 2𝑛𝜋 + 2 − 𝑠𝑖𝑛𝑥 − 𝑐𝑜𝑠𝑥
A)
𝜋 𝜋
(a) idempotent matrix (b) 𝑐𝑜𝑠𝑥= 𝑛𝜋 + , for n= 0, 𝑐𝑜𝑠𝑥 = , which
4 4
symmetric matrix (c)orthogonal is the only possible value
matrix (d) none
√16− 𝜋2
Ans:- (c) B= (I- A) (𝐼 + 𝐴) −1 ⇒ 𝑠𝑖𝑛𝑥 = ………………..(i)
4
⇒ 𝐵 𝑇 = (𝐼 + 𝐴𝑇 )−1 (𝐼 + 𝐴𝑇 ) = (𝐼 − Taking –ve sign

𝐴)−1(I+ A) 𝜋
𝑠𝑖𝑛𝑥 = ……………..(ii)
4
𝑡
𝐵 𝐵 = I as (I- A) (I+ A)= (I+ A) (I-A)
24
𝜋
From (i) & (ii) , we get as the largest 20. Let a, b, c be any real numbers such
4
value. Hence k= 4. that 𝒂𝟐 + 𝒃𝟐 + 𝒄𝟐 = 𝟏 then the
quantity
18. The number of solution(s) of the ab +bc+ ca satisfies the conditions
𝟔𝟒
equation 𝒛𝟐 − 𝒛 − |𝒛|𝟐 − = 𝟎 is / (a) ab+ bc+ ac = constant
|𝒛|𝟓
(b) - ½ ≤ 𝒂𝒃 + 𝒃𝒄 + 𝒄𝒂 ≤ 𝟏
are
(c) - ¼ ≤ 𝒂𝒃 + 𝒃𝒄 + 𝒄𝒂 ≤ 𝟏
(a) 0 (b) 1 (c) 2 𝟏
(d) 3 (d) -1 ≤ 𝒂𝒃 + 𝒃𝒄 + 𝒄𝒂 ≤ 𝟐
Ans:- (b) z = 2 is the only solution. Ans:- (a) (𝑎 + 𝑏 + 𝑐)2 ≥ 0
So there is only one solution of the given ⇒ 𝑎2 + 𝑏 2 + 𝑐 2 ≥ −2(𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎)

equation.
1
⇒ 2 ≥ −(𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎) ⇒ (𝑎𝑏 + 𝑏𝑐 +
𝟓𝒙
19. If function f(x) = cos(nx)×sin( 𝒏 ), 1
𝑐𝑎) ≥ − 2
satisfies f(x+ 3𝜋)= f(x), then find the
number of integral value of n 21. The maximum value of xyz for +ve x,
y, z subject to condition that xy + yz+
(a) 8 (b) 9 (c) 10
zx= 12 is
(d) 11
(a) 9 (b) 6 (c) 8
Ans:- (a) f(x+ 𝜆) = f(x) (d) none
xy + yz+ zx 1⁄
5(x+ λ) Ans:- (c) ≥ (xy . yz. zx) 3
⇒ cosn(x+ 𝜆) sin( )= 3
𝑛
5𝑥
cos(𝑛𝑥) sin( 𝑛 ) ⇒ (xyz)≤ 8
5𝜆 22. Let a, b, c are 3 positive real numbers
At x = 0, cos(n𝜆)sin ( 𝑛 )= 0
such that a+ b+ c= 2, then the value of
𝜋 𝒂 𝒃 𝒄
If cos(n𝜆)= 0, n𝜆= r𝜋+ 2 , r ∊ I . . is always
𝟏−𝒂 𝟏−𝒃 𝟏−𝒄
𝜋
(a) > 8 (b) < 8
n (3𝜋)= r𝜋+ 2 (∵𝜆= 3𝜋) (c) 8 (d) none
(3n- r)= ½ [not possible] Ans:- (a) Let 1- a= x, 1- b= y, 1- c = z

5𝜆 5𝜆 3- (a+ b+ c) = x+ y+ z = 1(∵ a+ b+ c= 2)
∴ cosn𝜆 ≠ 0 ∴ sin ( 𝑛 )= 0 ⇒ =
𝑛
15 1−𝑥 1−𝑦 1−𝑧
𝑃𝜋(𝑃 ∊ 𝐼) ⇒ 𝑛 = Now, . .
𝑃 𝑥 𝑦 𝑧
For P= ±1, ±3, ±5, ±15 𝑦+𝑧 𝑧+𝑥 𝑦+𝑥

= . .
𝑥 𝑦 𝑧
n=±15, ±5, ±3, ±1
25
𝑦+𝑧 𝑧+𝑥 𝑦+𝑥 8 25. If 2x+ 4y= 1, then prove that the
=( )( )( ) . 𝑥𝑦𝑧 >
2 2 2
8 quantity 𝒙𝟐 + 𝒚𝟐 is always greater
√𝑦𝑧 √𝑧𝑥 √𝑧𝑦 . 𝑥𝑦𝑧 (By AM> GM than equal to
inequality) (a) 1/20 (b) 5/64
(c) 1 (d) none
𝑎 𝑏 𝑐
⇒ 1−𝑎 . 1−𝑏 . 1−𝑐 > 8
Ans:- (a) Maximize 𝑥 2 + 𝑦 2 subject to 2x+
23. Let a+ b +c = 1 then the value of the 4y -1=0 by
quantity is always √𝟒𝒂 + 𝟏 +
Method of Lagrange multiplier⟶
√𝟒𝒃 + 𝟏 + √𝟒𝒄 + 𝟏
(a) equals 21 (b) ≤ 21 F= 𝑥 2 + 𝑦 2 + 𝜆(2𝑥 + 4𝑦 − 1)
(c) > 21 (d) none
𝜕𝐹 𝜕𝐹
= 2𝑥 + 2𝜆 = 0 ; 𝜕𝑦 = 2𝑦 + 2𝜆 = 0
𝜕𝑥
Ans:- (b) 4a+ 4b+ 4c = 4
∴ x= -𝜆 ∴ y= -2𝜆
⇒(4a+ 1)+ (4b+ 1)+ (4c +1) = 7
1 1
Applying c-s inequality:- 𝑎1 = √4𝑎 + 1, 2x+ 4y = 1 𝑥𝑚𝑎𝑥 = + 10 , 𝑦𝑚𝑎𝑥 = 5
𝑎2 = √4𝑏 + 1, 𝑎3 = √4𝑐 + 1 & 𝑏𝑖 =1 −1
⇒ 𝜆= 10 ;
2
∴ (∑3𝑖=1 𝑎𝑖 .1) ≤ (∑3𝑖=1 𝑎𝑖 2 )(∑3𝑖=1 1) ; 1 4 5 1
where 𝑎𝑖 =𝑎1 , 𝑎2 , 𝑎3 ∴ 𝑥2 + 𝑦2 ≥ + 100 = = 20.
100 100
⇒ (√4𝑎 + 1 + √4𝑏 + 1 + √4𝑐 + 1)2 ≤ 26. If a, b, c are positive real numbers ∋

(4𝑎 + 1 + 4𝑏 + 1 + 4𝑐 + 1) × (1 + 1 + 1) a+ b+ c= 1. The value of 𝒂𝟐 + 𝒃𝟐 + 𝒄𝟐
is always
= 3 × 7 = 21 (a) ½ (b) 1/3
(c) ¼ (d) none
24. If f(x)is a polynomial function
𝟏 𝟏
satisfying f(x)f(𝒙)= f(x)+ f(𝒙) and Ans:- (b) Using C-S inequality,
f(3)=28 then f(4) is 2 2 2
(∑3𝑖=1 𝑥𝑖 𝑦𝑖 ) ≤ (∑ 𝑥𝑖 )(∑ 𝑦𝑖 ) Taking
(a) 28 (b) 65
(c) 78 (d) none 𝑦𝑖 = 1 & xi = a, b, c.
Ans:- (c) The given functional equation is ⇒(𝑎 + 𝑏 + 𝑐)2 ≤ (𝑎2 + 𝑏 2 + 𝑐 2 ). 3

satisfied by f(x)= ± 𝑥 𝑛 + 1 1
⇒ 𝑎2 + 𝑏 2 + 𝑐 2 ≥ 3
f(3)= +33 + 1 = 28
27. If a, b, c , x are real numbers such that
Hence, n= 3 𝒙𝒃+(𝟏−𝒙)𝒄 𝒙𝒄+(𝟏−𝒙)𝒂
abc≠ 𝟎 𝒂𝒏𝒅 = =
𝒂 𝒃
𝒙𝒂+(𝟏−𝒙)𝒃
So, f(4)= 43 + 1 = 65.
𝒄
26
Then prove that a+ b+ c equals to d | (a+ b) and d |(a -b).
(a) 1 (b) 2 ∴ d | (a +b+ a -b) , ⇒ d| 2a and

(c) 0 (d) none
∴ d | (a +b- a +b) , ⇒ d| 2b
𝑥𝑏+(1−𝑥)𝑐 𝑥𝑐+(1−𝑥)𝑎
Ans:- (c) = =
𝑎 𝑏 Thus d |(2a, 2b), ⇒ d|2(a,b)
𝑥𝑎+(1−𝑥)𝑏
=1
𝑐 Hence d= 1 or 2, because gcd(a, b)= 1
𝑎−𝑐 𝑏−𝑎 𝑐−𝑏
∴ x= 𝑏−𝑐 , 𝑥 = ,𝑥 = 30. The number of solution (positive
𝑐−𝑎 𝑎−𝑏
integers) of the equation 3x+ 5y = 1008
The solutions are : a= b= c or a+ b+ c= 0. is
(a) 61 (b) 67
(c)79 (d) none
28. If f : R ⟶R is given by f(x)=
𝟒𝒙 Ans:- (b) x, y ∊ ℕ, then 3 |5y ⇒ 3|y, y = 3k
∀ 𝒙 ∈ 𝑹, check f(x)+f(1-x)= 1.
𝟒𝒙 +𝟐 ∀𝑘 ∊ℕ
𝟏 𝟐
Hence the value of f(𝟏𝟗𝟗𝟕) + 𝒇 (𝟏𝟗𝟗𝟕) + Thus 3x + 15k = 1008
𝟏𝟗𝟗𝟔
⋯ + 𝒇 (𝟏𝟗𝟗𝟕) is ⇒ x + 5k= 336 ⇒ 5k ≤ 335 ⇒ k ≤ 67
(a) 998 (b) 1996

(c) 1997 (d) none
ISI B.STAT/B.MATH
41−𝑥 4/4𝑥
Ans:- (a) f(1- x)= = = f(x)+ OBJECTIVE QUESTIONS &
4−𝑥+1 +2 4/4𝑥 +2
f(1- x)= 1. SOLUTIONS
1 2 3
Now, putting x = 1997 , 1997 , 1997 , … . , 1997
998 SET – 4
1 2 1996
So, f(1997) + 𝑓 (1997) + ⋯ + 𝑓(1997)
1. If 𝑺𝒏 denotes the sum of first n terms of
= (1
⏟ + 1 + ⋯ + 1) an A.P. whose
998 terms (a) P∑𝒏𝒓=𝟏 𝒓 (b) n∑𝒏𝒑=𝟏 𝒑

𝒑
(c) a∑𝒓=𝟏 𝒓 (d) none of
= 998
these
29. If gcd (a, b)=1, then gcd (a+b, a-b) is
Ans. (d)
(a) a or b (b) 1 or 2
(c) 1 or 3 (d) none 𝑆𝑛𝑥
𝑛𝑥
[2𝑎+(𝑛𝑥−1)𝑑] 𝑛[2𝑎−1]+𝑛𝑥𝑑
2
= 𝑥
[2𝑎+(𝑥−1)𝑑]
= (2𝑎−𝑑)+𝑥𝑑
𝑆𝑥
2
Ans:- (b) let d = gcd (a+ b, a- b)then
27
𝑆𝑛𝑥 (a) A.P. (b) G.P. (c)

For to be independent of x
𝑆𝑥
H.P. (d) none of these
2a - d= 0
Ans. (c)
∴ 2a= d 𝑎 𝑥
X = 1−𝑎 ⟹ 𝑎 = 1−𝑥
𝑝
Now, 𝑆𝑝 = 2 [2𝑎 + (𝑝 − 1)𝑑] = 𝑝2 𝑎 𝑦 𝑧
Similarly, b = 1−𝑦 , 𝑐 = 1−𝑧
Now, a, b, c are in H.P.

𝝅 𝐬𝐢𝐧(𝟐𝒏−𝟏)
2. if 𝒂𝒏= ∫𝟎 𝒔𝒊𝒏𝒙 dx, then
1+𝑥 1+𝑦 1+𝑧
⟹ , , are in A.P.
𝒂𝟏, 𝒂𝟐, 𝒂𝟑, ……..are in 𝑥 𝑦 𝑧
1 1 1
(a) A.P. and H.P. ⟹𝑥 , 𝑦 , 𝑧 are in A.P.
(b) A.P. and G.P. but not in H.P.
⟹ x, y, z are in H.P.
(c) G.P. and H.P.
(d) A.P., G.P. and H.P. 4. If a, b, c be the 𝒑𝒕𝒉 ,𝒒𝒕𝒉 and 𝒓𝒕𝒉 terms
respectively of an A.P. and G.P. both,
Ans. (b)
then the product of the roots of equation
𝑎𝑛+1 − 𝑎𝑛 𝒂𝒃 𝒃𝒄 𝒄𝒂 𝒙𝟐 – 𝒂𝒃𝒄𝒙 + 𝒂𝒄 𝒃𝒂 𝒄𝒃 =0 is equal to
𝜋
sin(2𝑛 + 1)𝑥 − sin(2𝑛 − 1)𝑥
=∫ 𝑑𝑥 (a) -1 (b) 1 (c) 2
0 sin 𝑥
𝜋 (d) (b-c)(c-a)(a-b)
2 cos 2𝑛𝑥. 𝑠𝑖𝑛𝑥 2 sin 2𝑛𝑥 𝜋
= ∫ 𝑑𝑥 = [ ]
0 𝑠𝑖𝑛𝑥 2𝑛 0 Ans. (b)
=0
a= x+ (p- 1)d, b= x+ (q-1)d, c= x+ (r-1)d
∴𝑎𝑛+1 = 𝑎𝑛 ⟹ 𝑎1 = 𝑎2 = 𝑎3 = ⋯
a=𝑚𝑛𝑝−1 , 𝑏 = 𝑚𝑛𝑞−1 , 𝑐 = 𝑚𝑛𝑟−1
Also 𝑎1 = 𝜋 ≠ 0
∴ Product of roots =
Hence 𝑎1 , 𝑎2 , … 𝑎𝑛 are in A.P. and G.P. but
not in H.P. (Equal numbers cannot be in (𝑚𝑛𝑝−1 )(𝑟−𝑞)𝑑 , (𝑚𝑛𝑞−1 )(𝑝−𝑟)𝑑 , (𝑚𝑛𝑟−1 )(𝑞−𝑝)𝑑 =
H.P) 𝑚0 . 𝑛0 = 1.
5. If a, b, c, be the 𝒑𝒕𝒉 ,𝒒𝒕𝒉 and 𝒓𝒕𝒉 terms

respectively of a G.P. then the equation-
3. If a, b, c are proper fractions and are in
H.P. and x=∑∞ 𝒏 ∞ 𝒏
𝒏=𝟏 𝒂 , y=∑𝒏=𝟏 𝒃 ,
𝒂𝒒 𝒃𝒓 𝒄𝒑 𝒙𝟐 + pqrx + 𝒂𝒓 𝒃𝒏 𝒄𝒒 = 0 has
z=∑∞ 𝒏
𝒏=𝟏 𝒄 , (a) both roots zero
then x, y, z are in (b) at least one root zero
(c) no root zero
(d) both roots unity
28
Ans. (c)
Product of roots= 𝑎𝑟−𝑞 𝑏 𝑝−𝑟 𝑐 𝑞−𝑝 = 1 ≠ 0 𝒋

8. If ∑𝒏𝒓=𝟏 𝒕𝒓 = ∑𝒏𝒌=𝟏 ∑𝒌𝒋=𝟏 ∑𝒊=𝟏 𝟐, then
𝟏
⟹ no root is equal to zero. ∑𝒏𝒓=𝟏 =
𝒕𝒓
6. If (𝒓)𝒏 denotes the number rrr….. (n (a)

𝒏+𝟏
(b) 𝒏+𝟏
𝒏
𝒏
digits), where r=1, 2, 3,…9 and a=(𝟔)𝒏 , 𝒏−𝟏 𝒏
b=(𝟖)𝒏 , c=(𝟒)𝟐𝒏 , then (c) (d) 𝒏−𝟏
𝒏
(a) 𝒂𝟐 +b+c=0 Ans. (b)

(b) 𝒂𝟐 +b-c=0
∑𝑛𝑘=1 ∑ℎ𝑗=1 ∑𝑗𝑖=1 2 = ∑𝑛𝑘=1 ∑𝑘𝑗=1 2𝑗=
(c) 𝒂𝟐 +b-2c=0 2∑𝑛𝑘=1 ∑𝑘𝑗=1 𝑗 = 2 ∑𝑛𝑘=1
𝑘(𝑘+1)
= ∑𝑛𝑘=1 𝑘 2 +
2
(d) 𝒂𝟐 +b-9c=0
∑𝑛𝑘=1 𝑘
Ans. (b) 𝑛(𝑛+1)(2𝑛+1) 𝑛(𝑛+1) 𝑛(𝑛+1)(𝑛+2)
= + =
6 2 3
A = (6)𝑛 = 6 6 6 … 6(𝑛 𝑑𝑖𝑔𝑖𝑡𝑠) = 6 × 1 +
6 × 10 + 6 × 102 + ⋯ 6 × 10𝑛−1 ∴ 𝑆𝑛 =
𝑛(𝑛+1)(𝑛+2)
3
6 2
= 9 (10𝑛 − 1) = 3 (10𝑛 − 1) 𝑟(𝑟+1)(𝑟+2)
⟹ 𝑡𝑟 = 𝑆𝑟 − 𝑆𝑟−1 = −
3
8 4 (𝑟−1)𝑟(𝑟+1)
b= 9 (10𝑛 − 1), 𝑐 = (102𝑛 − 1) 3
= 𝑟(𝑟 + 1)
9
4 8 1 1 1 1 1
Now 𝑎2 + 𝑏= 9 (10𝑛 − 1)2 + 9 (10𝑛 − = = 𝑟 − 𝑟+1 ∴ ∑𝑛𝑟=1 𝑡 = 1 −
𝑡𝑟 𝑟(𝑟+1) 𝑟
4 1 𝑛
1) = (10𝑛 − 1) 2 (10𝑛
− 1 + 2) = = 𝑛+1
9 𝑛+1
4 2𝑛
(10 − 1) = 𝑐 𝟏 𝟏
9
9. If a=∑∞ ∞
𝒓=𝟏 𝒓𝟒 , then ∑𝒓=𝟏 (𝟐𝒓−𝟏)𝟒 =
𝟏𝟔 𝒂
(a) 𝟏𝟓a (b) 𝟐
7. Let a=1 1 1.....1(55 digits),
𝟏𝟓 𝟏𝟒
b=1+10+𝟏𝟎𝟐 +…𝟏𝟎𝟒 , (c) 𝟏𝟔a (d) 𝟏𝟓a
c=1+𝟏𝟎𝟓 +𝟏𝟎𝟏𝟎 +𝟏𝟎𝟏𝟓 +…+𝟏𝟎𝟓𝟎 , then
Ans. (c)
(a) a=b+c (b) a=bc 1 1 1 1
(c) b=ac (d) c=ab ∑∞
𝑟=1 = 14 + 34 + 54 + ⋯ + 𝑡𝑜 ∞
(2𝑟−1)4
Ans. (b) 1 1
= (14 + 24 + 34 + ⋯ + 𝑡𝑜 ∞) −
1
1055 1 1 1
a= 1+ 10+ 102 + ⋯ + 1054 = = (24 + 44 + 64 + ⋯ + 𝑡𝑜 ∞)
10−1
1055 −1 105 −1
. = 𝑏𝑐
105 −1 10−1
29
1 1 1 1 ∴(−∞, 3)
= a-24 (14 + 24 + 34 + ⋯ + 𝑡𝑜 ∞) = 𝑎 −
𝑎 15
= 16 𝑎 12. Let 𝛼, 𝛽 are the roots of the equation
16
𝒙𝟐 +ax +b=0, then maximum value of the
10. If 𝒂𝟏, 𝒂𝟐, 𝒂𝟑 ,…are in G.P. having 𝜶−𝜷 𝟐
expression - (𝒙𝟐 +ax +b) - ( ) will be
𝟐
common ratio r such that
∑𝒏𝒌=𝟏 𝒂𝟐𝒌−𝟏 =∑𝒏𝒌=𝟏 𝒂𝟐𝒌+𝟐 ≠ 𝟎, then number 𝟏
(a) 𝟒 (𝒂𝟐 − 𝟒𝒃) (b) 0
of possible values of r is
(c) 1 (d) none
(a) 1 (b) 2
Ans. (b) let z= - (𝑥 2 -ax +b)
(c) 3 (d) none of these
𝐷 𝑎2 −4𝑏 4𝑏−𝑎2
Ans. (c) Now, 𝑧𝑚𝑎𝑥. = − 4𝑎 = − = =
4 4
𝛼−𝛽 2
Given 𝑎1 + 𝑎3 + 𝑎5 + ⋯ + 𝑎2𝑛−1 = 𝑎4 + +( 2
)
𝑎6 + 𝑎8 + ⋯ + 𝑎2𝑛+2
∴Thus the maximum value of the given
= 𝑟 3 (𝑎1 + 𝑎3 + 𝑎5 + ⋯ + 𝑎2𝑛−1 ) equation is 0.
⟹𝑟 3 = 1 ⟹ 𝑟 = 1, 𝜔, 𝜔2 13. Let P (x) = 𝒙𝟐 +bx +c, where b and c

are integers and P(x) is a factor of
11. If 𝒙𝟐 - x + a - 3= 0 has at least one
negative value of x,then complete set of both 𝒙𝟒 + 𝟔𝒙𝟐 + 𝟐𝟓 𝒂𝒏𝒅 𝟑𝒙𝟒 + 𝟒𝒙𝟐 +
values of ‘a’ is 𝟐𝟖𝒙 + 𝟓, then P(1) is
(a) (−∞, 𝟏) (b) (−∞, 𝟐) (a) 4 (b) 8

(c) (−∞, 𝟑) (d) none (c) 24 (d) none
Ans. (c) 𝑥 2 - x +a - 3= 0 has at least one Ans. (a) ∴ P(x) is a factor of 3 (𝑥 4 + 6𝑥 2 +

negative root and for real roots, 25)- (3𝑥 4 + 4𝑥 2 + 28𝑥 + 5)= 14(𝑥 2 −
2𝑥 + 5)
1- 4(a - 3) ≥ 0
∴ P(x) = 𝑥 2 − 2𝑥 + 5
13
⇒a≤ 4
⇒ P(1)= 4.
13
⇒ a ∊ (−∞, 4 )
14. The value of a for which (𝒂𝟐 − 𝟏)𝒙𝟐 +
𝟐(𝒂 − 𝟏)𝒙 + 𝟐 > 0 ∀ 𝑥 are
Now, both root will be non-negative of D ≥
0, ⇒ 𝑎 − 3 ≥ 0 ⇒ 𝑎 ≥ 3 (a) a≥ 𝟏 (b) a≤ 𝟏
13 (c) a > - 3 (d) none
∴ a ∊ (3, 4 )
Ans. (d) we know, 𝑃𝑥 2 + 𝑞𝑥 + 𝑐 > 0 if P >
13 13
∴ a ∊ (−∞, 4 )∪ a ∊ (3, 4 ) 0, and 𝑞 2 − 4𝑃𝑐 < 0,
∴ (𝑎2 − 1)𝑥 2 + 2(𝑎 − 1)𝑥 + 2 > 0 ∀ 𝑥

30
Now, 𝑎2 − 1 > 0 and 4 (𝑎 − 1)2 − Now, the two values of x corresponds to 𝛼

8(𝑎2 − 1) ≤ 0 and 𝛽 as y takes the same limits of values.
⇒ 𝑎2 − 1 ≥ 0 and -4(a-1)(a+3) ≤ 0 Hence 𝛼 +𝛽= -2.
⇒ a ≤ −1 or a ≥ 1 𝑎𝑛𝑑 𝑎 ≤ −3 𝑜𝑟 𝑎 ≥ 1 𝒂𝟒 +𝒃𝟒 𝒃𝟒 +𝒄𝟒 𝒄𝟒 +𝒂𝟒

17. 𝒂𝟐 +𝒃𝟐 + 𝒃𝟐 +𝒄𝟐 + 𝒄𝟐 +𝒂𝟐 ≥
i.e., 𝑎 ≤ −3 𝑜𝑟 𝑎 ≥ 1.
(a) a+ b+ c (b) 𝒂𝟐 + 𝒃𝟐 +
𝒄𝟐 (c) ab+ bc+ ca
(d) none
Ans. (b) (𝑎2 − 𝑏 2 )2 ≥ 0

15. The sum of real roots of the equation
𝒙𝟐 − 𝟐𝟐𝟎𝟎𝟕 . 𝒙 + |𝒙 − 𝟐𝟐𝟎𝟎𝟔 | + ⇒ 𝑎4 + 𝑏 4 ≥ 2𝑎2 . 𝑏 2
𝟐(𝟐𝟒𝟎𝟏𝟏 − 𝟏) = 𝟎 is
⇒2𝑎4 + 2𝑏 4 ≥ 𝑎4 + 𝑏 4 + 2𝑎2 . 𝑏 2 =
(a) 𝟐𝟐𝟎𝟎𝟔 (b) 𝟐𝟐𝟎𝟎𝟕 (𝑎2 + 𝑏 2 )2
(c) 𝟐𝟐𝟎𝟎𝟔 +𝟐𝟐𝟎𝟎𝟕 (d) 𝑎4 +𝑏4 𝑎2 +𝑏 2
none ⇒ 𝑎2 +𝑏2 ≥ …………….(1)
2
Ans. (b) ∴ (𝑥 − 22006 )2 + |𝑥 − 22006 | − 𝑏 4 +𝑐 4 𝑏 2 +𝑐 2

Similarly, 𝑏2 +𝑐 2 ≥ ……………(2)
2
2=0
𝑐 4 +𝑎4 𝑐 2 +𝑎2
⇒ |𝑥 − 22006 |2 + |𝑥 − 22006 | − 2=0 ⇒ x= And, ≥ ……………………(3)
𝑐 2 +𝑎2 2
22006 +1, 22006 -1.
(1)+(2)+(3) implies
∴The sum of real roots are =22007
𝑎4 +𝑏4 𝑏 4 +𝑐 4 𝑐 4 +𝑎4
+ 𝑏2 +𝑐 2 + 𝑐 2 +𝑎2 ≥ 𝑎2 + 𝑏 2 + 𝑐 2 .
𝑎2 +𝑏2
16. Consider an expression 𝒙𝟐 + 𝒚𝟐 +
𝟐𝒙 + 𝒚= constant. If for two constants 𝛼, 18. Let m > 1, n ∊ℕ, then 𝟏𝒎 + 𝟐𝒎 +
𝛽, the conditions x> 𝛼 and x > 𝛽 imply the 𝟐𝟐𝒎 + 𝟐𝟑𝒎 + ⋯ + 𝟐𝒏𝒎−𝒎 >
same limits for the value of y, then 𝛼 +𝛽 is
(a) 𝒏𝟏−𝒎 (b) (𝟏 − 𝒎)𝒏
(a) -2 (b) -4 (c) 𝒏𝟏−𝒎 (𝟐𝒏−𝟏 ) (d) none
(c) 1 (d) none
1𝑚 +2𝑚 +22𝑚 +23𝑚 +⋯+(2𝑛−1 )𝑚
Ans. (c) >
Ans. (a) 𝑥 2 + 𝑦 2 + 2𝑥 + 𝑦 = 𝑘 𝑛
1+2+4+⋯+2𝑛−1 𝑚
( )
1 5 𝑛
⇒ (𝑥 + 1)2 + (𝑦 + 2)2 = 𝑘 + 4
[∵ m> 0 and AM of mth power > mth power
5 1 of AM]
⇒ x= -1±√(𝑘 + 4)2 − (𝑦 + 2)2
⇒ 1𝑚 + 2𝑚 + 22𝑚 + 23𝑚 + ⋯ +
2𝑛−1 𝑚
(2𝑛−1 )𝑚 > 𝑛( ) > 𝑛1−𝑚 (2𝑛−1 )𝑚
𝑛
31
19. Let 𝒙𝟐 + 𝒚𝟐 = 𝒄𝟐 , then the least value Putting the all I value and then multiplies the
of 𝒙−𝟐 + 𝒚−𝟐 is in equations,
(a) c (b) 𝒄𝟐 (1+𝑎1 )(1+𝑎2 ) … (1+𝑎𝑛 )≥

(c) 𝒄𝟑 (d) none 2𝑛 √𝑎1 , 𝑎2 , 𝑎3 , … . , 𝑎𝑛
𝑥 2 +𝑦 2 𝑐2 ⇒ (1+𝑎1 )(1+𝑎2 ) … (1+𝑎𝑛 )≥

Ans. (d) Let z= 𝑥 −2 + 𝑦 −2 = = 𝑥2𝑦2
𝑥2𝑦2
2𝑛 (∵𝑎1 , 𝑎2 , 𝑎3 , … . , 𝑎𝑛 = 1)
and
It will be minimum when 𝑥 2 𝑦 2 will be

maximum. 22. If 𝒂𝟏 , … . , 𝒂𝒏 are positive real nos.
whose product is a fixed number c, then
As 𝑥 2 + 𝑦 2 = 𝑐 2 , then 𝑥 2 𝑦 2 is maximum
the minimum value of 𝒂𝟏 + 𝒂𝟐 + ⋯ +
𝑐2
when 𝑥 2 = 𝑦 2 = 𝒂𝒏−𝟏 + 𝟐𝒂𝒏 is
2
𝟏 𝟏
𝑐2 4
∴ 𝑧𝑚𝑖𝑛. = 𝑐4
= 𝑐 2. (a) 𝒏(𝟐𝒄)𝒏 (b) (𝒏 + 𝟏)𝒄𝒏
4 𝟏
(c) 𝟐𝒏𝒄𝒏 (d) done
𝒏+𝟏
20. 𝒏𝒏 ( 𝟐 )𝟐𝒏 >
Ans. (a) AM ≥ GM
(a) n! (b) (𝒏!)𝟐 1 1
So, LHS ≥ 𝑛(𝑎1 … 2𝑎𝑛 )𝑛 = 𝑛(2𝑐)𝑛
(c) (𝒏!)𝟑 (d) none.
1
13 +23 +⋯+𝑛3
Ans. (c) > (13 . 23 . … . 𝑛3 )𝑛
𝑛
𝒙 𝒆𝐜𝐨𝐬 𝒕
[∵AM> GM] 23. If f(x) = ∫𝟎 𝒅𝒕, then 2f(𝜋) =
𝒆𝐜𝐨𝐬 𝒕 +𝒆−𝐜𝐨𝐬 𝒕
1
𝑛(𝑛+1)2 (a) 0 (b) 𝜋 (c) –𝜋
⇒ > {(𝑛!)3 }𝑛
4
(d) none of these
𝑛+1 2𝑛
⇒ 𝑛𝑛 ( ) > {(𝑛!)3 }.
2 Ans. (b)
𝜋 𝑒 cos 𝑡
𝑓(𝜋) = ∫0 𝑑𝑡……….(1)
𝑒 cos 𝑡 +𝑒 −cos 𝑡
21. If 𝒂𝟏 , 𝒂𝟐 , 𝒂𝟑 , … . , 𝒂𝒏 are non- negative
𝜋 𝑒 −cos 𝑡
and 𝒂𝟏 , 𝒂𝟐 , 𝒂𝟑 , … . , 𝒂𝒏 = 𝟏, 𝑓(𝜋) = ∫0 𝑑𝑡 …………(2)
𝑒 −cos 𝑡 +𝑒 cos 𝑡
then (1+𝒂𝟏 )(1+𝒂𝟐 ) …(1+𝒂𝒏 )≥ [ since cos (𝜋-t)= - cost]

(a) 𝟐𝒏 (b) 𝟑𝒏 𝜋
∴ 2f(𝜋)= ∫0 𝑑𝑡 = 𝜋
(c) 𝟒𝒏 (d) none
1+𝑎𝑖
Ans. (a) ( 2
) ≥ √𝑎𝑖, where i= 1(1)n.
(AM ≥ GM)
32
24. Let [x] denotes the greatest integer 1 3

(1) + (2) ⟹ 2 ≤ 𝑔(2) ≤ 2
𝝅
less than or equal to x, then ∫𝟎𝟒 𝒔𝒊𝒏𝒙 𝒅(𝒙 −
∴ g(2) satisfies the inequality 0≤ 𝑔(2) < 2.
[𝒙])=
𝟏
26. The tangent at point P of a curve
(a) ½ (b) 1 - meets the y- axis at B, the line through P
√𝟐
(c) 1 (d) none of these parallel to y-axis meets the x-axis at A. If
𝜋/4
the area of 𝛥AOB is constant, the curve is
Ans. (b) ∫0 sin 𝑥 𝑑(𝑥 − [𝑥]) = a
𝜋
𝜋/4 1
∫0 sin 𝑥 𝑑𝑥 =−[cos 𝑥] 04 = − [ − 1] = (a) parabola (b) hyperbola
√2
1
1− (c) ellipse (d) circle
√2
𝜋 Ans. (b)
[∵ 0 < x <4 ∴ [𝑥] = 0]
Let P= (x, y)
𝒙 𝟏
25. Let g(x) = ∫𝟎 𝒇(𝒕)𝒅𝒕 , 𝒘𝒉𝒆𝒓𝒆 𝟐 ≤
Equation of tangent to the curve at P(x, y) is
𝒇(𝒕) ≤ 𝟏, 𝒕 ∈ [𝟎, 𝟏]𝒂𝒏𝒅𝟎 ≤ 𝒇(𝒕) ≤
𝟏 𝟑 𝑑𝑦
𝒇𝒐𝒓 𝒕 ∈ (𝟏, 𝟐]. Then (a) − 𝟐 ≤ 𝒈(𝟐) < Y- y = 𝑑𝑥 (𝑋 − 𝑥)
𝟐
𝟏 𝟑
(b) 𝟎 ≤ 𝒈(𝟐) < 2 (c) 𝟐 < 𝑔(𝟐) ≤ 𝑑𝑦
𝟐
𝟓
When X= 0, Y= y – x 𝑑𝑥
(d) 2 < g(2 )< 4
𝟐
𝑑𝑦
2 1 ∴B≡ (0, 𝑦 − 𝑥 )
𝑑𝑥
Ans. (b) 𝑔(2) = ∫0 𝑓(𝑡) 𝑑𝑡 = ∫0 𝑓(𝑡) 𝑑𝑡 +
2 1
∫1 𝑓(𝑡) 𝑑𝑡 𝑎𝑠 2 ≤ 𝑓(𝑡) ≤ 1 𝑓𝑜𝑟 0 ≤ 𝑡 ≤ 1, Area of 𝛥AOB ant=k
1 𝑑𝑦 𝑥 2 𝑑𝑦
1 1 1 ∴2 𝑥 (𝑦 − 𝑥 𝑑𝑥 ) ⟹ 𝑥𝑦 − = ±2𝑘 ⟹
1 𝑑𝑥
∴ ∫ 𝑑𝑡 ≤ ∫ 𝑓(𝑡)𝑑𝑡 ≤ ∫ 1 𝑑𝑡
𝑥 2 𝑑𝑦
0 2
𝑑𝑦 1
0 0 − 𝑥𝑦 = ±2𝑘 = 𝑐 ⟹ 𝑑𝑥 + 𝑦 (− 𝑥) =
𝑑𝑥
1 2
𝑜𝑟, 2 ≤ 𝑥2
1
∫0 𝑓(𝑡)𝑑𝑡 ≤ 1 ………. (1) 1
𝐼. 𝐹. = 𝑒 − log 𝑥 =
1 𝑥
𝑎𝑠 0 ≤ 𝑓(𝑡) ≤ 𝑓𝑜𝑟 1 < 𝑡 ≤ 2,
2 1 𝐶
𝑠𝑜𝑙𝑢𝑡𝑖𝑜𝑛 𝑖𝑠 𝑔𝑖𝑣𝑒𝑛 𝑏𝑦 𝑦, = ∫ 3 𝑑𝑥 + 𝑎
2 2 2 𝑥 𝑥
1
∴ ∫ 0 𝑑𝑡 ≤ ∫ 𝑓(𝑡) 𝑑𝑡 ≤ ∫ 𝑑𝑡
1 1 1 2 𝐶
𝑜𝑟 𝑦 = 𝑥 (− ) + 𝑎𝑥
2𝑥 2
𝑜𝑟, 0 ≤
2 1
≤ 2 ……………. (2) 𝑜𝑟 2𝑥𝑦 = −𝐶 + 2𝑎𝑥 2
∫1 𝑓(𝑡) 𝑑𝑡
33
𝜋 𝜋
⟹ x= tan−1 𝑓(𝑥) ∴ − 2 < 𝑥 < 2
𝑜𝑟 2𝑎𝑥 2 − 2𝑥𝑦 − 𝐶 = 0 ………….(1)
𝟐+𝐬𝐢𝐧 𝒙 𝒅𝒚
29. If y= (x) and (𝒅𝒙) =
Here h= -1, a= a, b= 0 𝒚+𝟏
𝝅
− 𝐜𝐨𝐬 𝒙, 𝒚(𝟎) = 𝟏, 𝒚 ( 𝟐 ) equals:
∴ ℎ2 > ab. Hence curve (1) is a
hyperbola (a) 1/3 (b) 2/3 (c) -
𝒅 𝒌 𝒅𝒙 1/3 (d) 1
27. The function f(k) = 𝒅𝒌 ∫𝟎 𝟏−𝐜𝐨𝐬 𝒌.𝐜𝐨𝐬 𝒌
2+sin 𝑥 𝑑𝑦
satisfies the differentiable equation Ans. (a) Given, = − cos 𝑥
𝑦+1 𝑑𝑥
𝒅𝒇 ………..(1) & 𝑦(0) =
(a) 𝒅𝒌 + 𝟐𝒇(𝒌). 𝐜𝐨𝐭 𝒌 = 𝟎
1 ………….(2)
𝒅𝒇
(b) 𝒅𝒌 + 𝟐𝒇(𝒙). 𝐜𝐨𝐬 𝒌 = 𝟎
𝑑𝑦 cos 𝑥
𝒅𝒇
(1) ⟹ ∫ = −∫ 𝑑𝑥
(c) 𝒅𝒌 − 𝟐𝒇(𝒌). 𝒄𝒐𝒔𝟐 𝒌 = 0 𝑦+1 2 + sin 𝑥
(d) none of these ⟹ log(𝑦 + 1) = − log(2 + sin 𝑥) + log 𝑐
𝑐
Ans. (a) 𝑓(𝑥) = ⟹𝑦+1=
2 + sin 𝑥
1
= 𝑐𝑜𝑠𝑒𝑐 2 𝑘 𝑐
1−cos 𝑘 cot 𝑘
⟹𝑦 = 2+sin 𝑥 −
𝑑𝑓 1 …………..(3)
= 2 𝑐𝑜𝑠𝑒𝑐 𝑘 (– 𝑐𝑜𝑠𝑒𝑐 𝑘 cot 𝑘)
𝑑𝑘
= −2𝑓(𝑘) cot 𝑘 𝑐
𝐴𝑙𝑠𝑜 𝑔𝑖𝑣𝑒𝑛 𝑦(0) = 1 ⟹ 1 = −1⟹𝑐
2
𝑑𝑓 =4
𝑜𝑟 + 2𝑓(𝑘)𝑐𝑜𝑡𝑘 = 0
𝑑𝑘
2 − sin 𝑥
∴ 𝑓𝑟𝑜𝑚 (3), 𝑦(𝑥) =
28. The largest value of ‘c’ such that there 2 + sin 𝑥
exists a differentiable function f(x) for –c<
𝜋 2−1 1
x < c that satisfies the equation 𝒚𝟏 = 𝟏 + ∴𝑦=( )= =
2 2+1 3
𝒚𝟐 with f(0)= 0 is
(a) 1 (b) 𝜋
𝝅 𝝅
(c) (d) 30. If 𝒍𝟏 𝒂𝒏𝒅 𝒍𝟐 are the side length of two
𝟑 𝟐
variables squares 𝒔𝟏 𝒂𝒏𝒅 𝒔𝟐 , respectively.
𝑑𝑦
Ans. (d) = 1 + 𝑦 2 ⟹ tan−1 𝑦 = 𝑥 + If 𝒍𝟏 = 𝒍𝟐 + 𝒍𝟐 𝟑 + 𝟔, then the rate of
𝑑𝑥
𝑘 change of the area of 𝒔𝟐 with respect to
rate of change of the area of 𝒔𝟏 when
∵ f(x) satisfies the equation 𝒍𝟐 = 𝟏 is
∴tan−1 𝑓(𝑥) = 𝑥 + 𝑘 (a) 3/2 (b) 2/3
(c) 4/3 (d) none
Now, f(0)= 0= k= 0
34
Ans. (d) Let ∆1 𝑎𝑛𝑑 ∆2 be the area of the 𝟐𝟏𝟎𝟏+𝟏 𝟐𝟏𝟎𝟏−𝟏

(a) (b)
𝟐𝟏𝟎𝟎 𝟐𝟏𝟎𝟎
sequences 𝑠1 𝑎𝑛𝑑 𝑠2 ,
𝟐𝟐𝟎𝟏−𝟏
(c) (d) None of these
𝟐𝟏𝟎𝟎
∆1=𝑙1 2 𝑎𝑛𝑑 ∆2 = 𝑙2 2
Ans. (c)
𝑑∆1 𝑑∆2
∴ = 2𝑙1 𝑎𝑛𝑑 = 2𝑙2 .
𝑑𝑙1 𝑑𝑙2
𝑡𝑟 3 = 2𝑟 + 2−𝑟 + 3𝑡𝑟
𝑑∆ 𝑙 𝑑𝑙 𝑙 1
⤇ 𝑑∆2 = 𝑙2 . 𝑑𝑙2 = 𝑙2 . 1+3𝑙 1
1 1 1 1 2 ∴∑100 3 100 𝑟 100 100
𝑟=1 𝑡𝑟 = ∑𝑟=1 2 + ∑𝑟=1 2𝑟 + 3 ∑𝑟=1 𝑡𝑟
𝑑∆2 1
When𝑙2 = 1, 𝑙1 = 8 , 𝑡ℎ𝑒𝑛 = 32. 1 1
(1− 100 )
𝑑∆1
= 2(2 100
−1+ 2 2
1 + 3 ∑100
𝑟=1 𝑡𝑟 =
1−
2
1
2101 − 2 + 1 − 2100 + 3 ∑100
𝑟=1 𝑡𝑟
ISI B.STAT/B.MATH 2201 −1

OBJECTIVE QUESTIONS & = − 1 + 3 ∑100
𝑟=1 𝑡𝑟
2100
SOLUTIONS 3. If ∑𝒏𝒓=𝟏 𝒓.r! = 100! - 1, then n equals
SET – 5 (a) 100 (b) 101

𝝅 Ans. (c)
𝒔𝒊𝒏𝟐 𝒏𝒙
1. If 𝒂𝒏 =∫ 𝒅𝒙, then
𝟐
𝟎 𝒔𝒊𝒏𝟐 𝒙
𝒂𝟏 𝒂𝟓𝟏 𝒂𝟏𝟎𝟏 𝑡𝑟 = r. r != (r+1 -1)r!= (r+1)! –r!
[𝒂𝟐 𝒂𝟓𝟐 𝒂𝟏𝟎𝟐 ] = ∴∑𝑛𝑟=1 𝑡𝑟 = (𝑛 + 1)! − 1! = (𝑛 + 1)! − 1
𝒂𝟑 𝒂𝟓𝟑 𝒂𝟏𝟎𝟑
(a) 1 (b) 0
(c) -1 (d) none of these 4. If m = ∑∝𝒓=𝟎 𝒂𝒓 , n=∑∝𝒓=𝟎 𝒃𝒓 where
0<a<1,0<b<1,then the quadratic equation
Ans. (b) 𝑎𝑛+2 + 𝑎𝑛 − 2𝑎𝑛+1 = 0
whose
⟹ 𝑎1 , 𝑎2 , 𝑎3 , … 𝑎𝑟𝑒 𝑖𝑛 𝐴. 𝑃.
roots are a and b is
∴ 𝑎1 + 𝑎101 = 2𝑎1 + 2𝑎1 + 100𝑑 =
(a) mn𝒙𝟐 +(m+n-2mn)x+mn-m-n+1=0
2(𝑎1 + 50𝑑) = 2𝑎51
(b) mn𝒙𝟐 +(2mn-m-n)x+mn-m-n+1=0
𝑎2 + 𝑎102 = 2𝑎52 , 𝑎3 + 𝑎103 = 2𝑎53
(c) mn𝒙𝟐 +(2mn+m+n)x+mn+m+n+1=0
2. If 𝒕𝒓 =𝟐𝒓⁄𝟑 +𝟐−𝒓⁄𝟑 , then (d) mn𝒙𝟐 -(2mn+m+n)x+mn+m+n+1=0
∑𝟏𝟎𝟎 𝟑 𝟏𝟎𝟎
𝒓=𝟏 𝒕𝒓 − 𝟑 ∑𝒓=𝟏 𝒕𝒓 +1 =
Ans. (a)
1 𝑚−1 𝑛−1
m = 1−𝑎 ⟹ 𝑎 = , 𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝑏 = .
𝑚 𝑛
35
Required quadratic equation is ⟹2𝑏101 − 𝑎101 − 𝑐 101 < 0
𝑥 2 − (𝑎 + 𝑏)𝑥 + 𝑎𝑏 = 0 Let f(x)= 𝑥 2 − 𝑘𝑥+2𝑏101 − 𝑎101-𝑐 101
or, 𝑥 2 − (
𝑚−1
+
𝑛−1
) 𝑥+
(𝑚−1)(𝑛−1)
=0 Then f(−∞) = ∞ > 0, 𝑓(0) = 2𝑏101 −
𝑚 𝑛 𝑚𝑛
𝑎101 − 𝑐 101 < 0, 𝑓(∞) = ∞ > 0.
or, mn𝑥 2 − (2𝑚𝑛 − 𝑚 − 𝑛)𝑥 + 𝑚𝑛 − 𝑚 −
Hence equation f(x)= 0 has one root in (-
𝑛+1=0
∞, 0)and other in(0, ∞).
5. If ∑𝒏𝒓=𝟏 𝒓𝟒 = 𝒂𝒏 , then ∑𝒏𝒓=𝟏 𝒓𝟒 (𝟐𝒓 −
7. If the sum of the series ∑∝𝒏=𝟎 𝒓𝒏 , |r|<1, is
𝟏)𝟒 =
s, then sum of the series ∑∝𝒏=𝟎 𝒓𝟐𝒏 is
(a) 𝒂𝟐𝒏 +𝒂𝒏 (b) 𝒂𝟐𝒏 -𝒂𝒏 𝟐𝒔
(c) 𝒂𝟐𝒏 -16𝒂𝒏 (d)𝒂𝟐𝒏 +16𝒃𝒏 (a) 𝒔𝟐 (b) 𝒔𝟐−𝟏
𝒔𝟐 𝒔𝟐
Ans. (c) ∑𝑛𝑟=1(2𝑟 4 4
− 1) = 1 + 3 + 5 + 4 4 (c)𝟐𝒔+𝟏 (d)𝟐𝒔−𝟏
(2𝑛 4
⋯+ − 1)
Ans. (d)
= [14
+2 +3 +⋯+ 4 4 (2𝑛)4 ] 4
− [2 +
s= ∑∞ 𝑛 2 3
𝑛=0 𝑟 = 1 + 𝑟 + 𝑟 + 𝑟 + ⋯ 𝑡𝑜 ∞ =
4 + 64 + ⋯ + (2𝑛)4 ]
4
1
1−𝑟
= 𝑎2𝑛 − 24 (14 + 24 + 34 + ⋯ + 𝑛4 ) =
1 𝑠−1
𝑎2𝑛 − 16𝑎𝑛 . ∴ r=1- =
𝑠 𝑠
6. If positive numbers a, b, c be in H.P., 1 1 𝑠2

∑∞
𝑛=0 𝑟
2𝑛
= 1−𝑟 2 = (𝑠−1)2
=
then equation 𝒙𝟐 − 𝒌𝒙 + 𝟐𝒃𝟏𝟎𝟏 − 𝒂𝟏𝟎𝟏 = 1− 2
𝑠
2𝑠−1
𝟎 (𝒌 ∊ 𝑹) has
𝟐 𝟒 𝟐𝒏
8. The limit of the product √𝟓,√𝟓,…. √𝟓
(a) both roots positive as n→∞ is
(b) both roots negative
𝟏
(a) 𝟓 (b) 𝐥𝐨𝐠 𝟏𝟎 𝟓
(c) one positive and one negative root
(d) both roots imaginary. (c) 1 (d) 5
Ans. (c) Ans. (d) Required limit=

1 1 1 1 1 1 1 1
Lt 52 . 54 . 58 … . 52𝑛 = Lt 52+4+8+⋯+2𝑛 =
a, b, c are in H.P. 𝑛→∞ 𝑛→∞
1
2
5 1 =5
⟹H.M. of a and c= b⟹√𝑎𝑐 > b (∵G.M. > 1−
2
H.M.)
9. If numbers p, q, r are in A.P. , then
Since A .M. > G.M. 𝒎𝟕𝒑 , 𝒎𝟕𝒒 , 𝒎𝟕𝒓 (m>0) are in
𝑎101 +𝑐 101
∴ > (√𝑎𝑐)101 > 𝑏101 [∵ √𝑎𝑐 >
2
𝑏]
36
(a) A.P. (b) G.P. 11. The set of all real number x such that
(c) H.P. (d)none of ||3-x|-|x+2||=5 is
these
(a) [3, ∞) (b) (-∞, −𝟐]
𝑚7𝑞 𝑚7𝑟 (c) (-∞, −𝟐] ∪[3, ∞) (d) (-
Ans. (b) 𝑚7𝑝 = 𝑚7(𝑞−𝑝) , 𝑚7𝑞 = 𝑚7(𝑟−𝑞)
∞, −𝟑] ∪[2, ∞)
∴ q- p= r- q
Ans. (c) (||3 − x| − |x + 2||)2 = 25
∴ 𝑚7𝑝 , 𝑚7𝑞 , 𝑚7𝑟 are in G.P.
⤇(3 − x)2 + (x + 2)2 − 2|3-x||x+2|= 25
10. Let n be a positive integer and
⤇ x 2 − 𝑥 − |−x 2 + 𝑥 + 6| = 6
(𝟏 + 𝒙 + 𝒙𝟐 )𝒏 = 𝒂𝟎 + 𝒂𝟏 𝒙 + ⋯ + 𝒂𝟐𝒏 𝒙𝟐𝒏 ,
then the value of 𝒂𝟎 𝟐 − 𝒂𝟏 𝟐 + So, it is clear that −x 2 + 𝑥 + 6 < 0 ,
𝒂𝟐 𝟐 … . . +𝒂𝟐𝒏 𝟐 is
i.e. −x 2 + 𝑥 + 6 ≥ 0
(a) 0 (b) 𝒂𝟎
(c) 𝒂𝒏 (d) 𝒂𝟐𝒏 (x-3)(x+2)≥ 0. So, x ≤ −2 & 𝑥 ≥ 3
Ans. (c) Replacing x by (- 1/x), we get ∴x ∊ (-∞, −2] ∪[3, ∞).
1 1 𝑛 𝑎1 𝑎2 12. The differential equation of the system

(1 − + 2 ) = 𝑎0 − + 2 + ⋯ of circle touch the y – axis at the origin is
𝑥 𝑥 𝑥 𝑥
1 𝑎2𝑛
− 𝑎2𝑛−1 . 2𝑛−1 + 2𝑛 𝒅𝒚
𝑥 𝑥 (a) 𝒙𝟐 + 𝒚𝟐 − 𝟐𝒙𝒚 𝒅𝒙= 0
𝒅𝒚
or, (1 − 𝑥 + 𝑥 2 )𝑛 = 𝑎0 𝑥 2𝑛 − 𝑎1 𝑥 2𝑛−1 + (b) 𝒙𝟐 + 𝒚𝟐 + 𝟐𝒙𝒚 𝒅𝒙=0
𝑎2 𝑥 2𝑛−2 + ⋯ + 𝑎2𝑛 ……………….(1) 𝒅𝒚
(c) 𝒙𝟐 − 𝒚𝟐 − 𝟐𝒙𝒚 𝒅𝒙 = 0
And given (1 + 𝑥 + 𝑥 2 )𝑛 = 𝑎0 + 𝑎1 𝑥 + 𝒅𝒚
(d) 𝒙𝟐 − 𝒚𝟐 + 𝟐𝒙𝒚 𝒅𝒙 = 𝟎
⋯ + 𝑎2𝑛 𝑥 2𝑛 …………………(2)
Multiplying corresponding sides of (1) and Ans. (d) 𝑥 2 + 𝑦 2 − 2𝑎𝑥= 0

(2), we have 𝑑𝑦
2x+2y𝑑𝑥 − 2𝑎=0
(1 + 𝑥 2 + 𝑥 4 )𝑛 = (𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 +
𝑑𝑦 𝑥 2 +𝑦 2
⋯ + 𝑎2𝑛 𝑥 2𝑛 ) × (𝑎0 𝑥 2𝑛 − 𝑎1 𝑥 2𝑛−1 + ⤇2(x+ y )=2 ( )
𝑑𝑥 2𝑥
𝑎2 𝑥 2𝑛−2 + ⋯ + 𝑎2𝑛 ) …….. (3)
𝑑𝑦
2 4 𝑛 2 4 ⤇2𝑥 2 + 2𝑥𝑦 𝑑𝑥 = 𝑥 2 + 𝑦 2
(1 + 𝑥 + 𝑥 ) = (𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 +
⋯ + 𝑎𝑛 𝑥 𝑛 + ⋯ + 𝑎2𝑛 𝑥 4𝑛 ) ……………..(4) 𝑑𝑦
⤇𝑥 2 − 𝑦 2 + 2𝑥𝑦 𝑑𝑥 = 0.
Equating coefficient of 𝑥 2𝑛 on both sides of
(3) and (4) 13. Let y(x) be a non-trivial solution of the
second order liner differential equation
𝑎0 2 − 𝑎1 2 + 𝑎2 2 … . . +𝑎2𝑛 2 = 𝑎𝑛 .
37
2 2
𝒅𝟐 𝒚 𝒅𝒚 z𝑒 𝑥 = ∫ 𝑥 3 𝑒 𝑥 𝑑𝑥 (put 𝑥 2 = 𝑢)
+ 𝟐𝒄 𝒅𝒙 + 𝒌𝒚 = 𝟎, 𝒘𝒉𝒆𝒓𝒆 𝒄 < 0, 𝑘 >
𝒅𝒙𝟐
0, 𝒄𝟐 − 𝒌. Then 1 2
= 2 (𝑥 2 − 1)𝑒 𝑥 + 𝑐
(a) |y(x)|⟶∞ 𝒂𝒔 𝒙 → ∞
(b) |y(x)|⟶𝟎 𝒂𝒔 𝒙 → ∞ ∴ General solution is given by:- √𝑦 =
1 2
(𝑥 2 − 1) + 𝑐𝑒 −𝑥
2
(c) 𝐥𝐢𝐦 |𝐲(𝐱)| exists & is finite
𝒙→±∞
1
(d) none Since y(0)=0, so, c= 2
Ans. (a) 𝑚2 + 2𝑐𝑚 + 𝑘 = 0 1 1

∴y(1)= (2𝑒)2 = 4𝑒 2.
−2𝑐±√4𝑐 2 −4𝑘 −2𝑐±√4 ( 𝑐 2 −𝑘)
∴m= = = 15. Let 𝒙𝒊 are non -ve reals and s= 𝒙𝟏 +
2 2
−2𝑐±2𝑎 2 2 2 𝒙𝟐 + ⋯ + 𝒙𝒏 , 𝒕𝒉𝒆𝒏 𝒙𝟏 𝒙𝟐 + 𝒙𝟐 𝒙𝟑 + … +
[∵ 𝑐 − 𝑘 = 𝑎 = 𝑐 − 𝑘]
2
𝒙𝒏−𝟏 𝒙𝒏 ≤
−𝑐−𝑎 −𝑐+𝑎
= , 𝒔𝟐 𝒔𝟐
2 2
(a) (b)
𝟐 𝟑
The general solution of the given L.D.E. is y 𝒔𝟐
𝑐+𝑎 (c) (d) none
𝟒
= 𝑐1 𝑒 𝑚1 𝑥 + 𝑐2 𝑒 𝑚2 𝑥 = 𝑐1 𝑒 −( 2
)𝑥
+
𝑐−𝑎
𝑐2 𝑒 −( 2
)𝑥 Ans. (c) (𝑥1 + 𝑥3 + 𝑥5 + ⋯ )(𝑥2 + 𝑥4 +
𝑥6 + ⋯)≥ 𝑥1 𝑥2 + 𝑥2 𝑥3 + … + 𝑥𝑛−1 𝑥𝑛
So, |y(x)|⟶∞ 𝑎𝑠 𝑥 → ∞
As when expanding LHS, we must get RHS
14. Let y be a function of x satisfying and many additional non- negative terms
𝒅𝒚
= 𝟐𝒙𝟑 √𝒚 − 𝟒𝒙𝒚. If y(0)= o and then since 𝑥𝑖 ≠ 0.
𝒅𝒙
y(1)equals Thus maximum achieved by taking 𝑥1 =
𝟏 𝑥, 𝑥2 = 𝑠 − 𝑎 and all other terms 0, but
(a) (b) 1/e
𝟒𝒆𝟐
(c) 𝒆𝟏/𝟐 (d) 𝒆𝟑/𝟐 𝑠2 𝑠
x(s-x) ≤ with equality when x = 2 (using
4
𝑑𝑦 AM ≥ GM )
Ans. (a) 𝑑𝑥 (4𝑥)𝑦=2√𝑦𝑥 3 (Bernoulli’s
Equation) 16. For any positive reals x, y, z and a is
the arithmetic mean of x, y, z then 𝒙𝒙 𝒚𝒚 𝒛𝒛
Putting√𝑦 = 𝑧, the equation reduces to is
𝑑𝑧
+ (2𝑥)𝑧= 𝑥 3 (linear in z) (a) ≥ (𝒙𝒚𝒛)𝒂 (b) < (𝒙𝒚𝒛)𝒂
𝑑𝑥
(c) >(𝒙𝒚𝒛)𝒂 (d) none
2
∴ I. F.= e∫ 2𝑥𝑑𝑥 = 𝑒 𝑥
Ans. (a) Let ≥ 𝑦 ≥ 𝑧 , then 𝑥 𝑥 𝑦 𝑦 ≥ 𝑥 𝑦 𝑦 𝑥 ,
Multiplying and integrating 𝑥 𝑥
as (𝑦) 𝑥 ≥ (𝑦) 𝑦 is obviously true.
38
Similarly, 𝑦 𝑦 𝑧 𝑧 ≥ 𝑦 𝑧 𝑧 𝑦 𝑎𝑛𝑑𝑧 𝑧 𝑥 𝑥 ≥ 𝑧 𝑥 𝑥 𝑧 (a)𝟐𝒏 (b) 𝟑𝒏
Multiplying all these, (𝑥 𝑥 𝑦 𝑦 𝑧 𝑧 )2 ≥ (c) 𝟒𝒏 (d) none

𝑥 𝑦+𝑧 . 𝑦 𝑧+𝑥 . 𝑧 𝑥+𝑦 𝑛
Ans. (b) There are (𝑚 ) choices for a subject
⇒𝑥 𝑥 𝑦 𝑦 𝑧 𝑧 × (𝑥 𝑥 𝑦 𝑦 𝑧 𝑧 )2 ≥ B with m elements.
𝑥 𝑥+𝑦+𝑧 . 𝑦 𝑥+𝑦+𝑧 . 𝑧 𝑥+𝑦+𝑧
Then each of the remaining n-m elements
⇒ (𝑥 𝑥 𝑦 𝑦 𝑧 𝑧 )3 ≥ (𝑥𝑦𝑧)3𝑎 can be in C or not, so there are 2𝑛−𝑚
choices for C
⇒ 𝑥 𝑥 𝑦 𝑦 𝑧 𝑧 ≥ (𝑥𝑦𝑧)𝑎
Thus the total no of pairs (B, C) is
17. The number of integers between 1
∑ 2𝑛−𝑚 . 𝑛𝑐𝑚 = ∑ 2𝑚 . 𝑛𝑐𝑚 = (1 + 2)𝑛 = 3𝑛
and 567 are divisible by either 3 or 5, is
(from binomial theorem) [∵𝑛𝑐𝑚 = 𝑛𝑐𝑛−𝑚 ]
(a) 200 (b) 250
(c) 300 (d) none 20. The value of the integral
𝟐[𝒙]
𝟎 |𝟑𝒙−[𝒙]|
Ans. (d) Let z= {1, 2, 3, …., 566, 567} ∫−𝟏𝟎 𝟐[𝒙] dx, where [.] denotes greatest
𝟑𝒙−[𝒙]
𝑧 integer function is
P = {x ∊ 3 𝑑𝑒𝑣𝑖𝑑𝑒𝑠 𝑥} and
𝑧 (a) 0 (b) 10
Q = { x ∊ 5 𝑑𝑒𝑣𝑖𝑑𝑒𝑠 𝑥 }
(c) -10 (d) none of
these
Here, |P|= 189 [∵ 567= 189× 3]
Ans. (d)
And |Q|= 113 [∵ 567= 113× 5 + 2]
2[𝑥]
| |
P ∩ 𝑄= set of multiple of both 3 and 5, Let 𝑓(𝑥) = 3𝑥−[𝑥]
2[𝑥]
3𝑥−[𝑥]
| P ∩ 𝑄 |=37; |P ∪ 𝑄|= 189+ 113- 37= 265.
Clearly f is not defined if x= 0 and when
18. Sets A and B have 3 and 6 elements 3x= [x]
respectively. The minimum number of
1
elements in A ∪B is So in (-10, 0), f is not defined at x= − 3 .
(a) 3 (b) 6 1
When x∊(−10, − )
(c) 9 (d) none 3
[x] < 0 and 3x- [x]< 0

Ans. (b) n(A ∪ B)≥ max{𝑛 (𝐴), 𝑛 (𝐵)}
[𝑥]
Thus n (A ∪ B)≥ max {3, 6} = 6. So, 3𝑥−[𝑥] > 0 ⟹ 𝑓(𝑥) = 1
19. A has n elements. How many (B, C) When x ∊ (− 3 , 0)

1
are such that ≠ 𝑩 ⊆ 𝑪 ⊆ 𝑨 ?

[x] < 0 and 3x- [y] > 0⟹ f(x)= -1
39
0 −1/3 0 𝑥2 0 1
∫ 𝑓(𝑥) 𝑑𝑥 = ∫ 𝑑𝑥 + ∫ (−1) 𝑑𝑥 = [2𝑥 − ] + 2[𝑥]
−10 −10 −1/3 2 −1 0
1 1
−3 0 = 0 − (−2 − ) + 2(1 − 0)
= [𝑥] − (𝑥) 1 2
−10 −3 9
=
1 1 2
= (− + 10) − (0 + )
3 3
2 23. Let f(x) be a continuous function such
= 10 − that f(a-x)+f(x)=0 for all x ∊[0, a].
3
𝝅 𝒂 𝒅𝒙
𝒃 𝐬𝐢𝐧 𝒙 Then ∫𝟎 equals
21. The equation ∫𝟒𝝅 (𝒂|𝐬𝐢𝐧 𝒙| + 𝟏+𝐜𝐨𝐬 𝒙 + 𝟏+𝒆𝒇(𝒙)
−
𝟒
(a) a (b) a/2 (c) ½
𝒄) 𝒅𝒙= 0 gives a relation between
f(a) (d) none of these
(a) a, b and c (b) a and b Ans. (b) Given, f(a- x)= - f(x)
(c) b and c (d) a and c
𝑎 𝑑𝑥 𝑎 𝑑𝑥
𝜋 Now 2I= ∫0 +∫ =
1+𝑒 𝑓(𝑥) 0 1+𝑒 𝑓(𝑎−𝑥)
Ans. (d) I = 2a∫0 |sin 𝑥| 𝑑𝑥 + 0 +
4
𝑎 𝑑𝑥 𝑎 𝑑𝑥 𝑎
𝜋 ∫0 + ∫0 1+𝑒 −𝑓(𝑥) = ∫0 𝑑𝑥 = 𝑎
𝜋
𝜋 1+𝑒 𝑓(𝑥)
4
∫ 𝑐 𝑑𝑥 = 2𝑎 ∫0 𝑠𝑖𝑛𝑥 𝑑𝑥 + 𝑐. 2
−
𝜋
4
4 𝑎
∴𝐼=
𝜋 2
𝜋
= −2𝑎[𝑐𝑜𝑠𝑥] 4 + 𝑐 24. Let f(x) be an integrable odd function
0 2
1 𝜋 in [-5, 5] such that f(10+ x)= f(x),
= −2𝑎 ( − 1) + 𝑐
√2 2 𝟏𝟎+𝐱
then ∫𝐱 𝐟(𝐭)𝐝𝐭 equals
22. Let f(x) = max. {2- x, 2, 1+ x} then
𝟏 𝟓
∫−𝟏 𝒇(𝒙) 𝒅𝒙= (a) 0 (b) 2∫𝐱 𝐟(𝐱)𝐝𝐱
(c) > 0 (d) none of these
(a) 0 (b) 2 (c)
𝑥+10
9/2 (d) none of these Ans. (a) Let y= ∫𝑥 𝑓(𝑡) 𝑑𝑡…… (1)
Ans. (c) ∴ f(x) = 2-x, x≤ 0 𝑑𝑦

Then, 𝑑𝑥 = 𝑓(𝑥 + 10). 1 − 𝑓(𝑥) = 0 [∵
= 2, 0≤x≤1 f(10+x)= f(x)]
= 1+ x, x ≥1 ∴ y is independent of x.
1 0 Putting x= -5 in (1), we get
I= ∫−1 𝑓(𝑥) 𝑑𝑥 = ∫−1 𝑓(𝑥)𝑑𝑥 +
1 0 1
∫0 𝑓(𝑥)𝑑𝑥 = ∫−1(2 − 𝑥)𝑑𝑥 + ∫0 2 𝑑𝑥 5
y= ∫−5 𝑓(𝑡) 𝑑𝑡 = 0 …………. (2)
40
Since y is independent of x, therefore y has 𝑚3

Y= mX – m- 𝑥 − 2
same value for all x.
𝑥+10 [∵ three normals are drawn from point on
∴∫𝑥 𝑓(𝑥) 𝑑𝑥= 0 the axis (H, 0) (say)]
𝟏 𝟐 𝟏 𝟐
25. If ∫𝟎 𝒙𝒆𝒙 𝒅𝒙 = 𝒌 ∫𝟎 𝒆𝒙 𝒅𝒙, then 𝑚2
∴ H= 1 + ⟹ m= ±√2𝐻 − 1
2
(a) k > 1 (b) 0 < k < 1 For m to be real, H > ½

(c) k=1 (d) none
10 1 29
⟹ℎ− > 2 ⟹ ℎ > 18
Ans. (b) Here 0 < x < 1 9
2 2 1 2 [where h is the abscissa w.r.t. the previous

⟹0< x𝑒 𝑥 < 𝑒 𝑥 ⟹ 0 < ∫0 𝑥𝑒 𝑥 𝑑𝑥 <
1 2 1 2 1 2
co-ordinate system]
∫0 𝑒 𝑥 𝑑𝑥 ⟹ 0 < 𝑘 ∫0 𝑒 𝑥 𝑑𝑥 < ∫0 𝑒 𝑥 𝑑𝑥
Hence the points are given by
⟹0<𝑘 2
(ℎ, 3) , 𝑤ℎ𝑒𝑟𝑒 ℎ > 18.
29
1
2
<1 [𝑑𝑖𝑣𝑖𝑑𝑖𝑛𝑔 𝑏𝑦 ∫ 𝑒 𝑥 𝑑𝑥]
0 27. A (𝒙𝟏 , 𝒚𝟏 ) and B (𝒙𝟐 , 𝒚𝟐 ) are any two
points on the parabola y= c𝒙𝟐 + 𝒃𝒙 + 𝒂.
26. Consider the parabola 3𝒚𝟐 − 𝟒𝒚 −
If P(𝒙𝟑 , 𝒚𝟑 ) be the point on the arc AB
𝟔𝒙 + 𝟖=0. The points on the axis of this
where the tangent is parallel to the chord
parabola from where 3 distinct normals
AB, then
can be drawn are given by
(a) 𝒙𝟐 is the A.M. between 𝒙𝟏 𝒂𝒏𝒅 𝒙𝟑
𝟐 𝟐𝟗
(a) (𝟑 , 𝒉) , 𝒘𝒉𝒆𝒓𝒆 𝒉 > (b) 𝒙𝟐 is the G.M. between 𝒙𝟏 𝒂𝒏𝒅 𝒙𝟑
𝟏𝟖
𝟏 𝟏𝟗
(b) (𝒉, 𝟑) , 𝒘𝒉𝒆𝒓𝒆 𝒉 > (c) 𝒙𝟐 is the H.M. between 𝒙𝟏 𝒂𝒏𝒅 𝒙𝟑
𝟏𝟖
𝟐 𝟐𝟗
(d) none of these
(c) (𝒉, 𝟑) , 𝒘𝒉𝒆𝒓𝒆 𝒉 > 𝟏𝟖
Ans. (d) Slope of tangent at p=
(d) none of these 𝑑𝑦 𝑦 −𝑦
𝑎𝑡 (𝑥3 , 𝑦3 ) = 2𝑎𝑥3 + 𝑏 = 𝑥2−𝑥1
𝑑𝑥 2 1
Ans. (c)
[given]……….(A)
2 2 10
Given parabola is (𝑦 − ) = 2 (𝑥 − ) ∵ A and B lie on the parabola,
3 9
Let X= 𝑥 −
10
,𝑌 = 𝑦 − 3
2 ∴𝑦1 = 𝑎𝑥1 2 + 𝑏𝑥1 + 𝑐 ………………(1)
9
And 𝑦2 = 𝑎𝑥2 2 + 𝑏𝑥2 + 𝑐 ……………..(2)
∴𝑌 2 = 2𝑥 becomes the equation of parabola
with reference to the new origin. ∴ 𝑦1 − 𝑦2 = [𝑎(𝑥1 + 𝑥2 )(𝑥1 − 𝑥2 ) +
𝑏](𝑥1 − 𝑥2 )
Hence equation of normal will be
𝑦 −𝑦
∴ 𝑥2−𝑥1 = 𝑎 (𝑥1 + 𝑥2 ) + 𝑏
2 1
41
∴ From (A), a(𝑥1 + 𝑥2 ) + 𝑏 = 2𝑎𝑥3 + 𝑏 (a) (a, 2a) (b) (4a, 4a)
𝑥1 +𝑥2
(c) (a- 2a) (d) none of
⟹ = 𝑥3 these
2
28. Let P (𝛼,β) be any point on parabola Ans. (a)

𝒚𝟐 = 𝟒𝒙(𝟎 ≤ 𝜷 ≤ 𝟐). M is the foot of
For any three points A, B, and C
perpendicular from the focus S to the
tangent at P, then the maximum value of |AC - AB|≤ BC
area of
∴ required point A will be on the
(a) 1 (b) 2 (c) intersection of BC and the parabola.
𝝅 𝝅
(d)
𝟑 𝟔
∴ A≡ (a, 2a) [∵ AB ia tangent to the
2 parabola]
Ans. (a) Let 𝛼= 𝑡 , 𝛽 = 2𝑡
∴ 0≤ 2t ≤ 2 ⟹ 0≤ t ≤ 1
Equation of tangent at (𝑡 2 , 2𝑡) 𝑖𝑠 𝑦𝑡 = 𝑥 + 30. Let f : R ⟶R be a function defined by

𝒆|𝒙| −𝒆−𝒙
𝑡2 f(x)= 𝒆𝒙 +𝒆−𝒙 , then
If S be the focus, then S ≡(1, 0)
(a) ‘f’ is one-one and onto
|1+𝑡 2 | (b) ‘f’ is one-one but not onto
SM= √1+𝑡 2 = √1 + 𝑡 2
(c) ‘f’ is not one-one but onto
2
PS= √(𝑡 2 − 1)2 + 4𝑡 2 = (𝑡 + 1) (d) ‘f’ is neither one-one nor onto
PM= √𝑃𝑆 2 − 𝑆𝑀2 = 𝑡 √𝑡 2 + 1 Ans. (d)
Area of 𝛥 PMS= ½ .PM.SM= ½ 𝑒 𝑥 − 𝑒 −𝑥

𝑓(𝑥) = 𝑥 , 𝑥 ≥ 0 = 0, 𝑥 ≤ 0
.t√𝑡 2 + 1. √𝑡 2 + 1 𝑒 + 𝑒 −𝑥
𝑡(𝑡 2 +1)
Since f(x)= 0, for all x ≤ 0
= 2
∴ f(x) is a many –one function
Which is an increasing function hence its
𝑒 𝑥 −𝑒 −𝑥
maximum value occurs at t= 1 Let y= ,𝑥 ≥ 0
𝑒 𝑥 +𝑒 −𝑥
∴ Maximum area= 1 sq. unit. 𝑒 𝑥 −𝑒 −𝑥 1

⟹ 𝑒 𝑥 +𝑒 −𝑥 = 𝑦
𝑒𝑥 1+𝑦
⟹𝑒 −𝑥 = 1−𝑦
29. The point A on the parabola 𝒚𝟐 = 𝟒𝒙
for which |AC-AB | is maximum, where 1+𝑦 1 1+𝑦
⟹𝑒 2𝑥 = 1−𝑦 ⟹ 𝑥 = 2 log 1−𝑦
B≡ (𝟎, 𝒂) 𝒂𝒏𝒅 𝑪 ≡ (−𝒂, 𝟎) is
42
𝑒 𝑥 − 𝑒 −𝑥 𝑒 2𝑥 − 1 2. If 𝒂𝒊 ∊R-{0}, i=1, 2, 3, 4 and x ∊ R and

𝑦= 𝑥 = ,𝑥 ≥ 0
𝑒 + 𝑒 −𝑥 𝑒 2𝑥 + 1 (∑𝟑𝒊=𝟏 𝒂𝟐𝒊 )𝒙𝟐 - 2x(∑𝟑𝒊=𝟏 𝒂𝒊 𝒂𝒊 +1) + ∑𝟒𝒊=𝟐 𝒂𝟐𝒊 ≥
0,
Clearly 𝑒 2𝑥 ≥ 1 𝑓𝑜𝑟 𝑥 ≥ 0
Then 𝒂𝟏 ,𝒂𝟐 ,𝒂𝟑 ,𝒂𝟒 are in
∴y≥ 0 for x ≥ 0
(a) A.P. (b) G.P.
∴ Range f = [0, ∞) ≠ co domain f.
(c) H.P. (d) none of these
Hence f is not onto.
Ans. (b) Given quadratic expression≥ 0 ∴
Thus f is a many-one into mapping. D≤0
⟹(∑3𝑖=1 𝑎𝑖 𝑎𝑖 + 1)2 −
(∑3𝑖=1 𝑎𝑖 2 )(∑4𝑖=1 𝑎𝑖 2 ) ≤ 0
ISI B.STAT/B.MATH
OBJECTIVE QUESTIONS & ⟹(𝑎1 𝑎2 + 𝑎2 𝑎3 + 𝑎3 𝑎4 )2 − (𝑎1 2 + 𝑎2 2 +
𝑎3 2 )(𝑎2 2 + 𝑎3 2 + 𝑎4 2 ) ≤ 0
SOLUTIONS
⟹(𝑎2 2 − 𝑎1 𝑎3 )2 + (𝑎3 2 − 𝑎2 𝑎4 )2 +
SET – 6 (𝑎2 𝑎3 − 𝑎1 𝑎4 )2 = 0
⟹(𝑎2 2 − 𝑎1 𝑎3 )2 = 0, (𝑎3 2 − 𝑎2 𝑎4 )2 =
1. If x ∊={1, 2, 3,……, 9}and 0, (𝑎2 𝑎3 − 𝑎1 𝑎4 )2 = 0
fn(x)=xxx……x (n digits),then 𝑎 𝑎 𝑎
⟹𝑎2 = 𝑎3 = 𝑎4
𝒇𝟐𝒏 (3)+𝒇𝒏 (2) = 1 2 3
𝟏 𝒓 𝟏
(a) 2𝒇𝟐𝒏 (1) 3. Let a = 𝒏! + ∑𝒏−𝟏
𝒓=𝟏 (𝒓+𝟏)!, b = 𝒎! +
(b) 𝒇𝟐𝒏 (1) ∑𝒎−𝟏
𝒓
then a+b equaals
𝒓=𝟏 (𝒓+𝟏)!
(c) 𝒇𝟐𝒏 (1)
(d)−𝒇𝟐𝒏 (4) (a) 0 (b) 1 (c)2
(d) none of these
Ans. (c)
Ans. (c)
2 3
𝑓𝑛 (𝑥) = 𝑥. 1 + 𝑥. 10 + 𝑥. 10 + 𝑟 𝑟+1−1 1 1
𝑛−1 (10𝑛 −1) 𝑥 𝑛 = = − (𝑟+1)!
⋯ 𝑥. 10 =𝑥 = 9 (10 − 1) (𝑟+1)! (𝑟+1)! 𝑟!
10−1
𝑟 1
2 3 2 ∴ ∑𝑛−1
𝑟=1 (𝑟+1)! = 1 − 𝑛! ⟹ 𝑎 = 1
∴𝑓𝑛 (3) + 𝑓𝑛 (2) = [9 (10𝑛 − 1)] +
2 1 1 𝑟
(10𝑛 − 1) = 9 (10𝑛 − 1)(10𝑛 − 1 + 2) = Similarly, 𝑚! + ∑𝑚
𝑟=1 (𝑟+1)! = 1
9
10𝑛 −1
= 𝑓2𝑛 (1)
9 ∴ a= 1, b=1 ⟹a+ b= 2
43
𝟏 𝒏
4. If ∑𝒌𝒏=𝟏[𝟑 + 𝟗𝟎] =21, where [x] denotes triangle and [r] denotes the integral part
of x, then [r] + [-r]=
the integral part of x, then k=
(a) 0 (b) 1
(a) 84 (b) 80
(c) -1 (d) none
Ans. (b)
Ans. (b)
1 𝑛 Since root of equation
21= ∑𝑘𝑛=1 [3 + 90] , 𝑤ℎ𝑒𝑟𝑒 𝑚 = 𝑘!
F(x)= 𝑥 2 + 2(𝑎 − 3)𝑥 + 9 = 0 lie between-
1 1 1 2 1 59
= [3 + 90] + [3 + 90] + ⋯ + [3 + 90] + 6 and 1
1 60 1 61 1 𝑘
[3 + 90] + [3 + 90] + ⋯ + [3 + 90] ∴(i) D≥ 0 (ii) f(-6)> 0 (iii) f(1) > 0 (iv) -
𝛼+𝛽 𝛼+𝛽
6< (v) 1 >
= (0 + 0 + ⋯ 𝑡𝑜 59 𝑡𝑒𝑟𝑚𝑠). +(1 + 1 + 2 2
⋯ 𝑡𝑜 (𝑘 − 59)𝑡𝑒𝑟𝑚𝑠) 27
Hence 6 ≤ 𝛼 < 4
∴ 21= k- 59⟹ k= 80.
∴|a| =6
5. Let f: R→R such that f(x) is 6−2 4 18
continuous and attains only rational value 𝑎3 = 2 + 3𝑑 = 2 + 3. =2+7=
21 7
at all real x and f(3)=4. If 1 1
1 1 − 1 2 3
𝒂𝟏 ,𝒂𝟐 ,𝒂𝟑 ,𝒂𝟒 ,𝒂𝟓 are in H.P., then 6 2
= 2 + 18. ( 21 ) = 2 − 7 = 14
ℎ18
∑𝟒𝒓=𝟏 𝒂𝒓 𝒂𝒓+𝟏 =
18 14
(a) f(5).𝒂𝟏 𝒂𝟓 (b) f(3).𝒂𝟒 𝒂𝟓 ∴ 𝑎3 ℎ18 = . = 12
7 3
(c) f(3).𝒂𝟏 𝒂𝟐 (d) f(2).𝒂𝟏 𝒂𝟑
7. If 𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 , 𝒙𝟒 , 𝒙𝟓 are in H.P. then
Ans. (a) 𝟏
(∑𝟒𝒌=𝟏 𝒙𝒌 𝒙𝒌+𝟏 ) is a root of equation
𝒙 𝟏 𝒙𝟓
Since f(x) is continuous and attains only
rational values (a) 𝒙𝟐 − 𝟑𝒙 + 𝟐 = 𝟎
(b) 𝒙𝟐 − 𝟓𝒙 − 𝟒 = 𝟎
∴ f(x)= constant= 4
(c) 𝒙𝟐 − 𝟗𝒙 + 𝟐𝟎 = 𝟎
∴ f(2) = f(3) = f(5) = 4 (d) 𝒙𝟐 − 𝟔𝒙 − 𝟖 = 𝟎
Since 𝑎1 , 𝑎2 , 𝑎3 , 𝑎4 , 𝑎5 are in H.P. Ans.(c)
∴ 𝑎1 𝑎2 + 𝑎2 𝑎3 + 𝑎3 𝑎4 + 𝑎4 𝑎5 = 𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 , 𝑥5 are in H.P.
4𝑎1 𝑎5 = 𝑓(5). 𝑎1 𝑎5
∴∑4𝑘=1 𝑥𝑘 𝑥𝑘+1 = 𝑥1 𝑥2 + 𝑥2 𝑥3 + 𝑥3 𝑥4 +
6. If three successive terms of a G.P. with 𝑥4 𝑥5 = 4𝑥1 𝑥5
common ratio r >1 from the sides of a
44
1 𝑧 2 −1
∴𝑥 ∑4𝑘=1 𝑥𝑘 𝑥𝑘+1 = 4 => 𝑧 2 + 𝑥 2 − 2𝑧𝑥 = 1 + 𝑥 2 => 𝑥 =
1 𝑥5 2𝑧
Clearly, 4 is a root of equation 1 [𝑧. 2𝑧 − (𝑧 2 − 1). 1]

∴ 𝑑𝑥 = 𝑑𝑧
2 𝑧2
𝑥 2 − 9𝑥 + 20 =0. 𝑧2 + 1
= 𝑑𝑧
8. Let f : (0, ∞)⟶R and F(x)= ∫𝟎 𝒇(𝒕) 𝒅𝒕
𝒙 2𝑧 2
If F(𝒙𝟐 ) = 𝒙𝟐 (𝟏 + 𝒙), 𝒕𝒉𝒆𝒏 𝒇(𝟒) = When x= 0, z= 1 and when x= ∞, 𝑧 = ∞
(a) 5/4 (b) 7 ∞ 1 𝑧 2 +1 1 ∞

∴ I= ∫1 𝑑𝑧 = 2 ∫1 (𝑧 −𝑛 +
𝑧 𝑛 2𝑧 2
(c) 4 (d) 2 1 𝑧 −𝑛+1 𝑧 −𝑛−1
𝑧 −𝑛−2 ) 𝑑𝑧 = 2 [ −𝑛+1 + −𝑛−1 ] ∞ 1
Ans. (c)
1 1 1
𝑥 = [0 − ( − )]
Given, F(x)= ∫0 𝑓(𝑡) 𝑑𝑡 ………(1) 2 1−𝑛 1+𝑛
𝐹(𝑥 2 ) = 𝑥 2 (1 + 𝑥) ………..(2) 1 2𝑛 𝑛
= (− 2
)= 2
2 1+𝑛 𝑛 −1
From (1), F’(x)= f(x)
10. If f(x)= ae2x+ bex +cx satisfies the
∴ f(4)= F’(4)…………..(3) conditions f(0)= -1, f’(log 2)= 28,
From (1), 𝐥𝐨𝐠 𝟒
[𝒇(𝒙) − 𝒄𝒙]𝒅𝒙 =
𝟑𝟗
∫𝟎 𝟐
, then
F’(𝑥 2 ).2x= 2x+ 3𝑥 2
(a) a= 5, b=6, c= 3 (b) a= 5, b= - 6,
2+3𝑥 c= 0 (c) a= -5, b=6, c= 3 (d)
⟹ F’(𝑥 2 ) = [∵ 0 < 𝑥 < ∞ ∴ 𝑥 ≠ 0]
2
none
2+6
⟹ 𝐹 ′ (4) = = 4 [Putting x= 2] Ans. (b)
2
∴ from (3), f(4)= 4 Given f(x)= 𝑎𝑒 2𝑥 + 𝑏𝑒 𝑥 + 𝑐𝑥 ……(1)

∞ 𝒅𝒙
9. If n > 1 then ∫𝟎 = 𝑔𝑖𝑣𝑒𝑛, 𝑓(0) = −1 ⟹ 𝑎 + 𝑏 = −1…..(2)
(𝒙+√𝟏+𝒙𝟐 ) 𝒏
f’(x)= 2 𝑎𝑒 2𝑥 + 𝑏𝑒 𝑥 + 𝑐𝑥
𝒏 𝒏𝟐 −𝟏
(a) 𝒏𝟐 −𝟏 (b) 𝒏
𝒏 𝟏−𝒏𝟐
∴f’ (log 2)= 𝑎𝑒 log𝑒 4 + 𝑏𝑒 log𝑒 2 + 𝑐
(c) − 𝒏𝟐 −𝟏 (d) 𝒏
Given 8a+ 2b+c= 28……….(3)
Ans. (a)
log 4 39
Given, ∫0 (𝑎𝑒 2𝑥 + 𝑏𝑒 𝑥 ) 𝑑𝑥 =
2
Put z= x+√1 + 𝑥 2
𝑎 log 4 39
∴ z- x= √1 + 𝑥 2 ⟹ [ 𝑒 2𝑥 + 𝑏𝑒 𝑥 ] =
2 0 2
45
𝑎 𝑎 39 2
⟹ 2 𝑒 log 16 + 𝑏𝑒 log 4 − (2 + 𝑏) = ∫ [𝑎2 + (4 − 4𝑎)𝑥 + 4𝑥 3 ] 𝑑𝑥
2
1
⟹ 15a + 6b= 39……….(4) 2 2
= 𝑎2 [𝑥] + (2 − 2𝑎)[𝑥 2 ]
1 1
Thus a= 5, b= -6, c= 0 2
+ [𝑥 4 ]
𝒅 𝒆𝐬𝐢𝐧 𝒙
1
11. Let 𝒇(𝒙) = ,𝒙 >
𝒅𝒙 𝒙
𝟐 = 𝑎2 + (2 − 2𝑎)3 + 15 , 𝐺𝑖𝑣𝑒𝑛, 𝑎2 − 6𝑎
𝟒 𝟐𝒆𝐬𝐢𝐧 𝒙
0. 𝐼𝑓 ∫𝟏 𝒙 𝒅𝒙 = 𝒇(𝒌) − 𝒇(𝟏), + 21 ≤ 12
then one of the possible value of k is ⟹ 𝑎2 − 6𝑎 + 9 ≤ 0 ⟹ (𝑎 − 3)2 ≤ 0

⟹ (𝑎 − 3)2 = 0 ⟹ 𝑎 = 3
(a) -4 (b) 0
(c) 2 (d) 16 (𝟐𝒓)𝒌
13. 𝐋𝐭 ∑𝒏𝒓=𝟏 𝒏𝒌+𝟏 , 𝒌 ≠ −𝟏, is equal to
𝒏→∞
Ans. (d)
𝟐𝒌 𝟐𝒌
(a) 𝒌−𝟏 (b) 𝒌
𝑑 𝑒 sin 𝑥
Given, 𝑑𝑥 (𝑓(𝑥)) = ,𝑥 > 0 𝟏 𝟐𝒌
𝑥 (c) 𝒌−𝟏 (d) 𝒌+𝟏
2
4 2𝑒 𝑠𝑖𝑛𝑥
𝑛𝑜𝑤 𝐼 = ∫1 𝑑𝑥 [put z= 𝑥 2 , 𝑑𝑧 = Ans. (d) Reqd. limit = Lt ∑𝑛𝑟=1 𝑛𝑘+1
(2𝑟)𝑘
𝑥
𝑛→∞
2𝑥 𝑑𝑥]
𝑛 𝑛
2 𝑟𝑘 𝑟 𝑘 1
4 2𝑒 𝑠𝑖𝑛𝑥 16 𝑒 sin 𝑧 = Lt 2 ∑ 𝑘 = Lt 2𝑘 ∑ ( ) =
𝑘
∴ I= ∫1 𝑑𝑥 = ∫1 𝑑𝑧 = 𝑛→∞ 𝑛 .𝑛 𝑛→∞ 𝑛 𝑛
𝑥2 𝑧
𝑟=1 𝑟=1
[𝑓(𝑧)] 16
1
= 𝑓(16) − 𝑓(1) 1
= 2𝑘 ∫ 𝑥 𝑘 𝑑𝑥
∴ f(k)= f(16) 0
𝑥 𝑘+1 1
𝑘
2𝑘
= 2 .[ ] =
∴ one possible value of k= 16 𝑘+1 0 𝑘+1
𝟐 𝟏
12. All the values of a for which ∫𝟏 [𝒂𝟐 + 𝒏!
14. 𝐋𝐭 {(𝒌𝒏)𝒏 } 𝒏 , 𝒌 ≠ 𝟎, is equal to
𝒏→∞
(𝟒 − 𝟒𝒂)𝒙 + 𝟒𝒙𝟑 ] 𝒅𝒙 ≤ 𝟏𝟐 are given by
𝒌 𝒆
(a) a= 3 (b) a ≤ 𝟒 (a) 𝒆 (b) 𝒌
𝟏
(c) 0≤ 𝒂 ≤ 𝟑 (d) none (c) (d) none of these
𝒌𝒆
of these
Ans. (c)
Ans. (a)
1 𝑛! 1/𝑛 1 𝑛! 1/𝑛 1
Let P= Lt ( ) = 𝑘 Lt (𝑛𝑛 ) = 𝑘𝑒
𝑛→∞ 𝑘 𝑛𝑛 𝑛→∞
√𝒏
15. 𝐋𝐭 ∑𝒏𝒓=𝟏 ( =
𝒏→∞ √𝒓 (𝟑√𝒓+𝟒√𝒏)𝟐
46
𝟏 𝟏 18. The area of the region enclosed by the

(a) 𝟕 (b) 𝟏𝟎
𝟏 curves y= xex and y= xe –x and the line x=
(c) 𝟏𝟒 (d) none of these 1, is
Ans. (c) (a) 1/e (b) 1- 1/e
(c) 2/e (d) 1- 2/e
Required limit
Ans. (c)
√𝑛
= Lt ∑𝑛𝑟=1 2 =
𝑛→∞
√𝑟.𝑛(3√𝑛+4)
𝑟
y=x𝑒 𝑥 …….(1)
1 1
Lt ∑𝑛𝑟=1 2 .𝑛 y= x𝑒 −𝑥 ……(2)
𝑛→∞ 𝑟 𝑟
√ (3+√ +4)
𝑛 𝑛
equating y from (1) and (2) we get
1
1
=∫ 𝑑𝑥 x𝑒 𝑥 = 𝑥𝑒 −𝑥 ⟹ 𝑥(𝑒 𝑥 − 𝑒 −𝑥 ) = 0
0 √𝑥 (3√𝑥 + 4)2
⟹x= 0
3
Put z= 3√𝑥 + 4, then dz= 2 𝑑𝑥
√𝑥
∴ Required area=
1 1
When x= 0, z= 4, when x= 1, z= 7
∫ (𝑦1 − 𝑦2 ) 𝑑𝑥 = ∫ (𝑥𝑒 𝑥 − 𝑥𝑒 −𝑥 ) 𝑑𝑥
2 7 𝑑𝑧 2 1 0 0
∴Reqd. limit= 3 ∫4 = 3 [− 𝑧] 74 = = [𝑥𝑒 𝑥− 𝑒 𝑥 — 𝑥𝑒 −𝑥
𝑧2
2 1 1 2 3 1 1
− 3 [7 − 4] = − 3 (− 28) = 14 − 𝑒 −𝑥 )
0
16. If f(x) = excosx.sin x, |x|≤ 𝟐 = = (𝑒 − 𝑒) − (0 − 𝑒 0 )
𝟑
𝟐, 𝒐𝒕𝒉𝒆𝒓𝒘𝒊𝒔𝒆 𝒕𝒉𝒆𝒏 ∫𝟐 𝒇(𝒙)𝒅𝒙 is equal to + [(𝑒 −1 + 𝑒 −1 ) − (0 + 1)]
2
(a) 0 (b) 1 =
𝑒
(c) 2 (d) 3
19. The area bounded by y = xe|x| and the
Ans. (c) lines |x|=1, y= 0 is
3 2 3
(a) 1 (b) 2
∫ 𝑓(𝑥) 𝑑𝑥 = ∫ 𝑓(𝑥) 𝑑𝑥 + ∫ 𝑓(𝑥) 𝑑𝑥
−2 −2 2 (c) 4 (d) 6
2
= ∫ 𝑒 cos 𝑥 . sin 𝑥 𝑑𝑥 Ans. (b)
−2
3
For x ≥ 0, curve is y= x𝑒 𝑥 ……..(1)
+ ∫ 2 𝑑𝑥 = 0 + 2(3 − 2),
2
=2 𝑑𝑦
For curve (1), 𝑑𝑥 = 𝑒 𝑥 (1 + 𝑥) > 0
[∵𝑒 cos 𝑥 . sin 𝑥 𝑖𝑠 𝑎𝑛 𝑜𝑑𝑑 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 = 2]
∴ y is increasing.
47
𝑑2𝑦 1, 2, 3, …., 100 such that the largest

= 𝑒 𝑥 (2 + 𝑥) > 0
𝑑𝑥 2 numbered selected is 10 is 271, then r=
∴ curve is convex downward. (a) 3 (b) 4

(c) 5 (d) none
For x ≤ 0, y= x𝑒 −𝑥
Ans. (a) from the given condition, we can
𝑑𝑦
∴𝑑𝑥 = 𝑒 −𝑥 (1 − 𝑥) > 0 write
∴ y is increasing 10𝑟 − 9𝑟 = 271,
𝑑2 𝑦 Applying Trial and error method:-

= 𝑒 −𝑥 − 𝑒 −𝑥 (1 − 𝑥) > 0
𝑑𝑥 2
r= 1, 10-9= 1
= −𝑒 −𝑥 (2 − 𝑥) < 0
∴ curve is concave downward. r =2, 102 − 92 = 19
1 r = 3, 103 − 93 = 271
Required area = 2∫0 𝑥𝑒 𝑥 𝑥 𝑑𝑥 =
2[𝑥𝑒 𝑥 − 𝑒 𝑥 ] 10 = 2[(𝑒 − 𝑒) − (0 − 𝑒 0 )] = 2 ∴ r= 3.
20. A bag contains unlimited number of 22. N men and n women sit along a line
white, red, black, and blue balls. The alternatively in x ways and along a circle
number of ways of selecting 10 balls so in y ways such that x= 10y, then the
that there is at least one ball of each color number of ways in which n men can sit at
is a round table so that all shall not have
same neighbors is
(a) 180 (b0 270
(c) 192 (d) none (a) 6 (b) 12
(c) 36 (d)
Ans. (d) Number of ways= coefficient of none
𝑋10 𝑖𝑛 (𝑋 + 𝑋 2 + 𝑋 3 + ⋯ )4
𝑥 2.⎿𝑛⎿𝑛
Ans. (b) = = 2𝑛
= coefficient of 𝑋10 𝑖𝑛 𝑋 4 (1 − 𝑋)−4 𝑦 ⎿𝑛−1 ⎿𝑛
= coefficient of 𝑋 6 𝑖𝑛 (1 − 𝑋)−4 ⇒ x = 2ny = 10y ⇒ n = 5

1
=
(6+1)(6+2)(6+3)
[∵coefficient of 𝑥 𝑟 𝑖𝑛(1 − Hence the required number = 2 × ⎿4= 12.
1.2.3
−4 (𝑟+1)(𝑟+2)(𝑟+3)
𝑋) = ] 23. A contest consists of predicting the
1.2.3
result (win, draw or defeat) of 10
7×8×9
= 1×2×3 = 84. matches. The number of ways in which
one entry contains at least 6 incorrect
21. The number of ways of selecting r results is
balls with replacement out of n balls
numbered
48
(a) ∑𝟏𝟎
𝒓=𝟔 𝟏𝟎𝒄𝒓 . 𝟑
𝒓
(b) (a) 512 (b) 640
∑𝟓𝒓=𝟏 𝟏𝟎𝒄𝒓 . 𝟐𝒓 (c) (c) 672 (d) none
∑𝟏𝟎
𝒓=𝟔 𝟏𝟎𝒄𝒓 (d) none Ans. (c) We have to put 2 twice in each
numbers, so any 2 out of the 7 places can be
Ans. (d) Since total number of ways
chosen in 7𝑐2 ways. The remaining 5 places
predicting the results of one match is 3 , so
can be filled with the other two numbers in
results of 10 match is 310 , now number of
25 ways.
ways that the result of one match is correct
is 1 and also number of ways to predict The required numbers of numbers are 7𝑐2 ×
wrongly of one match is 2 . 25 = 672.
No. of ways to predict wrongly exactly r
matches =10𝑐𝑟 . 2𝑟 110−𝑟
𝒌 𝑴−𝒌 𝑴−𝒌
26. The value of {∑𝟏𝟎𝟎
𝒊=𝟎 ( 𝒊 )(𝟏𝟎𝟎−𝒊)(𝟏𝟎𝟎−𝒊)} /
10
∴ The required number is 3 − 𝑴
(𝟏𝟎𝟎 ), where M - k > 100, k >100, is
∑4𝑟=1 10𝑐𝑟 . 2𝑟
𝒌 𝑴
(a) (b)
𝑴 𝒌
𝒌
24. Let 1 to 20 are placed in any around a (c) 𝑴𝟐 (d) none
circle. Then the sum of some 3 𝑘 𝑀−𝑘 𝑀−𝑘
𝑀
consecutive numbers must be at least Ans. (a) {∑100
𝑖=0 ( 𝑖 )(100−𝑖)(100−𝑖 )}/ (100)
(a) 30 (b) 31 𝑘 (𝑘𝑖)(100−𝑖

𝑀−𝑘
) 𝑖(𝑘𝑖)(100−𝑖
𝑀−𝑘
)
= (𝑀−100)∑100
𝑖=0[ 𝑀 − ∑100
𝑖=0 𝑀 ]
(c) 32 (d) none (100 ) (𝑀−100)(100 )
𝑘 𝑀
Ans. (c) Suppose 𝑥1 , 𝑥2 , … . , 𝑥20 be the 𝑘
𝑀
(100) 𝑀
.100 (100 ) 𝑘
= 𝑀−100 . 𝑀 − 𝑀 = 𝑀.
numbers placed around the circle. Now the (100) (𝑀−100) (100)
mean of the 20 sums of 3 consecutive

numbers such as (𝑥1 + 𝑥2 + 𝑥3 ), (𝑥2 + 𝑥3 +
𝑥4 ), ….., 27. Let n be an odd positive integer. If
𝒊𝟏 , 𝒊𝟐 , … . , 𝒊𝒏 is a permutation of 1, 2, 3,
(𝑥19 + 𝑥20 + 𝑥21 ), (𝑥20 + 𝑥1 + 𝑥2 ) is
1 3×20×21 …., n.
{3(𝑥1 + 𝑥2 + ⋯ + 𝑥20 )} = =
20 2×20
31.5 Then (1-𝒊𝟏 )(2-𝒊𝟐 )….(n-𝒊𝒏 )is
Thus from Pigon hole principle that at least (a) Odd (b) even
one of the sums must be ≥ 32. (c) prime (d) none
25. The number of different seven–digit Ans. (b) since n is odd, let n= 2m+ 1, where
numbers can be written using only there m is a non-negative integer.
digits 1, 2, 3 under the condition that the
digit 2 occurs twice in each number is
49
Then set s ={1, 2, …, n} contains m+ 1 odd ∴ Required number of ways = 16𝑐4 ×

nos, namely 2, 4, …, 2m. 12𝑐5 × 7𝑐7 = 4!5!7!
16!
This is also true for the

30. For how many positive integers n less
permutation 𝑖1 , 𝑖2 , … . , 𝑖𝑛 of s.
than 17,⎿n+⎿n+1+⎿n+2 is an integral
Consider m+ 1 numbers1 − 𝑖1 , 3 − 𝑖3 , …. n multiple of 49? (a) 4
- 𝑖𝑛 which are of the from r - 𝑖𝑟 , where r is (b) 5 (c) 6
odd. (d) none
Since 𝑖5 is even for only m values of s, by Ans. (b) ⎿n+⎿n+1+⎿n+2=

P.H.P. , one of the m+ 1 , numbers, ⎿n{1+(n+1)+(n+2)(n+1)}= ⎿n(𝑛 + 2)2
𝑖1 , 𝑖2 , … . , 𝑖𝑛 , say it is odd, where t is also
Since 49 divides (𝑛 + 2)2 ⎿n, so either 7
odd. Hence t-𝑖𝑡 is even and the product (1-
devides (n+2) or 49 divides ⎿n. Thus n=5,
𝑖1 )(2-𝑖2 )….(n-𝑖𝑛 ) is even.
12, 14, 15, 16, i.e. number of integers are 5.
−𝟏 √ 𝒏−√𝒏−𝟏
28. The value of ∑∞
𝒏=𝟏 𝐬𝐢𝐧 = ISI B.STAT/B.MATH
√𝒏(𝒏+𝟏)
𝝅 𝝅
OBJECTIVE QUESTIONS &
(a) 𝟒 (b) 𝟐
SOLUTIONS
𝝅 𝝅
(c) - 𝟐 (d) 𝟑
SET – 7
√𝑛−√𝑛−1
Ans. (b) 𝑡𝑛 = sin−1 ( )
√𝑛(𝑛+1)
1 1 1. Let x, y, z be different from 1 satisfying

∴𝑡𝑛 = sin−1 − sin−1
√ 𝑛 √𝑛+1
x+ y +z = 2007,
1
∴𝑆𝑛 = sin−1 (1) − sin−1 𝟏 𝟏 𝟏
√𝑛+1 Then the value of 𝟏−𝒙 + + is
𝟏−𝒚 𝟏−𝒛
∴ 𝑆∞ = Lt 𝑆𝑛 = sin−1(1) − sin−1 (0) 𝟏
𝑛→∞
(a) 0 (b) 1 (c) 2008 (d) 𝟐𝟎𝟎𝟖
29. The number of ways to give 16
1 1 1
different things to 3 persons, according as Ans:- (a) + +
1−𝑥 1−𝑦 1−𝑧
A< B < C so that B gets 1 more than A
3−2(𝑥+𝑦+𝑧)+ (𝑥𝑦+𝑦𝑧+𝑧𝑥) 3−2×2007+4011
and C get 2 more than B, is = = (1−𝑥)(1−𝑦)(1−𝑧) =
(1−𝑥)(1−𝑦)(1−𝑧)
𝟒!𝟓!𝟕! 0
(a) 4!5!7! (b) 𝟏𝟔!
𝟏𝟔! 2. In a 𝛥ABC, if r= 𝒓𝟐 + 𝒓𝟑 +
(c) 𝟒!𝟓!𝟕! (d) none
𝒓𝟏 , 𝒂𝒏𝒅 𝒂𝒏𝒈𝒍𝒆(𝐴) >
𝝅 𝒔
Ans. (c) Here x+ y +z=16, x= y+1, y= z+2 𝒕𝒉𝒆𝒏 𝒕𝒉𝒆 𝒓𝒂𝒏𝒈𝒆 𝒐𝒇 is equal to
𝟑 𝒂
∴x=4, y=5, z= 7 (a) (½, 2) (b) (½, ∞)

(c) (½, 3) (d) (3, ∞)
50
Ans. (a) 2𝑦 𝑧
⇒ x. + 3. 3 = 3
2
𝑟 = 𝑟2 + 𝑟3 − 𝑟1
Applying AM ≥ GM,
Δ Δ Δ Δ
= s−b + s−c − s−a 𝑥+2.
2𝑦
+3.
𝑧
𝑦 𝑧
s
So, 2 3
≥ 6√𝑥( 2)2 (3)3
1+2+3
1 1 1 1
⟹ + = + x𝑦 2 𝑧 3
s s−a s−b s−c 3
⇒ (6)6 ≥ 22 .33
2s − a s(s − a)
⟹ = ⇒ x𝑦 2 𝑧 3 ≤ 16.
27
2s − b − c (s − b)(s − c)
2s − a A s 𝒅𝒚
⟹ = cot 2 ⟹ 5. If y(t) is a solution of (1+t) 𝒅𝒕 − 𝒕𝒚 = 𝟏
a 2 a
1 A s and y(t) then y(1) equals
= (cot 2 + 1) ⟹
2 2 a (a) ½ (b) e + ½ (c) e+ ½
1
∊ ( , 2) (d)- ½
2
𝑑𝑦 𝑡 1
Ans:- (d) 𝑑𝑡 − 1+𝑡 𝑦 = 1+𝑡
𝑡
3. If 𝒂𝟏 , 𝒂𝟐 , … . , 𝒂𝒏 are positive real nos,
𝒂 𝒂 𝒂 𝒂
∴I.F. = 𝑒 − ∫1+𝑡𝑑𝑡 = 𝑒 −(𝑡−log(1+𝑡)) =
then 𝒂𝟏 + 𝒂𝟐 + ⋯ + 𝒂𝒏−𝟏 + 𝒂𝒏 is always 𝑒 −𝑡 . (1 + 𝑡)
𝟐 𝟑 𝒏 𝟏
𝟏⁄ Multiplying and integrating

i) ≥ 𝒏 ii) ≤ 𝒏 iii) 𝒏 𝒏 iv) none of
these. 𝑑𝑡
y𝑒 −𝑡 . (1 + 𝑡) = ∫ 𝑒 −𝑡 . (1 + 𝑡) (1+𝑡) = 𝑒 −𝑡 +
Ans:- AM ≥ GM gives 𝑐
𝑎1 𝑎𝑛−1 𝑎 𝑎 𝑎𝑛−1 𝑎𝑛 When y(0) = -1, ⤇ c= 0.
+ ⋯+ + 𝑎𝑛 ≥ 𝑛√𝑎1 . … . .𝑎 =1
𝑎2 𝑎𝑛 1 2 𝑎𝑛 1
𝑎1 𝑎𝑛−1 𝑎𝑛
∴y𝑒 −𝑡 . (1 + 𝑡) = −𝑒 −𝑡
∴ 𝑎 +⋯+ +𝑎 ≥𝑛
2 𝑎𝑛 1 1
∴y= − 1+𝑡 ∴y(1)= - ½.
𝟐 𝟑
4. The maximum possible value of x𝒚 𝒛
subject to the condition xyz ≥ 𝟎 and
x+y+z = 3 is 6. If the quadratic equation 𝒙𝟐 + 𝒂𝒙 +

𝒃 + 𝟏 = 𝟎 has non- zero
i) 1 ii) 𝟏⁄𝟖 iii) 𝟏⁄𝟒 iv)
𝟐𝟕⁄ Integer solutions, then
𝟏𝟔
a) 𝒂𝟐 + 𝒃𝟐 is a prime number
Ans:- x+ y+ z = 3 b) 𝒂𝒃 is prime number
c) Both a) and b)
51
d) Neither a) nor b) Ans:- (a) if x < 0, LHS = -ve but RHS= +ve
Ans:- (d) 𝛼+𝛽= -a, 𝛼𝛽= (b+ 1) If x = 0, LHS= not defined.
∴ 𝑎2 + 𝑏 2 = (α + β)2 + (αβ − 1)2 If x > 0, use AM ≥ GM inequality
= (𝛼 2 + 1)( 𝛽 2 + 1) 𝑥. 2
1⁄
𝑥
1 1
+ 𝑥 . 2𝑥 ≥ 2√2 ⁄𝑥+𝑥 ≥ 2. √22 =4
1⁄ 1
⇒ 𝑥. 2 𝑥 = . 2𝑥 ; so, x= 1.
𝑥
𝟏 𝟏
7. Let u = (√𝟓 − 𝟐) ⁄𝟑 − (√𝟓 + 𝟐) ⁄𝟑 and
𝟏 𝟏
v= (√𝟏𝟖𝟗 − 𝟖) ⁄𝟑 − (√𝟏𝟖𝟗 + 𝟖) ⁄𝟑,
9. Let f (x) and g (x) be functions, which
Then for each positive integer n, 𝒖𝒏 +
take integers as arguments. Let
𝒗𝒏+𝟏 = ? f (x+ y) = f (x) + f (y) + 8 for all integers x
(a) -1 (b) 0 and y. Let f (x) = x for all negative
(c) 1 (d) 2 numbers x and let g(8)=17, then f (0)=?
(a) 8 (b) 9 (c)

Ans:- (b) 𝑢3 = (√5 − 2) − (√5 + 2) −
1⁄ 1⁄ 17 (d) 72
3 3
3(√5 − 2) (√5 + 2) . (𝑢)
Ans:- (c) put x = -8, y= 8 in the given
3 functional equation.
i.e. 𝑢 = −4 − 3𝑢
⇒ (u-1)( 𝑢2 − 𝑢 + 4)= 0
𝟐𝟎𝟎𝟕.𝟐𝟎𝟎𝟔.𝟐𝟎𝟎𝟒.𝟐𝟎𝟎𝟑
𝑢2 − 𝑢 + 4 is always +ve. So, u= 1 10. Let x = [ 𝟏 ], where [x]
× (𝟐𝟎𝟎𝟓)𝟒
𝟑
Similarly 𝑣 3 + 15𝑣 + 16 = 0 denotes the greatest integer integer less
((𝒙+𝟏).𝒙𝟐 )+𝟏
⇒ (v +1)( 𝑣 2 − 𝑣 + 16)= 0 than or equal to x. then (𝒙𝟐 +𝟏)
is
⇒ v= -1 (a) 80 (b) 80.2

(c) 80.5 (d) 81
So, for each n, 𝑢𝑛 + 𝑣 𝑛+1 = 0
2007 2006 2004 2003
Ans:- (b) x= [3.2005 . 2005 . 2005 . 2005]
2 1 1 2
8. The number of real values of x = [3(1+2005)(1+2005 )(1-2005)(1-2005)]
satisfying the equation
4 1
𝟏 𝟏 = [3(1-(2005)2)( 1-(2005)2 )]
𝒙. 𝟐 ⁄𝒙 + 𝒙 . 𝟐𝒙 = 4 is / are
⇒ x=2.
(a) 1 (b) 2
(c) 3 (d)4
52
11. A graph defined in polar co – Solving x = - 1 only one real root.

𝟏
ordinates by r (𝜃) = cos 𝜃+𝟐. The smallest
14. If in an isosceles triangle with base ‘a’,
x –co- ordinates of any point on this vertical angle 20° and lateral side of each
graph is wih length ‘b’ is given then the value of
(a) 1/16 (b) -1/16 𝒂𝟑 + 𝒃𝟑 equals
(c) 1/8 (d) -1/8 (a) 3ab (b) 3a𝒃𝟐
Ans:- (b) x =r cos𝜃 (c) 3𝒂𝟐 𝒃 (d) 3
𝑎
1
= cos2 𝜃 + 2 𝑐𝑜𝑠𝜃 Ans:- (b) sin 10° = 2𝑏 ⇒ sin 30° =
3 𝑠𝑖𝑛10° − 4𝑠𝑖𝑛3 10°
1 2
= (𝑐𝑜𝑠𝜃 + ) = 1/16 1 3𝑎 4𝑎3
4
⇒ = −
2 2𝑏 8𝑏 3
12. A monic polynomial is one in which
3𝑎 4𝑎3
the coefficient of the highest order term is ⇒1= − 8𝑏3
𝑏
1. The monic polynomial P(x) (with
integer coefficient) of least degree that ⇒ 𝑎3 + 𝑏 3 = 3𝑎𝑏 2 .
satisfies P (√𝟐 + √𝟓)= 0 is
15. If 𝒂𝟐 + 𝒃𝟐 + 𝒄𝟐 − 𝟐𝒂𝒃 = 𝟎, then the
(a) 𝒙𝟒 − 𝒙𝟑 − 𝟏𝟒𝒙𝟐 + 𝟗=0 point of concurrency of family of lies ax+
(b) 𝒙𝟒 − 𝟏𝟒𝒙𝟐 + 𝟗= 0 by+ c= 0 lies on the line
(c) 𝒙𝟒 + 𝒙𝟑 − 𝟏𝟒𝒙𝟐 + 𝟗=0 (a) y= x (b) y = x+ 1

(d) 𝒙𝟒 + 𝟏𝟒𝒙𝟐 − 𝟗 (c) y = -x (d)3x= y
Ans:- (c) (𝑎 − 𝑏)2 − 𝑐 2 = 0

ANS:- (b) Let x=√2 + √5 . Squaring, 𝑥 2 =
7 + 2√10 ⇒ (a-b -c)(a- b+ c)=0
⇒ 𝑥 2 − 7 = 2√10. Squaring again, 𝑥 4 − If a- b= c ⇒ ax + by+ (a-b)=0

14𝑥 2 + 9= 0
⇒ a (x+1)+b(y-1)=0⇒ x=-1 , y= 1
13. The number of distinct real roots of
If a-b = -c ⇒ ax+ by+ (b-a) =0
the equation 𝒙𝟒 + 𝟖𝒙𝟐 + 𝟏𝟔 = 𝟒𝒙𝟐 −
𝟏𝟐𝒙 + 𝟗 is ⇒ a (x- 1)+ b(y +1)=0
(a) 1 (b) 2 ⇒ x=1, y= -1.
(c) 3 (d) 4
16. The value of k for which the
Ans:- (a) (𝑥 2 + 4)2 = (2𝑥 − 3)2 ⇒ 𝑥2 + inequality k𝐜𝐨𝐬 𝟐 𝒙 − 𝒌𝒄𝒐𝒔𝒙 + 𝟏 ≥ 𝟎 ∀ 𝒙 ∊
4 = ±(2𝑥 − 3) (−∞, ∞)holds is
Giving x2 – 2x + 7 = 0 and x2 +2x +1 = 0.
53
𝟏
(a) k < - 𝟐 (b) k > 4
𝟏 |𝒙|
(c) − 𝟐 ≤ 𝒌 ≤ 𝟒 (d) 19. Total number of solutions of sinx = 𝟏𝟎
𝟏
≤𝒌≤𝟓 is
𝟐
Ans:- (c) kcos2 𝑥 − 𝑘𝑐𝑜𝑠𝑥 + 1 ≥ 0 ∀ 𝑥 ∊ (a) 0 ; (b) 3 ; (c) 4 ; (d) none

(−∞, ∞) Ans. (d) Two graphs meet exactly 6 times,
⇒ k (cos2 𝑥 − 𝑐𝑜𝑠𝑥) +1 ≥ 0…………(i) hence, it has 6 solutions. Draw graph
yourself.
1 1
But cos2 𝑥 − 𝑐𝑜𝑠𝑥 = (𝑐𝑜𝑠𝑥 − 2)2 − 4
20. A rigid body is spinning about a fixed
1 point (3, -2, -1) with angular velocity of 4
⇒ − 4 ≤ cos2 𝑥 − 𝑐𝑜𝑠𝑥 ≤ 2
rad/sec., the axis of rotation being in
1 the direction of (1, 2, -2), then the velocity
From (i) we get 2k+1 ≥ 0 ⇒ 𝑘 ≥ − 2
of the particle at the point (4, 1, 1) is
𝑘
⇒ −4 +1 ≥ 0 (a) 4/3 (1, -4, 10) (b) 4/3 (4, -10, 1)
(c) 4/3 (10, -4, 1) (d) 4/3(10, 4, 1)
⇒k≤4
Ans:- (c)
1
⇒ −2 ≤ 𝑘 ≤ 4
̂
𝑖̂+2𝑗̂ −2𝑘 4
𝜔⃗ = 4( ) = 3 (𝑖̂ + 2𝑗̂ − 2𝑘̂)
√1+4+4
17. The remainder obtained when 1! +2!
+3!+….+ 95! is divided by 15, is r⃗ = O⃗P- O⃗A
(a) 3 (b) 5 = (4î+ĵ+k̂)-(3î-2ĵ-k̂)= î+3ĵ+ 2k̂

(c) 7 (d) none 4
v̂= 𝜔̂× 𝑟⃗ = 3 ( î + 2ĵ − 2k̂) × ( î + 3ĵ +
Ans. (a) here 1! +2! +3! +4! = 33 and n! is 4
2k̂) = 3 (10𝑖̂ − 4𝑗̂ + 𝑘̂)
divisible by 15 where n ≥ 5.
The remainder is same as the remainder 21. A particle has an angular speed of 3
obtained by dividing 33 with 15, i.e., 3. rad /sec and the axis of rotation passes
through the point (1, 2, 2) and (1, 2, -2),
then the velocity of the particle at the
𝒆𝒕𝒂𝒏𝒙 −𝒆𝒙
point P(3, 6, 4) is
18. The value of 𝐋𝐭 is
𝒙→𝟎 𝒕𝒂𝒏𝒙−𝒙 𝟑 𝟑
(a) (22, 8, -2) (b) (𝟐𝟐, 𝟎, 𝟐)
√𝟏𝟕 √𝟏𝟕
(a) 0 (b) 1 𝟑
(c) (𝟐𝟐, −𝟖, −𝟐) (d)
(c) e (d) none √𝟏𝟕
𝟑
(𝟐𝟐, −𝟖, 𝟐)
𝑒 tan 𝑥 −𝑒 𝑥 𝑥 𝑒 tan 𝑥 −1 √𝟏𝟕
Ans. (b) Lt = Lt 𝑒 ( tan 𝑥− 𝑥 ) =
𝑥→0 tan 𝑥− 𝑥 𝑥→0
𝑒 0 . log 𝑒 𝑒 = 1 Ans:- (c)
54
O⃗A= î + ĵ + 2k̂ (b) P (A∩B̅) = P (A)- P(A∩B) does not

hold
O⃗B =î + 2ĵ − 2k̂
(c) P (A∪B) =1-P (A̅).P(B̅) if A and B are
∴ A⃗B= ĵ-4k̂ independent
⟹ | A⃗B |= √17 (d) P (A∪B) =1-P (A̅).P(B̅) if A and B are

disjoint
AP⃗= (3î+6ĵ+4k̂)- (î+ĵ+2k̂)
Ans. (c)
= 2î+5ĵ+2k̂
P(A/B͞)+P(A͞/B͞)= 1,
(ĵ-4k̂)
3
∴𝜔⃗ =
√17
∴ P(A͞+B͞)= 1-P(A/B͞)
(ĵ-4k̂)× (2î + 5ĵ + 2k̂) =
3
v⃗= 𝜔̂× 𝑟⃗=
√17 1 − 𝑃(𝐴 ∪ 𝐵) 𝑃(𝐴 ∪ 𝐵)′
3 =
(22î − 8ĵ − 2k̂) 𝑃(𝐵) 𝑃(𝐵′)
√17
𝑃(𝐴′ ∩ 𝐵 ′ ) 𝐴′
22. In a group of equal number of boys = = 𝑃 ( ′)
𝑃(𝐵′) 𝐵
and girls, 20% girls and 35% boys are
graduate. If a member of the group is 24. one hundred identical coins, each with
selected at random, then the probability probability P, of showing up heads are
of this member not being a graduate is tossed. If 0 < P < 1 and the probability of
heads showing on 50 coins is equal to that
𝟏𝟏 𝟗
(a) 𝟒𝟎 (b) 𝟐𝟎 (c) of the heads showing on 51 coins, then p=
𝟏𝟏 𝟐𝟗
(d) 𝟒𝟎 𝟏 𝟒𝟗
𝟐𝟎 (a) 𝟐 (b) 𝟏𝟎𝟏
𝟓𝟎 𝟓𝟏
Ans. (d) Let A and B denotes the events that (c) 𝟏𝟎𝟏 (d) 𝟏𝟎𝟏
the member selected at random is a boy and
a girl respectively. Let E denotes the event Ans. (d)
that the member selected is a graduate.
Here n= 100, p= p, q= 1-p
Reqd. prob.
Given, p(50) = p(51)
=1- [P(A).P(E/A)+P(B).P(E/B)]
1 35 1 20 55 11 29 ⟹100𝐶50 𝑝50 (1 − 𝑝)50 = 100𝐶51 𝑝51 (1 −
=1- [2 . 100 + 2 . 100 = 200] = (1 − 40) = 40
𝑝)49
23. for any two events A and B in a 100! 100!
sample space ⟹ (1 − 𝑝) = 𝑝
50! 50! 51! 49!
𝑷(𝑨)+𝑷(𝑩)−𝟏
⟹ 51(1 − 𝑝) = 50𝑝 ⟹ 𝑝
(a) P (A/B)≥ , 𝑷(𝑩) ≠ 𝟎 is 51
𝑷(𝑩)
=
always true. 101
55
25. A box contains 24 identical balls of 1 ≤ 𝑥 2 ⟹ 𝑥 ≤ −1 𝑜𝑟 𝑥 ≥ 1

which 12 are white and 12 are black. The ⟹{ 2 5 5 5
𝑥 < 2 ⟹ −√2 < 𝑥 < √2
balls are drawn at random from the box
one at a time with replacement. The
probability that a white ball is drawn for 5 5
⟹ −√2 < 𝑥 ≤ −1 𝑜𝑟 1 ≤ 𝑥 < √2
the 4th time on the 7th draw is
………..(A)
𝟓 𝟐𝟕
(a) 𝟔𝟒 (b) 𝟑𝟐
(ii) 𝑥 2 − 5𝑥 + 5 > 0 ⟹ 𝑥 <
𝟓 𝟏
(c) 𝟑𝟐 (d) 𝟐 5−√5 5+√5
𝑜𝑟 𝑥 > …….(B)
2 2
1 (𝑥
2
Ans. (c) Probability of drawing a white ball (iii) log − 5𝑥 + 5) > 0
2
12 1
in any draw=24 = 2
1 0
⟹ 𝑥 2 − 5𝑥 + 5 < ( )
2
A white ball will be drawn for the 4th time
on the 7th draw ball is drawn in the 7th draw ⟹ 𝑥 2 − 5𝑥 + 5 < 1 ⟹ 𝑥 2 − 5𝑥 +
and 3 white balls are drawn in the first 6 4<0
draws.
⟹ 1< x< 4 ……………(C)
3 3
∴ Required probability = 6𝐶3 𝑝 𝑞 . 𝑝 =
5−√5
1 3 1 3 1 5 From (A), (B) and (C), 1 ≤ x <
20. (2) . (2) . 2 = 32 2
26. If [x]denotes the integral part of x,

then the domain of the function 27. If f(x)= 𝐋𝐭 𝐋𝐭 𝒄𝒐𝒔𝟐𝒎 𝒏! 𝝅𝒙, then
𝒎→∞ 𝒏→∞
f(x)= 𝐬𝐢𝐧−𝟏 [𝟐𝒙𝟐 − 𝟑] + 𝐥𝐨𝐠 𝟐 {𝐥𝐨𝐠 𝟏/𝟐 (𝒙𝟐 − range of f(x)is
𝟓𝒙 + 𝟓)} is (a) [0, 1] (b) [0, 1]
(c) (0, 1) (d) {0}
𝟓 𝟓
(a) (−√𝟐 , −𝟏) (b) (𝟏, √𝟐)
Ans. (b)
𝟓 𝟓
(c) (−√𝟐 , −𝟏) ∪ (𝟏, √𝟐) (d) When x is rational say p/q , then n! x𝜋 is a
multiple of 𝜋 and 𝑐𝑜𝑠 2 𝑛! 𝑥𝜋 = 1
none of these
Ans. (d) ∴ Lt 𝑐𝑜𝑠 2𝑚 𝑛! 𝑥𝜋 = Lt 1𝑚 = 1 ∴ f(x)=

𝑚→∞ 𝑚→∞
1
For f(x) to be defined
When x is irrational,
(i) [2𝑥 2 − 3]= -1, 0, 1
n! x𝜋 ≠a multiple of 𝜋
⟹ -1 ≤ 2𝑥 2 − 3 < 2 ⟹2 ≤2𝑥 2 < 5
∴𝑐𝑜𝑠 2 𝑛! 𝑥𝜋 ≠ 1
5
⟹ 1≤ 𝑥 2 < 2
56
∴ 0≤ 𝑐𝑜𝑠 2 𝑛! 𝑥𝜋 < 1 ∴ k= 2
∴ Lt 𝑐𝑜𝑠 2𝑚 𝑛! 𝑥𝜋 = 29. If {x} denotes the fractional part of x,

𝑚→∞
𝟑𝟐𝟎𝟎
Lt (𝑐𝑜𝑠 2 𝑛! 𝑥𝜋)𝑚 = 0 then { 𝟖
}=
𝑚→∞
𝟏 𝟑
Thus f(x) = 0, when x is rational (a) 𝟖 (b) 𝟖
𝟓
= 1, when x is irrational (c) 𝟖 (d) none
∴ Range f= {0, 1} Ans. (d)
28. The normal at any point P (𝒕𝟐 , 𝟐𝒕) on 3200 9100 (1 + 8)100
the parabola 𝒚𝟐 = 𝟒𝒙 meets the curve = =
8 8 8
again at Q, the area of 𝛥POQ, O being the 1 + 100𝐶1 8 + 100𝐶1 82 + ⋯ + 8100
𝒌 =
origin is |𝒕| (𝟏 + 𝒕𝟐 )(𝟐 + 𝒕𝟐 ) then 8
1
= + 𝑎𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟
(a) k > 2 (b) k=2 8
(c) k < 2 (d) k= 1 3200 1
∴{ }=8
8
Ans. (b) Given P ≡ (𝑡 2 , 2𝑡)
30. Which of the following function does
Given parabola is 𝑦 2 = 4𝑥 ……….. (1) not obey mean value theorem in [0, 1]
Here a= 1. 𝟏 𝟏 𝟐 𝟏
(a) f(x)= 𝟐 - x, x < ½; f(x)=(𝟐 − 𝒙) , 𝒙 ≥ 𝟐
Let Q=( 𝑡1 2 , 2𝑡1) 𝐬𝐢𝐧 𝒙
(b) f(x) = , 𝒙 ≠ 𝟎; 𝒇(𝒙) = 𝟏, 𝒙 = 𝟎
𝒙
Since normal at P meet the curve again at Q.
(c) f(x)= x |x|
2 𝑡 2 +2 (d) f(x)= |x|
∴ 𝑡1 = −𝑡 − 𝑡 = ………… (2)
𝑡
Ans. (a) Let f(x) = 𝑥 3 − 3𝑥 + 𝑘
Now O≡ (0, 0), P≡ (𝑡 2 , 2𝑡), Q=( 𝑡1 2 , 2𝑡1 )
Then f’(x) = 3(𝑥 2 − 1) < 0 𝑖𝑛 (0, 1)
Given,
𝑘
⟹ f’(x) has no root in (0, 1)
|𝑡|
(1 + 𝑡 2 )(2 + 𝑡 2 ) = 𝑎𝑟𝑒𝑎 𝑜𝑓 𝛥𝑃𝑂𝑄
But f(x) = 0 has two distinct roots 𝛼and 𝛽 in
1 (0, 1)
= 2 |𝑡 2 . 2𝑡1 − 2𝑡. 𝑡1 2 | = |𝑡 2 𝑡1 − 𝑡𝑡1 2 | =
2
𝑡 2 +2 (𝑡 2 +2) ⟹ f’(x)= 0 has at least one root in (𝛼, 𝛽).
|−𝑡 2 ( )−𝑡 |
2 𝑡2
(𝑡 2 +2)
= (𝑡 2 + 2) |𝑡 + | = (𝑡 2 + 2) |𝑡 +
𝑡
(𝑡 2 +2) (1+𝑡)2
| = (𝑡 2 + 2)2
𝑡 |𝑡|
57
ISI B.STAT/B.MATH 𝑥
𝑡𝑟+1 =
(𝑟𝑥 + 1){(𝑟 + 1)𝑥 + 1}
(𝑟 + 1)𝑥 + 1 − (𝑟𝑥 + 1)
SOLUTIONS =
(𝑟𝑥 + 1)[(𝑟 + 1)𝑥 + 1]
SET – 8 1 1
= −
(𝑟𝑥 + 1) (𝑟 + 1)𝑥 + 1
𝑛−1
1
1. If [x] denotes the integral part of x, ∴ 𝑆𝑛 = ∑ 𝑡𝑟+1 = 1, 𝑥 ≠ 0 = 0, 𝑥
𝐬𝐢𝐧[𝒄𝒐𝒔𝒙] 𝑛𝑥 + 1
then 𝐋𝐭 = 𝑟=0
𝒙→𝟎 𝟏+[𝒄𝒐𝒔𝒙] =0
𝐬𝐢𝐧 𝟏
(a) 0 (b) 1 (c) 1
𝟐 ∴ Lt 𝑆𝑛 = Lt (1 − 𝑛𝑥+1)
𝑛→∞ 𝑛→∞
(d) does not exist
1, 𝑥 ≠ 0
Ans. (a) Lt [cos 𝑥] = 0 Thus, f(x)= {
𝑥→0−0 0, 𝑥 = 0
[∵ when x ⟶0- 0, 0 < cosx < 1 ] and ∴ Lt 𝑓(𝑥) = 1 𝑎𝑛𝑑 𝑓(0) = 0

𝑥→0
Lt [cos 𝑥] = 0 Hence f(x) is neither continuous nor

𝑥→0+0
differentiable at x= 0
[∵ when x ⟶0+ 0, 0 < cosx < 1 ]
Clearly f(x) is not a periodic function.
sin[cos 𝑥] sin 0
∴ Lt = =
𝑥→0−0 1+[cos 𝑥] 1+0 𝐥𝐨𝐠(𝟐+𝒙)−𝒙𝟐𝒏 𝒔𝒊𝒏𝒙
sin[cos 𝑥] sin 0 3. Let f(x)= 𝐋𝐭 then f(x) is
0 Lt = =0 𝒏→∞ 𝟏+𝒙𝟐𝒏
𝑥→0+0 1+[cos 𝑥] 1+0
discontinuous at
∴Required limit = 0
(a) x= 1 only (b) x=-1 only
2. Let f(x)= 𝐋𝐭 ∑𝒏−𝟏
𝒙
then (c) x= -1, 1 only (d) no point
𝒓=𝟎 (𝒓𝒙+𝟏){(𝒓+𝟏)𝒙+𝟏)}
𝒏→∞
Ans. (c)
(a) f(x) is continuous but not
differentiable at x= 0 Lt 𝑋 2𝑛 = Lt (𝑥 2 )𝑛
𝑛→∞ 𝑛→∞
(b) f(x) is both continuous and ∞, 𝑥2 > 1

differentiable at x= 0 = {0, 0 ≤ 𝑥2 < 1
1, 𝑥2 = 1
(c) f(x) is neither continuous nor ∞, 𝑥 < −1 𝑜𝑟 𝑥 > 1
differentiable at x=0 = { 0, −1<𝑥 <1
1, 𝑥 = ±1
(d) f(x) is a periodic function
Ans. (c)
58
∴ 𝑓(𝑥) 5. If f(x) = p |sin x|+𝒒𝒆|𝒙| +

−𝑠𝑖𝑛𝑥, 𝑥 < −1 𝑜𝑟 𝑥 > 1 𝒓|𝒙|𝟑 𝒂𝒏𝒅 𝒇(𝒙) is differentiable at x=0,
log(2 + 𝑥) , −1 <𝑥 < 1 then
= {
log(2 + 𝑥) − 𝑠𝑖𝑛𝑥
, 𝑥 = ±1 (a) p= q= r=0
2
(b) p=0, q=0, r== any real number
Lt 𝑓(𝑥) = −𝑠𝑖𝑛1, Lt 𝑓(𝑥)
𝑥→1+0 𝑥→1−0
= 𝑙𝑜𝑔3, Lt 𝑓(𝑥) (c) q=0, r=0, p is any real number
𝑥→1+0 (d) r=0, p=0, q is any real number
= Lt log(2 + 𝑥) = 0,
𝑥→−1
Ans. (b)
Lt 𝑓(𝑥) = Lt (− sin 𝑥) = 𝑠𝑖𝑛1
𝑥→1−0 𝑥→−1 At x= 0,
Clearly f(x) is discontinuous only at two L.H. derivative of p |sin x|= - p
points x= -1, 1
R.H. derivative of p |sin x|= p
4. The function f(x) = max {(1-x), (1+x), 2}
is, where x ∊(-∞, ∞) ∴ For p |sin x| to be differentiable at x= 0, p=
- p or p= 0
(a) discontinuous at all points
(b) differentiable at all points At x= 0, L.H. derivative of q𝑒 |𝑥| = q
(c) differentiable at all points except -1 For q𝑒 |𝑥| to be differentiable at x= 0, -q = q

and 1 (d) continuous at all points or q= 0
except -1 and 1
d.c. of r |𝑥|3 at x= 0 is 0
Ans. (c)
∴ for f(x) to be differentiable at x= 0, p= 0,
We draw the graph of y= 1- x, y= 1+ x and y q= 0and r may be any real number.
=2
Second method:
f(x)= max.{1-x, 1+x, 2}
𝑓(ℎ)−𝑓(0)
f’(0- 0)= Lt =
∴ f(x)= 1- x, x ≤ -1= 2, -1≤ x≤ 2 = 1+x, x ≥ ℎ→0−0 ℎ
𝑝|sin ℎ|+𝑞𝑒 |ℎ| +𝑟|ℎ|3 −𝑞
2 Lt
ℎ→0−0 ℎ
From graph it is clear that f(x) is continuous

−𝑝 sin ℎ + 𝑞𝑒 ℎ − 𝑟ℎ3 − 𝑞
at all x and differentiable at all x except x= - = Lt
ℎ→0−0 ℎ
1 and x= 1 𝑠𝑖𝑛ℎ
= Lt {−𝑝
ℎ→0−0 ℎ
ℎ
𝑞(𝑒 − 1)
− − 𝑟ℎ2 }
−ℎ
= −𝑝 − 𝑞
59
Similarly, f’ (0+0)= p+q ∴ g(x) is continuous at x= 1
Since f(x) is differentiable at x= 0 Also g’ (x)= 3𝑥 2 − 2𝑥 + 1, 0 ≤ 𝑥 < 1 =

−1, 1 < 𝑥 ≤ 2
∴ f’(0- 0) = f’(0+ 0)⟹ - p- q= p+ q
∴ g’(1-0)= 3. 12 − 2.1 + 1 = 2 and
⟹ p+ q= 0
g’(1+0)= -1
Here r may be any real number.
Hence g(x) is not differentiable at x= 1.
7. If [x] denotes the integral part of x and

𝝅
𝒔𝒊𝒏[𝒙+𝟏]+𝐬𝐢𝐧 𝝅[𝒙+𝟏]
6. Let f(x)= 𝒙𝟑 − 𝒙𝟐 + 𝒙 + 𝟏, f(x)= [x]{ }, then
𝟏+[𝒙]
𝒈(𝒙) = 𝒎𝒂𝒙. {𝒇(𝒕), 𝟎 ≤ 𝒕 ≤ 𝒙}, 𝟎 ≤ 𝒙 ≤ 𝟏
(a) f(x) is continuous in R
= 𝟑 − 𝒙, 𝟏 < 𝑥 ≤ 2 (b) f(x) is continuous but not
differentiable in R
then in [0, 2] the points where g(x) is not
differentiable is (are) (c) f"(x) exists for all x in R
(d) f(x) is discontinuous at all integer
(a) 1 (2) 2
points in R
(c) 1 and 2 (d) none of
these Ans. (d)
Ans. (a) 𝑓(𝑡) = 𝑡 3 − 𝑡 2 + 𝑡 + 1 Sin 𝜋 [x+ 1]= 0
∴ f’ (t)= 3𝑡 2 − 2𝑡 + 1 > 0 Also [x+ 1]= [x]+ 1
∴ f(t) is an increasing function. [𝑥] 𝜋
∴ f(x)= 1+[𝑥] sin [𝑥]+1 𝑎𝑡 𝑥 = 𝑛, 𝑛 ∊
Since 0≤ t ≤ x 𝑛 𝜋
𝐼, 𝑓(𝑥) = 1+𝑛 sin 𝑛+1 𝑓𝑜𝑟 𝑛 − 1 < 𝑥 <
∴ max f(t)= f(x)= 𝑥 3 − 𝑥 2 + 𝑥 + 1 𝑛, [𝑥] = 𝑛 − 1
𝑛−1 𝜋
Thus g(x)= 𝑥 3 − 𝑥 2 + 𝑥 + 1, 0 ≤ 𝑥 ≤ 1= 3- ∴ f(x)= sin 4
𝑛
x, 1 < x ≤ 2
𝑛−1 𝜋
The only doubtful point for differentiability 𝐻𝑒𝑛𝑐𝑒 Lt 𝑓(𝑥) sin ,
𝑥→𝑛−0 𝑛 4
of g(x) in [0, 2] is x = 1 𝑛 𝜋
∴ f(n)= 1+𝑛 sin 𝑛+1
Clearly, Lt 𝑔(𝑥) = 13 − 12 + 1 + 1 =
𝑥→1+0
2 ∴ f(x) is discontinuous at all n ∊ I
Lt 𝑔(𝑥) = Lt (3 − 𝑥) = 2 𝑎𝑛𝑑 𝑔(1)

𝑥→1+0 𝑥→1
=2
60
[𝒕𝒂𝒏𝟐 𝒙]−𝟏 𝝅 ∴ f(x) is differentiable and hence continuous

8. Let f(x) = , 𝒙 ≠ 𝒏𝝅 ± 𝟒 = 𝟎, 𝒙 =
𝒕𝒂𝒏𝟐 𝒙−𝟏
𝝅 at all x in (0, 𝜋)
𝒏𝝅 ± 𝟒 then f(x) is
10. if [x] denotes the integral part of x and
(a) continuous at all x (b) continuous at in (0, 𝜋), we define
𝝅 𝝅
x= 𝟒 (c) discontinuous at x= 𝟒 (d)
𝟐(𝒔𝒊𝒏𝒙−𝒔𝒊𝒏𝒏 𝒙)+|𝒔𝒊𝒏𝒙−𝒔𝒊𝒏𝒏 𝒙|
none f(x)= [𝟐(𝒔𝒊𝒏𝒙−𝒔𝒊𝒏𝒏 𝒙)−|𝒔𝒊𝒏𝒙−𝒔𝒊𝒏𝒏 𝒙|] = 𝟑, 𝒙 =
𝝅 𝝅
𝒙≠ then for n > 1
Ans. (c) 𝟐 𝟐
Since tan x is not defined at (a) f(x) is continuous but not

𝝅
differentiable at x= 𝟐
𝜋
X= (2n+1) 2 , 𝑛 ∊ (b) both continuous and differentiable
𝐼, 𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 𝑓(𝑥)𝑖𝑠 𝑑𝑖𝑠𝑐𝑜𝑛𝑡𝑖𝑛𝑢𝑜𝑢𝑠 𝑎𝑡 𝑥 = 𝝅
at x= 𝟐
𝜋
(2𝑛 + 1) , 𝑛 ∊ 𝐼 (c) (c) neither continuous nor
2
𝝅
𝜋 differentiable at x= 𝟐
Now f (4 ) = 0
(d) 𝐋𝐭𝝅 𝒇(𝒙) 𝒆𝒙𝒊𝒔𝒕 𝒃𝒖𝒕 𝐋𝐭𝝅 𝒇(𝒙) ≠
𝒙→ 𝒙→
𝟐 𝟐
[𝑡𝑎𝑛2 𝑥] − 1 𝝅
Lt 𝑓(𝑥) = Lt 𝒇( 𝟐 )
𝜋 𝜋 2
𝑥→ −0 𝑥→ −0 𝑡𝑎𝑛 𝑥 − 1
4 4
0−1 Ans. (b)
= Lt
𝜋 2
= ∞
𝑥→ −0 𝑡𝑎𝑛 𝑥 − 1 𝜋 𝜋
4
For 0 < 𝑥 < 𝑜𝑟 < 𝑥 < 𝜋 0 < sin 𝑥 <
2 2
𝜋
Hence f(x) is discontinuous at x= 4 1
∴ for n > 1, sin x > 𝑠𝑖𝑛4 𝑥
𝒙 𝟏 3(sin 𝑥−𝑠𝑖𝑛4 𝑥) 𝜋
9. Let f(x)= ∫𝟎 𝒕 𝒔𝒊𝒏 𝒕 𝒅𝒕, then the number ∴ f(x)=[ ] = 3, 𝑥 ≠ = 3, 𝑥 =
sin 𝑥−𝑠𝑖𝑛𝑛 𝑥 2
𝜋
of points of discontinuity of f(x) in (0, 𝜋) is
2
(a) 0 (b) 1 Thus in (0, 𝜋) , f(x) = 3

(c) 2 (d) more than 2
Hence f(x)is continuous and differentiable at
Ans. (a) 𝜋
x= 2
𝑥
1
𝑓(𝑥) = ∫ 𝑡 sin 𝑑𝑡 11. If[x] denotes the integral part of x and
0 𝑡
f(x) = [n+ psin x], 0< x < 𝜋, n∊I and p is a
1 prime number, then the number of points
∴ f’(x)= x sin 𝑥
where f(x) is not differentiable is
Clearly f’(x) is a finite number at all x in (0,
(a) p-1 (b) p
𝜋).
(c) 2p-1 (d) 2p +1
61
Ans. (c) [x] is not differentiable at integral 𝑏

⟹𝑠𝑖𝑛2 𝜃 = − 𝑎 𝑖𝑠 𝑛𝑜𝑛-negative and ≤ 1⟹
points. 𝑏
|𝑎 | ≤ 1
Also [n+ p sin x]= n+ [p sin x]
13. If c be a positive constant and |f(y)-
∴ [p sin x] is not differentiable, where p sin f(x)|≤ 𝒄(𝒚 − 𝒙)𝟐 for all real x and y, then
x is an integer. But p is prime and 0 < sin x
≤1 [∵ 0 < x < 𝜋] (a) f(x)= 0 for all x (b) f(x)= x for all x
(c) f’(x)= 0 for all x (d) f’(x)= c for all
∴ p sin x is an integer only when x
𝑟
Sinx = 𝑝, where 0< r ≤ p and r ∊ N Ans. (c)
For r= p, sin x= 1 ⟹ x= 2 in (0, 𝜋)

𝜋 Given, |f(y)- f(x)| ≤𝑐(𝑦 − 𝑥)2 , 𝑐 > 0
𝑓(𝑦)−𝑓(𝑥)
For 0 < r < p, sin x= 𝑝
𝑟 ⟹|f(y)- f(x)| ≤𝑐|𝑦 − 𝑥|2 ⟹ | |≤
𝑦−𝑥
𝑓(𝑦)−𝑓(𝑥)
𝑐|𝑦 − 𝑥| ⟹ Lt | | ≤ Lt 𝑐|𝑦 − 𝑥|
𝑟 𝑟 𝑦→𝑥 𝑦−𝑥
∴ x= sin−1 𝑝 𝑜𝑟 𝜋 − sin−1 𝑝 𝑦→𝑥
⟹ |𝑓 ′ (𝑥)| ≤ 0
Number of such values of x= p- 1+p- 1= 2p
-2 ⟹|𝑓 ′ (𝑥)| ≤ 0 for all real x
∴ Total number of points where f(x) is not ⟹ f’(x)= 0∀x∊ R

differentiable
𝒅 𝒙𝟑
14. Let f(t)in t. then 𝒅𝒙 {∫𝒙𝟐 𝒇(𝒕)𝒅𝒕}
= 1+ 2p – 2= 2p – 1
𝒔𝒆𝒄𝟒 𝜽 𝒕𝒂𝒏𝟒 𝜽 𝟏 (a) has a value 0 when x= 0

12. If + = 𝒂+𝒃 , 𝒕𝒉𝒆𝒏 (b) has a value 0 when x=1 , x= 4/9
𝒂 𝒃
(a) |b|=|a| (b) |b|≤ |𝒂| (c) has a value 𝟗𝒆𝟐 − 𝟒𝒆 when x=e
(c) |b|≥ |𝒂| (d) none of these (d) has a differential coefficient 27e -8
when x= e
Ans. (b)
𝑑 𝑥3
𝑠𝑒𝑐 4 𝜃 𝑡𝑎𝑛4 𝜃 1 𝑠𝑒𝑐 2 𝜃 − 𝑡𝑎𝑛2 𝜃 Ans. (c) 𝑑𝑥 ∫𝑥 2 𝑓(𝑡) 𝑑𝑡 = 𝑓(𝑥 3 ). 3𝑥 2 −
+ = =
𝑎 𝑏 𝑎+𝑏 𝑎+𝑏 𝑓(𝑥 2 ). 2𝑥
𝑠𝑒𝑐 2 𝜃
⟹ 𝑎(𝑎+𝑏) [(𝑎 + 𝑏)𝑠𝑒𝑐 2 𝜃 − 𝑎] + = 𝑙𝑜𝑔𝑥 3 . 3𝑥 2 − log 𝑥 2 . 2𝑥
𝑡𝑎𝑛2 𝜃
= 9𝑥 2 𝑙𝑜𝑔𝑥 − 4𝑥 𝑙𝑜𝑔𝑥
[(𝑎 + 𝑏)𝑡𝑎𝑛2 𝜃 + 𝑏] = 0 = 𝑥 𝑙𝑜𝑔𝑥(9𝑥 − 4)
(𝑎+𝑏)𝑏
⟹ a𝑡𝑎𝑛2 𝜃 + 𝑏𝑠𝑒𝑐 2 𝜃 = 0
62
𝑑𝑧 16. If 𝒂𝒏 = the digit at units place in the

𝑙𝑒𝑡 𝑧 = 𝑥 log 𝑥 (9𝑥 − 4)𝑡ℎ𝑒𝑛
𝑑𝑥 number 1! +2! +3! +…+n! for n≥ 4,
= (1 + log 𝑥)(9𝑥 − 4)
+ 9𝑥 log 𝑥 then 𝒂𝟒 , 𝒂𝟓 , 𝒂𝟔 , … are in
𝑑𝑧 (a) A.P. only (b) G.P. only (c)

𝑎𝑡 𝑥 = 𝑒, = 2(9𝑒 − 4) + 9𝑒 A.P. and G.P. only (d) A.P., G.P.,
𝑑𝑥
= 27𝑒 − 8 and H.P.
15. If a, 𝜶𝟏 , 𝜶𝟐 , … 𝜶𝟐𝒏−𝟏 , 𝒃 𝒂𝒓𝒆 𝒊𝒏 𝑨. 𝑷., Ans.(c)
𝒂, 𝜷𝟏 , 𝜷𝟐 , … 𝜷𝟐𝒏−𝟏 , 𝒃 are in G.P. and a, 1 ! +2 ! +3 ! +4! = 33

𝜸𝟏 , 𝜸𝟐 , … 𝜸𝟐𝒏−𝟏 , 𝒃 are in H.P., where a, b
The digits at units place in each of 5 !, 6 !,…
are positive, then the equation
is 0
𝜶𝒏 𝒙𝟐 − 𝜷𝒏 𝒙 + 𝜸𝒏 = 𝟎 has
∴𝑎4 = 𝑎5 = 𝑎6 = ⋯ = 3
(a) real and equal roots
Clearly 𝑎4 , 𝑎5 , 𝑎6 , … are in A.P. and G.P. but
(b) real and unequal roots
not in H.P. as they are equal.
(c) imaginary roots
17. Let p, q, r ∊ 𝑹+ and 27pqr ≥
(d) roots which are in A.P.
(𝒑 + 𝒒 + 𝒓)𝟑 and 3p +4q +5r = 12 then
Ans. (c) 𝒑𝟑 + 𝒒𝟒 + 𝒓𝟓 is equal to
The middle terms of the A.P., G.P. and H.P. (a) 3 (b) 6 (c) 2
are 𝛼𝑛 , 𝛽𝑛 𝑎𝑛𝑑 𝛾𝑛 respectively (d) none of these.
∴ 𝛼𝑛 = A.M. of a and b, Ans. (c)
𝛽𝑛 = G.M. of a and b, 1 ! +2 ! +3 ! +4! = 33
𝛾𝑛 = H.M. of a and b, The digits at units place in each of 5 !, 6 !,…

is 0
∵ AH=𝐺 2
∴𝑎4 = 𝑎5 = 𝑎6 = ⋯ = 3
∴ 𝛼𝑛 𝛾𝑛 = 𝛽𝑛 2
Clearly 𝑎4 , 𝑎5 , 𝑎6 , … are in A.P. and G.P. but
Now, discreminant of given equation not in H.P. as they are equal.
=𝛽𝑛 2 − 4𝛼𝑛 𝛾𝑛 = −3𝛼𝑛 𝛾𝑛 < 0 (∵𝛼𝑛 , 𝛾𝑛
are positive) 18. If (2+ x)(2+𝒙𝟐 )(𝟐 + 𝒙𝟑 ) … (𝟐 + 𝒙𝟏𝟎𝟎 ) =
∑𝒏𝒓=𝟎 𝒙𝒓 , then n equals
(a) 2550 (b) 5050

(c) 𝟐𝟖 (d) none of these.
63
100×101
Ans. (b) 𝑥 𝑛 = 𝑥1+2+3+⋯+100 = 𝑥 2 = Thus a= b= c.
𝑥 5050 21. If p, q be non zero real numbers and
𝟏
⟹ n= 5050 f(x)≠ 0 in [0, 2] and ∫𝟎 𝒇(𝒙). (𝒙𝟐 + 𝒑𝒙 +
𝟐
𝟐 𝒒)𝒅𝒙 = ∫𝟎 𝒇(𝒙). (𝒙𝟐 + 𝒑𝒙 + 𝒒)𝒅𝒙 = 𝟎
19. If p, q, r, s ∊ R, then equation (𝒙 +
𝒑𝒙 + 𝟑𝒒)(- 𝒙𝟐 + 𝒓𝒙 + 𝒒)(- 𝒙𝟐 + 𝒔𝒙 − 𝟐𝒒)= then equation 𝒙𝟐 + 𝒑𝒙 + 𝒒= 0 has
0 has (a) two imaginary roots
(a) 6 real roots (b) no root in (0, 2)
(b) at least two real roots (c) one root in (0,1) and other in (1,2)
(c) 2 real and 4 imaginary roots (d) one root in (-∞, 𝟎) and other in (2,∞)
(d) 4 real and 2 imaginary roots. Ans. (c)
Ans. (b) Let F(x) = ∫ 𝑓(𝑥)(𝑥 2 + 𝑝𝑥 + 𝑞)𝑑𝑥,
𝐷1 + 𝐷2 + 𝐷3 = 𝑝2 − 12𝑞 + 𝑟 2 + 4𝑞 + Then according to question
𝑠 2 + 8𝑞 = 𝑝2 + 𝑟 2 + 𝑠 2 ≥ 0
F(1) –F(0) = 0, F(2) – F(1) = 0
⟹ at least one of 𝐷1 , 𝐷2 , 𝐷3 ≥ 0
∴ F(0) = F(1) and F(1)= F(2)
20. If a, b, c, d, are four non-zero real
numbers such that (𝒅 + 𝒂 − 𝒃)𝟐 + Hence, equation F’(x)= 0 i.e. equation
(𝒅 + 𝒃 − 𝒄)𝟐 = 0 and roots of the equation f(x). (𝑥 2 + 𝑝𝑥 + 𝑞) = 0
a(b-c) 𝒙𝟐 + b(c-a)x + c(a-b)= 0 and real
i.e., equation 𝑥 2 + 𝑝𝑥 + 𝑞 = 0 has at least
and equal, then a, b, c
one root (here exactly one root) in (0, 1) and
(a) are equal (b) are not equal (c) are exactly one root in (1, 2).
zero (d) none of the above
22. If a, b, c, ∊ R, a ≠ 0 and (𝒃 − 𝟏)𝟐 <
Ans. (a) Equation 𝑎(𝑏 − 𝑐)𝑥 2 + 4𝒂𝒄, then the number of roots of the
𝑏(𝑐 − 𝑎)𝑥 + 𝑐(𝑎 − 𝑏)= 0 has equal roots system of equation (in three unknowns
𝒙 𝟏 , 𝒙𝟐 , 𝒙𝟑 )
2𝑎𝑐
⟹ b= 𝑎+𝑐 …….(1)
𝒂𝒙𝟏 𝟐 + 𝒃𝒙𝟏 + 𝒄 = 𝒙𝟐
(𝑑 + 𝑎 − 𝑏)2 + (𝑑 + 𝑏 − 𝑐)2 =0
𝒂𝒙𝟐 𝟐 + 𝒃𝒙𝟐 + 𝒄 = 𝒙𝟑
⟹ a-b = b- c = -d ⟹ 2b= a+ c
𝒂𝒙𝟑 𝟐 + 𝒃𝒙𝟑 + 𝒄 = 𝟏 is
……(2)
4𝑎𝑐 (a) 0 (b) 1 (c)
⟹ 𝑎+𝑐 = a +c ⟹ (𝑎 − 𝑐)2 = 0⟹ a= c
2 (d) 3
From (2), b= a Ans. (a) Let f(x) = 𝑎𝑥 2 + (𝑏 − 1)𝑥+c
64
Given system of equation is equivalent For x ≤ 1, −3𝑥 + 6 ≥ 6 ⟹ 𝑥 ≤ 0

……(A)
𝑓(𝑥1 )=𝑥2 −𝑥1
𝑡𝑜 𝑓(𝑥2 )=𝑥3 −𝑥2 }
𝑓(𝑥3 )=𝑥1 −𝑥3 For 1≤ 𝑥 ≤ 2, −𝑥 + 4 ≥ 6⟹ x≤ −2
⟹ 𝑓(𝑥1 ) + 𝑓(𝑥2 ) + 𝑓(𝑥3 ) = 0 (not acceptable as 1≤ 𝑥 ≤ 2)
∴ 𝑎𝑓(𝑥1 ) + 𝑎𝑓(𝑥2 ) + 𝑎𝑓(𝑥3 ) = 0 (not For x≥ 3, 3𝑥 − 6 ≥ 6 ⟹ 𝑥 ≥ 4

possible) ………(B)
As (𝑏 − 1)2 − 4𝑎𝑐 < 0. From (A) and (B) all positive value of x are
given by x≤ 0 𝑜𝑟 𝑥 ≥ 4
∴ 𝑎𝑓(𝑥1 ), 𝑎𝑓(𝑥2 ), 𝑎𝑓(𝑥3 ) > 0.
Hence given system of equation has no real

𝟏
root. 25. 𝟐𝒔𝒊𝒏𝒙 + 𝟐𝒄𝒐𝒔𝒙 ≥ 𝟐𝟏 −
√𝟐
23. If α, 𝛽 are the roots of the equation (a) only for x ≥0 (b) only for x≤ 0
𝒙𝟐 -ax +b= 0 and 𝑨𝒏 = 𝜶𝒏 + 𝜷𝒏 then (c) for all real x (d) only for x ≠0
which of the following is true?
Ans. (c)
(a) 𝑨𝒏+𝟏 = 𝒂𝑨𝒏 + 𝒃𝑨𝒏−𝟏
(b) 𝑨𝒏+𝟏 = 𝒃𝑨𝒏 + 𝒂𝑨𝒏−𝟏 Since A.M. ≥ G.M
(c) 𝑨𝒏+𝟏 = 𝒂𝑨𝒏 − 𝒃𝑨𝒏−𝟏 2sin 𝑥 +2cos 𝑥

∴ ≥ √2sin 𝑥 . 2cos 𝑥 =
2
(d) 𝑨𝒏+𝟏 = 𝒃𝑨𝒏 − 𝒂𝑨𝒏−𝟏 1 1 𝜋
( ) sin(𝑥+ )
2(2)(sin 𝑥+cos 𝑥) = 2 √2 4
Ans.(a)
1 𝜋 1
1+ sin(𝑥+ ) 1−
𝛼 +𝛽= a, 𝛼𝛽= b ⟹ 2sin 𝑥 + 2cos 𝑥 ≥ 2 √2 4 ≥2 √2
𝜋
Given, 𝐴𝑛 = 𝛼 𝑛 + 𝛽 𝑛 [∵ least value of sin (𝑥 + 4 ) = −1]
Now, 𝐴𝑛+1 = 𝛼 𝑛+1 + 𝛽 𝑛+1 26. How many different nine digit
= (𝛼 𝑛 + 𝛽 𝑛 )( 𝛼 +𝛽)-𝛼𝛽(𝛼 𝑛−1 + 𝛽 𝑛−1) numbers can be formed from the number
223355888 by rearranging its digits so
= a𝐴𝑛 + 𝑏𝐴𝑛−1 that the odd digits occupy even positions?
24. If x satisfies |x-1|+|x-2|+|x-3|≥ 6, then (a) 16 (b) 36

(c) 60 (d) 180
(a) 0≤ 𝒙 ≤ 𝟒 (b) 𝒙 ≤ −𝟐 𝒐𝒓 𝒙 ≥ 𝟒
(c) 𝒙 ≤ 𝟎 𝒐𝒓 𝒙 ≥ 𝟒 (d) 𝒙 ≥ 𝟎 Ans. (c)
Ans. (c) Number of digits= 9
65
Number of odd digits = 4, number of even 29. Range of f(x) = 𝒔𝒊𝒏𝟐𝟎 𝒙 + 𝒄𝒐𝒔𝟒𝟖 𝒙 is
digits= 5
(a) [0, 1] (b) (0, 1)
Number of even places= 4 (c) (0, ∞) (d) none of
these
Odd digits can be arranged in even paces in
|4̲
ways. Even digits can be arranged in Ans. (b)
|2̲|2̲
|5̲
remaining 5 places in |2̲|3̲ ways 0 ≤ 𝑠𝑖𝑛2 𝑥 ≤ 1 ⟹ 𝑠𝑖𝑛20 𝑥 ≤ 𝑠𝑖𝑛2 𝑥
|4̲ |5̲ Thus 0 ≤ 𝑠𝑖𝑛20 𝑥 ≤ 𝑠𝑖𝑛2 𝑥 ………. (1)

∴ Required number = |2̲|2̲ . |2̲|3̲ = 60
Again 0 ≤ 𝑐𝑜𝑠 48 𝑥 ≤ 𝑐𝑜𝑠 2 𝑥 ………..(2)
[∵
27. For 2≤ 𝒓 ≤ 𝒏, (𝒏𝒓) + 𝟐(𝒓−𝟏
𝒏 𝒏
) + (𝒓−𝟐)= 𝑠𝑖𝑛20 𝑥 𝑎𝑛𝑑 𝑐𝑜𝑠 48 𝑥 𝑐𝑎𝑛𝑛𝑜𝑡 𝑏𝑒 𝑧𝑒𝑟𝑜 𝑎𝑡 𝑎 𝑡𝑖𝑚𝑒
]
(a) (𝒏+𝟏
𝒓−𝟏
) (b) 2(𝒏+𝟏
𝒓+𝟏
)
⟹ 0 < f(x) ≤ 1. Hence range of f(x) = (0,
(c) 2(𝒏+𝟐
𝒓
) (d) (𝒏+𝟐
𝒓
)
1)
Ans. (d)
30. Let x, y, z = 105, where x, y, z ∊N.
(𝑛𝑟) 𝑠𝑡𝑎𝑛𝑑𝑠 𝑓𝑜𝑟 𝑛𝐶𝑟 Then number of ordered triplets (x, y, z)
satisfying the given equation is:
Now 𝑛𝐶𝑟 + 2𝑛𝐶𝑟−1 + 𝑛𝐶𝑟−2
(a) 15 (b) 27
= (𝑛𝐶𝑟 + 𝑛𝐶𝑟−1 ) + (𝑛𝐶𝑟−1 + 𝑛𝐶𝑟−2 ) (c) 6 (d) none of these
= 𝑛 + 1𝐶𝑟 + 𝑛 + 1𝐶𝑟−1 = 𝑛 + 2𝐶𝑟 Ans. (b)
𝟐 105= 3× 5 × 7
28. If ∑𝟏𝟎
𝒊=𝟏 𝐬𝐢𝐧
−𝟏
𝑿𝒊 = 𝟓𝝅, 𝒕𝒉𝒆𝒏 ∑𝟏𝟎
𝒊=𝟏 𝑿𝒊 =
When no 1 is taken as a solution, number of
(a) 0 (b) 5
solutions= |3̲ = 6
When only 1’ s taken, number of solutions=
Ans. (c)
3𝐶2 . |3̲ = 18
10
𝜋 When two 1’s are taken, number of solutions
∑ sin−1 𝑥𝑖 = 5𝜋 = 10.
2 |3
̲
𝑖=1 = 3𝐶1 . |2̲ = 3
𝜋
⟹ sin−1 𝑥𝑖 = 2 , ∀𝑖 ⟹ 𝑥𝑖 = 1 ∀ 𝑖 ⟹
∴ Reqd. number= 6+18+3 =27
∑10 2
𝑖=1 𝑥𝑖 = 1
66
ISI B.STAT/B.MATH ∴ D ≤ 0⟹ 16𝑝2 − 48 ≤ 0 ⟹ −√3 ≤ 𝑝 ≤

OBJECTIVE QUESTIONS & √3
SOLUTIONS
SET – 9 2. Consider the following statements S

and R. S: both sinx and cosx are
𝝅
decreasing function in (𝟐 , 𝝅) & R: If a
1. If f(x) = (𝒑𝜶 − 𝜶𝟐 − 𝟐)𝒙 − differentiable function decreases in (a, b)
𝒙
∫𝟎 (𝒄𝒐𝒔𝟒 𝒕 + 𝒔𝒊𝒏𝟐 𝒕 − 𝟐) 𝒅𝒕 is a decreasing then its derivative also decreases in (a, b).
function of x for all x ∊R and 𝛼∊ R, where Which of the following are true?
𝛼 being independent of x, then
(a) both S and R are wrong
(a) p∊ (-∞, 𝟏) (b) p∊ (-1, √𝟑) (b) S is correct and R is wrong
(c) p∊ (1, ∞) (d) none of these (c) both S and R are correct but R is not
the correct expiation for S
Ans. (b) Given, 𝑓(𝑥) = (𝑝𝛼 − 𝛼 2 − 2)𝑥 −
𝑥
∫0 (𝑐𝑜𝑠 4 𝑡 + 𝑠𝑖𝑛2 𝑡 − 2) 𝑑𝑡 ……….(1) (d) S is correct and R is the correct
explanation for S
∴𝑓 ′ (𝑥) = 𝑝𝛼 − 𝛼 2 − 2 − (𝑐𝑜𝑠 4 𝑥 +
𝑠𝑖𝑛2 𝑥 − 2) = −𝛼 2 + 𝑝𝛼 − (𝑐𝑜𝑠 4 𝑥 + Ans. (b) From the trend of value of sin x and
𝑠𝑖𝑛2 𝑥) cos x we know sin x and cosx decrease in
𝜋
< 𝑥 < 𝜋. So, the statement S is correct.
2
= −𝛼 2 + 𝑝𝛼 − (𝑐𝑜𝑠 4 𝑥 + 𝑐𝑜𝑠 2 𝑥 + 1)
The statement R is incorrect cos x is a
2
1 2 3
2
= −𝛼 + 𝑝𝛼 − [(𝑐𝑜𝑠 𝑥 − ) + ] differentiable function which decreases in
2 4 𝜋
( 2 , 𝜋) but its d.c. – sin x is increasing in
3
= −𝛼 2 + 𝑝𝛼 − 𝜋
4 ( 2 , 𝜋)
2
1
− (𝑐𝑜𝑠 2 𝑥 − )
2
3 𝒙𝟐 +𝟏 −𝒕𝟐
Clearly f’(x) ≤ −𝛼 2 + 𝑝𝛼 − 4 [∵ 3. If f(x)= ∫𝒙𝟐 𝒆 𝒅𝒕, then the interval
1 2 in which f(x) is increasing is
𝑀𝑖𝑛. 𝑣𝑎𝑙𝑢𝑒 𝑜𝑓 (𝑐𝑜𝑠 2 𝑥 − 2) = 0]
(a) (0, ∞) (b) (-∞, 𝟎)
For f(x) to be decreasing for all real x, i.e.,
(c) [-2, 2] (d) none of these
f’(x) ≤ 0
3 Ans. (b)
∴ −𝛼 2 + 𝑝𝛼 − 4 ≤ 0 ⟹4𝛼 2 − 4𝑝𝛼 + 3 ≥
0, ∀ 𝛼 ∊ 𝑅
67
𝑥 2 +1 𝒙𝟐 −𝟐
−𝑡 2 ′ (𝑥) 5. If ∫ =
𝑓(𝑥) = ∫ 𝑒 𝑑𝑡 𝑓 𝒙𝟐 +𝟐
𝒅𝒙
(𝒙𝟒 +𝟓𝒙𝟐 +𝟒) 𝐭𝐚𝐧−𝟏 ( )
𝑥2 𝒙
2 2 4
= 𝑒 −(𝑥 +1) . 2𝑥 − 𝑒 −𝑥 . 2𝑥 𝒍𝒐𝒈|𝒇(𝒛)| + 𝒄, then
2𝑥
= (𝑥 2 +1)2 [1 (a) f(z) = 𝐭𝐚𝐧−𝟏 𝒛 , 𝒘𝒉𝒆𝒓𝒆 𝒛 = √𝒙 + 𝟐
𝑒 𝟐
4 +(𝑥 2 +1)2 (b) f(z) = 𝐭𝐚𝐧−𝟏 𝒛 , 𝒘𝒉𝒆𝒓𝒆 𝒛 = 𝒙 + 𝒙
− 𝑒 −𝑥 ]
𝒙+𝟐
2𝑥 (c) f(z)= 𝐬𝐢𝐧−𝟏 𝒛 , 𝒘𝒉𝒆𝒓𝒆 𝒛 =
2𝑥 2 +1 𝒙
= 2 2 [1 − 𝑒 ]
𝑒 (𝑥 +1) (d) none of these
2 +1
2(𝑒 2𝑥 − 1)
= 2 2 (−𝑥) Ans. (b)
𝑒 (𝑥 +1)
𝑥 2 −2
But 𝑒 2𝑥 2 +1
>1 I= ∫ 𝑥2 +2
𝑑𝑥
(𝑥 4 +5𝑥 2 +4) tan−1 ( )
𝑥
∴ f’(x)> 0 in (-∞, 0) and hence f(x) is

Dividing numerator & denominator by 𝑥 2
increasing in (-∞, 0)
we have
2
1− 2
𝑥
=∫ 4 2 𝑑𝑥 =
𝒙 (𝒕−|𝒕|)𝟐 (𝑥 2 +5+ 2 ) tan−1 (𝑥+ )
𝑥 𝑥
4. The value of ∫𝟎 𝟏+𝒕𝟐 𝒅𝒕 is equal to 2
1− 2
𝑥
∫ 2 2 𝑑𝑥
[(𝑥+ ) 2 +1] tan−1 (𝑥+ )
(a) 4(x-𝐭𝐚𝐧−𝟏 𝒙) if x < 0 (b) 0 if > 0 𝑥 𝑥
(c) 𝐥𝐨𝐠(𝟏 + 𝒙𝟐 ) if x > 0 (d) none of 2

these 𝑙𝑒𝑡 tan−1 (𝑥 + ) = 𝑢
𝑥
Ans. (a) 1 2
⟹ . (1 − ) = 𝑑𝑥 = 𝑑𝑢
𝑥 2 𝑥2
(𝑡 − |𝑡|)2 1 + (𝑥 + 𝑥) 2
𝐼=∫ 𝑑𝑡
0 1 + 𝑡2
1
𝑁𝑜𝑤 𝐼 = ∫ 𝑑𝑢 = log |𝑢| + 𝑐
𝐶𝑎𝑠𝑒 𝐼: 𝑥 > 0 , 𝑡ℎ𝑒𝑛 0 < 𝑡 < 𝑥, |𝑡| = 𝑡 𝑢
2
𝑥 (𝑡−𝑡)2 = 𝑙𝑜𝑔 |tan−1 (𝑥 + )|
∴ I= ∫0 1+𝑡 2 𝑑𝑡 =0 𝑥
−1
= tan 𝑧, 𝑤ℎ𝑒𝑟𝑒 𝑧
Case II: x < 0, then x < t< 0⟹ |t|= -t 2
= (𝑥 + )
𝑥
𝑥 (𝑡+𝑡)2 𝑥 4𝑡 2
∴ I= ∫0 𝑑𝑡 = ∫0 𝑑𝑡 =
1+𝑡 2 1+𝑡 2 𝟏
𝑥 1 6. ∫ 𝒙 𝐥𝐨𝐠 (𝟏 + 𝒙) 𝒅𝒙 = 𝒇(𝒙) 𝐥𝐨𝐠(𝒙 + 𝟏) +
4 ∫0 (1 − 1+𝑡 2 ) 𝑑𝑡 = 4[𝑡 − tan −1
𝑡] 𝑥0
𝒈(𝒙)𝒙𝟐 + 𝑳𝒙 + 𝒄, then
= 4(𝑥 − tan−1 𝑥) 𝟏
(a) L= 1 (b) f(x) = 𝟐 𝒙𝟐
(c) g(x) = log x (d) none of these
68
Ans. (d) 1 4
𝑁𝑜𝑤 𝐼 = ∫ 𝑧 −5/4 𝑑𝑧 = 𝑧 −1/4 + 𝐶
3 3
1
I= ∫ 𝑥 log (1 + 𝑥) 𝑑𝑥 = ∫ 𝑥 𝑙𝑜𝑔 (𝑥 + 4 𝑥 − 1 1/4
= .( ) +𝐶
1)𝑑𝑥 − ∫ 𝑥 𝑙𝑜𝑔 𝑥 𝑑𝑥 3 𝑥+2
𝑥2 1 𝑥2 𝑥2
= log(𝑥 + 1) − 2 ∫ 1+𝑥 𝑑𝑥 − 𝑙𝑜𝑔𝑥 +
2 2
1 𝑥2 𝑥2 𝟏+𝒏.𝒙𝒏−𝟏 −𝒙𝟐𝒏
∫ 𝑥 𝑑𝑥 = log(𝑥 + 1) − 𝑙𝑜𝑔𝑥 − 8. ∫ 𝒆𝒙 𝒅𝒙=
2 2 2 (𝟏−𝒙𝒏 )√𝟏−𝒙𝟐𝒏
1 1 1
2
∫ (𝑥 − 1 + 𝑥+1) 𝑑𝑥 + 2 ∫ 𝑥 𝑑𝑥
𝒆𝒙 √𝟏−𝒙𝟐𝒏 𝒆𝒙 √𝟏−𝒙𝒏
(a) +𝒄 (b) +𝒄
𝟏−𝒙𝟐𝒏 𝟏−𝒙𝒏
𝑥2 𝑥2 1
= log(𝑥 + 1) − log 𝑥 − log(𝑥 + 1) 𝒆𝒙 √𝟏−𝒙𝟐𝒏
2 2 2 (c) +𝒄 (d) none of these
𝟏−𝒙𝒏
𝑥
+ +𝑐
2 Ans. (c)
𝑥2 1 1 1−𝑥 2𝑛 +𝑛𝑥 𝑛−1 √1−𝑥 2𝑛

𝑓(𝑥) = − , 𝑔(𝑥) = − log 𝑥 I= ∫ 𝑒 𝑥 [(1−𝑥 𝑛)√1−𝑥 2𝑛] 𝑑𝑥 = ∫ 𝑒 𝑥 [ +
2 2 2 1−𝑥 𝑛
1 𝑛𝑥 𝑛−1 1−𝑥 𝑛
𝐿= . √
(1−𝑥 𝑛 )2 1+𝑥 𝑛
] 𝑑𝑥 = ∫ 𝑒 𝑥 {𝑓(𝑥) +
2
𝑓 ′ (𝑥)]𝑑𝑥,
𝒅𝒙
7. ∫ 𝟑 𝟓 =
(𝒙−𝟏)𝟒 (𝒙+𝟐)𝟒
1 − 𝑥 2𝑛
𝟏 𝑤ℎ𝑒𝑟𝑒 𝑓(𝑥) = √ = 𝑒 𝑥 𝑓(𝑥) + 𝐶
𝟒 𝒙−𝟏 𝟒 𝟒 𝒙−𝟏 1 − 𝑥𝑛
(a) 𝟑 (𝒙+𝟐) + 𝒄 (b) 𝟑 √𝒙+𝟐 + 𝒄
1 − 𝑥 2𝑛
𝟏 = 𝑒𝑥 +𝐶
𝒙+𝟐 𝟒 1 − 𝑥𝑛
(c) (𝒙−𝟏) + 𝒄 (d) none of these
(𝒙+𝟏)
9. ∫ 𝒙(𝟏+𝒙𝒆𝒙)𝟐 𝒅𝒙 = 𝒍𝒐𝒈|−𝒇(𝒙)| + 𝒇(𝒙) +
Ans. (a)
𝒄 𝒕𝒉𝒆𝒏 𝒇(𝒙) =
𝑑𝑥
𝐼= ∫ 5 𝟏 𝟏
(a) 𝒙+𝒆𝒙 (b) 𝒙+𝒙𝒆𝒙
𝑥+2 4
(𝑥 − 1)2 (
𝑥 − 1) 𝟏
(c) (𝟏+𝒙𝒆𝒙)𝟐 (d) none of
𝑥+2 these
𝑝𝑢𝑡 𝑧 = , 𝑡ℎ𝑒𝑛
𝑥−1
Ans. (b)
(𝑥 − 1). 1 − (𝑥 − 2). 1
𝑑𝑥 = 𝑑𝑥 Put z= x𝑒 𝑥 , then dz = (𝑒 𝑥 + 𝑥𝑒 𝑥 ) dx
(𝑥 − 1)2
3 𝑑𝑧 1 1 1
= − 𝑑𝑥 I= ∫ 𝑧(1+𝑧)2 = ∫ [𝑧 − 1+𝑧 − (1+𝑧)2 ] 𝑑𝑧 =
(𝑥 − 1)2
𝑧 1 𝑥𝑒 𝑥 1
log 1+𝑧 + 1+𝑧 + 𝐶 = 𝑙𝑜𝑔 |1+𝑥𝑒 𝑥 | + 1+𝑥𝑒 𝑥 + 𝑐
69
1 1 12. If f(𝛼)= f(𝛽) and n ∊N, then the value

= log |1 − 𝑥
|+ +𝐶 ′′
1 + 𝑥𝑒 1 + 𝑥𝑒 𝑥 𝜷
of ∫𝜶 (𝒈(𝒇(𝒙))) 𝒈′ (𝒇(𝒙)). 𝒇′ (𝒙) 𝒅𝒙 =
(a) 1 (b) 0
𝝅
𝐬𝐢𝐧(𝟐𝒏−𝟏)𝒙 𝜷𝒏+𝟏 −𝜶𝒏+𝟏
10. If 𝑰𝒏 = ∫𝟎 𝟐 𝒅𝒙, 𝒂𝒏𝒅 𝒂𝒏 = (c) (d) none of
𝒔𝒊𝒏𝒙 𝒏+𝟏
𝝅
𝐬𝐢𝐧 𝒏𝜽 these
∫𝟎 ( 𝐬𝐢𝐧 𝜽 ) 𝟐 𝒅𝜽, 𝒕𝒉𝒆𝒏 𝒂𝒏+𝟏 − 𝒂𝒏 =
𝟐
Ans. (b)
(a) 𝑰𝒏 (b) 2𝑰𝒏
(c) 𝑰𝒏 + 𝟏 (d) 0 Put z = g(f(x)), then dz = g’(f(x)) f’(x) dx
Ans. (c) 𝑎𝑛+1 − 𝑎𝑛 = 𝑧 𝑛+1

𝜋
= ∫ 𝑧 𝑛 𝑑𝑧 =
𝑠𝑖𝑛2 (𝑛+1)𝑥−𝑠𝑖𝑛2 𝑛𝑥 𝑛+1
∫02 𝑑𝑥
𝑠𝑖𝑛2 𝑥 1 𝑛+1 𝛽
𝐼 = 𝑛+1 [{𝑔(𝑓(𝑥))] ] 𝛼
=
𝜋
2 sin(2𝑛 + 1) 𝑥𝑠𝑖𝑛 𝑥 1 𝑛+1 𝑛+1
=∫ 𝑑𝑥 [[{𝑔(𝑓(𝛼))] − [{𝑔(𝑓(𝛽))] ]= 0
𝑛+1
0 𝑠𝑖𝑛2 𝑥
𝜋 [∵ f(𝛼)= f(𝛽)]
2 sin(2𝑛 + 1)𝑥
= ∫ 𝑑𝑥
0 sin 𝑥
= 𝐼𝑛+1 13. Let [x] denotes the integral part of a
𝝅 real number x and {x} = x- [x], then
11. If n ≠ 𝟏, ∫𝟎𝟒 (𝒕𝒂𝒏𝒏 𝒙 + 𝒕𝒂𝒏𝒏−𝟐 𝒙) 𝒅(𝒙 − solution of 4{x}= x+ [x] are
[𝒙])=
𝟐 𝟒
(a) ± 𝟑 , 𝟎 (b) ± 𝟑 , 𝟎
𝟏 𝟏
(a) 𝒏−𝟏 (b) 𝒏+𝟏 𝟓
𝟏 𝟐
(c) 0, 𝟑 (d) ±𝟐, 𝟎
(c) 𝒏 (d) 𝒏−𝟏
Ans. (c)
Ans. (a)
4{x}= x+ [x]= [x]+ {x} +[x]
𝜋
Let 𝐼𝑛 = ∫0 (𝑡𝑎𝑛𝑛 𝑥 + 𝑡𝑎𝑛𝑛−2 𝑥) 𝑑(𝑥 − [𝑥])
4
2
⟹ {x}= 3 [𝑥] …….(1)
𝜋
ℎ𝑒𝑟𝑒 0 < 𝑥 < ∴ [𝑥] = 0 ∴ 𝑥 − [𝑥] = 𝑥 Since 0 ≤ {𝑥} < 1
4
𝜋 2 3
4
𝑛−2 2
∴ 0≤ 3 [𝑥] < 1 ⟹ 0 ≤ [𝑥] < 2
𝑛𝑜𝑤 𝐼𝑛 = ∫ 𝑡𝑎𝑛 𝑥𝑠𝑒𝑐 𝑥 𝑑𝑥
0
1 Hence [x]= 0, 1
𝑛−2
= ∫ 𝑧 𝑑𝑧, 𝑝𝑢𝑡𝑡𝑖𝑛𝑔 𝑧
2
0 ∴{x}= 0, 3 [from (1)]
= tan 𝑥
5
𝑧 𝑛−1 1 ∴ x= [x]+ {x}= 0, 3
= [ 𝑛−1 ] 10 = 𝑛−1
70
14. The maximum number of real roots of Given, 𝑥 2 − 4𝑥 + 5 = 𝑥 − 1

the equation 𝒙𝟐𝒏 − 𝟏= 0 (n ∊N) is
⟹ 𝑥 2 − 5𝑥 + 6 = 0⟹ x= 2, 3
(a) 2 (b) 3
𝒂𝟐 𝒃𝟐 𝒄𝟐
(c) n (d) 2n 16. Equation 𝒙−𝜶 + 𝒙−𝜷 + 𝒙−𝜸 = 𝒎 − 𝒏𝟐 𝒙
Ans. (a) (a, b, c, m, n ∊ r) has necessarily
𝑥 2𝑛 − 1 = 0 ⟹ 𝑥 2𝑛 = 1 = cos 0 + 𝑖 sin 0 (a) all the roots real

(b) all the roots imaginary
2𝑟𝜋 2𝑟𝜋 𝑟𝜋
∴ 𝑥 = cos + 𝑖 sin = cos +
2𝑛 2𝑛 𝑛 (c) two real and two imaginary roots
𝑟𝜋
𝑖 sin , 𝑟 = 0, 1, … . , (2𝑛 − 1) (d) two rational and two irrational roots
𝑛
𝑟𝜋 Ans.(a)
x will be real only when sin =0
𝑛
𝑟𝜋 Let p + iq be a root of given equation, then

or = 𝑚𝜋
𝑛
𝑎2 𝑏2 𝑐2
+ 𝑝−𝛽+𝑖𝑞 + 𝑝−𝛾+𝑖𝑞 = 𝑚 − 𝑛2 (𝑝 +
or r = mn = a multiple of n 𝑝−𝛼+𝑖𝑞
𝑖𝑞)
But, r= 0, 1, 2,, …, 2n- 1
𝑎2 [𝑝−𝛼−𝑖𝑞] 𝑏 2 [(𝑝−𝛽)−𝑖𝑞] 𝑐 2 [(𝑝−𝛾)−𝑖𝑞]
⟹ (𝑝−𝛼)2 +𝑞2 + + =
∴ r = 0, n (𝑝−𝛽)2 +𝑞2 (𝑝−𝛾)2 +𝑞2
𝑚 − 𝑛2 𝑝 − 𝑖𝑛2 𝑞
2𝑛
∴𝑥 − 1 = 0 has only two real root 1, -1.
Equating imaginary parts we get
Second method: Let f(x) = 𝑥 2𝑛 − 1
𝑎2 𝑏2 𝑐2
2𝑛−1 𝑞 [{(𝑝−𝛼)2 +𝑞2 + (𝑝−𝛽)2 +𝑞2 + (𝑝−𝛾)2 +𝑞2 } +
Then, f’(x) = 2𝑛𝑥
𝑛2 ] = 0
Sign scheme for f’(x) is
Hence graph, of y= f(x) will either intersect ∴ q= 0.

x –axis at two points or touch x-axis or will Hence p +iq= p= a real number.
not interest x-axis or will not interest x-axis.
Therefore eqn. f(x)= 0 has two distinct real 17. If a, b, c ∊ { 1, 2, 3, 4, 5}, the number
roots or two equal real roots or no real root. of equations of the form 𝒂𝒙𝟐 + 𝒃𝒙 + 𝒄 =
𝟐 −𝟒𝒙+𝟓)
𝟎 which have real roots is
15. The roots of equation 𝟕 𝐥𝐨𝐠𝟕(𝒙
are (a) 25 (b) 26
(c) 207 (d) 24
(a) 4, 5 (b) 2, -3
(c) 2, 3 (d) 3, 5 Ans. (d)
Ans. (c) 𝑏2
For real roots ac ≤ 4
71
B 𝑏2 Possible value No. of (a) c > 0 (b) b > 0

4 of ac such that possible pairs (c) b< 0 (d) c < 0
𝑏2 (a, c)
ac ≤ 4 Ans. (d)
2 1 1 1 g(x)= 𝑎(𝑎𝑥 2 + 𝑏𝑥 + 𝑐) + 𝑏(2𝑎𝑥 + 𝑏) +
3 2.25 1.2 3
𝑐 + 2𝑎 = 𝑎2 𝑥 2 + 3𝑎𝑏𝑥 + 𝑏 2 + 3𝑎𝑐
4 4 1, 2, 3, 4 8
5 6.25 1, 2, 3, 4, 5, 6 12 discriminant of its corresponding equation ,
Total 24
D = 9𝑎2 𝑏 2 − 12𝑎3 𝑐
Value of ac Possible pairs (a, c) = 9𝑎2 𝑏 2 − 36𝑎3 𝑐 + 24𝑎3 𝑐

1 (1, 1)
2 (1, 2), (2, 1) = 9𝑎2 (𝑏 2 − 4𝑎𝑐) + 24𝑎3 𝑐 ……(1)
3 (1, 3), (3, 1)
4 (1, 4), (4, 1), (2, 2) Since f(x)> 0, ∀ 𝑥 ∊ 𝑅
5 (1, 5), (5, 1)
6 (2, 3), (3, 2) ∴ a > 0 and 𝑏 2 − 4𝑎𝑐< 0
Hence number of quadratic equations
For g(x)> 0 ∀ 𝑥 ∊ 𝑅, 𝑎2 > 0 𝑎𝑛𝑑 𝐷 < 0
having real roots = 24
But from (1), D < 0 when c < 0
18. If x, 𝒂𝟏 , 𝒂𝟐 , 𝒂𝟑 , … , 𝒂𝒏 ∊ 𝑹 𝒂𝒏𝒅 (𝒙 −
𝒂𝟏 + 𝒂𝟐 )𝟐 + (𝒙 − 𝒂𝟐 + 𝒂𝟑 )𝟐 + ⋯ 20. The constant term of the quadratic
𝟏
𝟐 expression ∑𝒏𝒌=𝟏 (𝒙 − 𝒌+𝟏) (𝒙 −
+(𝒙 − 𝒂𝒏−𝟏 + 𝒂𝒏 ) = 0,
𝟏
then 𝒂𝟏 , 𝒂𝟐 , 𝒂𝟑 , … , 𝒂𝒏 are in ) 𝒂𝒔 𝒏 ⟶ ∞ is
𝒌
(a) A.P. (b) G.P. (c) H.P. (d) none of (a) -1 (b) 0
these. (c) 1 (d) none of these
Ans. (a) (𝑥 − 𝑎1 + 𝑎2 )2 + (𝑥 − 𝑎2 + Ans. (c) Constant term
𝑎3 )2 + ⋯ + (𝑥 − 𝑎𝑛−1 + 𝑎𝑛 )2 = 0
1 1 1 1
c = 1.2 + 2.3 + ⋯ + 𝑛(𝑛+1) = 1 − 𝑛+1
⟹𝑎1 − 𝑎2 = 𝑎2 − 𝑎3 = ⋯ = 𝑎𝑛−1 −
𝑎𝑛 = 𝑥 1
lim 𝑐 = lim (1 − )=1
⟹ 𝑎1 , 𝑎2 , 𝑎3 , … . 𝑎𝑛 are in A.P. with 𝑛→∞ 𝑛→∞ 𝑛+1
common difference x. 𝝅
21. If 𝜽𝒊 ∊ [𝟎, 𝟔 ] , 𝒊 = 𝟏, 𝟐, 𝟑, 𝟒, 𝟓 and
19. Let f(x) = 𝒂𝒙𝟐 + 𝒃𝒙 + 𝒄 and g(x) = 𝒔𝒊𝒏𝜽𝟏 𝒛𝟒 + 𝒔𝒊𝒏𝜽𝟐 𝒛𝟑 + 𝒔𝒊𝒏𝜽𝟑 𝒛𝟐 +
af(x) + bf′(x) + cf″(x) If f(x) > 0 for all x , 𝒔𝒊𝒏𝜽𝟒 𝒛 + 𝒔𝒊𝒏𝜽𝟓 = 𝟐 then z satisfies
then the sufficient condition for g(x) to be
𝟑 𝟏 𝟏 𝟑
> 0 v x is (a) |z|> 𝟒 (b) |z|< 𝟐 (c) 𝟐
< |z|< 𝟒 (d)
none of these
72
Ans.(a) At x = 2, 3𝑥 − 𝑥 + 2 = 9
𝜋
Since 0≤ 𝜃𝑖 , ≤ For x >2, 3𝑥 − 𝑥 + 2 > 9
6
1 (As 3𝑥 − 𝑥 + 2 is an increasing function for

∴ 0≤ 𝑠𝑖𝑛𝜃𝑖 , ≤ 2
x > 2)
From given condition 1 𝑥
For x= -2, (3) + 2 + 𝑥 = 9
|2|= |𝑠𝑖𝑛𝜃5 + 𝑧𝑠𝑖𝑛𝜃4 + 𝑧 2 𝑠𝑖𝑛𝜃3 +
𝑧 3 𝑠𝑖𝑛𝜃2 + 𝑧 4 𝑠𝑖𝑛𝜃1 | 1 𝑥
For x < -2, (3) + 2 + 𝑥 < 9
⟹ 2≤ |𝑠𝑖𝑛𝜃5 | + |𝑧||𝑠𝑖𝑛𝜃4 | + 1 𝑥
1 [as (3) + 2 + 𝑥 𝑖𝑠 𝑑𝑒𝑐𝑟𝑒𝑎𝑠𝑖𝑛𝑔]
|𝑧|2 |𝑠𝑖𝑛𝜃3 |+|𝑧|3 |𝑠𝑖𝑛𝜃2 |+|𝑧|4 |𝑠𝑖𝑛𝜃1 | ≤2+
1 1 2 1 3 1 4 1
|𝑧| + |𝑧| + |𝑧| + |𝑧| | < |𝑧| + Hence given equation has only two solutions
2 2 2 2 2
|𝑧|2 + ⋯ 𝑡𝑜 ∞ ….(1) -2 and 2.
When|𝑧| < 1, from (1), 23. The number of real roots of the
𝟏
1 1 equation (𝟗 + 𝒔𝒊𝒏𝒙)𝟏−𝒙 + (𝟏𝟎 +
2 < 2 . 1−|𝑧| 𝟏 𝟏
𝒔𝒊𝒏𝒙)𝟏−𝒙 = (𝟏𝟏 + 𝒔𝒊𝒏𝒙)𝟏−𝒙 for x ∊ (0, 1)
1 3 is
∴ 1 − |𝑧| < 4 ⟹ |𝑧| > 4
3
(a) exactly one (b) at least
When |z|> 1, clearly |𝑧| > 4 one (c) at most one (d)
none of these
3
Thus |𝑧| > 1, 𝑐𝑙𝑒𝑎𝑟𝑙𝑦 |𝑧| > 4
Ans. (a)
|𝒙|
22. Number of solutions of 𝟑 = |𝟐 −
Given eqn. is f(x) = 1,
|𝒙|| is
1
1 1−𝑥
(a) 0 (b) 2 where f(x) = (1 + ) −
10+sin 𝑥
(c) 4 (d) infinite 1
1 1−𝑥
(1 − 10+sin 𝑥)
Ans. (b)
Given equation is Clearly

1
1 𝑥 f(0)= 5 < 1 𝑎𝑛𝑑 𝑓(1 − 0) = ∞
(3) = 2 − 𝑥, − ∞ < 𝑥 ≤ −2
Also f(x) is an increasing function
= 2+ x, -2 ≤ 𝑥 ≤ 0
∴ f(x)= 1 only for one value of x.
3𝑥 = 2 − 𝑥, 0 ≤ 𝑥 ≤ 2
= x – 2, 2≤ 𝑥 < ∞
73
24. If 0 < 𝛼r < 1 for r= 1, 2, 3, …, k and m (a) n (b) 2n

be the number of real solutions of (c) n/2 (d) 3n
equation
Ans. (b)
∑𝒌𝒓=𝟏(𝒂𝒓 )𝒙 = 𝟏 & n be the number of real
Given, 2𝑥 2 − 3𝑥𝑦 − 9𝑦 2 − 11 = 0
solution of equation ∑𝒌𝒓=𝟏(𝒙 − 𝒂𝒓 )𝟏𝟎𝟏 =
𝟎, then ⟹ (2x +3y)(x- 3y)= 11
(a) m= n (b) m ≤ n 2𝑥 + 3𝑦 = 1 2𝑥 + 3𝑦 = 11
∴ }, }
(c) m ≥ n (d) m > n 𝑥 − 3𝑦 = 11 𝑥 − 3𝑦 = 1
Ans. (b) 2𝑥 + 3𝑦 = −1 2𝑥 + 3𝑦 = −11

}, }
𝑥 − 3𝑦 = −11 𝑥 − 3𝑦 = −1
Let 𝛼 be a root of eqn.
∴ x= 4, y= 1, x= -4, y= -1
𝑥 𝑥 𝑥
𝑎1 + 𝑎2 + ⋯ + 𝑎𝑘 = 1
…………….(1) ∴ m= 2
Then when x < 𝛼, L.H.S. of (1)> 1 Again, given
And when x > 𝛼, L.H.S. of (1)< 1 𝑥 3 − [𝑥] − 3 = 0 ⟹𝑥 3 − (𝑥 − 𝛼) − 3 = 0,
Hence, eqn. (1) cannot have more than one Where 𝛼= {x}= x-[x]
root. ⟹𝑥 3 − 𝑥 = 3 − 𝛼. But 0≤ 𝛼 < 1
∴𝑚≤1 ∴ 2 < 𝑥3 − 𝑥 ≤ 3
Let f(x) = (𝑥 − 𝑎1 )101 + (𝑥 − 𝑎2 )101 + ⋯ + For x ≥ 2,
(𝑥 − 𝑎𝑛 )101
𝑥 3 − 𝑥 = 𝑥(𝑥 2 − 1) ≥ 2(22 − 1) = 6
∴ f’(x) > 0 ⟹ f(x) is an increasing function
For x≤ −1, 𝑥 3 − 𝑥 = 𝑥(𝑥 2 − 1) < 0
Also f(−∞) = −∞ < 0 𝑎𝑛𝑑 𝑓(∞) = ∞ >
0 For -1 < x< 0, 𝑥 3 − 𝑥 < 1 < 2
∴ f(x) = 0 has exactly one real root For 0 < x ≤ 1, 𝑥 3 − 𝑥 < 𝑥 3 < 1 < 2
∴ n= 1 For x= 0, 𝑥 3 − 𝑥 = 0 < 2
Hence m ≤ 𝑛. ∴1 < x< 2 ∴ [x]=1
25. If m be number of integral solutions of ∴Given equation becomes

equation 𝟐𝒙𝟐 − 𝟑𝒙𝒚 − 𝟗𝒚𝟐 − 𝟏𝟏 = 𝟎 and 1
n be the number of real solutions of 𝑥 3 − 4= 0⟹x= 43
equation 𝒙𝟑 − [𝒙] − 𝟑= 0, then m =
∴ n= 1
74
Thus m= 2, n=1
26. If [x] denotes the integral part of x 27. If [x] denotes the integral part of x
𝟐 |𝒙|
−𝟏 𝟏+𝒕 and m= [𝟏+𝒙𝟐 ] , 𝒏 =
and k = 𝒔𝒊𝒏 > 0, then integral
𝟐𝒕
𝟏
value of 𝛼 for which the equation (x- 𝒊𝒏𝒕𝒆𝒈𝒓𝒂𝒍 𝒗𝒂𝒍𝒖𝒆𝒔 𝒐𝒇 , then
𝟐−𝒔𝒊𝒏𝟑𝒙
[k])(x+𝛼) - 1 = 0 has integral roots is
(a) m≠ n (b) m > n
(a) 1 (b) 2 (c) m + n = 0 (d) 𝒏𝒎 = 𝟎
Ans. (a)
Ans. (d)
|𝑥|
2 1+𝑡 2
0 ≤ 1+𝑥 2 < 1 ;
−1 1+𝑡
For sin 𝑡𝑜 𝑏𝑒 𝑑𝑒𝑓𝑖𝑛𝑒𝑑, | |≤1
2𝑡 2𝑡
|𝑥|
∴ m= [1+𝑥2 ] = 0
1+𝑡 2
⟹ <1
2𝑡
Again 1≤ 2 − sin 3𝑥 ≤ 3
⟹ 1+ |𝑡|2 ≤ 2|𝑡|
1 1
2
∴3 ≤ 2−sin 3𝑥 ≤ 1
⟹ (1+ |𝑡|) ≤ 0
1
⟹ (1+ |𝑡|)2 = 0 ⟹ |𝑡| = 1 ∴ n= integral value of 2−sin 3𝑥= 1
⟹ t= ±1 ∴m≠ n is the correct choice.

𝜋
∴ k= sin−1 1 = (∵k> 0)
2
𝜋 28. If 1 lies between the roots of equation

∴ [k] = [2 ]= 1
𝒚𝟐 − 𝒎𝒚 + 𝟏 = 𝟎 and [x] denotes the
𝟒|𝒙| 𝒎
Given equation is (x-1)(x-𝛼)-1= 0 integral part of x, then [(𝒙𝟐 +𝟏𝟔) ] =
⟹ (x- 1)(x+ 𝛼)= 1 ……. (1) (a) 1 (b) 0 (c)

We have to find integral value of 𝛼 for undefined (c) 2
which equation (1) has integral roots. Ans. (b)
∴ x and 𝛼 are integers. Since 1 lies between the roots of equation
From (1), (i) x- 1 = 1⟹ x= 2 𝑦 2 − 𝑚𝑦 + 1 = 0,
X+ 𝛼= 1⟹ 𝛼= 1- x= -1 ∴ f(1)< 0
(ii) x- 1 = -1⟹ x= 0 ⟹ 2-m < 0 ⟹ m > 2 …… (1)
X+ 𝛼= -1 ⟹ 𝛼= -1 4|𝑥| 4|𝑥| 4𝑧
Let y= 𝑥 2 +16 = =𝑧 2 +16, where z= |x|
|𝑥|2 +16
75
∴ y𝑧 2 − 4𝑧 + 16𝑦 = 0 Let 𝜙(x)= f(x)+Ag(x)
Since z is real, Then 𝜙’(x)= f’(x)+ Ag’(x)

1 1
∴ 16- 64𝑦 2 ≥ 0 ⟹ − 2 ≤ 𝑦 ≤ 2 Choosing A such that φ(0)= 𝜙(1),
𝑓(1)−𝑓(0)
1 We have A= - 𝒈(𝟏)−𝒈(𝟎)
∴ 0≤ 𝑦 ≤ 2 [∵ y > 0]
1 for this value of A using Rolle’s theorem for

∴0≤ 𝑦 𝑚 ≤ 2𝑚 < 1
𝜙(x) in (0, 1), we have
∴ [𝑦 𝑚 ] = 0 …….. (2)
𝜙’(c)= 0 for some c ∊ (0, 1)
𝟖
29. Equation sin x + 2sin 2x +3 sin 3x = 𝝅 𝑓 ′ (𝑐) 𝑓(1) − 𝑓(0)
⟹ ′
= −𝐴 =
has at least one root in 𝑔 (𝑐) 𝑔(1) − 𝑔(0)
6−2 4
(a) (𝝅,
𝟑𝝅
)
𝝅
(b) (𝟎, 𝟐 ) = ⟹2=
𝟐 𝑔(1) − 0 𝑔(1)
𝝅
(c) (𝟐 , 𝝅) (d) none of these ⟹ 𝑔(1) = 2
Ans. (b)
8 ISI B.STAT/B.MATH
Let f(x) = 𝜋 𝑥 + cos 𝑥 + cos 2𝑥 + cos 3𝑥
8 SOLUTIONS
𝑡ℎ𝑒𝑛 𝑓 ′ (𝑥) = 𝑥 − 𝑠𝑖𝑛𝑥 − 2sin 2𝑥
𝜋
− 3 sin 3𝑥 SET – 10
f(x) is continuous and differentiable at every
point
1. Let
𝜋
Also f(0)= f(2 ) ∴ By Rolle’s theorem f(x) = cosx(sinx + √𝒔𝒊𝒏𝟐 𝒙 + 𝒔𝒊𝒏𝟐 𝜽),
𝜋
f’(c)= 0 for at least one c in (0, 2 ) where ‘𝜃’ is a given constant,
30. Let f(x) and g(x) be differentiable then maximum value of f(x) is
functions for 0≤ 𝒙 ≤ 𝟏 such that f(0) = 2,
(a) √𝟏 + 𝐜𝐨𝐬𝟐 𝜽 (b) √𝟏 + 𝐬𝐢𝐧𝟐 𝜽
g(0)= 0, f(1)= 6.Let there exist a real
number c in (0, 1) such that f’(c)= 2g’(c), (c) |cos𝜃| (d) none
then g(1)= Ans. (b) {𝑓(𝑥)𝑠𝑒𝑐𝑥 − 𝑠𝑖𝑛𝑥}2 = 𝑠𝑖𝑛2 𝑥 +
(a) 1 (b) 2 𝑠𝑖𝑛2 𝜃,
(c) -2 (d) -1 ⤇ 𝑓 2 (𝑥)(1 + 𝑡𝑎𝑛2 𝑥) − 2𝑓(𝑥𝑡𝑎𝑛𝑥) =
Ans. (b) 𝑠𝑖𝑛2 𝜃
76
⤇ 𝑓 2 (𝑥)𝑡𝑎𝑛2 𝑥 − 2𝑓(𝑥𝑡𝑎𝑛𝑥) + 𝑓 2 (𝑥) − 1

= 1−𝑥 + log(1 − 𝑥)-1
𝑠𝑖𝑛2 𝜃 = 0
𝑥
2 (𝑥) 2 (𝑥){ 2 (𝑥) 2 = 1−𝑥 + log(1 − 𝑥)
⤇4𝑓 ≥ 4𝑓 𝑓 − 𝑠𝑖𝑛 𝜃}
⤇𝑓 2 (𝑥) ≤ 1 + 𝑠𝑖𝑛2 𝜃
4. The polar equation r= acos𝜃 represents
i.e. |f(x)|≤ √1 + 𝑠𝑖𝑛2 𝜃.
(a) a spiral (b) a parabola
(c) a circle (d) none
𝟏+√𝟐+𝟑√𝟑+⋯+𝒏√𝒏
2. 𝐥𝐢𝐦 Ans. (c) 𝑟 2 = 𝑎𝑟𝑐𝑜𝑠𝜃
𝒏→∞ 𝒏
(a) equals 0 (b) equals 1 ∴ 𝑥 2 + 𝑦 2 = 𝑎𝑥 (since r = 𝑥 2 + 𝑦 2 , 𝑥 =

(c) equals ∞ (d) none 𝑎𝑐𝑜𝑠𝜃 )
Ans. (b) Cauchy’s First limit theorem:- ∴𝑥 2 + 𝑎𝑥 + 𝑦 2 = 0

𝑢1 +𝑢2 +⋯+𝑢𝑛
If lim 𝑢𝑛 = 𝑙, 𝑡ℎ𝑒𝑛 lim =𝑙. 𝑎 𝑎2
𝑛
𝑛→∞ 𝑛→∞ ∴(x+2)2 + 𝑦 2 = 4
1
Here lim 𝑢𝑛 = lim 𝑛𝑛 = 𝑎 𝑎
𝑛→∞ 𝑛→∞ This is a circle of radius 2 and centre (-2 , 0).
1, 𝑠𝑜, 𝑏𝑦 Cauchy’s first limit theorem
(𝟏+𝒔𝒊𝒏𝝅𝒙)𝒕 −𝟏
𝑢1 +𝑢2 +⋯+𝑢𝑛 5. If f(x) = 𝐋𝐭 , then range of
lim = 𝒊→∞ (𝟏+𝒔𝒊𝒏𝝅𝒙)𝒕 +𝟏
𝑛→∞ 𝑛
f(x) is
1+√2+3√3+⋯+𝑛√𝑛
lim = 1.
𝑛→∞ 𝑛
(a) {-1, 1} (b) {0, 1}
3. If 0 < x < 1, then the sum of the infinite (c) {-1, 1} (d) {-1, 0, 1}
𝟏 𝟐 𝟑
series 𝟐 𝒙𝟐 + 𝟑 𝒙𝟑 + 𝟒 𝒙𝟒 + ⋯ is Ans. (d)
𝟏+𝒙 𝒙 (1+sin 𝜋𝑥)𝑡 −1
(a) 𝐥𝐨𝐠 𝟏−𝒙 (b) 𝟏−𝒙 + 𝐥𝐨𝐠(𝟏 + 𝒙) f(x)= Lt =
𝑡→∞ (1+sin 𝜋𝑥)𝑡 +1
𝟏 𝒙 1
(c) 𝟏−𝒙 + 𝐥𝐨𝐠(𝟏 − 𝒙) (d) 𝟏−𝒙 + 1−
(1+sin 𝜋𝑥)𝑡
1 𝑡, sin 𝜋𝑥 > 0
𝐥𝐨𝐠(𝟏 − 𝒙) 1+(
1+sin 𝜋𝑥
)
0−1 =
1 2 2 3 3 4 , sin 𝜋𝑥 < 0
Ans. (b) 2 𝑥 + 3 𝑥 + 4 𝑥 + ⋯ 0+1
1−1
{ 1+1 , sin 𝜋𝑥 = 0
1 2 1 3 1 4
= (1-2) 𝑥 + (1-3) 𝑥 + (1-4)𝑥 +…. 1, sin 𝜋𝑥 > 0
{−1, 𝑠𝑖𝑛𝜋𝑥 < 0
1 1 1 0, 𝑠𝑖𝑛𝜋𝑥 = 0
= {𝑥 2 +𝑥 3 +𝑥 4 +…. }-{2 𝑥 2 + 3 𝑥 3 + 4 𝑥 4 +
⋯} ∴ Range f= {-1, 0, 1}
1 1
= {1+x+𝑥 2 +….}-{x+2 𝑥 2 + 3 𝑥 3 +…}-1
77
𝝅 1 1 1
6. If f: (𝟎, 𝒏) → 𝑹, 𝒅𝒆𝒇𝒊𝒏𝒆𝒅 𝒃𝒚 𝒇(𝒙) = 𝑆𝑛 = (1 − 1+𝑥) + (1+𝑥 − 1+2𝑥) +
∑𝒏𝒌=𝟏[𝟏 + 𝐬𝐢𝐧 𝒌𝒙], where [x] denotes the 1 1
(1+2𝑥 − 1+3𝑥) + ⋯ + (1+(𝑛−1)𝑥 −
1
integral part of x, then range of f(x) is 1

)
1+𝑛𝑥
(a) {n-1, n+1} (b) {n-1, n, n+1} 1
(c) {n, n+1} (d) none of these = 1−
1 + 𝑛𝑥
Ans. (c) 𝑏𝑢𝑡 Lt 𝑛𝑥 = ∞, 𝑥 > 0 = −∞, 𝑥 < 0 =
𝑛→∞
f(x )= ∑𝑛𝑘=1(1
+ [sin 𝑘𝑥]) = 𝑛 + [sin 𝑥] + 0, 𝑥 = 0
[sin 2𝑥] + … + [sin 𝑛𝑥] …….(1)
∴𝑓(𝑥) = Lt 𝑆𝑛 = 1, 𝑤ℎ𝑒𝑛 𝑥 ≠ 0
𝑛→∞
𝜋
case 1: when kx ≠ for k= 1, 2, 3, …, n = 0, 𝑤ℎ𝑒𝑛 𝑥 = 0
2
𝜋 Hence range f= {0, 1}

since 0 < kx < 𝜋 and kx ≠ 2
𝝅𝒙 𝝅𝒙
∴ 0 < sin kx < 1, for k= 1, 2, …., n 8. Period of f(x) = sin (𝒏−𝟏)! + 𝐜𝐨𝐬 𝒏! is
∴ [sin kx]= 0, for k= 1, 2, 3, …., n (a) n ! (b) 2 (n!)

(c) 2 (n-1)! (d) none of these
∴ from (1), f(x)= n
𝜋𝑥
𝜋 Ans. (b) sin (𝑛−1)! is a periodic function with
When exactly one of x, 2x, 3x, …, nx is 2 . 𝜋
period 2𝜋+ (𝑛−1)! = 2(𝑛 − 1)!
Here not more than one of x, 2x, 3x, …, nx
𝜋
can be 2 . 𝜋𝑥 𝜋
𝑃𝑒𝑟𝑖𝑜𝑑 𝑜𝑓 cos = 2𝜋 + = 2𝑛!
𝑛! 𝑛!
In this case one of sin x, sin2x, …, sinmnx is
1 and other lie between 0 and 1 𝐿. 𝐶. 𝑀. 𝑜𝑓 2(𝑛 − 1)! 𝑎𝑛𝑑 2(𝑛!)𝑖𝑠 2(𝑛!)
∴ From (1), f(x)= n+1 ∴ 𝑃𝑒𝑟𝑖𝑜𝑑 𝑜𝑓 𝑓(𝑥)𝑖𝑠 2(𝑛!)
Hence range of f= {n, n+ 1} 9. Period of the function cos {(x+3)-[x+3]},

where [x] denotes the integral part of x is
𝒙 𝒙
7. If f(x) = 𝐋𝐭 + (𝒙+𝟏)(𝟐𝒙+𝟏) +
𝒏→∞ 𝒙+𝟏
𝒙 (a) 1 (b) 2 (c)
(𝟐𝒙+𝟏)(𝟑𝒙+𝟏)
+ ⋯ + to n terms, then range 𝜋 (d) 2𝜋
of f(x) is
Ans. (a)
(a) {0, 1} (b) {-1, 0} (c)
x- [x] is a periodic function with period 1.
{-1, 1} (d) none of these
∴ (x+ 3)- [x+ 3] is a periodic function with
Ans. (a)
period 1.
78
∴ cos {(x+ 3)}- [x+ 3]] is a periodic function 12. If f is an increasing function and g is a
with period 1. decreasing function such that g(f(x))
exists, then
𝟑
(a) g(f(x)) is an increasing function
10. If f(x) = 𝟐𝒔𝒊𝒏 𝝅𝒙+𝒙−[𝒙] , where [x] (b) g(f(x)) is an decreasing
denotes the integral part of x is a periodic
function with period (c) nothing can be said
(d) g(f(x)) is a constant function
(a) 1 (b) 2 (c)
𝜋 (d) none of these Ans. (b)
Ans. (b) f’ (x)> 0 (∵ f(x) is an increasing function)
Period of x- [x] is 1 and period of 𝑠𝑖𝑛3 𝜋𝑥 is g’(x)< 0

2.
(∵g(x) is a decreasing function)
L.C.M. of 1 and 2 is 2
(g(f(x)))’= g’ (f(x)).f’(x) < 0
∴ f(x) is a periodic function with period 2.
∴g(f(x)) is a decreasing function.
11. If f(x)= cos x+ cos ax is a periodic

13. f: R⟶ R, f(x)=x|x| is
function, then a is necessarily
(a) one-one and onto
(a) an integer (b) a rational number
(b) one-one but not onto
(c) an irrational number (d) an event
number (c) not one-one but onto
(d) neither one-one nor onto
Ans. (b) Period of cos x= 2𝜋 and period of
2𝜋
cos ax= |𝑎| Ans. (a)
2𝜋 2𝜋 −𝑥 2 , 𝑥 ≤ 0
Period of f(x) = L.C.M. of 𝑎𝑛𝑑 = 𝑓(𝑥) = {
1 |𝑎| 𝑥2, 𝑥 ≥ 0
𝐿.𝐶.𝑀.𝑜𝑓 2𝜋 𝑎𝑛𝑑 2𝜋
𝐻.𝐶.𝐹.𝑜𝑓 1 𝑎𝑛𝑑 |𝑎| −2𝑥 2 , 𝑥 ≤ 0
∴ 𝑓 ′ (𝑥 ) = {
2𝑥, 𝑥 ≥ 0
Since k= H.C.F. of 1 and |a|
∴ f’(x)=>0 ∴ f(x) is an increasing function
1 |𝑎|
∴ 𝑘= an integer= m (say) and = an integer and consequently it is a one –one function.
𝑘
= n (say)
Also f(−∞)= -∞, f(∞)=∞, Hence range f=
𝑛 𝑛 R
∴ |a|=𝑚 ⟹ 𝑎 = ± 𝑚 = a rational number.
79
𝟏 𝟏 ∴ Period of f(x) is 4
14. Let f(r) = 1+ 𝟐 +𝟑 + ⋯ +
𝟏
, 𝒕𝒉𝒆𝒏 ∑𝒏𝒊=𝟏 𝒇(𝒊)= 16. If f(x) = (𝒂 − 𝒙𝒏 )𝟏/𝒏 , x > 0 and g(x)> x
𝒓
⋁x ∊R, then for all x > 0
(a) (n+1) f(n)-(n- 1) (b) (n+ 1) f(n)- n
(c) n f(n)- (n-1) (d) (n-1) f(n) (a) g(g(x))= f(f(x)) (b) g(g(x))>2
f(f(x)) (c) g(g(x))< f(f(x)) (d)
Ans. (b) g(g(x))> f(f(x))
1
f(1)+ f(2)+ …+f(n)= 1+ (1 + 2) + Ans. (d)
1 1 1 1 1
(1 + 2 + 3) + ⋯ (1 + 2 + 3 + ⋯ + 𝑛) f(x)= (𝑎 − 𝑥 𝑛 )1/𝑛 , 𝑥 > 0
1
(𝑛 − 1) (𝑛 − 2) ∴ f(f(x))= f(y), where y= f(x)= (1 − 𝑦 𝑛 )𝑛 =
=𝑛+ + +⋯
2 3 1
[𝑛 − (𝑛 − 1)] {1 − (𝑎 − 𝑥 𝑛 )} 𝑛 = 𝑥, 𝑥 > 0
+
𝑛 Given, g(x)-> 0 ∀ x 𝜖 R
1 1 1
= 𝑛 (1 + + +⋯+ ) ∴ g(g(x))-g(x)> 0 ∀ x 𝜖 R
2 3 𝑛
1 2 𝑛−1
−( + +⋯+ ) [Putting g(x) in place of x]
2 3 𝑛
Adding we get, g(g(x))-x> 0
1 1
= 𝑛𝑓(𝑛) − [(1 − ) + (1 − ) + ⋯
2 3 ⟹ g(g(x))> x ⟹g(g(x))> f(f(x)), x > 0
1
+ (1 − )]
𝑛 [∵ f(f(x))= x, x > 0]
= 𝑛𝑓(𝑛) − (𝑛 − 1) + 𝑓(𝑛) − 1 17. Given, y= sgn(x), then

= (𝑛 + 1)𝑓(𝑛) − 𝑛
(a) |x|= x sgn(x)
𝐬𝐢𝐧{𝒙} (b) sgn(sgn(x)) = sgn(x)
15. The period of f(x) = 𝒆 +
𝝅
𝐬𝐢𝐧 ( 𝟐 [𝒙]) is ([.]) and {.} are the greatest (c) x= |x|sgn(x)
integer function and fraction function (d) all of (a), (b), (c)
(a) 1 (b) 4 Ans. (d)

(c) 2 (d) not periodic
1, 𝑥 > 0
Ans. (b) 𝑓(𝑥) = 𝑠𝑔𝑛(𝑥) = { 0, 𝑥 = 0
−1, 𝑥 < 0
Period of {x} i.e. x- [x] is 1 and period of
𝜋 𝑥, 𝑥 > 0
sin (2 [𝑥]) 𝑖𝑠 4 𝑥 𝑠𝑔𝑛 (𝑥) = { 0, 𝑥 = 0 = |𝑥|
−𝑥, 𝑥 < 0
L.C.M. of 1 and 4 is 4
80
𝑠𝑔𝑛(1), 𝑥 > 0
𝑠𝑔𝑛 (𝑠𝑔𝑛(𝑥)) = { 𝑠𝑔𝑛(0), 𝑥 = 0
𝑠𝑔𝑛(−1), 𝑥 < 0 20. Let P is an odd prime and n= 1+p!,
1, 𝑥 > 0 then total number of prime in the list n+1,
= { 0, 𝑥 = 0 = 𝑠𝑔𝑛(𝑥) n+2, n+3, ……, n+p-1 is equal to
−1, 𝑥 < 0
(a) P- 3 (b) P- 5
𝑥, 𝑥 > 0 (c) 0 (d) none
|𝑥|𝑠𝑔𝑛(𝑥) = {0, 𝑥 = 0 = 𝑥, ∀ 𝑥 𝜖 𝑅
𝑥, 𝑥 < 0 Ans. (c) ∵ n= 1+p!
18. For positive real numbers ∴ n+ r= (r+1)+p!

𝒂𝟏 , 𝒂𝟐 , … … . 𝒂𝟏𝟎𝟎 , let P= ∑𝟏𝟎𝟎
𝒊=𝟏 𝒂𝒊 𝒂𝒏𝒅 𝒒 =
If 1 ≤ 𝑟 ≤ 𝑝 − 1, 𝑡ℎ𝑒𝑛 2 ≤ 𝑟 + 1 ≤ 𝑝 and
∑𝟏≤𝒊≤𝒋≤𝟏𝟎𝟎 𝒂𝒊 𝒂𝒋 , then
clearly,
𝑷𝟐 𝑷𝟐
(a) q = 𝟐 (b) 𝒒𝟐 ≤ (n+ r) is divisible by r+1. ∴ n+ r can’t be a
𝟐
𝑷𝟐 prime
(c) q < (d) none
𝟐
Hence, there is no prime in the given list.
Ans. (c) 𝑎1 + 𝑎2 + ⋯ … . +𝑎100 = P,
2
𝑃2 = (𝑎1 + 𝑎2 + ⋯ … . +𝑎100 )2 = ∑100
𝑖=1 𝑎𝑖 +
100
2 ∑𝑖<𝑗 𝑎𝑖 𝑎𝑗 21. Let f : (0, +∞) → 𝑹 𝒂𝒏𝒅 𝑭(𝒙) =
𝒙
∫𝟎 𝒇(𝒕)𝒅𝒕 𝒊𝒇 𝑭(𝒙𝟐 ) = 𝒙𝟐 (𝟏 + 𝒙), then f(4)
2
∴ 𝑃2 - 2q ≥ 0 [∵∑100
𝑖=1 𝑎𝑖 ≥ 0] equals
𝑃2 (a) 5/4 (b) 7

∴q≤ .
2
(c) 4 (d) 2
19. Number of integral terms in the
Ans. (c)
expansion of (√𝟔 + √𝟕)𝟑𝟐 =
𝑥2
(a) 15 (b) 17 We have, f(𝑥 2 )= ∫0 𝑓(𝑡) 𝑑𝑡 = 𝑥 2 + 𝑥 3
(c) 19 (d) none
Differentiating both sides, we get;
Ans. (b) (√6 + √7)32 = f(𝑥 2 ).2𝑥 = 2𝑥 + 3𝑥 2
𝑟 32−𝑟
∑32
𝑟=0 32𝑐𝑟 . 6 . 72 2
⟹ f(𝑥 2 )= 1+(3/2)x
𝑟 32−𝑟
For integral terms 2 and both are ⟹ f(4)= 1+3/2(2)= 4
2
𝑟
integers and w is in turn possible if 2 is an
integer.
22. The equation of a curve is y= f(x). The
∴ r = 0, 2, 4,…, 32 means r can take 17
tangents at (𝛼, f(𝛼)), (𝛽,f(𝛽)) and (𝛾, f(𝛾))
different values.
81
𝝅 𝝅 𝝅
make angles 𝟔 , 𝟑 , 𝟒 respectively with the
𝑑𝑥 𝑑𝑦
positive direction of the x- axis. Then the ∴2𝑥 𝑑𝑡 + 2𝑦 𝑑𝑡 = 0
value of
𝑑𝑦 𝑥 𝑑𝑥 𝑥
𝜸 𝜸 = − = − .2
∫𝜷 𝒇′ (𝒙). 𝒇′′ (𝒙)𝒅𝒙 + ∫𝜶 𝒇′′ (𝒙)𝒅𝒙 is equal 𝑑𝑡 𝑦 𝑑𝑡 𝑦
to 𝑥
𝑤ℎ𝑒𝑛 𝜃 = 30°, = cot 30° = √3
𝟏 𝟏 𝑦
(a) − (b)
√𝟑 √𝟑
(c) 0 (d) none of 𝑑𝑦
∴ = −2√3𝑓𝑡/𝑠𝑒𝑐
these 𝑑𝑡
Ans. (a) 1 𝑑𝑥 2 1 𝑑𝑦 2
√
𝑛𝑜𝑤 𝑉 = ( ) +( )
1 2 𝑑𝑡 2 𝑑𝑡
Given, 𝑓 ′ (𝛼) = , 𝑓 ′ (𝛽) = √3, 𝑓 ′ (𝛾) = 1
√3 1
= √22 + 12 = 2 𝑓𝑡/𝑠𝑒𝑐
𝛾 𝛾 2
Now ∫0 𝑓 ′ (𝑥)𝑓 ′′ (𝑥) 𝑑𝑥 + ∫𝛼 𝑓 ′′ (𝑥) 𝑑𝑥 =
1 2 1 2
[2 (𝑓 ′ (𝑥)) ] 𝛽𝛾 + [𝑓 ′ (𝑥)] 𝛼𝛾 = 2 (𝑓 ′ (𝑦)) −
1 1
{𝑓 ′ (𝛽)}2 + 𝑓 ′ (𝛾) − 𝑓 ′ (𝛼) = (1 − 3) + 24. Two persons are moving on the curve
2 2
1 1 𝒙𝟑 + 𝒚𝟑 = 𝒂𝟑 . When the position of first
1− = −
√3 √3 and second persons are (𝛼, 𝛽) and (𝛾, 𝛿)
the second persons is in the direction of
the instantaneous motion, then
23. A rod of length 10ft sides with ends on 𝜸 𝜹 𝜶 𝜷
the co-ordinates axes. If the end on x-axis (a) 𝜶 + 𝜷 + 𝟏 = 𝟎 (b) 𝜸 + 𝜹 − 𝟏 =
moves with constant velocity of 2ft/ 𝟎 (c) 𝛼𝛾 +𝛽𝛿 = 1 (d) none
minute, then the magnitude of the velocity of these
of the middle point at the instant the rod
makes an angle of 30° with x-axis is Ans. (a)
(a) 2ft / sec (b) 3 ft / sec Given curve is 𝑥 3 + 𝑦 3 = 𝑎3 ……….(1)

(c) √𝟑 ft / sec (d) none of these Let P≡ (𝛼, 𝛽), 𝑄 ≡ (𝛾, 𝛿)
Ans. (a) Since P and Q lie on(1)
Let AB be the position of rod at any time t ∴𝛼 3 + 𝛽 3 = 𝑎2 𝑎𝑛𝑑 𝛾 3 + 𝛿 3 = 𝑎2
and p be its middle point.
𝛼 3 − 𝛾 3 = 𝛿 3 − 𝛽 3 ……………(2)
𝑥 𝑦
Let OA= x, OB= y, then P ≡ (2 , 2)
𝑑𝑦 𝑥2
From(1), 𝑑𝑥 = − 𝑦 2
𝑥 2 + 𝑦 2 = 102
82
Equation of tangent at P(𝛼, 𝛽) 𝑖𝑠 𝑦 − 𝛽 = Now, area (𝛥AOB)= 2

𝛼2
(𝑥 − 𝛼)…………(3) 1 1+𝑏
𝛽2 ∴ 2= 2 .2+𝑏 {−(1 + 𝑏)}
According to question, (3) passes through
or, 4(2+b)+ (1 + 𝑏)2 = 0
Q ∴ 𝛼 2 (𝛼 − 𝛾) = 𝛽 2 (𝛿 − 𝛽) ……(4)
or, 𝑏 2 + 6𝑏 + 9 = 0
𝛼 2 + 𝛾 2 + 𝛼𝛾 𝛽 2 + 𝛿 2 + 𝛽𝛽
= Or (𝑏 + 3)2 = 0
𝛼2 𝛽2
𝛾2 𝛾 ∴ b= -3 > 1
⟹1+ 2+
𝛼 𝛼
𝛿2 𝛿
=1+ 2+
𝛽 𝛽 26. If 2a+ 3b +6c = 0, then equation 𝒂𝒙𝟐 +
𝒃𝒙 + 𝒄 = 𝟎 has at least one root in
𝛾 2 𝛿 2 𝛾 𝛿 𝛾 𝛿
⟹ ( ) −( ) =( − )⟹ − +1
𝛼 𝛽 𝛼 𝛽 𝛼 𝛽 (a) (-1, 1) (b) (1, 2)
𝛾 𝛿 (c) (-1, 0) (d) (2, 3)
= 0[∵ ≠ ]
𝛼 𝛽
Ans. (a)
25. The triangle formed by the tangents to
the curve f(x) = 𝒙𝟐 + 𝒃𝒙 − 𝒃 at the point Let f’(x) = a𝑥 2 + 𝑏𝑥 + 𝑐, then
(1, 1) and the co-ordinate on the first 𝑎𝑥 3 𝑏𝑥 2 2𝑎𝑥 3 +3𝑏𝑥 2 +6𝑐𝑥
quadrant. If its area is 2 then the value of f(x) = + + 𝑐𝑥 =
3 2 6
b is
2𝑎 + 3𝑏 + 6𝑐
𝑓(1) = = 0, 𝑓(0) = 0
(a) -1 (b) 3 6
(c) -3 (d) 1 ∴ f(0)= f(1) ∴ there exists 𝛼, 0< 𝛼 < 1 such
𝑑𝑦 that f’ (𝛼)= 0
Ans. (c) 𝑑𝑥 = 2𝑥 + 𝑏
i.e., equation a𝑥 2 + 𝑏𝑥 + 𝑐 = 0 has at least
∴ The equation of the tangent at (1, 1) is one root in (0, 1).
y-1= (2+b)(x-1)
or (2+b)x- y= 1+ b
27. If ur denotes the number of one–one
1+𝑏 functions from
∴ OA= 2+𝑏 𝑎𝑛𝑑 𝑂𝐵 = −(1 + 𝑏)
{𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒓 } 𝒕𝒐 {𝒚𝟏 , 𝒚𝟐 , … , 𝒚𝒓 } such that
Since 𝛥 AOB lies in the first quadrant, f(𝒙𝒊 ) ≠ 𝒚𝒊 , for i= 1, 2, 3, …, r then 𝒖𝟒 =
1+𝑏 (a) 9 (b) 44

∴ 2+𝑏 > 0𝑎𝑛𝑑 1 + 𝑏 < 0
∴1+b < 0, 2+b < 0⟹ b < -2………..(1) Ans. (a)
83
𝑢𝑟 = number of ways of putting Given lines are r⃗ = a⃗ + 𝜆b⃗ …………..(1)

𝑥1 , 𝑥2 , … , 𝑥𝑟 in r corresponding place so that
r⃗ = b⃗ + 𝜇a⃗ ……………..(2)
no 𝑥1 is put in the corresponding place
lines (1) and (2) intersect at (a⃗ + b⃗ )
1 1 (−1)𝑟
= |r̲(|2̲̲ − |3̲ + ⋯ + ) Then the plane passes through (a⃗ + b⃗ )
̲ ̲
̲ |𝑟̲ ̲
̲
̲ ̲
̲ ̲
̲
̲
̲ Also, line (1) is parallel to b⃗ and line (2) is
parallel to a⃗ ⟹ (a⃗ ×b⃗ ) is normal to plane
containing these lines.
1 1 1
∴𝑢𝑟 = |4̲ − |3̲ + |4̲̲ = 12 − 4 + 1 ∴ Eqn. of reqd. plane is
|2
̲̲̲ ̲
̲ ̲
̲
̲ ̲ ̲
̲
̲ ̲
̲
̲
̲ ̲
̲ ̲
̲
̲
̲
̲
̲ [r⃗ - (a⃗ +b⃗ )].(a⃗ ×b⃗ ) = 0
( ̲
̲ )
r⃗(a⃗ ×b⃗ ) - (a⃗ +b⃗ ). (a⃗ ×b⃗) = 0
⟹ [r⃗ a⃗ b⃗] = 0
28. Number of positive unequal integral
solutions of equation x+ y+ z = 6 is
(a) 4! (b) 3! 30. Let a⃗= 2î + ĵ - 2k̂ and b⃗= î + ĵ . If c⃗ is

(c) 6! (d) 2×4!
a vector such that a⃗.c⃗ = |c⃗|, |c⃗-a⃗| = 2√𝟐
Ans. (b) and angle between | (a⃗× 𝒃⃗) × 𝒄⃗| =
Given x+ y+ z = 6 …….(1) (a) 2/3 (b) 1/3

(c) 3/2 (d) 1
x, y, z ∊ N and are unequal.
Ans. (c)
⟹ x, y, z ∊ {1, 2, 3} and are unequal
Given a⃗ = 2 î+ ĵ- 2 k̂
∴ Required number of solutions= 3! = 6
b⃗= î+ ĵ
a⃗ .c⃗=|c⃗|……………(1)
29. The plain containing the two straight
lines r⃗= a⃗+ 𝜆b⃗ and r⃗= b⃗+ 𝜇a⃗ is |c⃗-a⃗|= 2√2 …………….(2)
𝜋
(a) [r⃗ a⃗ b⃗] = 0 Angle between (a⃗ ×b⃗ ) and c⃗= 6
(b) [r⃗ a⃗ a⃗ × 𝒃⃗] = 0
Now,
(c) [r⃗ b⃗ a⃗ × 𝒃⃗] = 0
𝜋
(d) none |(a⃗ ×b⃗ )× 𝑐⃗|= |a⃗ ×b⃗ ||c⃗|sin 6 =
3
Ans. (a) |𝑐⃗|……(3)
2
84
From (3), |𝑐⃗ − 𝑎⃗|2 = 8 Q2. Find the number of positive integers
less than or equal to 6300 which are not
⟹(𝑐⃗ − 𝑎⃗).( 𝑐⃗ − 𝑎⃗)= 8 divisible by 3, 5 and 7.
⟹|𝑐⃗|2 + |𝑎⃗|2 − 2𝑎⃗. 𝑐⃗ = 8 Solution:- S= {1, 2, 3, …, 6300}
⟹ |𝑐⃗|2 + 9 − 2|𝑐⃗| = 8 (from (1)) Let A: Set of integers divisible by 3
∴ |𝑐⃗| = 1 B: Set of integers divisible by 5
3
From (3), |(a⃗ ×b⃗ )× 𝑐⃗ | = . C: Set of integers divisible by 7
2
We are to find:- n(s) – n(A∪ B∪ C) = n(S) –

[n(A)+n(B) +n(C) – n(A ∩ B)- n(B ∩ C)-
ISI B.STAT & B.MATH n(A ∩ C)+ n(A∩ B∩ C)]
SUBJECTIVE QUESTIONS & 6300 6300 6300
SOLUTIONS = 6300 − {[ ]+[ ]+ [ ]−
3 5 7
6300 6300 6300 6300
[ 3×5 ] − [ 5×7 ] − [ 3×7 ] + [3×5×7]}
SET – 1
𝑖. 𝑒. , 𝑛(𝐴 ∪ 𝐵 ∪ 𝐶)𝑐 = 2880.
Q1. How many natural numbers less than

𝟏𝟎𝟖 are there, whose sum of digits equals 7? Q3. If c is a real number with 0 < c < 1, then
Solution:- show that the values taken by the function
𝒙𝟐 +𝟐𝒙+𝒄
We need to count the no. of solutions of 𝑥1 + y= , as x varies over real numbers,
𝒙𝟐 +𝟒𝒙+𝟑𝒄
𝑥2 + ⋯ + 𝑥8 = 7 range over all real numbers.
Which satisfies 0 ≤ 𝑥𝑖 ≤ 7, i= 1, 2, 3, …, 8 Solution:-
……………….(1)
𝑥 2 + 2𝑥 + 𝑐
The number of solution of (1) is= coefficient of 𝑦= ;
𝑥 2 + 4𝑥 + 3𝑐
𝑥 7 in (1 + 𝑥 + 𝑥 2 + ⋯ + 𝑥 7 )8
⟾ 𝑥 2 𝑦 + 4𝑥𝑦 + 3𝑐𝑦 = 𝑥 2 + 2𝑥 + 𝑐
= 𝑐𝑜𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑡 𝑜𝑓 𝑥 7 𝑖𝑛 (1 − 𝑥 8 )8 (1 − 𝑥)8
⟾ (𝑦 − 1)𝑥 2 + 2𝑥(2𝑦 − 1) + 𝑐(3𝑦 − 1)
7 8 )(1
= coefficient of 𝑥 in (1 − 8𝑥 + 8𝑐1 𝑥 + = 0 [∵ 𝑥 𝑖𝑠 𝑟𝑒𝑎𝑙]
4𝑐2 𝑥 2 + 10𝑐3 𝑘 + ⋯ )
∴ {2(2𝑦 − 1)}2 − 4(𝑦 − 1). 𝑐(3𝑦 − 1) ≥ 0
= 14𝑐7
(2𝑦 − 1)2
= 3432. (𝐴𝑛𝑠) ⟾𝑐 ≤ ∵ 0 < 𝑐 < 1,
(𝑦 − 1)(3𝑦 − 1)
1
𝑆𝑜, < 𝑦 < 1.
3
85
𝑛
Q4. Let X = {0, 1, 2, 3, …, 99}. For a, b in X, 1 1 1
𝑑𝑥
we define a * b to be the remainder obtained = lt ∑ 𝑟 = ∫
𝑛 →∞ 𝑛 0 1+𝑥
by dividing the product ab by 100. For 𝑟=1 1 + 𝑛
example, 9*18 = 62 and 7*5 = 35. Let x be an 1

= [log 𝑒 (1 + 𝑥)] = log 𝑒 2.
element in X. An element y in X is called the 0
inverse and write down their inverses. Q6. Tangents are drawn to a given circle
from a point on a given straight line, which
Solution:- x*y = 1, ⟹ xy = 100k +1 for x = {0,
does not meet the given circle. Prove that the
1, 2, …, 99}
locus of the mid-point of the chord joining the
(1) For x = 1, y = 1, x * y = 100k + where x two points of contact of the tangents with
=c circle is a circle.
∴ Inverse of 1 is 1. Solution:- Slope of OM = k/h [taking centre

(0, 0)]
(2) There is no integral multiple of 2, 4, 5, 6
having 1 at unit place, ⟹ 2, 4, 5, 6 have ∴Slope of AB = - h/k . [∵ AB ⏊ OM]
no inverse.
∴ Equation of AB, whose slope is –h/k and
(3) 3 and 7 can have inverses
which passes through the point (h, k) is y –k =
(i) For x= 3 , 3 y = 1 i.e. 3y = 100k +1 ℎ
(𝑥 − ℎ)
𝑘
The least k satisfying is 2, i.e. 3y = 201, y = 67
and the next k satisfying is 5, i.e. 3y = 167 but or, ℎ𝑥 + 𝑘𝑦 = ℎ2 + 𝑘 2 ………… (1)
167 ∉ X.
And equation of AP, the tangent is 𝑥𝑥1 + 𝑦𝑦1 =
∴ 3 has only inverse = 67. 𝑎2 ………… (2)
(ii) For x = 7, y = 1, i.e. 7y = 100k +1
The least k satisfying is Ʒ, i.e. 7y = 301, y 43
The next k satisfying is ID, i.e. 7y = 1001, y =

143 but 143 ∉ X. ∴ From (1) and (2) , we have,
∴ 7 has only inverse = 43.
𝑥1 𝑦1 𝑎2
= = 2
ℎ 𝑘 ℎ + 𝑘2
ℎ𝑎 2 𝑘𝑎 2
Q5. Evaluate 𝐥𝐢𝐦 { +
𝟏 𝟏
+ …+ }.
𝟏 ∴ 𝑥1 = ℎ2 +𝑘2 , 𝑦1 = ℎ 2 +𝑘 2
.
𝒏→∞𝒏+𝟏 𝒏+𝟐 𝒏+𝒏
Solution:- ∴ Put these values of 𝑥1 𝑎𝑛𝑑 𝑦1 𝑖𝑛 𝑙𝑥1 + 𝑚𝑦1 +

𝑛=0
1 1 1 1
Lt [ 1 + 2 + ⋯+ ]
𝑛 ℎ𝑎 2 𝑘𝑎 2
𝑛 →∞ 𝑛 1+𝑛 1+
𝑛
1+
𝑛
We get, 𝑙. ℎ2 +𝑘2 + 𝑚. ℎ2 +𝑘 2 + 𝑛 = 0
⟾ 𝑙ℎ𝑎2 + 𝑚𝑘𝑎2 + 𝑛(ℎ2 + 𝑘 2 ) = 0
86
𝑙𝑎 2 𝑚𝑎 2 𝑂𝑄
⟾ ℎ2 + 𝑘 2 + 𝑛
ℎ + 𝑛
𝑘 = 0, i.e. the ∴ 𝑅1 = , 𝑛𝑜𝑤, 𝑂𝑃 = 𝑅2 (√2 + 1), 𝑅2
required focus of M. √2 + 1
𝑂𝑃 √2 − 1
2 2 = = 𝑅1
So, the equation of the circle is 𝑥 + 𝑦 + √2 √2 + 1
𝑙𝑎 2 𝑚𝑎 2
𝑛
𝑥 + 𝑛
𝑦 = 0. 2
√2−1 √2−1
∴ 𝑅3 = 𝑅2 = 𝑅1 ( )
√2+1 √2+1
Q7. Draw the graph (on plain paper) of f(x) =
min {|x| - 1, |x -1|- 1, |x- 2| - 1}. ∴ 𝐴𝑟𝑒𝑎 = 𝜋(𝑅1 2 + 𝑅2 2 + ⋯ +∝)
Solution:- y = │x│ -1 √2−1

2
√2−1
4
= 𝜋 {𝑅1 2 + 𝑅1 2 ( ) + 𝑅1 2 ( ) +
√2+1 √2+1
𝑥 − 1, 𝑤ℎ𝑒𝑛 𝑥 ≥ 0
={
−𝑥 − 1, 𝑤ℎ𝑒𝑛 𝑥 < 0 ⋯ +∝}
Z = │x -1│ -1
2 4
√2−1 √2−1
𝑥 − 1 − 1, 𝑤ℎ𝑒𝑛 𝑥 ≥ 1 = 𝜋𝑅1 2 {1 + ( ) +( ) + ⋯ +∝}
={ √2+1 √2+1
−𝑥 + 1 − 1, 𝑤ℎ𝑒𝑛 𝑥 < 1
W = │x- 2│-1 1 3+2√2

= 𝜋𝑅1 2 { 2 } = 𝜋𝑅1 2 ( ) =
√2−1 4√2
𝑥 − 2 − 1, 𝑤ℎ𝑒𝑛 𝑥 ≥ 2 1−( )
√2+1
={
−𝑥 + 2 − 1, 𝑤ℎ𝑒𝑛 𝑥 < 2 3√2+4
𝜋𝑅1 2 ( 8
)
𝜋 18−16 𝜋 1
= 8
𝑅1 2 (3 ) = 4 . 100. 3 𝑠𝑞. 𝑐𝑚 [∵
√2−4 √2−4
𝑅1 = 10𝑐𝑚. ]
25𝜋
=3 𝑠𝑞. 𝑐𝑚 [𝑝𝑟𝑜𝑣𝑒𝑑]
√2−4
Q8. Let {𝑪𝒏 } be an infinite sequence of circles

lying in the positive quadrant of the XY –
plane, with strictly decreasing radii and
satisfying the following conditions. Each 𝑪𝒏
touches both X-axis and the Y-axis. Further,
for all n ≥ 1, the circle 𝑪𝒏+𝟏 touches the circle
𝑪𝒏 externally. If 𝑪𝟏 has radius 10cm, then
show that the sum of the areas of all these
𝟐𝟓𝝅
circles is 𝟑√𝟐−𝟒sq. cm.
Solution:- 𝑂𝑂1 =
𝑅1 √2 ∴ 𝑂𝑃2 = 𝑅1 √2 − 𝑅1
Q9. Consider the system of equations x + y =
∴ 𝑂𝑄 = 𝑅1 √2 + 𝑅1 = 𝑅1 (√2 + 1) 2, ax + y = b. Find conditions on a and b
under which
87
(i) the system has exactly one solution; From (1) And (2), we get 𝑘1 = 4, 𝑘2 = 0.
1 𝑛 1
(ii) the system has no solution; ∴𝑥𝑛 = 4 (2) = 2𝑛−2 .
(iii) The system has more than one solution.
Solution:- ISI B.STAT & B.MATH

1 1 2 1 SUBJECTIVE QUESTIONS &
𝛥= | | = 1 − 𝑎; 𝛥1 = | | = 2𝑎 −
𝑎 1 𝑏 𝑎 SOLUTIONS
1 2
𝑏 ; 𝛥2 = | | = 𝑏 − 2𝑎.
𝑎 𝑏
SET – 2
(i) For exactly one solution, 𝛥≠ 0 i.e. 1
–a ≠ 0 ⟾ a ≠ 1.
(ii) For no solution, 𝛥 = 0, i.e. a = 1,
𝛥1 ≠ 0, 𝛥2 ≠ 0. i.e. 2a ≠ b. Q1. A vessel contains x gallons of wine
(iii) For more than one solution, 𝛥= and another contains y gallons of water.
𝛥1 = 𝛥2 = 0, a = 1, b = 2. From each vessel z gallons are taken out
and transferred to the other. From the
resulting mixture in each vessel, z gallons
Q10. Let {𝒙𝒏 } b e a sequence such that 𝒙𝟏 = are again take out and transferred to the
𝟐, 𝒙𝟐 = 𝟏 𝒂𝒏𝒅 𝟐𝒙𝒏 − 𝟑𝒙𝒏−𝟏 + 𝒙𝒏−𝟐 = 𝟎 other. If after the second transfer, the
quantity of wine in each vessel remains
For n > 2. Find an expression for 𝒙𝒏 . the same as it was after the first transfer,
then show that z (x + y) = x y.
Solution:- 𝑥1 = 2, 𝑥2 = 1, 2𝑥𝑛 − 3𝑥𝑛−1 +
𝑥𝑛−2 = 0. 𝑥−𝑧 𝑧
Hints:- = 𝑦 ⇰ 𝑥𝑦 − 𝑧𝑦 = 𝑧𝑥 ⇰𝑥𝑦 =
𝑥
Let, 𝑥𝑛 = 𝑘𝑎𝑛 , ∴ 2𝑘𝑎𝑛 − 3𝑘𝑎𝑛−1 + 𝑘𝑎𝑛−2 = 0 𝑧(𝑥 + 𝑦) [Proved]
or, 2𝑎2 − 3𝑎 + 1 = 0
or, (2a- 1)(a- 1) = 0 Q2. Suppose k, n are integers ≥ 1. Show that

1 (k. n)! is divisible by (𝒌!)𝒏 .
or, 𝑎1 = 2 , 𝑎2 = 1.
Solution: We write the numbers from 1 to kn in
1 𝑛
∴𝑥1 = 𝑘1 𝑎1 𝑛 + 𝑘2 𝑎2 𝑛 = 𝑘1 ( ) + 𝑘2 (1)𝑛 . k rows of n numbers each as follows:
2
1 𝑘1 1, 2, 3, …., n
Again, 𝑥1 = 2 = 𝑘1 (2) ≠ 𝑘2 (1)1 = 2
+
𝑘2 …………… (1) n+1, n+2 , n+3, ….., 2n
1 2 𝑘1 2n + 1, 2n +2, 2n +3,…….., 3n
And 𝑥2 = 1 = 𝑘2 (2) + 𝑘2 (1)1 = 4
+ 𝑘2
…………. (2) ⁞
kn – n+1, kn – n+2, kn –n + 3, ……, kn
88
Since each row has n consecutive positive So, sum of roots = coefficient of x = 0
integers, the product of the numbers in each row
is divisible by n!. The product of all the numbers ∴ 𝛼 = 0.
(kn)! Is divisible by (𝑛!)𝑘 . So, roots are -3𝛽, -𝛽, 𝛽, 3𝛽.
Q3. All the permutations of the letters a, b, c,
∴ −3𝛽 2 + 3𝛽 2 − 9𝛽 2 − 𝛽 2 − 3𝛽 2 + 3𝛽 2 =
d, e are written down and arranged in
−(3𝑚 + 1)
alphabetical order as in a dictionary. Thus
the arrangement abcde is in the first position ⟾ −10𝛽2 = −(3𝑚 + 1)
and abced is in the second position. What is
the position of the arrangement debac? 3𝑚 + 1
∴ 𝛽2 = .
10
Solution:-
Also, 9𝛽 4 = 𝑚2
Words starting with ‘a’ ⟶ 4!
3𝑚 + 1 2
″ ″ ″ ‘b’ ⟶ 4! ∴ 9( ) = 𝑚2
10
″ ″ ″ ‘c’ ⟶ 4! 3
⟾ 9𝑚 + 3 = ±10𝑚 ⟾ 𝑚 = 3, − .
19
″ ″ ″ ‘d’ ⟶ 3! + 3! + 3! + 3!
(ii)𝑥 2 − 𝑎𝑥 − 𝑏 = 0
(i.e. da ⟶ 3!, db ⟶ 3!, dc ⟶ 3!, de ⟶ 3!)
Let roots be 𝛼, 𝛽, ∣𝛼∣ <1, ∣𝛽∣ <1,
Total no. of words before debac including it is =
3 × 4! + 3 × 3! + 3 = 93. ∴∣𝛼 +𝛽∣ ≤ ∣𝛼∣ + ∣𝛽∣ <2, as ∣𝛼∣ <2, or ∣𝛼∣ ∣𝛽∣ <1
Q4. (i) Determine m so that the equation 𝒙𝟒 − Or, ∣𝛼𝛽∣ <1

(𝟑𝒎 + 𝟐)𝒙𝟐 + 𝒎𝟐 = 𝟎 has four real roots in
∴ ∣b∣ <1
arithmetic progression.
Again, ab <2, ∣b∣ -∣a∣ <1, and ∣b∣ -∣a∣ ≤∣ b- a∣
(ii)Let a and b be two real numbers. If the
roots of the equation 𝒙𝟐 − 𝒂𝒙 − 𝒃 = 𝟎 have ∴ b –a <1 and b+ a< 1.
absolute value less than one, show that each
of the following conditions holds:
(i) |b| < 1, (ii) a+ b <1 and (iii) b - a <1. Q5. Let a and b be real numbers such that the
equations 2x + 3y = 4 and ax – by = 7 have
Solution:- exactly one solution. Then, show that the
equations 12x – 8y = 9 and bx + ay = 0 also
(i) 𝑥 4 − (3𝑚 + 1)𝑥 2 + 𝑚2 = 0
have exactly one solution.
Let four roots
A B C D E F Solution:-
be 𝛼 - 3𝛽, 𝛼 –
A × 0 ② 0 ② ②
B 2 × 2 2 0 2 𝛽, 𝛼+ 𝛽, 𝛼+ 2𝑥 + 3𝑦 = 4
} ________________ (i)
C 0 0 × 2⃞ 2⃞ 0 3𝛽. 𝑎𝑥 − 𝑏𝑦 = 7
D 2 0 0 × 2 2
E 0 2 0 0 × 2
F 0 0 2 0 0 ×
89
(v)Teams A, B and D had moved to the final

Final round of the tournament.
2 3 score
∴ 𝛥1 = | | ≠ 0, since
𝑎 −𝑏 6 Solution:-
it has only one solution. 8
4 Steps:-
⟾ - (3a+2b) ≠ 0⟾ (3a+2b)
6
≠0. 4 1. First use (i) then (iii)
2 2. Since after 4 games, B had 8 pts. And B
12𝑥 − 8𝑦 = 7 lost to E later, so B had won against A,
} __________
𝑏𝑥 + 𝑎𝑦 = 0
C, D, F.
(ii)
3. Since A had 6 pts. After 4 games and A
12 −8 had lost to B had D, so A won against C,
∴ 𝛥2 = | | = 4(3𝑎 + 2𝑏), since
𝑏 𝑎 E and F.
(3a+2b) ≠0, 4. C had 4 pts. After 4 games. So, C won
against D and E.
So, 𝛥2 ≠0; So, the equations in (ii) has only one
5. Since A, B and D moved to final round
solution.
and total 4 pts, so D must have won the
Q6. In a competition, six teams A, B, C, D, E, games against E and F.
F play each other in the preliminary round –
called round robin tournament. Each game
ends either in a win or a loss. The winner is 𝝅 𝒄𝒐𝒔𝒙
Q7. If A = ∫𝟎
(𝒙+𝟐)𝟐
𝒅𝒙,
awared two points while the loser is awared
𝝅/𝟐 𝒔𝒊𝒏𝒙 𝒄𝒐𝒔𝒙
zero points. After the round robin 𝒕𝒉𝒆𝒏 𝒔𝒉𝒐𝒘 𝒕𝒉𝒂𝒕 ∫𝟎 𝒅𝒙 =
(𝒙+𝟏)
tournament, the three teams with the highest 𝟏 𝟏 𝟏
( + 𝝅+𝟐 − 𝑨).
𝟐 𝟐
scores move to the final round. Based on the
following information, find the score of each Solution:-
team at the end of the round robin
tournament. 𝜋
2 𝑠𝑖𝑛𝑥 𝑐𝑜𝑠𝑥
∫ 𝑑𝑥
(i) In the game between E and F, team E won. 0 (𝑥 + 1)
𝜋
(ii) After each team had played four games, 1 2 𝑠𝑖𝑛2𝑥
team A had 6 points, team B had 8 points and = ∫ 𝑑𝑥
2 0 (𝑥 + 1)
team C had 4 points. The remaining matches
yet to be played were 1 𝜋 𝑠𝑖𝑛𝑧 𝑑𝑧
= ∫ 𝑧 .
2 0 +1 2
(i)Between A and D; 2
𝜋
(ii)Between B and E; and 1 𝜋 𝑠𝑖𝑛𝑧 𝑑𝑧 1 2 𝑐𝑜𝑠𝑧
= ∫ = − .∫ 𝑑𝑧
2 0 𝑧+2 2 0 (𝑧 + 2)2
(iii)Between C and F.
1 1 1 1
(iv)The teams D, E and F had won their = ( + )− 𝐴
2 𝜋+2 2 2
games against A, B and C respectively.
1 1 1
= ( + − 𝐴)
2 2 𝜋+2
90
∴ ⦟BOD +⦟COD +⦟COE +⦟AOE +⦟AOF

+⦟BOF = 2(𝜃+ 𝜙+ 𝜓) = 2𝛱
Q8. If a, b and c are the lengths of the sides of
a triangle ABC and if 𝒑𝟏 , 𝒑𝟐 𝒂𝒏𝒅 𝒑𝟑 are the ∴𝜃+ 𝜙= 𝛱-𝜓
lengths of the perpendiculars drawn from the
circumcentre onto the sides BC, CA and AB ⟾ tan (𝜃+ 𝜙)= tan (𝛱- 𝜓)= - tan 𝜓.
respectively, then show that Hence we can show, tan 𝜃+ tan 𝜙 +tan 𝜓 =
𝒂 𝒃 𝒄 𝒂𝒃𝒄 tan𝜃tan𝜓tan𝜙
+ + = .
𝒑𝟏 𝒑𝟐 𝒑𝟑 𝟒𝒑𝟏 𝒑𝟐 𝒑𝟑 𝑎 𝑏 𝑐 𝑎𝑏𝑐 𝑎
i.e., + + = 𝑜𝑟, +
2𝑝1 2𝑝2 2𝑝3 8𝑝1 𝑝2 𝑝3 𝑝1
𝑏 𝑐 𝑎𝑏𝑐
𝑝2
+ 𝑝 = 4𝑝 𝑝 𝑝 .
3 1 2 3
Solution:- As 𝑃1 , 𝑃2 , 𝑃3 are the lengths of the
perpendiculars drawn from the circum centre O Q9. (a) Study the derivatives of the function
𝒙+𝟏
to the sides of length a, b, c respectively, then f(x) = (𝒙−𝟏)(𝒙−𝟕) to make conclusions about the
from the diagram. D, E, F are the mid points of behavior of the function as x ranges over all
BC, CA, AB respectively. possible values for which the above formula
Hence , in 𝛥BOD and 𝛥COD, for f(x) is meaningful.
⦟BDO =⦟CDO, BD = DC & OD is common. (b) Use the information obtained in (a) to
draw a rough sketch of the graph of f(x) on
∴ 𝛥BOD ≡ 𝛥COD. plain paper.
𝑥+1 1 1 4 1
Solution:- f(x) = (𝑥−1)(𝑥−7) = − . + . .
3 𝑥+1 3 𝑥−7
1 1 4 1
(a) f’(x) = 3 . (𝑥+1)2 − 3 . (𝑥−7)2
For, 0 ≤ 𝑥 < −1, 𝑓 ′ (𝑥)𝑖𝑠 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒;
For, -∞ < x < 0, 𝑓 ′ (𝑥) is negative;
For, 0 < x <7, 𝑓 ′ (𝑥) is

negative;
x 0 𝜋
Similarly, 𝛥COE ≡ 2 For, 7< x < ∞, 𝑓 ′ (𝑥) is
z 0 𝜋
𝛥AOE and 𝛥AOF ≡ negative.
𝛥BOF, (b)
⟾ ⦟BOD = ⦟COD= 𝜃, say
⦟COE = ⦟AOE= 𝜙, say
⦟ AOF = ⦟BOF= 𝜓, say.
91
(b) P(x) does not have any odd integer roots.
Solution:-
P(0) = 𝑎0 = odd, P(1) = 1+ 𝑎𝑛−1 + 𝑎𝑛−2 + ⋯ +

𝑎0 = 𝑜𝑑𝑑
(a) Case-I:-
If x = 2m, then
P(x) = 𝑥 𝑛 + 𝑎𝑛−1 𝑥 𝑛−1 + ⋯ + 𝑎0 = odd, as all

the term containing x will be even but 𝑎0 = odd.
Q10. Show that there is exactly one value of x
⟹ x = 2m cannot be a root of the equation P(x)
which satisfies the equation
= 0 [proved]
𝟐𝒄𝒐𝒔𝟐 (𝒙𝟑 + 𝒙) = 𝟐𝒙 + 𝟐−𝒙 . (b) Case-II:-
If x = 2m+ 1
Solution:- -1 ≤ 𝑐𝑜𝑠 2 (𝑥 3 + 𝑥) ≤ 1 implying 𝑝𝑥 = 𝑥 𝑛 + 𝑎𝑛−1 𝑥 𝑛−1 + ⋯ + 𝑎0 = 𝑥 𝑛 +
−2 ≤ 2𝑐𝑜𝑠 2 (𝑥 3 + 𝑥) ≤ 2 𝑎𝑛−1 (𝑒𝑣𝑒𝑛 + 1) + 𝑎𝑛−2 (𝑒𝑣𝑒𝑛 + 1) + ⋯ +
𝑎1 (𝑒𝑣𝑒𝑛 + 1)𝑎0 = 𝑥 𝑛 + 𝑎0 + (𝑎𝑛−1 𝑒𝑣𝑒𝑛 +
By AM ≥ GM inequality we have 2𝑥 + 2−𝑥 ≥ 2
𝑎𝑛−2 𝑒𝑣𝑒𝑛 + ⋯ + 𝑎1 𝑒𝑣𝑒𝑛) + (𝑎1 + 𝑏2 + ⋯ +
So 2𝑐𝑜𝑠 2 (𝑥 3 + 𝑥) = 2𝑥 + 2−𝑥 = 2 satisfies 𝑎𝑛−1 ) = 𝑥 𝑛 + (𝑎𝑛−1 𝑒𝑣𝑒𝑛 + 𝑎𝑛−2 𝑒𝑣𝑒𝑛 + ⋯ +
when x = 0. 𝑎1 𝑒𝑣𝑒𝑛) + (𝑎0 + 𝑎1 + ⋯ + 𝑎𝑛−1 )
So there is only one value of x = 0 which satisfy = odd ⟹ x = (2m +1) cannot be a root of the
the given equation. equation P(x) = 0 [proved.]
Q2. Let 𝒂𝟎 𝒂𝒏𝒅 𝒃𝟎 be any two positive

integers. Define 𝒂𝒏 , 𝒃𝒏 for n ≥ 1 using the
ISI B.STAT & B.MATH relations 𝒂𝒏 = 𝒂𝒏−𝟏 + 𝟐𝒃𝒏−𝟏 , 𝒃𝒏 = 𝒂𝒏−𝟏 +
𝒂
SUBJECTIVE QUESTIONS & 𝒃𝒏−𝟏 𝒂𝒏𝒅 𝒍𝒆𝒕 𝒄𝒏 = 𝒃𝒏, for n= 0, 1, 2, …
𝒏
SOLUTIONS
(a) Write (√𝟐 − 𝒄𝒏−𝟏 ) 𝒊𝒏 𝒕𝒆𝒓𝒎𝒔 𝒐𝒇 (√𝟐 −
SET – 3 𝒄𝒏 ).
𝟏
(b) Show that |√𝟐 − 𝒄𝒏+𝟏 | < |√𝟐 − 𝒄𝒏 |.
𝟏+√𝟐
Q1. Let P(x) = 𝒙𝒏 + 𝒂𝒏−𝟏 𝒙𝒏−𝟏 +

(c) Show that 𝐥𝐢𝐦 𝒄𝒏 = √𝟐 .
𝒂𝒏−𝟐 𝒙𝒏−𝟐 + ⋯ + 𝒂𝟏 𝒙 + 𝒂𝟎 be a polynomial 𝒏→∞
with integer coefficients, such that, P(0) and Solution:-

P(1) are odd integers. Show that:
(a) P(x) does not have any even integer roots.
92
𝑎𝑛 = 𝑎𝑛−1 + 2𝑏𝑛−1 , 𝑏𝑛 = 𝑎𝑛−1 + 𝑏𝑛−1 , 𝑐𝑛 𝑥1 𝑥4

+
𝑎𝑛 𝑥5 𝑥3
= . = 𝑥 𝑥
𝑏𝑛 1 − 𝑥1 . 𝑥4
5 3
𝑎
(a) √2 − 𝑐𝑛−1 = √2 − 𝑛−1
𝑏 𝑛+1
𝑎𝑛 𝑥1 𝑥3 + 𝑥4 𝑥5
𝑎𝑛 + 2𝑏𝑛 +2 = .
𝑏 𝑥3 𝑥5 − 𝑥1 𝑥4
= √2 − = √2 − 𝑎𝑛
𝑎𝑛 + 𝑏𝑛 𝑛
+1
𝑏𝑛
𝑐𝑛+2
= √2 +
𝑐𝑛−1
√2𝑐𝑛 + √2 − 𝑐𝑛 − 2
=
𝑐𝑛+1
(√2 − 1)𝑐𝑛 − √2(√2 − 1)
=
𝑐𝑛 + 1
(√2 − 1)(𝑐𝑛 − √2)
= .
(𝑐𝑛+1 )
│√2−𝑐𝑛 +1│ 1−√2 1

(b) │√2−𝑐𝑛 │
= │𝑐 │ = <
𝑛 +1 (1+√2)(𝑐𝑛 +1)
1
1+√2
1
⟾ │√2 − 𝑐𝑛 + 1│< 1+ │√2 − 𝑐𝑛 │
√2
Q4. Let [x] denote the largest integer less than

𝑐𝑛 −√2 𝑐𝑛+1 𝟏
(c) lt = lt = 1. or equal to x. For example, [𝟒 ] = 𝟒; [𝟒] = 𝟒.
𝑛 →∞ 𝑐𝑛+1 +√2 𝑛 →∞ 1−√2 𝟐
Draw a rough sketch of the graphs of the
following functions on plain paper:
(i) f(x) = [x] ;

Q3. Let ABC be any triangle, right –angled at (ii) g(x) = x – [x];
A, with D any point on the side AB. The line
𝟏
DE is drawn parallel to BC to meet the side (iii) h(x)= [𝒙].
AC at the point E. F is the foot of the
perpendicular drawn from E to BC. If AD= Solution:- (i)
𝒙𝟏 , Db = 𝒙𝟐 , BF = 𝒙𝟑 , EF = 𝒙𝟒 and AE = 𝒙𝟓 ,
then show that x y
[0, 1) 0
𝒙𝟏 𝒙𝟐 𝒙𝟏 𝒙𝟑 + 𝒙𝟒 𝒙𝟓 [1, 2) 1
+ = .
𝒙𝟓 𝒙𝟓 𝒙𝟑 𝒙𝟓 − 𝒙𝟏 𝒙𝟒 [2, 3) 2
[3, 4) 3
Solution:- ⁞ ⁞
𝑥 𝑥 𝑥1 +𝑥2
LHS = 𝑥1 + 𝑥2 = 𝑥5
= 𝑡𝑎𝑛𝜃 = tan(𝜙 + 𝑐) =
5 5
𝑡𝑎𝑛𝑐+𝑡𝑎𝑛𝜙
1−𝑡𝑎𝑛𝑐 𝑡𝑎𝑛𝜙
93
3 1
24 2
3 1
3
(ii) g(x) = x – [x] = {x}.
X g(x)
0 0
1 1
4 4
1 1 Q5. Show that the area of the bounded region
2 2
3 3 enclosed between the curves
4 4
1 0 𝟐
𝒚𝟑 = 𝒙𝟐 𝒂𝒏𝒅 𝒚 = 𝟐 − 𝒙𝟐 , 𝒊𝒔 𝟐 .
1 1 𝟏𝟓
14 4
1
1 ½ Solution:- 𝑦 3 = 𝑥 2 …………. (i)
2 ⁞
⁞ y = 2−𝑥 2 …………… (ii)
⟾ y = 2 - 𝑦3
⟾(y -1) (𝑦 2 + 𝑦 + 2) = 0
∴y = 1, y = ½ (-1±√3)
∴ x = ±1, since y is real & equal to 1. Point of

intersection of the two curves are (1, 1) and (-1 ,
1).
1
(iii) h(x) = [𝑥]
x h(x)
1 1
1 1
14
1 1
12 1
3 1
14
1 ∴ Area of shaded region = ∫−1(𝑦1 − 𝑦2 )𝑑𝑥 =
2 2
2 1 1 2
∫−1 [2 − 𝑥 2 − 𝑥 3 ] 𝑑𝑥 = 2 15 𝑠𝑞. 𝑢𝑛𝑖𝑡𝑠.
1 2
2
2
94
Q6. We say that a sequence {𝒂𝒏 } has As roots are rational, hence D is a perfect
property P, if there exists a positive square.
integer m such that 𝒂𝒏 ≤1 for every n ≥
i.e. 𝑝2 − 4𝑞 = 𝑘 2 , where k ∊ I.
m. For each of the following sequences,
determine whether it has the property P or, 𝑝2 = 𝑘 2 + 4𝑞.
or not. [Do not use any result on limits.]
Now, when p = even, 𝑘 2 + 4𝑞 = even.
𝟐𝟎𝟎
𝟎. 𝟗 + 𝒊𝒇 𝒏 𝒊𝒔 𝒆𝒗𝒆𝒏 ⤇ 𝑘 2= even, so k = even.
(𝒊) 𝒂𝒏 = { 𝒏
𝟏 −𝑒𝑣𝑒𝑛 ±𝑒𝑣𝑒𝑛
𝒊𝒇 𝒏 𝒊𝒔 𝒐𝒅𝒅 ⤇x= 2
= integer …………………
𝒏
(i)
𝒏𝝅
𝐜𝐨𝐬
𝟐
𝟏+ 𝒊𝒇 𝒏 𝒊𝒔 𝒆𝒗𝒆𝒏 Again when p = odd, 𝑘 2 + 4𝑞 = odd
(𝒊𝒊) 𝒂𝒏 = { 𝒏
𝟏
𝒊𝒇 𝒏 𝒊𝒔 𝒐𝒅𝒅. ⤇ 𝑘 2= odd, so k= odd.
𝒏
Solution:- (i) For every even number n ≥ ⤇x=

−𝑜𝑑𝑑 ±𝑜𝑑𝑑
= integer ……………………..
2
2000, 𝑎𝑛 ≤ 1 (ii)
And for every odd positive integer, 𝑎𝑛 ≤ 1. Hence the proof is complete.
Here, {𝑎𝑛 } is a decreasing sequence and Q8. Consider the set S of all integers between
200 and including 1000 and 99999. Call two
𝑎2000 = 0.9 + 2000 = 1.
integers x and y in S to be in the same
∴ 𝑎𝑛 satisfies property P. equivalence class if the digits appearing in x
and y are the same. For example, if x = 1010,
(ii) Let n = 4k (even) y= 1000 and z = 1201, then x and y are in the
same equivalence class, but y and z are not.
1 4𝑘𝜋
i.e., 𝑎4𝑘 = 1 + 4𝑘 cos ( )= 1+ Find the number of distinct equivalence
2
1 1 classes that can be formed out of S.
cos(2𝑘𝜋) = 1 + 4𝑘 > 1.
4𝑘
Solution:-
[∵ cos (2k𝜋) = 1] So, here 𝑎𝑛 does not
If ‘a’ is a member of some equivalence class
satisfy P.
then it’s distinct digit determine the equivalence
Q7. Suppose that the roots 𝒙𝟐 + 𝒑𝒙 + 𝒒 = 𝟎 class completing. Hence, no. of equivalence
are rational numbers and p, q are integers. classes are the number of ways in which ‘i’
Then show that the roots are integers. integers can be selected from {1, 2, 3, …, 9} for
2 ≤ i ≤ 5 and {1, 2, 3, …, 9} for i = 1.
Solution:-
Now, this can be done in 9 + ∑5𝑖=2(10
𝑖
)=
2
The roots of the equation 𝑥 + 𝑝𝑥 + 𝑞 = 0 are x
∑5𝑖=1(10
𝑖
) − 1.
−𝑝±√𝑝2 −4𝑞
= 2
.
95
𝒏−𝟏
𝒙𝒏 −𝟏 ISI B.STAT & B.MATH
Q9. For x > 0, show that 𝒙−𝟏
≥ 𝒏𝒙 𝟐 ,
where n is a positive integer. SUBJECTIVE QUESTIONS &
SOLUTIONS
Solution:-
Let us take the sequence of numbers as SET – 4

{𝑥 𝑛−1 , 𝑥 𝑛−2 , … , 𝑥 0 }
Applying AM ≥ GM inequality:- Q1. If f(x) is a real-valued function of a real

1 𝑛−1 𝑛−2 variable x, such that 2f(x) + 3 f(-x) = 15 – 4x
𝑛
(𝑥 ,𝑥 , … , 𝑥 0 ) ≥ √𝑥 (𝑛−1)+(𝑛−2)+⋯+0 for all x, find the function f(x).
𝑛
1 Solution:-
1 𝑥𝑛 − 1 𝑛(𝑛−1) 𝑛
𝑜𝑟, . ≥ {𝑥 2 }
𝑛 𝑥−1 2f(x) + 3f(-x) = 15 – 4x
𝑥𝑛 − 1 𝑛−1 Put x = -x , 2f(-x) + 3f(x) = 15 + 4x

𝑜𝑟, ≥ 𝑛𝑥 2 .
𝑥−1
______________________________________
Solving, we get, f(x) = 3 + 4x

𝟑 𝟒 𝟓
Q10. Show that 𝟏 .𝟐 .𝟒 + 𝟐.𝟑.𝟓 + 𝟑.𝟒.𝟔 + ⋯ +
𝒏+𝟐 𝟏 𝟐𝟗 𝟒 𝟏 𝟏
= 𝟔 [ 𝟔 − 𝒏+𝟏 − 𝒏+𝟐 − 𝒏+𝟑].
𝒏(𝒏+𝟏)(𝒏+𝟑) Q2. Show that there is exactly one value of x
𝑛+2 which satisfies the equation
Solution:- 𝑡𝑛 = 𝑛(𝑛+1)(𝑛+3)
𝟐𝒄𝒐𝒔𝟐 (𝒙𝟑 + 𝒙) = 𝟐𝒙 + 𝟐−𝒙 .
1 1 1 1 1 1
= [ − ]+ [ − ] Solution:-
6 𝑛+1 𝑛+2 6 𝑛+2 𝑛+3
2 1 1 We know 𝑐𝑜𝑠 2 (𝑥 3 + 𝑥) ≤ 1.
+ [ − ]
3 𝑛 𝑛+1
2𝑥 + 2−𝑥
1 1 1 ≥ √2𝑥 . 2−𝑥
𝑆𝑜, 𝑆 = ∑𝑛𝑛=1 𝑇𝑛 = 6 ∑𝑛𝑛=1 (𝑛+1 − 𝑛+2) + 2
1 1 1 2 1 1
∑𝑛𝑛=1 ( − 𝑛+3) + 3 ∑𝑛𝑛=1 (𝑛 − 𝑛+1). ⟾ 2𝑥 + 2−𝑥 ≥ 2
6 𝑛+2
1 1 1 1 1 1 2𝑐𝑜𝑠 2 (𝑥 3 + 𝑥) = 2𝑥 + 2−𝑥
= ( − )+ ( − )
6 2 𝑛+1 6 3 𝑛+3 ∴ 𝑐𝑜𝑠 2 (𝑥 3 + 𝑥) = 1
2 1
+ (1 − )
3 𝑛+1 For x = 0, the equation is satisfied.
1 29 4 1
= [ − −
6 6 𝑛+1 𝑛+2
1
− ] (𝑝𝑟𝑜𝑣𝑒𝑑)
𝑛+3 Q3. There are 1000 doors 𝑫𝟏 , 𝑫𝟐 , … , 𝑫𝟏𝟎𝟎𝟎
and 1000 persons 𝑷𝟏 , 𝑷𝟐 , … , 𝑷𝟏𝟎𝟎𝟎 . Initially
96
all the doors were closed. Person 𝑷𝟏 goes and ∴f(0) = 0 and f’(x) = 2x –sin x –x cos x
opens all the doors. Then person 𝑷𝟐 closes
doors 𝑫𝟐 , 𝑫𝟒 , … , 𝑫𝟏𝟎𝟎𝟎 and leaves the odd- = (x –sin x) + x (1 –cos x)
numbered doors open. Next, 𝑷𝟑 changes the 𝛱
In the interval [0, 2 ], 𝑥 − 𝑠𝑖𝑛𝑥 ≥ 0 𝑎𝑛𝑑 1 −
state of every third door, that is,
𝑫𝟑 , 𝑫𝟔 , … , 𝑫𝟗𝟗𝟗 . (For instance, 𝑷𝟑 closes the 𝑐𝑜𝑠𝑥 ≥ 0.
open door 𝑫𝟑 and opens the closed door 𝑫𝟔 ,
∴ f’(x)≥ 0 ∴ f(x) is an increasing function of x
and so on.) Similarly, 𝑷𝒎 changes the state of 𝛱
in[0, 2 ]
the doors 𝑫𝒎 , 𝑫𝟐𝒎 , 𝑫𝟑𝒎 , … , 𝑫𝒏𝒎 , … while
leaving the other doors untouched. Finally,
It’s min value will be f(0) = 0, maximum value
𝑷𝟏𝟎𝟎𝟎 opens 𝑫𝟏𝟎𝟎𝟎 if it were closed and closes 𝛱 𝛱2 𝛱
it if it were open. At the end, how many doors will be 𝑓 ( 2 ) = 4
− 2.
remain open?
Q5. Let A and B be two fixed points 3 cm
Solution:- By the problem, the persons 𝑃𝑚 will apart.
change the state of the door 𝐷𝑛 , where m│ n i.e.
m is one of the factors of n. (a) Let P be any point not collinear with A
and B, such that PA = 2PB. The tangent at p
At first, all the doors were closed and we are to to the circle passing through the points P, A
determine the no. of doors remaining open, i.e. and B meets the extended line AB at the point
we are to determine the no. of doors whose K. Find the lengths of the segments KB and
states are finally changed. KP.
Now, for the door 𝐷𝑛 , n will either have even or (b) Hence or otherwise, prove that the locus
odd no. of factors. of all points P in the plane such that PA =
2PB is a circle.
It is obvious, for even no. of factors, state of
doors remain same, so whenever no. of fact (n) Solution:-
odd, state of Or𝐷𝑛 changes.
(a) AB = 2a = 3 cm, let P(h, k) be the co-
⟹ (n) = 2k +1, k ∊ 𝐼 + ⟹ 𝜎(𝑛) = (2𝑝 + ordinate of P and PA = 2PB
1)(2𝑞 + 1) × … (2𝑟 + 1) … . ; ⟹ 𝑛 =
𝑎2𝑝 𝑏 2𝑞 𝑐 2𝑟 …. For prime a, b, c …..
∴(ℎ + 𝑎)2 + 𝑘 2 = 4{(ℎ − 𝑎)2 + 𝑘 2 }
⟹Square numbered door remains open.
⟾ 3ℎ2 + 3𝑘 2 − 10ℎ𝑎 + 3𝑎2 = 0
∴No. of doors remaining open = (√1000) = 31
Q4. Find the maximum and minimum values

of the function f(x) = 𝒙𝟐 − 𝒙 𝒔𝒊𝒏𝒙, in the Locus of P is 𝑥 2 + 𝑦 2 −
10
𝑎𝑥 + 𝑎2 = 0
𝝅 3
closed interval [𝟎, 𝟐 ].
5 2 4𝑎 2
⟾ (𝑥 − 3 𝑎) + 𝑦 2 = ( 3 ) which is a circle
Solution:-
5 4𝑎
with centre at (3 𝑎, 0) 𝑎𝑛𝑑 𝑟𝑎𝑑𝑖𝑢𝑠 = 3
.
f(x) = 𝑥 2 − 𝑥 𝑠𝑖𝑛𝑥
5𝑎 4𝑎
∴ Co-ordinates of K are ( 3 , 0) & 𝐾𝑃 = 3
.
97
∴ KB = OK - OB=
5𝑎
−𝑎 =
2𝑎 2 3
= × = 1𝑐𝑚. (ii)│x│- │y│ ≥ 1.
3 3 3 2
There are four cases:- (I) x – y ≥ 1 when x > 1, y
>0
(II) x + y ≥ 1 when x
≥ 1, y < 0
(III) –x –y ≥ 1 when
x < 0, y > 0
(IV) –x + y ≥ 1
when x< 0, y <0
Graph of (i):-
Q6. Sketch, on plain paper, the regions

represented on the plane by the following:
(i) |y|= sin x;
(ii) |x| - |y| ≥ 1.

Q7. Show that the larger of the two areas into
Solution:-
which the circle 𝒙𝟐 + 𝒚𝟐 = 𝟔𝟒 is divided by
𝟏𝟔
(i) y = sin x, when y > 0……………… [case -I] the curve 𝒚𝟐 = 𝟏𝟐𝒙 𝒊𝒔 (𝟖𝝅 − √𝟑).
𝟑
= 0, when y = 0 …………………..[case -II] Solution:- 𝑥 2 + 𝑦 2 = 64 ……………… (i)

= -sin x, when y < 0 ……………..[case -III] 𝑦 2 = 12𝑥 ……………….. (ii)
[case -I]
[case -II] ⟾ 64 −𝑥 2 = 12𝑥 ⟾ (x - 4) (x + 16) = 0 ∴ x
𝜋 𝜋 = - 16, 4
X (4n +1)
2
N𝜋+(−1)𝑛 6
But x = -16 is not possible as radius of a circle is
y 1 ½
√64 units.
𝜋 𝜋
X (4n +1)2 N𝜋+(−1)𝑛 6
y -1 -½
Area of the shaded region is
For all n = 0, ±1, ±2, ±3,…..
98
4 64𝜋 (2𝑚)! 1
= 2∫0 (𝑦1 − 𝑦2 )𝑑𝑥 + 2
, 𝑤ℎ𝑒𝑟𝑒 𝑦1 = Let P(m) is true, i.e., 22𝑚.(𝑚!)2 ≤ ,
√3𝑚+1
√64 − 𝑥 2 , 𝑦2 = 2√3𝑥
(2𝑚+2)!
4 P(m+ 1) = =
22𝑚+2 .[(𝑚+1)!]2
= 2 ∫ (√64 − 𝑥2 − 2√3𝑥) 𝑑𝑥 + 32𝜋 (2𝑚)!(2𝑚+1)(2𝑚+2)
0
4.22𝑚 (𝑚!)2 (𝑚+1)2
𝑥 − √64 − 𝑥 2
= 2[ (2𝑚)! (2𝑚+1)
2 = . ≤
4.22𝑚 (𝑚!)2 2(𝑚+1)
3 1 2𝑚+1 1
64 𝑥 𝑥2 4 . . ; [𝑠ℎ𝑜𝑤 𝑖𝑡]
√3𝑚+1 2(𝑚+1) √3𝑚+4
+ sin−1 ( ) − 2√3. ]
2 8 3 0
2 ∴ P(m+1) is true.
+ 32𝜋
1
So, by induction 𝑥𝑛 ≤ ∀ 𝑛 ∈ ℕ.
16 √3𝑛+1
= (8𝜋 − √3)𝑠𝑞. 𝑢𝑛𝑖𝑡𝑠.
3
Q9. Show that if n is any odd integer greater
than 1, then 𝒏𝟓 − 𝒏 is divisible by 80.
Solution:-
Take n = 2k + 1,
For n = 3, 35 − 3 = 240 ⃒ 80.
Now, P(n) =𝑛5 − 𝑛 = (2𝑘 + 1)5 − (2𝑘 + 1)
= {(2𝑘 − 1) + 2}5 − (2𝑘 − 1) + 2
= (2𝑘 − 1)5 + 5𝐶1 (2𝑘 − 1)4 . 2

+ 5𝐶2 (2𝑘 − 1)3 . 22
+ 5𝐶3 (2𝑘 − 1)2 . 23
+ 5𝐶4 . (2𝑘 − 1). 2 + 25
𝟏 𝟑 𝟓 𝟐𝒏−𝟏
Q8. Let 𝒙𝒏 = 𝟐 . 𝟒 . 𝟔 … . . . Then show − (2𝑘 − 1) + 2
𝟐𝒏
𝟏
that 𝒙𝒏 ≤ , 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒏 = 𝟏, 𝟐, 𝟑, … = {(2𝑘 − 1)5 − (2𝑘 − 1)} + 10(2𝑘 − 1)4
√𝟑𝒏+𝟏
5.4
1 3 5 2𝑛−1 + × 4(2𝑘 − 1)
Solution:- 𝑥𝑛 = 2 . 4 . 6 … . . = 2.1
2𝑛
1.2.3.4….(2𝑛−1)(2𝑛) (2𝑛)! 5.4
= 22𝑛.(𝑛!)2 + . 8(2𝑘)2 + 5
(2.2….𝑡𝑜 2𝑛 𝑡𝑖𝑚𝑒𝑠)(1.2.3…𝑛)2 2.1
× 16(2𝑘 − 1) + 30
(2𝑛)! 1
We need to show that 22𝑛.(𝑛!)2 ≤ ∀𝑛 ∈
√3𝑛+1 ≡ 𝑀𝑢𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 80 + 10(16𝑘 4 − 24𝑘 2 + 16𝑘)
ℕ.
≡ 𝑀𝑢𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 80 + 80(2𝑘 4 − 3𝑘 2 + 2𝑘)
By induction, P(1) is true.
∴ (2𝑘 − 1)5 − (2𝑘 − 1) is divisible by 80.
99
∴ By induction method, for all odd integer n, 1 2 1 2

Let S = (𝑎 + 𝑎) + (𝑏 + 𝑏)
𝑛5 − 𝑛 is divisible by 80.
(𝑎2 + 𝑏 2 )
Q10. If any one pair among the straight lines = 𝑎2 + 𝑏 2 + +4
𝑎2 𝑏 2
ax + by = a + b, bx – (a+ b)y = - a, (a+ b)x –ay
= 𝑆1 + 𝑆2 + 4.
= b intersect, then show that the three
straight lines are concurrent. 1
𝑆1 = 𝑎2 + 𝑏 2 ≥ [(𝑎 − 𝑏)2 ≥ 0
2
Solution:-
⟾ 𝑎2 + 𝑏 2 − 2𝑎𝑏 ≥ 0
Let 1st two lines intersect. ⟾ (𝑎 + 𝑏)2 ≥ 4𝑎𝑏 ⟾ 4𝑎𝑏
≤1 ⟾ 𝑎𝑏
ax + by = a + b _____________ (i) × 𝑏 1 1
≤ 𝑎2 + 𝑏 2 ≥ 1 − 2 ( )
4 4
bx – (a+ b)y = - a ___________ (ii)× 𝑎 1
= ]
2
𝑎𝑏𝑥 + 𝑏 2 𝑦 = 𝑎𝑏 + 𝑏 2
𝑎2 + 𝑏 2 2 2 1
𝑎𝑏𝑥 − 𝑎(𝑎 + 𝑏)𝑦 = −𝑎2 𝑆2 = 2 2
,𝑎 𝑏 ≤
𝑎 𝑏 16
− + + 1
∴ ≥ 16.
𝑎2 𝑏 2
__________________________________ ∴𝑆2 ≥ 8
𝑦 = 1. ∴𝑆1 + 𝑆2 ≥ + 8
1
2
𝑎+𝑏−𝑏𝑦
∴x= = 1. 1 25
𝑎 ∴S≥2+8+4 = 2
.
In the third line, (a+ b) x – ay = LHS = b = RHS.
So, there straight lines are concurrent.

Q2. Suppose that P(x) is a polynomial of
ISI B.STAT & B.MATH degree n such that
SUBJECTIVE QUESTIONS & 𝒌

P(k) = 𝒌+𝟏 for k= 0, 1, …, n.
SOLUTIONS
Find the value of P(n + 1).
SET – 5 Solution:-
Given that, P(x) is a polynomial of degree n

Q1. If a and b are positive real numbers such such that
that a + b = 1, prove that
𝑘
P(k) = 𝑘+1 ∀ 𝑘 = 0, 1, … … , 𝑛
𝟐 𝟐
𝟏 𝟏 𝟐𝟓
(𝒂 + ) + (𝒃 + ) ≥ .
𝒂 𝒃 𝟐 Let, Q(x) = (x +1) P(x) –x
Solution:-
100
The polynomial Q(x) vanishes for k = 0, 1, …., ⟾cot 𝑥𝑛+1 = cot 𝑥𝑛+2 − (𝑛 − 1) [dividing
n bysin 𝑥𝑛+1 + sin 𝑥𝑛 ]
i.e. (x+ 1) P(x) –x = a(x) (x-1) (x- 2) … (x- n) ∴cot 𝑥𝑛 = cot 𝑥𝑛−1 + 2−𝑛 = cot 𝑥𝑛−2 +
2−(𝑛−1) + 2−𝑛 = ⋯ … … … … … … ….
Putting x = -1, 1 = a(1) (-2) (-3) …. (-1 -n)
= cot 𝑥1 + 2−2 + 2−3 + ⋯ + 2−𝑛
⟹1 = a (−1)𝑛+1 (𝑛 + 1)1 ⟹ 𝑎 =
1 1
.
(−1)𝑛+1 (𝑛+1)!
= 2−1 + 2−2 + 2−3 + ⋯ + 2−𝑛
𝑎𝑥(𝑥 − 1)(𝑥 − 2) … (𝑥 − 𝑛) + 𝑥 1 𝑛
𝑃(𝑥) = = 1 − ( ) [∵ tan−1 2 = 𝑥1 ]
(𝑥 + 1) 2
1 𝑛
(−1)𝑛+1 𝑥(𝑥 − 1)(𝑥 − 2) … (𝑥 − 𝑛) ∴cot 𝑥𝑛 = 1 − (2) .
= +𝑥
(𝑛 + 1)!
lt cot 𝑥𝑛 = 1. ⟾ cot ( lt 𝑥𝑛 ) = 1
{(𝑛+1)𝑛(𝑛−1)…3.2.1}+𝑥+1 𝑛 →∞ 𝑛 →∞
∴ P(n+ 1)= (−1)𝑛+1 (𝑛+1)! 𝛱
(𝑛+2) ⟾ lt 𝑥𝑛 = .
𝑛 →∞ 4
(𝑛 + 1)
+ (𝑛 + 1) Q4. Consider the circle of radius 1 with its
(𝑛 + 1)!
= (−1)𝑛+1 centre at the point (0, 1). From this initial
(𝑛 + 2)
(−1)𝑛+1 + 𝑛 + 1 position, the circle is rolled along the positive
= x-axis without slipping. Find the locus of the
(𝑛 + 2)
point P on the circumference of the circle
1 which is on the origin at the initial position of
𝑓𝑜𝑟 𝑛 = 𝑜𝑑𝑑
∴ P(n+ 1) = { 𝑛
the circle.
𝑛 + 2 𝑓𝑜𝑟 𝑛 = 𝑒𝑣𝑒𝑛
Solution:-
Let ‘P’ be the point on the circle NP, let the line
OMX on which the circle rolls is X-axis and the
Q3. Suppose 𝒙𝟏 = 𝐭𝐚𝐧−𝟏 𝟐 > 𝒙𝟐 > 𝒙𝟑 > ⋯ point ‘O’ is origin. Radius of circle is one unit,
are positive real numbers satisfying
𝐬𝐢𝐧(𝒙𝒏+𝟏 − 𝒙𝒏 ) + 𝟐−(𝒏+𝟏) 𝒔𝒊𝒏𝒙𝒏 𝒔𝒊𝒏𝒙𝒏+𝟏 =
𝟎 𝒇𝒐𝒓 𝒏 ≥ 𝟏. Find
𝝅
𝒄𝒐𝒕𝒙𝒏 . 𝑨𝒍𝒔𝒐, 𝒔𝒉𝒐𝒘 𝒕𝒉𝒂𝒕 𝐥𝐢𝐦 𝒙𝒏 = 𝟒 .
𝒏→∞
Solution:-
𝑠𝑖𝑛𝑥𝑛+1 cos 𝑥𝑛 − 𝑐𝑜𝑠𝑥𝑛 − cos 𝑥𝑛+1 sin 𝑥𝑛+2

− (𝑛 + 1) sin 𝑥𝑛 sin 𝑥𝑛+1 = 0
Let P= (x, y) and ⦟PCM= 𝜃, where 𝜃 is the
⟾ sin 𝑥𝑛+1 {cos 𝑥𝑛+2 − (𝑛 + 1) sin 𝑥𝑛 } angle through which the circle turns as the point
= cos 𝑥𝑛+1 sin 𝑥𝑛 P tracts out of the locus.
101
∴ OM = PM͡ = 1.𝜃 = 𝜃, let PL ⏊OX, x= OL= And, (2 − 𝑥)2 = 𝑥, or 𝑥2 − 5𝑥 + 4 = 0 or, x

OM-LM = 𝜃- sin 𝜃. = 1, 4, from (ii) & (iii)
Y = PL= NM = CM – CN = 1- cos 𝜃. So, point of intersection is x = 1.
Q5. Sketch, on plain paper, the graph of y =
𝒙𝟐 +𝟏
𝒙𝟐 −𝟏
.
Solution:-
𝑥 2 +1 (𝑥 2 −1)2 +2
y = 𝑥 2 −1 = 𝑥 2 −1
2 𝑑𝑦 4𝑥
∴ y = 1+ ∴ = −
𝑥 2 −1 𝑑𝑥 (𝑥 2 −1)2
For, −∞ ≤ 𝑥 < −1, 𝑦 ′ 𝑖𝑠 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒.
For, -1 < x ≤ 0, y’ is positive

Area of the shaded region is =
For, 0 ≤ x <1, y’ is negative 1
│ ∫0 (𝑦2 − 𝑦1 )𝑑𝑥 │, 𝑤ℎ𝑒𝑟𝑒 𝑦1 = −√𝑥, 𝑦2 =
For, 1< x ≤ ∞, y’ is negative. 𝑥2
=
1
│ ∫0 (−√𝑥 − 𝑥 2 )𝑑𝑥 │ = 1 𝑠𝑞. 𝑢𝑛𝑖𝑡𝑠.
Q7. Let x and n be positive integers such

that 𝟏 + 𝒙 + 𝒙𝟐 + ⋯ + 𝒙𝒏−𝟏 is a prime
number. Then show that n is a prime
number.
Solution:-
𝑥 𝑛 −1
Q6. Find the area of the region in the xy- P= 1 + 𝑥 + 𝑥 2 + ⋯ + 𝑥 𝑛−1 = 𝑥−1
plane, bounded by the graphs of
If P is prime, then x – 1 = 1 ⤇ x = 2.
𝟐
y = 𝒙 , 𝒙 + 𝒚 = 𝟐 𝒂𝒏𝒅 𝒚 = −√𝒙.
2𝑛 −1
∴ P= = 2𝑛 − 1 is a prime.
Solution:- 2−1
Let n is not a prime, then n = pq [p, q are

y = 𝑥 2 ……………. (i) x+y=2
………………… (ii) +ve integers]
y = −√𝑥 ………….. (iii) So, 2𝑛 − 1 is divided by both 2𝑝 − 1 and

2𝑞 − 1
So, 𝑥4 = 𝑥, or, x (𝑥3 − 1)= 0, so, x = 0, 1,
from (i) & (ii) i.e., 2𝑛 − 1 is not a prime.
102
But we know 2𝑛 − 1 is prime, so, by Perimeter of the marked region of the circle =
contradiction n is also prime. 2𝜋a –a (2𝜋 -𝜃) = a𝜃
Q8. Show that for every positive integer n, 7 Perimeter of the base of the cone = 2𝜋r
divides 𝟑𝟐𝒏+𝟏 + 𝟐𝒏+𝟐 . 𝑎𝜃
∴ 2𝜋r = a𝜃 ⟹r = 2𝜋
Solution:- 32𝑛+1 + 2𝑛+2 = 3. 32𝑛 + 4. 2𝑛 =
1
3(2 + 7)𝑛 + 4. 2𝑛 Volume of the cone = V = 𝜋𝑟 2 ℎ
3
= 3[2𝑛 + 𝑛𝑐1 . 2𝑛−1 . 7 + ⋯ + 7𝑛 ] + 4. 2𝑛

1 𝑎2 𝜃 2 𝑎2 𝜃 2
= 7. 2𝑛 + 3.7. 𝑛𝐶1 . 2𝑛−1 + ⋯ + 3. 7𝑛 = 𝜋. √𝑎2 −
3 4𝜋 2 4𝜋 2
= 7(2𝑛 + 3. 𝑛𝐶1 . 2𝑛−1 + ⋯ + 3. 7𝑛−1 ) ≡
𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 7. 𝑎3 2
= 𝜃 √4𝜋 2 − 𝜃 2
24𝜋 2
Q9. If a, b, c are positive numbers, then show
𝑑𝑣 𝑎3 𝜃3
that ∴ = (2𝜃 √4𝜋 2 − 𝜃2 − )
𝑑𝜃 24𝜋 2 √4𝜋 2 − 𝜃 2
𝒃𝟐 + 𝒄𝟐 𝒄𝟐 + 𝒂𝟐 𝒂𝟐 + 𝒃𝟐
+ + ≥ 𝒂 + 𝒃 + 𝒄. For V to be max or min,
𝑑𝑣
=0
𝒃+𝒄 𝒄+𝒂 𝒂+𝒃 𝑑𝜃
Solution:- 𝜃3
∴ 2𝜃 = √4𝜋 2 − 𝜃 2 − =0
√4𝜋2 −𝜃2
(𝑏 + 𝑐)2
𝑏2 + 𝑐 2 ≥ ⟹8𝜋 2 − 2𝜃 2 − 𝜃 2 = 0
2
𝑏2 + 𝑐 2 𝑏 + 𝑐 (∵ 𝜃 ≠ 0)
≥
𝑏+𝑐 2
2
2 2 2 2
∴ 𝜃 = 2𝜋 √3
𝑐 +𝑎 𝑐+𝑎 𝑎 +𝑏
𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦, ≥ &
𝑐+𝑎 2 𝑎+𝑏
𝑎+𝑏 𝑑2 𝑣 𝑎3
≥ . [ 2] = [2√4𝜋 2 − 𝜃 2
2 𝑑𝜃 𝜃=2π √2 24𝜋 2
3
𝑏 2 + 𝑐 2 𝑐 2 + 𝑎2 𝑎2 + 𝑏 2 1 4𝜃 3𝜃 2
𝐴𝑑𝑑𝑖𝑛𝑔, 𝑤𝑒 𝑔𝑒𝑡 + + − −
𝑏+𝑐 𝑐+𝑎 𝑎+𝑏 2 √4𝜋 2 − 𝜃 2 √4𝜋 2 − 𝜃 2
≥𝑎+𝑏+𝑐
2𝜃 4
+ 3 ]
(4𝜋 2 − 𝜃 2 )2 𝜃=2π √
2
3
Q10. Out of a circular sheet of paper of
radius a, a sector with central angle 𝜃 is cut ∴ The volume of the funnel is max. when 𝜃
out and folded into the shape of a conical 2
funnel. Show that the volume of the funnel is equals 2𝜋 √3 [proved]
𝟐
maximum when 𝜃 equals 2𝜋√ .
𝟑
Solution:-
103
ISI B.STAT & B.MATH 1 1

= [(2𝑎𝑥)2 + 4𝑎𝑥𝑏 + 𝑏 2 ] + [4𝑎𝑐 − 𝑏 2 ]
4𝑎 4𝑎
SUBJECTIVE QUESTIONS &
SOLUTIONS (2𝑎𝑥 + 𝑏)2 1
= + [4𝑎𝑐 − 𝑏 2 ]
4𝑎 4𝑎
𝑏
SET – 6 P is minimum when (2ax + b) = 0, i.e. x = − 2𝑎,
4𝑎𝑐−𝑏2
and 𝑃𝑚𝑖𝑛 = 4𝑎
.
Q1. Show that if n >2, then (𝒏!)𝟐 > 𝒏𝒏.
Solution:-
Q3. A pair of complex numbers 𝒛𝟏 , 𝒛𝟐 is said
2 (n- 2) > n -2 ⤇ 2n – 4+ 2 > n ⤇ 2(n- 1) > n to have property P if for every complex
………….. (i) number z, we can find real numbers r and s
such that z = r 𝒛𝟏 + 𝒔𝒛𝟐. Show that a pair
3 (n- 3) > n -3 ⤇ 3n – 9 > n- 3 ⤇ 3 (n- 2) > n 𝒛𝟏 , 𝒛𝟐 has property P if and only if the points
…………… (ii) 𝒛𝟏 , 𝒛𝟐 and 0 on the complex plane are not
collinear.
Similarly, we have 4 (n- 3) > n
……………… (iv) Solution:-
5 (n- 4) > n …………….. Now, 𝑧1 = 𝑎 + 𝑖𝑏, 𝑧2 = 𝑥 + 𝑖𝑦, 0 = 0 + 𝑖. 0
(v)
And let 𝑧1 , 𝑧2 , 0 be collinear then
⁞ 0 0 1
𝑎𝑥
│𝑎 𝑏 1 │ = 0 ⟾ = 𝑘(𝑠𝑎𝑦)
Multiplying all these up to (n- 2) terms, we get 𝑏𝑦
𝑥 𝑦 1
[1.2.3. … . . (𝑛 − 1)]2 > 𝑛𝑛−2 ∴ 𝑧1 = 𝑏𝑘 + 𝑖𝑏 = 𝑏(𝑘 + 𝑖), 𝑧2 = 𝑦(𝑘 + 𝑖)
𝑛𝑛 So, ∃ some real ‘r’ or‘s’ such that z = r𝑧1 +
⤇ [(𝑛 − 1)!]2 >
𝑛2 𝑠𝑧2 = 𝑟𝑏(𝑘 + 𝑖) + 𝑠𝑦(𝑘 + 𝑖) = (𝑟𝑏 + 𝑠𝑦)(𝑘 +
⤇ [𝑛!]2 > 𝑛𝑛 . 𝑖),
Q2. Show that for all real x, the expression Which does not hold good.
𝒂𝒙𝟐 + 𝒃𝒙 + 𝒄 (where a, b, c are real constants So, 𝑧1 , 𝑧2 and 0 should not be collinear.
(𝟒𝒂𝒄−𝒃𝟐 )
with a > 0), has the minimum value 𝟒𝒂
.
Q4. In a club of 80 members, 10 members
Also find the value of x for which this
play none of the games Tennis,
minimum value is attained.
Badminton and Cricket. 30 members play
Solution;- exactly one of these three games and 30
members play exactly two of these games.
Let P = 𝑎𝑥 2 + 𝑏𝑥 + 𝑐
45 members play at least one of the games
1 among Tennis and Badminton. Determine
= [4𝑎2 𝑥 2 + 4𝑎𝑏𝑥 + 4𝑎𝑐]
4𝑎 the number of Cricket playing members.
104
Solution:- Solution:-
Let n(U) = Number of elements in universal

set = 80
Friend Yes No. Total
Kin
n(NM) = Number of non-playing members
Yes 27 31 58
= 10
n(PM) = Number of playing members= 80- No. 3 129 132

10= 70.
Total 30 160 190
Given that number of members playing 1. Most of the friends are kin because 3 of
exactly one of the three games = 𝑡1 + 𝑏1 + 30 friends are not kin.
𝑐1= 30. 2. Most of the friends are kin, which is not
true.
Number of members playing exactly two of
these three games = tb + bc + ct =
30.Number of members playing there games 𝟏 𝟑
= 10. Q6. Evaluate 𝐥𝐢𝐦 {(𝟏 + 𝟐𝒏) (𝟏 + 𝟐𝒏) (𝟏 +
𝒏→∞
𝟏
𝟓 𝟐𝒏−𝟏 𝟐𝒏
∴ No. of members playing cricket=𝑐1 + 𝟐𝒏
) … (𝟏 + 𝟐𝒏 )} .
𝑡𝑐 + 𝑡𝑏𝑐 + 𝑏𝑐
Solution:-
= 25 + 12 + 10 1
1 3 2𝑛−1 2𝑛
Let p = lt {(1 2𝑛) (1 + 2𝑛) … . (1 + )}
= 47 . 𝑛 →∞ 2𝑛
1 1 3
log 𝑃 = lt {𝑙𝑜𝑔 (1 + ) + log (1 + )
𝑛 →∞ 2𝑛 2𝑛 2𝑛
Q5. Each pair in a group of 20 persons is 2𝑛 − 1
+ ⋯ + log (1 + )}
classified by the existence of kinship relation 2𝑛
and friendship relation between them. The 𝑛
1 1 2𝑟 − 1
following table of data is obtained from such = lt ∑ log (1 + )
a classification. 2 𝑛 →∞ 𝑛 2𝑟
𝑟=1
KINSHIP AND FRIENDSHIP RELATION AMONG 20 PERSONS 𝑛

1 1 𝑟 1
= lt ∑ log (1 + − )
Friendship→ Yes No 2 𝑛 →∞ 𝑛 𝑛 2𝑛
𝑟=1
Kinship ↓
𝑛
Yes 27 31 1 1 𝑟 1
No 3 129 = lt ∑ log (1 + ) , 𝑠𝑖𝑛𝑐𝑒 lt = 0.
2 𝑛 →∞ 𝑛 𝑛 𝑛 →∞ 2𝑛
Determine (with justifications) whether each 𝑟=1
of the following statements is supported by
1 1
the above data: = ∫ log(1 + 𝑥) 𝑑𝑥
2 0
(i) Most of the friends are kin.
1 1
(ii) Most of the kin are friends. = [𝑥 log(1 + 𝑥) − 𝑥 + log(1 + 𝑥)]
2 0
105
1 Solving these there equations, we will get the

4 2
= log ( ) following equation:-
𝑒
1 23𝑥 2 − 90𝑥 + 63 = 0
4 2 2
∴𝑃=( ) = .
𝑒 √𝑒 90 ± √902 − 4.23.63 21
∴𝑥= = 𝑜𝑟, 3
2.23 23
Q7. The circles 𝑪𝟏 , 𝑪𝟐 𝒂𝒏𝒅 𝑪𝟑 with radii 1, 2
21
and 3, respectively, touch each other By the diagram, x can’t be 3, so, 𝑥 = 23 , ∴ 𝑦 =
externally. The centres of 𝑪𝟏 𝒂𝒏𝒅 𝑪𝟐 lie on 20
.
the x-axis, while 𝑪𝟑 touches them from the 23
top. Find the ordinate of the centre of the 21 20

circle that lies in the region enclosed by the ∴ Required centre of the circle is (23 , 23).
circles 𝑪𝟏 , 𝑪𝟐 𝒂𝒏𝒅 𝑪𝟑 and touches all of them.
Q8. Using calculus, sketch the graph of the
Solution:- following function on a plain paper: f(x) =
𝟓−𝟑𝒙𝟐
.
𝟏− 𝒙𝟐
5−3𝑥 2 3(1−𝑥 2 )+2 2

Solution:- f(x) = = =3+
1−𝑥 2 1−𝑥 2 1−𝑥 2
4𝑥
∴ 𝑓 ′ (𝑥) = ,
(1 − 𝑥 2 )2
For, −∞ < 𝑥 < −1, 𝑓 ′ (𝑥)𝑖𝑠 𝑛𝑒𝑔𝑎𝑡𝑖𝑣𝑒;
For, -1 < x ≤ 0, 𝑓 ′ (𝑥) is negative;
For, 0 < x <1, 𝑓 ′ (𝑥) is positive;
For, 1< x <∞, 𝑓 ′ (𝑥) is positive;
x -3 3 -2 2 0 1
-2 1
2
f(x) 2
3
2
3
2
1
2
1 5 17 17
4 4 3 3
3 3
For simplicity, centre of 𝐶1 ≡ (0, 0); 𝐶2 ≡
(3, 0); 𝐶3 ≡ (0, 4)
Let (x, y) be the co-ordinates of the centre of the

circle touching 𝐶1 , 𝐶2 𝑎𝑛𝑑 𝐶3 and let r be its
radius.
Then, (𝑟 + 1)2 = 𝑥 2 + 𝑦 2 ………………. (1)
(𝑟 + 2)2 = (𝑥 − 3)2 + 𝑦 2 ………………… (2)
(𝑟 + 3)2 = 𝑥 2 + (𝑦 − 4)2 …………………….

(3)
106
Q9. Let ABC be an isosceles triangle with AB Now, a (a+ 1) is divisible by 2.

= BC = 1 cm and ⦟A = 30°. Find the volume
of the solid obtained by resolving the triangle ∴𝑛4 ≡ 1 (𝑚𝑜𝑑 16).
about the line AB. (b)Solution:-
Solution:- Here AB = BC = 1
Now, 𝑛1 4 ≡ 1(𝑚𝑜𝑑 16)
1 1
BD = BC Cos 60° = 1. 2 = 2 𝑛2 4 ≡ 1 (𝑚𝑜𝑑 16)
CD = BC Sin 60° = 1.
√3
=
√3 ⁞ ⁞
2 2
1 3 𝑛8 4 ≡ 1 (𝑚𝑜𝑑 16)
∴AD = AB+ BD = 1+2 = 2
________________________
1 3
∴ Required volume = 𝜋. 4
3 𝑛1 4 + 𝑛2 4 + ⋯ + 𝑛8 4 ≡ 8 (𝑚𝑜𝑑 16)
3 1 1 3𝜋 𝜋
∴ (2 − 2) 𝑠𝑞. 𝑢𝑛𝑖𝑡 = 3 . 4
𝑠𝑞. 𝑢𝑛𝑖𝑡 = 4 𝑠𝑞. 𝑢𝑛𝑖𝑡. But 1993 ≡ 9 (mod 16)
So, the value of 𝑛1 4 + 𝑛2 4 + ⋯ + 𝑛8 4 can’t be

1993.
ISI B.STAT & B.MATH

SOLUTIONS
Q10. (a) Prove that, for any odd integer n, 𝒏𝟒
when divided by 16 always leaves remainder SET – 7
1.
(b) Hence or otherwise show that we cannot Q1. Let x be a positive number, A sequence
find integers 𝒏𝟏 , 𝒏𝟐 , … , 𝒏𝟖 such that𝒏𝟏 𝟒 + {𝒙𝒏 } of real numbers is defined as follows:
𝒏𝟐 𝟒 + ⋯ + 𝒏𝟖 𝟒 = 𝟏𝟗𝟗𝟑.
𝟏 𝟓 𝟏 𝟓
𝒙𝟏 = 𝟐 (𝒙 + 𝒙) , 𝒙𝟐 = 𝟐 (𝒙𝟏 + 𝒙 ) , …, and in
Solution 𝟏
general,
(a) Let n = 2a + 1
𝟏 𝟓
𝒙𝒏+𝟏 = 𝟐 (𝒙𝒏 + 𝒙 ) 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒏 ≥ 𝟏.
𝑛4 = (2𝑎 + 1)4 𝒏
𝒙𝒏−√𝟓 𝟐𝒏
= (4𝑎2 + 4𝑎 + 1)2 (a) Show that, for all n ≥ 1,
𝒙−√𝟓
= ( ) .
𝒙𝒏 +√𝟓 𝒙+√𝟓
= [4𝑎(𝑎 + 1) + 1]2
(b) Hence find 𝐥𝐢𝐦 𝒙𝒏 .
𝒏→∞
2 (𝑎 2
= 16𝑎 + 1) + 8𝑎(𝑎 + 1) + 1
Solution:-
2
= 16[𝑎(𝑎 + 1)] + 8𝑎(𝑎 + 1) + 1
107
1 5 √5 𝑥𝑛−1 √5
(a) 𝑥𝑛 = 2 (𝑥𝑛−1 + 𝑥 )= 2
( +𝑥 )
𝑛−1 √5 𝑛−1
𝑥𝑛 1 𝑥𝑛−1 √5
⟾ = ( + ).
√5 2 √5 𝑥𝑛−1
By componendo-dividend, we get-
1 𝑥𝑛−1 √5
𝑥𝑛 − √5 2 ( √5 + 𝑥𝑛−1 ) − 1
=
𝑥𝑛 + √5 1 𝑥𝑛−1 √5
2 ( √5 + 𝑥𝑛−1 ) + 1
Q3. Sketch on plain paper, the graph of the
𝑥𝑛−1 2 + √5 − 2√5 𝑥𝑛−1
= function y = sin(𝒙𝟐 ), in the range 0 ≤ x ≤
𝑥𝑛−1 2 + √5 + 2√5 𝑥𝑛−1
√𝟒𝝅.
2 22
𝑥𝑛−1 − √5 𝑥𝑛−2 − √5 Solution:-
=( ) = ( ) =⋯
𝑥𝑛−1 + √5 𝑥𝑛−2 + √5 Taking different values of x, we get different y.
2𝑛−1
𝑥1 − √5
=( ) x 0 √𝜋/4 √𝜋/2 √𝜋 √3𝜋/2 √2𝜋
𝑥1 + √5
√5𝜋/2 √3𝜋 √7𝜋/2 √4𝜋
2𝑛
𝑥 − √5 y 0 1/√2 1 0 -1 0 1
=( ) (𝑝𝑟𝑜𝑣𝑒𝑑) 0 -1 0
𝑥 + √5
(b)Since x is a positive number, 𝑥 − √5 < 𝑥 +

√5
𝑥−√5
⟾ 𝑥+√5 < 1
2𝑛
𝑥−√5
∴(𝑥+√5) ⟶ 0 𝑎𝑠 𝑛 → ∞.
𝑥−√5
⟾ 𝑥+√5 ⟶ 0 ⟾ 𝑥 − √5 ⟶ 0
Q4. If n is a positive integer greater than 1
∴ lt 𝑥𝑛 = √5. such that 3n + 1 is perfect square, then show
𝑛 →∞
that n + 1 is the sum of three perfect squares.
Q2. Draw the region of points (x, y) in the
plane, which satisfy |y| ≤|x| ≤ 1. Solution:-
Solution:- As 3n + 1 is a perfect square, so let
3n + 1 = 𝑎2
⤇ a is not a multiple of 3.
108
⤇ a may be of the form either 3k + 1 or 3k + 2, Again w > z

k ∊ I.
& 𝑤1 = 𝑧1
Taking a = 3k + 1, 3n + 1= (3k + 1)2 =
9𝑘 2 + 6𝑘 + 1 ; 𝑤2 = 𝑧2
Or, n = 3𝑘 2 + 2𝑘 ⁞
Or, n + 1 = 3𝑘 2 + 2𝑘 + 1 = 𝑘 2 + 𝑘 2 + 𝑤𝑘 > 𝑧𝑘
(𝑘 + 1)2
But 𝑤𝑘+1 = 𝑧𝑘+1
i.e. , sum of three perfect squares.
So, 𝑢𝑘 + 𝑤𝑘 = 𝑣𝑘 + 𝑧𝑘 ⤇ (u+ w)k = (v+
2 2
Taking a = 3k + 2, 3n + 1= (3k + 2) = 9𝑘 + z)k
6𝑘 + 4;
But 𝑢𝑘+1 + 𝑤𝑘+1 > 𝑣𝑘+1 + 𝑧𝑘+1 .
Or, n =3𝑘 2 + 4𝑘 + 1
So, u + w > v + z.
Or, n + 1= 3𝑘 2 + 4𝑘 + 2 = 𝑘 2 + (𝑘 + 1)2 +
(𝑘 + 1)2 Q6. Consider the set of points S = {(x, y): x, y
are non-negative integers ≤ n}.
i.e. sum of 3 perfect squares. [Proved]
Find the number of squares that can be
formed with vertices belonging to S and sides
parallel to the axes.
Q5. Let x = (𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏 ), y =
(𝒚𝟏 , 𝒚𝟐 , … , 𝒚𝒏 ) , where 𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏 Solution:-
, 𝒚𝟏 , 𝒚𝟐 , … , 𝒚𝒏 are real numbers. We write
The number of squares with sides of unit length
x > y, if for some k, 1 ≤ k ≤ (n- 1), 𝒙𝟏 =
= 𝑛 × 𝑛 = 𝑛2 .
𝒚𝟏 , 𝒙𝟐 = 𝒚𝟐 , … , 𝒙𝒌 = 𝒚𝒌 , but 𝒙𝒌+𝟏 >
𝒚𝒌+𝟏 . Show that for u = (𝒖𝟏 , … , 𝒖𝒏 ), The number of squares with sides of length 2
v=(𝒗𝟏 , … , 𝒗𝒏 ), w = (𝒘𝟏 , … , 𝒘𝒏 ) and z = units is = (𝑛 − 1) × (𝑛 − 1) = (𝑛 − 1)2 and so
(𝒛𝟏 , … , 𝒛𝒏 ), if u > v and w > z, then (u +w) on.
> (v +z).
∴ Total number of squares = 𝑛2 + (𝑛 − 1)2 +
𝑛(𝑛+1)(2𝑛+1)
Solution:- u > v ⋯ + 22 + 12 = 6
.
& 𝑢1 = 𝑣1 𝐬𝐢𝐧𝟒 𝐱 𝐜𝐨𝐬 𝟒 𝐱 𝟏

Q7. If 𝐚
+ 𝐛
= 𝐚+𝐛, then show that
𝑢2 = 𝑣2 𝐬𝐢𝐧𝟔 𝐱 𝐜𝐨𝐬 𝟔 𝐱 𝟏
+ = .
𝐚𝟐 𝐛𝟐 (𝐚+𝐛)𝟐
⁞
Solution:-
𝑢𝑘 = 𝑣𝑘 𝑠𝑖𝑛4 𝑥 𝑐𝑜𝑠 4 𝑥 1
+ = ,
But 𝑢𝑘+1 > 𝑣𝑘+1 𝑎 𝑏 𝑎+𝑏
109
𝑠𝑖𝑛4 𝑥 (1 − 𝑠𝑖𝑛2 𝑥)2 1 ′ 𝑘

𝑜𝑟, + = = ∑(𝑙𝑖 + 𝑤𝑖 )(𝑙𝑖 − 𝑤𝑖 )
𝑎 𝑏 𝑎+𝑏
𝑖=1
𝑘
𝑜𝑟, (𝑎 + 𝑏)2 𝑠𝑖𝑛4 𝑥 − 2𝑎𝑠𝑖𝑛2 𝑥(𝑎 + 𝑏)
+ 𝑎2 = 0 = ∑(𝑘 − 1)(𝑙𝑖
𝑖=1
∴ {(𝑎 + 𝑏)𝑠𝑖𝑛2 𝑥 − 𝑎}2 = 0 − 𝑤𝑖 ) [𝑓𝑟𝑜𝑚 (1)]
𝑎 𝑎 = (𝑘 − 1){∑𝑘𝑖=1 𝑙𝑖 −} = (𝑘 − 1). 0 [𝑓𝑟𝑜𝑚 (2)]

∴ 𝑠𝑖𝑛2 𝑥 = ∴ 𝑐𝑜𝑠 2 𝑥 = 1 −
𝑎+𝑏 𝑎+𝑏 =0
𝑏
= ; 𝑘 𝑘
𝑎+𝑏
2
⟹ ∑ 𝑙𝑖 = ∑ 𝑤𝑖 2 (𝑝𝑟𝑜𝑣𝑒𝑑)
𝑠𝑖𝑛6𝑥 𝑐𝑜𝑠6𝑥 𝑎3 𝑏3 𝑖=1 𝑖=1
∴ + = +
𝑎2 𝑏2 (𝑎 + 𝑏)3 (𝑎 + 𝑏)3
𝑎2 𝑏2
1
= . Q9. Let 𝑷𝟏 , 𝑷𝟐 , … , 𝑷𝒏 be polynomials in x,
(𝑎 + 𝑏)2
each having all integer coefficients, such that
𝑷𝟏 = 𝑷𝟏 𝟐 + 𝑷𝟐 𝟐 + ⋯ + 𝑷𝒏 𝟐 . Assume that 𝑷𝟏
is not the zero polynomial. Show that 𝑷𝟏 =
Q8. Suppose there are k terms playing a
𝟏 𝒂𝒏𝒅 𝑷𝟐 = 𝑷𝟑 = ⋯ = 𝑷𝒏 = 𝟎.
round robin tournament; that is, each team
plays against all the other teams and no game Solution:-
ends in a draw. Suppose the ith team loses 𝒍𝒊
games and wins 𝒘𝒊 games. Show that According to the question, 𝑝1 = 𝑝1 2 + 𝑝2 2 +
𝑝3 2 + ⋯ + 𝑝𝑛 2
𝒌 𝒌
𝟐
∑ 𝒍𝒊 = ∑ 𝒘𝒊 𝟐 . This is possible when the degree of 𝑝1 is0.
𝒊=𝟏 𝒊=𝟏
𝑝2 2 +𝑝3 2 +⋯+𝑝𝑛 2
𝑝1 2 ≥ 𝑝1 , 𝑝1 2 +𝑝2 2 +⋯+𝑝𝑛 2
≥0 given that
Solution:-
𝑝1 2 + 𝑝2 2 + 𝑝3 2 + ⋯ + 𝑝𝑛 2 = 𝑝1 , 𝑝1 2 = 𝑝1 , ∵
By the problem, every team will play k -1 𝑝1 ≠ 0 ∴ 𝑝1 = 1
matches. As the i-th team loses 𝑙𝑖 & 𝑤𝑖𝑛𝑠 𝑤𝑖
matches, they play a total of 𝑙𝑖 + 𝑤𝑖 matches, as And 𝑝2 2 + 𝑝3 2 + ⋯ + 𝑝𝑛 2 = 0
no match ends in draw.
i.e., 𝑝2 = 𝑝3 = ⋯ 𝑝𝑛 = 0 [Proved]
∴ 𝑙𝑖 + 𝑤𝑖 = 𝑘 − 1 …………. (1)
Obviously, total no. of wins in the tournament

Q10. Let P(x) = 𝒙𝟒 + 𝒂𝒙𝟑 + 𝒃𝒙𝟐 + 𝒄𝒙 + 𝒅,
= total no. of loses in the tournament where a, b, c, and d are integers. The sums of
the pairs of roots of P(x) are given by 1, 2, 5,
⟹ ∑𝑘𝑖=1 𝑙𝑖 = ∑𝑘𝑖=1 𝑤𝑖 …………… (2) 6, 9 and 10 find P( ½ ).
Now, ∑𝑘𝑖=1 𝑙𝑖 2 = ∑𝑘𝑖=1 𝑤𝑖 2 = ∑𝑘𝑖=1(𝑙𝑖 2 − 𝑤𝑖 2 ) Solution:-
110
P(x) = 𝑥 4 + 𝑎𝑥 3 + 𝑏𝑥 2 + 𝑐𝑥 + 𝑑, now sum of Q1. Sketch the set A ∩ B in the Argand Plane,
the roots= -a 𝒛+𝟏
where A = {z: |𝒛−𝟏| ≤ 1} and B= {z: |z| - Re z ≤
⟹ 𝛼+ 𝛽+ 𝛾+ 𝛿= -a 1}.
Again, 𝛼 + 𝛽 = +1, 𝛾 + 𝛿 =10, 𝛼 + 𝛾 = 2, 𝛼 +𝛿 = Solution:-

6, 𝛽 + 𝛾= 5, 𝛽 +𝛿 = 9, Adding, 3(𝛼+ 𝛽+ 𝛾+ 𝛿) = 𝑧+1
Let z = x + iy, then ∣ 𝑧−1 ∣ ≤ 1,
33
⟹ 𝛼 + 𝛽 +𝛾 + 𝛿 = 11 ⟾ ∣z+1∣ ≤ ∣z- 1∣,
⟹ a = -11 ⟾ (𝑥 + 1 + 𝑖𝑦)2 ≤ (𝑥 + 𝑖𝑦 − 1)2 ⟾ 4𝑥 ≤ 0

⟾ 𝑥 ≤ 0.
Solving, the equations,
A = {z : x ≤ 0} ………………….. (i)
𝛼 = -1 [Note: (𝛼+ 𝛾) and (𝛼+ 𝛿) both should be
either Also, ∣z∣ - Re(z) ≤ 1
𝛽 = 2 even or both should be odd, else a, b, c, d ⟾ √𝑥 2 + 𝑦 2 ≤ 𝑥 + 1 ⟾ 𝑥 2 + 𝑦 2 ≤ 𝑥 2 +

1
2𝑥 + 1 ⟾ 𝑦 2 ≤ 2𝑥 + 1 = 2 (𝑥 + )
𝛾 = 3 will not be integers.] 2
1
𝛿=7 ∴𝑦 2 = 2 (𝑥 + 2) is a parabola, having its vertex
1
We know, 𝛼𝛽 +𝛽𝛾 + 𝛾𝛿 +𝛿𝛼 +𝛼𝛾 +𝛽𝛿 = b at (− 2 , 0) and axis on X-axis.
𝛼𝛽𝛾+ 𝛽𝛾𝛿+ 𝛾𝛿𝛼+ 𝛼𝛽𝛿 = -c
𝛼𝛽 𝛾𝛿 = d
Putting the values of 𝛼, 𝛽, 𝛾, 𝛿, b = 29, c = -1, d

= -42, a = -11.
∴ a, b, c, d any integers.
∴P(x) = 𝑥 4 − 4𝑥 3 + 29𝑥 2 − 𝑥 − 42 and,

585
𝑃(1/2)_= 16
ISI B.STAT & B.MATH

SUBJECTIVE QUESTIONS & Q2. A function f from a set A into a set B is
SOLUTIONS rule which assigns to each element x in A, a
unique (one and only one) element (denoted
by f(x)) in B. A function f from A into B is
SET – 8 called an onto function, if for each element y
in B there is some element x in A, such that
f(x) = y. now suppose that A = {1, 2, …, n}
111
and B = {1, 2, 3}. Determine the total number = 2(2𝑛2 + 𝑛) + 1

of onto functions from A into B.
∴√𝐷 is an odd positive number.
Solution:-
Q4. Show that a necessary and sufficient
Number of onto functions from {1, 2, 3, …, n} condition for the line ax + by +c = 0, where a,
to {1, 2} is 2𝑛 − 2. b, c are non-zero real numbers, to pass
through the first quadrant is either ac < 0 or
Here, A = {1, 2, 3, …, n}, B = {1, 2, 3}, for each
bc < 0.
i ∊ A have 3 possibilities, so total no. of f(n)
from A to B is 3𝑛 . Solution:-
But there are (32)(2𝑛 − 2)𝑓(𝑛) image consist of ax + by +c = 0

2 points and 3 f(n) whose image is singleton. 𝑎𝑥+𝑐
Hence, total number of onto functions f(n) from ⟾y=− 𝑏
>0.
A to B is {3𝑛 − (32)(2𝑛 − 2) − 3}.
𝑎𝑥+𝑐 𝑎𝑐𝑥 2 +𝑐 2
∴ 𝑏
<0⟾ 𝑏𝑐
< 0.
Q3. Let D=𝒂𝟐 + 𝒃𝟐 + 𝒄𝟐 , where a and b are
successive positive integers and c = ab. Prove There will be at least one point on the line for
that √𝑫 is an odd positive integer. which x > 0 and y >0 [∵ If passes through the 1st
quadrant]
Solution:-
(i) If 𝑎𝑐𝑥 2 + 𝑐 2 > 0, then bc <0, now,
Let a = 2n x>0, 𝑐 2 > 0.
∴ ac > 0.
b = 2n + 1
c = 2n (2n +1) (ii) If 𝑎𝑐𝑥 + 𝑐 2 < 0, then bc >0, now, x

>0, 𝑐 2 > 0.
= 4𝑛2 + 2𝑛
∴The necessary and sufficient conditions for the
D = 𝑎2 + 𝑏 2 + 𝑐 2 line to pass through the 1st quadrant is either ac
>0 or, bc >0.
∴ D = 16 𝑛4 + 16𝑛3 + 12𝑛2 + 4𝑛 + 1
Q5. The sum of squares of the digits of a
D- 1 = 2(8𝑛4 + 8𝑛3 + 6𝑛2 + 2𝑛)
three digits positive number is 146, while the
∴ D – 1 is an even number. sum of the two digits in the unit’s and the
ten’s place is 4 times the digit in the
∴ D is an odd number. hundred’s place. Further, when the number
is written in the reverse order, it is increased
So, √𝐷 is an odd number. by 297. Find the number.
Also, D = 16 𝑛4 + 16𝑛3 + 12𝑛2 + 4𝑛 + 1 Solution:-
= (4𝑛2 + 2𝑛 + 1)2 Let the no. be (xyz), i.e. N = 100x + 10y +z
∴ √𝐷= 4𝑛2 + 2𝑛 + 1 Given 𝑥 2 + 𝑦 2 + 𝑧 2 = 146, .................. (i)
112
4x = y + z ………………………………… (ii) polynomials in the system are the usual sum

and product, respectively, where for the
100z + 10y + x = 100x +10y + z + 297 addition and multiplication of coefficients the
⟾ z –x = 3 …………………. (iii) above mentioned rules apply. For example, in
the system,
Solving (i), (ii) and (iii), we have x = 4, y= 9, z
= 7. (𝒙 + 𝟏). (𝒙𝟐 + 𝒙 + 𝟏)
= 𝒙𝟑 + (𝟏 + 𝟏)𝒙𝟐 + (𝟏 + 𝟏)𝒙
So, the number is 497. + 𝟏 = 𝒙𝟑 + 𝟎𝒙𝟐 + 𝟎𝒙 + 𝟏
= 𝒙𝟑 + 𝟏.
Show that in this system 𝒙𝟑 + 𝒙 + 𝟏 =

Q6. Show that there is at least one real value
(𝒂𝒙 + 𝒃). (𝒄𝒙𝟐 + 𝒅𝒙 + 𝒆) 𝒄𝒂𝒏′ 𝒕 𝒉𝒐𝒍𝒅.
of x for which 𝟑√𝒙 + √𝒙 = 𝟏.
Solution:- Where a, b, c, d and e are elements of S.
Solution:-
Let y = 1- √𝑥 …………… (i)
3 Let us try to write,
And 𝑦0 = √𝑥 ……………. (ii)
𝑥 3 + 𝑥 + 1 = (𝑎𝑥 + 𝑏)(𝑐𝑥 2 + 𝑑𝑥 + 𝑒)
For function (i) x = 0, y= 1; x = 1, y =0; x=
1 1 = 𝑎𝑐𝑥 3 + (𝑏𝑐 + 𝑎𝑑)𝑥 2
,𝑦 = ; + (𝑏𝑑 + 𝑎𝑒)𝑥 + 𝑏𝑒;
4 2
This is a continuous function curve which ⟹ 𝑎𝑐 = 1, 𝑏𝑐 + 𝑎𝑑 = 0, 𝑏𝑑 + 𝑎𝑒 = 1, 𝑏𝑒 = 1

decreases from 1 to 0
∵ 𝑎, 𝑏, 𝑐, 𝑑, 𝑒 ∊ 𝑠, as we have assumed.
For function (ii) x = 0, 𝑦0 = 0; x = 1, 𝑦0 = 1;
1 1
x= 8 , 𝑦0 = 2; ∴ From the given rule, a = 1, c= 1, b = 1, e= 1
∴ bc+ ad = 0, substituting the rules,

This is also a continuous function curve and it
increases from 0 to 1 in the interval 0 ≤ x ≤ 1. 1+ d= 0 ⟹ d = 1 (∵ 1+ 1 = 0)
Hence, they must meet each other, i.e. their Again, bd +ac = 1, substituting the values,
value will be some at some points between 0 ≤ x
≤ 1. 1+ 1= 1, but, by the rule 1+ 1 = 0, which
contradicts over assumption.
Hence, the given equation has only one real root.
⟹ 𝑥 3 + 𝑥 + 1 cannot be factorial in this
Q7. Suppose S = {0, 1} with the following system.
addition and multiplication rules:
0 + 0= 1 +1 = 0 0.0= 0.1 = 1.0 = 0

𝝅/𝟐 𝐬𝐢𝐧 𝒏𝒙 𝟐 𝟏
Q8. Show that ∫𝟎 | 𝒙 | 𝒅𝒙 ≥
𝝅
(𝟏 + +
𝟐
0 + 1 = 1+ 0 = 1 1. 1 = 1
𝟏
⋯ + 𝒏).
A system of polynomials is defined with
coefficients in S. The sum and product of two Solution:-
113
𝜋 sin ℎ𝑥
∫0 │ 𝑥
│𝑑𝑥, as x ranges from [0, 𝜋], so
Let us put nx = z ∴ ndx = dz

𝑛𝜋 𝑠𝑖𝑛𝑧 𝑑𝑧 𝑛𝜋 𝑠𝑖𝑛𝑧
I = ∫0 │ 𝑧/𝑛 │ 𝑛
= ∫0 │ 𝑧
│ 𝑑𝑧 =
𝜋𝑠𝑖𝑛𝑧 2𝜋 𝑠𝑖𝑛𝑧
∫0 │ 𝑧
│ 𝑑𝑧 + ∫𝜋 │ 𝑧 │ 𝑑𝑧 + ⋯+
𝜋 𝑠𝑖𝑛𝑧
∫(𝑛−1)𝜋 │ 𝑧 │ 𝑑𝑧
𝜋 𝑠𝑖𝑛𝑧 𝜋 𝑠𝑖𝑛𝑧
Now, ∫0 │ 𝑧
│ 𝑑𝑧 = ∫0 𝑧 𝑑𝑧 ≥
𝜋 𝑠𝑖𝑛𝑧 1 𝜋
∫0 𝜋 𝑑𝑧 = 𝜋 ∫0 𝑠𝑖𝑛𝑧 𝑑𝑧
2𝜋 𝑠𝑖𝑛𝑧 𝜋 −𝑠𝑖𝑛𝑦
Now, ∫𝜋 │ │ 𝑑𝑧 = ∫0 │ │𝑑𝑦 , where
𝑧 𝜋+𝑦
𝜋 + y = z,
(ii) PD⏊ BC, PE ⏊ AC, PF ⏊AB.
𝜋 𝑠𝑖𝑛𝑦 1 𝜋 2
= ∫0 𝜋+𝑦 𝑑𝑦 ≥ ∫ 𝑠𝑖𝑛𝑦
2𝜋 0
𝑑𝑦 = 2𝜋 So, from (i) ⦟PAF = ⦟PAE = 30°,
3𝜋 𝑠𝑖𝑛𝑧
Proceeding in this way, ∫2𝜋 │ 𝑧
│𝑑𝑧 ≥ ⦟PCE = ⦟PCD = 30°, ⦟PBD= ⦟PBF= 30°.
2 𝑛𝜋 𝑠𝑖𝑛𝑧 2
, … . , ∫(𝑛−1)𝜋 │ 𝑧 │ ≥ 𝑃𝐹 1 𝐴𝐹
3𝜋 𝑛𝜋 ∴In 𝛥PAF, 𝐴𝐹 = tan 30 ° = 𝑜𝑟, 𝑃𝐹 = .
√3 √3
2 2 2 2 2 1
∴𝐼 ≥ 𝜋 + 2𝜋 + 3𝜋 + ⋯ + 𝑛𝜋 = 𝜋 (1 + 2 + ⋯ + Similarly, for 𝛥PBD, we get PD =
1 1 1
). 𝐵𝐷, 𝑎𝑛𝑑 for 𝛥PCE, we get PE= 𝐶𝐸.
𝑛 √3 √3
1
𝑃𝐷+𝑃𝐸+𝑃𝐹 (𝐵𝐷+𝐶𝐸+𝐴𝐹) 1
∴ 𝐵𝐷+𝐶𝐸+𝐴𝐹 = √3𝐵𝐷+𝐶𝐸+𝐴𝐹 = .
√3
Q9. Inside an equilateral triangle ABC, an
arbitrary point P is taken from which the As each of the PD, PE, PF can be represented
perpendiculars PD, PE and PF are dropped w.r.t. BD, CE, AF respectively, so the specified
onto the sides BC, CA and AB, respectively. ratio does not depend upon the choice of the
𝑷𝑫+𝑷𝑬+𝑷𝑭 point P.
Show that the ratio 𝑩𝑫+𝑪𝑬+𝑨𝑭 does not depend
upon the chice of the point P and find its Q10. AB is a chord of a circle C.
value.
(a) Find a point P on the circumference of C
Solution:- We have (i) AB = BC = CA & ⦟ B such that PA. PB is the maximum.
=⦟C =⦟A = 60°
(b) Find a point P on the circumference of C
[∵ 𝛥ABC is equilateral] which maximizes PA+ PB.
Solution:- (a) Let PA = x and PB = y
𝑥+𝑦 2 𝑥−𝑦 2
∴ PA.PB = xy = ( 2
) −(2
)
114
xy is maximum when x = y. Solution:-
i.e. PA = PB ⟾𝛥PAB will be an isosceles one.
Position of P:-
P will be the point of intersection of the

perpendicular bisector of AB and the circles.
𝐴𝑃 𝐵𝑃 𝐴𝐵
(b)sin 𝐵 = sin 𝐴 = sin 𝑃
𝐴𝑃 𝐴𝐵
AP = sin 𝑃 × sin 𝐵 ; 𝐵𝑃 = sin 𝑃 × sin 𝐴 ;
𝐴𝐵
∴ AP + BP = sin 𝑃 × (sin 𝐴 + sin 𝐵) =
𝐴𝐵 𝐴+𝐵 𝐴−𝐵
sin 𝑃
× 2 sin 2 cos 2 =
𝑥 𝑦
𝐴𝐵 𝑃 𝐴−𝐵 Equation of PQ: + = 1.
sin 𝑃
. 2 cos 2 cos 2 . 𝑎 𝑏
∴ bx +ay – ab = 0 ……………. (1)

∵ AB = constant, ⦟P = constant,
𝐴−𝐵 As PQ = L, so, 𝑎2 + 𝑏 2 = 𝐿2 …………….
∴AP + BP = maximum when cos 2 = (2)
maximum =1.
Equation of the line through R(a, b) and
𝐴−𝐵
⟾ 2 = 0 ⟾ 𝐴 = 𝐵 ⟾ 𝑃𝐴 = 𝑃𝐵. perpendicular to PQ is
𝑎
⟾ P lies on the point of intersection of the y-b = (𝑥 − 𝑎)
𝑏
bisector of AB.
𝑜𝑟, 𝑎𝑥 − 𝑏𝑦 − (𝑎2 − 𝑏 2 ) = 0 ……………
(3)
ISI B.STAT & B.MATH Both the lines PQ & RS meet at point S,
whose locus we are to find, the variables
being a, b, which are connected by 𝑎2 +
SOLUTIONS 𝑏 2 = 𝐿2 .
SET – 9 Solving (1) and (3), we have

𝑥 𝑦
=
−𝑎3 2
+ 𝑎𝑏 − 𝑎𝑏 2 −𝑎 𝑏 + 𝑎2 𝑏 − 𝑏 3
2
Q1. Let PQ be a line segment of a fixed length 1
=
l with its two ends P and Q sliding along the −𝑏 − 𝑎2
2
X- axis an Y-axis respectively. Complete the

𝑥 𝑦 1 1
rectangle OPRQ where O is the origin. Show ⟾ = = − = ;
−𝑎3 −𝑏 3 𝑏 2 + 𝑎2 𝐿2
that the locus of the foot of perpendicular
drawn O is the origin. Show that the locus of 1 1
⟾ 𝑎 = (𝐿2 𝑥)3 & 𝑏 = (𝐿2 𝑦)3 ;
the foot of the perpendicular drawn from R
on PQ is given by 𝒙𝟐/𝟑 + 𝒚𝟐/𝟑 = 𝑳𝟐/𝟑 .
115
1 1
⟾ 𝑎 = (𝐿2 𝑥)3 & 𝑏 = (𝐿2 𝑦)3 ; (ii) Again, y = f(x) = [x] + √{𝑥}
∵ 𝑎2 + 𝑏 2 = 𝐿2 As 0 ≤ {x} < 1, hence √{𝑥} is always real,
2 2 2 ⟾ f(x) is always real.

∴ (𝐿2 𝑥)3 + (𝐿2 𝑦)3 = (𝐿2 )3
2 2 2 ⟾ there is a 𝑥0 , ∀ 𝑦0 ∊ ℝ &𝑥0 ∊ ℝ, ∋ 𝑦0 =
∴ 𝑥 3 + 𝑦 3 = 𝐿3 which is the required locus 𝑓(𝑥0 )
of S.
Q3. A troop 5 metres long starts
Q2. Let [x] denote the largest (positive, marching. A soldier at the end of the file
negative or zero) less than or equal to x. Let
steps out and starts marching forward at
y= f(x)= [x]+ √𝒙 − [𝒙] be defined for all real
a higher speed. On reaching the head of
numbers x.
the column, he immediately turns around
(i) Sketch on plain paper, the graph of the and marches back at the same speed. As
function f(x) in the range -5 ≤ x ≤ 5. soon as he reaches the end of the file, the
troop stops marching, and it is found that
(ii) Show that, given any real number 𝒚𝟎 ,
the troop has moved by exactly 5 metres.
there is a real number 𝒙𝟎 , such that 𝒚𝟎 =
What distance has the soldier travelled?
𝒇(𝒙𝟎 ).
Solution:- Let Vel. Of troop = 𝑉𝑡
Solution:- y = f(x) = [x] + √𝑥 − [𝑥] = [x] +
√{𝑥} Vel. Of soldier = 𝑉𝑠
(i) We know 0 ≤ {x} < 1 Now, distance travelled by troop, when the
soldier reached that point = x m.
⟾√{𝑥} ≥ {𝑥}
𝑥 𝑑𝑖𝑠𝑡𝑎𝑛𝑐𝑒
∴ Time taken = 𝑉 = .
⟾[x] + √{𝑥}≥ [x] + {x} 𝑡 𝑣𝑒𝑙𝑜𝑐𝑖𝑡𝑦
⟾ f(x) ≥ x So, distance traveled by soldier = length of

troop + x = x+ 5
‘=’ holds when x takes integral values.
𝑥+5
∴ Time taken = .
𝑉𝑠
𝑥 𝑥+5 𝑉 𝑥+5
Given that 𝑉 = ⤇ 𝑉𝑠 =
𝑡 𝑉𝑠 𝑡 𝑥
…………….(i)
Again, the soldier retreated x units.

𝑥
∴ Time taken by him to retreat = 𝑉
𝑠
The troop travelled = {10 – (5+ x)}m = (5-

x)m.
116
∴ Time taken by them to travel=

5−𝑥 When ‘n’ is not a perfect square, then let
𝑉𝑡
𝑝
𝑥 5−𝑥 √𝑛 is a rational number= 𝑞 , where gcd (p, q)= 1.
So, by the question, we have 𝑉 =
𝑠 𝑉𝑡
𝑝2
𝑉𝑠 𝑥
i.e. n = 𝑞2
⤇𝑉 = 5−𝑥 ……………. (ii)
𝑡
∵p and q are relatively prime to each
Equating (i) and (ii), we have other, 𝑝2 𝑎𝑛𝑑 𝑞 2 should be relatively prime to
𝑝2
𝑥+5 𝑥 each other and 𝑞2 can’t be an integer. Hence, √𝑛
= 5−𝑥
𝑥
is not a rational number.
5
⤇x= . Q6. Show that 𝟐𝟐𝒏 − 𝟑𝒏 − 𝟏 is divisible by 9
√2
for all n ≥ 1.
∴ The soldier travelled = 5+ x+ x= (5+ 5√2)
Solution:-
m.
22𝑛 − 3𝑛 − 1 = 4𝑛 − 3𝑛 − 1
Q4. Given m identical symbols, say H’s, show
that the number of ways in which you can = (1 + 3)𝑛 − 3𝑛 − 1
distribute them in k boxes marked 1, 2, …, k,
= {1 + 3𝑛 + 9. 𝑛𝑐2 + ⋯ + 3𝑛 } − 3𝑛 − 1
so that no box goes empty is (𝒎−𝟏
𝒌−𝟏
).
= 9(𝑛𝑐2 + 3. 𝑛𝑐3 + ⋯ + 3𝑛−2 )
Solution:-
i.e., 22𝑛 − 3𝑛 − 1 is divisible by 9 ∀ 𝑛 ≥ 1.
(a) Put 1 ball in each box, so we have m-x
identical balls to be distributed in k boxes. Q7. Find the set of all values of m such that y
𝒙𝟐 −𝒙
Let, the jth box got i j balls out of (m - k) balls, = 𝟏−𝒎𝒙 can take all real values.
where j = 1, 2, 3, …, k; 0 ≤ i, j ≤ m- k.
Solution:-
So, we need to find the no. of solutions of the
equation 𝑖1 + 𝑖2 + ⋯ + 𝑖𝑘 = 𝑚 − 𝑘, where each 𝑥2 − 𝑥
𝑦=
i j is non-negative integers. 1 − 𝑚𝑥
∴ Total number f solutions = coefficient of ⟾ 𝑦 − 𝑚𝑥𝑦 = 𝑥 2 − 𝑥

𝑥 𝑚−1 in (1 − 𝑥)−𝑘 ⟾ 𝑥 2 + (𝑚𝑦 − 1)𝑥 − 𝑦 = 0
𝑚−1
= ( ). ∴ (𝑚𝑦 − 1)2 + 4𝑦 ≥ 0 [∵ 𝑥 𝑖𝑠 𝑟𝑒𝑎𝑙]
𝑘−1
⟾ 𝑚2 𝑦 2 + (4 − 2𝑚)𝑦 + 1 ≥ 0
Q5. Show that for every positive integer n, √𝒏
is either an integer or an irrational number. ∴ (4 − 2𝑚)2 − 4𝑚2 ≥ 0 [∵ 𝑦 𝑖𝑠 𝑟𝑒𝑎𝑙]
Solution:- ⟾ (2 − 𝑚)2 − 𝑚2 ≥ 0
When ‘n’ is perfect square, ⟾ 2 − 2𝑚 ≥ 0 ⟾ 𝑚 ≤ 1.
Then √𝑛 is an integer.
117
Q9. Let X be a point on a straight line

segment AB such that AB.BX = A𝑿𝟐 . Let C
Q8. If A, B, C are the angles of a triangle, be a point on the circle with centre at A and
𝟑
then show that sin A + sin B - cos C ≤ 𝟐. radius AB such that BC = AX. Show that the
angle BAC= 36°.
Solution:-
Solution:- Let, a = radius of the circle,
Sin A + sin B –sin C = Sin A + sin B-sin
𝛱
( 2 − 𝑐) AX = x = BC. Since, AB. BX = A𝑋 2 ,
⟾ a (a -x) = 𝑥 2 ⟾𝑎2 − 𝑎𝑥 − 𝑥 2 = 0,
𝛱
= sin 𝐴 + sin 𝐵 + sin (𝐶 − )
2 𝑥 2 𝑥
⟾ ( ) + − 1 = 0,
𝑎 𝑎
𝛱
= sin 𝐴 + sin 𝐵 + sin 𝐷 , 𝐷=𝐶− .
2 𝑥 −1+√5
∴𝑎 = 2
.
𝛱
𝑁𝑜𝑤, 𝐴 + 𝐵 + 𝐶 = 𝛱; ∴ 𝐴 + 𝐵 + 𝐶 − 𝜃 𝜃 𝑥 −1+√5
2 Now, x = BC = 2a sin ∴ sin = = =
𝛱 2 2 2𝑎 4
=𝐴+𝐵+𝐷 = . sin 18°
2
𝜃
Let, f(x)= sin x, we plot its graph such that ⟾ = 18° ⟾ 𝜃 = 36°
2
𝛱
taking the abscissa A, B, D as 𝐴 + 𝐵 + 𝐷 = 2 ,
𝛱
⟾⦟BAC= 36°.
or, plotting in the interval [0, 2 ]
∴ Centroid of 𝛥PQR≡G≡
𝐴+𝐵+𝐷 sin 𝐴+sin 𝐵+sin 𝐷 Q10. Let a, b, c, d be positive real numbers
( , )
3 3 such that abcd = 1. Show that (1+ a)(1+ b)(1+
c)(1+ d)≥ 16.
We take a point f(x) = sin x, such that it is of the
same abscissa that of G, but of greater ordinate. 1+𝑎 1+𝑏 1+𝑐
Solution:- 2
≥ √𝑎, 2
≥ √𝑏, 2
≥ √𝑐,
𝐴+𝐵+𝐷 𝐴+𝐵+𝐷 1+𝑑
∴M≡( , 𝑠𝑖𝑛 3 ) 2
≥ √𝑑.
3
∴ Ordinate of G < ordinate of M, Multiplying corresponding sides of the above

inequalities, we have,
sin 𝐴+sin 𝐵+sin 𝐷 𝐴+𝐵+𝐷
⟾ 3
< 𝑠𝑖𝑛 3
,
(1+ a) (1+ b) (1+c) (1+d) ≥ 16 √𝑎𝑏𝑐𝑑 ≥ 16.
3
Or, sin 𝐴 + sin 𝐵 + sin 𝐷 < 2
.
𝛱
When A, B, D are not distinct, i.e., A= B=D= 6 ,
equality holds. ⟾ sin 𝐴 + sin 𝐵 + sin 𝐷 ≤
3 3
2
, sin 𝐴 + sin 𝐵 − cos 𝐶 ≤ 2.
118
ISI B.STAT & B.MATH 𝑑𝑛 1 −1

= (𝑓(𝑡)) = 𝑃𝑛 ( ) 𝑒 𝑡;
𝑑𝑡 𝑛 𝑡
SOLUTIONS 𝑑𝑛+1 𝑑 1 −
1
𝑓(𝑡) = {𝑃𝑛 ( )} . 𝑒 𝑡
𝑑𝑡 𝑛+1 𝑑𝑡 𝑡
1 1 1
SET – 10 + 𝑒 −𝑡 ( 2 ) . 𝑃 ( )
𝑡 𝑡
1 1 𝑑 𝑛+1
Q1. For a real number x, let [x] denote the 𝑁𝑜𝑤, 𝑃𝑛+1 ( ) = 𝑒 𝑡 . 𝑛+1 . 𝑓(𝑡)
𝑡 𝑑𝑡
largest integer less than or equal to x and <x>
denote x – [x]. Find all the solutions of the
1 𝑑 1 −
1
−
1 1 1
= 𝑒𝑡 [ {𝑃𝑛 ( )} . 𝑒 𝑡 + 𝑒 𝑡 ( 2 ) 𝑃𝑛 ( )]
equations 13[x] +25 <x> = 271. 𝑑𝑡 𝑡 𝑡 𝑡
𝑑 1 1 1
Solution:- = [𝑃𝑛 ( )] + 2 𝑃𝑛 ( ).
𝑑𝑡 𝑡 𝑡 𝑡
13 [x] + 25 〈x〉 = 271 1 𝑑 𝑑𝑡
Let us put 𝑡 = x, 𝑃𝑛+1 (𝑥) = 𝑑𝑥 {𝑃𝑛 (𝑥)} / 𝑑𝑥 +
271−13[𝑥]
or, 〈x〉 = 25
, 𝑥2.
𝑑
We know 0 ≤ 〈x〉 <1, ∴ 𝑃𝑛 (𝑥) = 𝑥 2 𝑃𝑛 (𝑥) − 𝑥 2 𝑑𝑥 {𝑃𝑛 (𝑥)} =
𝑑
⟾0≤
271−13[𝑥]
<1 𝑥 2 (𝑃𝑛 (𝑥) − 𝑑𝑥 𝑃𝑛 (𝑥)).
25
⟾ 13[x] - 271 > -25 Q3. Study the derivative of the function f(x) =
𝒙𝟑 − 𝟑𝒙𝟐 + 𝟒, and roughly sketch the graph
⟾ [x] > 18. 9 of f(x), on plain paper.
The nearest integers in this interval are 19 and Solution:- 𝑓(𝑥) = 𝑥 3 − 3𝑥 2 + 4
20.
𝑓 ′ (𝑥) = 3𝑥 2 − 6𝑥 = 3𝑥(𝑥 − 2)
271−13×19
Putting [x] = 19, 〈x〉 = 25
= 0.96
f’(x) > 0 for -∞ ,x < 0
271−13×20
Putting [x] =n 20, 〈x〉 = 25
= 0.44 f’(x) < 0 for 0< x < 2
∴ x = 19.96, 20.44 (Answer) f’(x) > 0 for 2 < x< ∞

𝟏
Q2. Consider the function f(t) = 𝒆− 𝒕 . 𝒕 > 0. x -2 -1 0 1 2 3
Let for each positive integer n, 𝒑𝒏 be the f(x) -16 0 4 2 0 4
𝟏
𝒅𝒏 𝟏
polynomial such that 𝒅𝒕𝒏 𝒇(𝒕) = 𝑷𝒏 ( 𝒕 ) 𝒆− 𝒕 for
all t > 0. Show that
𝒅
𝑷𝒏+𝟏 (𝒙) = 𝒙𝟐 (𝑷𝒏 (𝒙) − 𝑷 (𝒙)).
𝒅𝒙 𝒏
Solution:- f(t) = 𝑒 −1/𝑡 , 𝑡 > 0
119
Q5. (i) Find the number of all possible

ordered k- tuples of non-negative integers
(𝒏𝟏 , 𝒏𝟐 , … , 𝒏𝒌 ) such that ∑𝒌𝒊=𝟏 𝒏𝒊 = 𝟏𝟎𝟎.
(ii) Show that the number of all possible

ordered 4- tuples of non-negative integers
(𝒏𝟏 , 𝒏𝟐 , 𝒏𝟑 , 𝒏𝟒 ) such that ∑𝟒𝒊=𝟏 𝒏𝒊 ≤
𝟏𝟎𝟎 𝒊𝒔 (𝟏𝟎𝟎
𝟒
).
Solution:-
(i) Let S = {𝑛1 , 𝑛2 , … , 𝑛𝑘 } be a set with k distinct

elements. Given 𝑛𝑖 ≥ 0 𝑎𝑛𝑑 ∑𝑘𝑖=1 𝑛𝑖 = 100.
Q4. Study the derivative of the function So, total number of all possible ordered k –
tuples of such kinds are = (𝑘−1+100 ).
f(x) = 𝐥𝐨𝐠 𝒆 𝒙 − (𝒙 − 𝟏), 𝒇𝒐𝒓 𝒙 > 0, and 100
roughly sketch the graph of f(x), on plain

(ii)Here k = 4, and ∑𝑘𝑖=1 𝑛𝑖 ≤ 100
paper.
So, no. of such possible cases are = (4−1+101
4
)=
Solution:-
(104
4
).
𝑓(𝑥) = log 𝑒 𝑥 − (𝑥 − 1), 𝑓𝑜𝑟 𝑥 > 0.
Q6. Let P be the fixed point (3, 4) and Q the
1 1−𝑥
𝑓 ′ (𝑥) = − 1 = ; point (x, √𝟐𝟓 − 𝒙𝟐 ). If M(x) is the slope of the
𝑥 𝑥
line PQ, find 𝐥𝐢𝐦 𝑴(𝒙).
𝒙→𝟑
𝑓 ′ (𝑥) > 0 𝑓𝑜𝑟 0 < 𝑥 < 1
Solution:-
′ (𝑥)
𝑓 < 0 𝑓𝑜𝑟 1 < 𝑥 < ∞
P(3, 4); Q (x, √25 − 𝑥 2 )
x 0.5 1 2 3
f(x) 0.2 0 -0.7 -1.5 𝑦 −𝑦 √25−𝑥 2 −4
Slope, M(x)= 𝑥 1− 𝑥2 = 𝑥−3
1 2
√25−𝑥 2 −4
Now, lim 𝑀(𝑥) = lim
𝑥→3 𝑥→3 𝑥−3
3
= − 4 [Do yourself applying L’Hospital Rule]
𝟐𝟓 𝟔
Q7. Solve 𝟔𝒙𝟐 − 𝟐𝟓𝒙 + 𝟏𝟐 + + 𝟐 = 𝟎.
𝒙 𝒙
Solution:-
25 6
6𝑥 2 − 25𝑥 + 12 + 𝑥
+ 𝑥 2 = 0;
6 25
⟾ 6𝑥 2 + 12 + 2
− 25𝑥 + =0
𝑥 𝑥
120
6 25 (1 + 𝑥)𝑛+1 𝑛𝑐1 𝑥 2
⟾ 6𝑥 2 − 12 + 2
− 25𝑥 + + 24 = 0 = 𝑛𝑐0 𝑥 + +⋯
𝑥 𝑥 𝑛+1 2
1 2 1 𝑛𝑐𝑛 𝑥 𝑛+1
⟾ 6 (𝑥 − ) − 25 (𝑥 − ) + 24 = 0 + + 𝑐𝑜𝑛𝑠𝑡𝑎𝑛𝑡
𝑥 𝑥 𝑛+1
1 1
Let, 𝑥 − 𝑥 = 𝑦; so, 6𝑦 2 − 25𝑦 + 24 = 0 Putting x = 0, then constant = 𝑛+1.
25±√625−576 8 3 (1+𝑥)𝑛+1 𝑛𝑐1 𝑥 2

⟾y= = 3 𝑜𝑟 2. So, = 𝑛𝑐0 𝑥 + +⋯+
2×6 𝑛+1 2
𝑛𝑐𝑛 𝑥 𝑛+1 1
When y =
8
,𝑥 =
1
3 𝑜𝑟 3,
+ 𝑛+1.
𝑛+1
3
3 1 (1 + 𝑥)𝑛+2
For y = 2 , 𝑥 = 2 𝑜𝑟 − 2.
(𝑛 + 1)(𝑛 + 2)
𝑛𝑐0 𝑥 2 𝑛𝑐1 𝑥 3
= + + …
1.2 2.3
Q8. (i) In the identity 𝑛𝑐𝑛 𝑥 𝑛+2 𝑥
+ +
𝒏! (𝑛 + 1)(𝑛 + 2) 𝑛 + 1
𝒙(𝒙 + 𝟏)(𝒙 + 𝟐) … (𝒙 + 𝒏) + 𝑐𝑜𝑛𝑠𝑡𝑎𝑛𝑡 .
𝒏
𝑨𝒌 1
= ∑ , Putting x= 0, then constant = (𝑛+1)(𝑛+2).
𝒙+𝒌
𝒌=𝟎
(1+𝑥)𝑛+2 𝑛𝑐0 𝑥 2 𝑛𝑐1 𝑥 3
Prove that 𝑨𝒌 = (−𝟏)𝒌 (𝒏𝒌) . So, (𝑛+1)(𝑛+2) = + + …+
1.2 2.3
𝑛𝑐𝑛 𝑥 𝑛+2 𝑥 1
𝟏 𝟏 + 𝑛+1 + (𝑛+1) (𝑛+2).
(ii) Deduce that:(𝒏𝟎) 𝟏.𝟐 − (𝒏𝟏) 𝟐.𝟑 + (𝑛+1)(𝑛+2)
𝟏 𝟏 𝟏
(𝒏𝟐) 𝟑.𝟒 − … + (−𝟏)𝒏 (𝒏𝒏) (𝒏+𝟏)(𝒏+𝟐) = 𝒏+𝟐 Putting x= -1, we get
𝑛𝑐0 𝑛𝑐1 𝑛𝑐2 𝑛𝑐
Solution:- 0= − + … + (−1)𝑛 (𝑛+1)(𝑛+2)
𝑛
−
1.2 2.3 3.4
1 1
(i) From n! = ∑𝑛𝑘=0 𝐴𝑘 (𝑥 + 1)(𝑥 + + (𝑛+1)(𝑛+2)
.
(𝑛+1)
2) … (𝑥 + 𝑘 − 1)(𝑥 + 𝑘 + 1) … (𝑥 + 𝑛) 1 1 1
So, (𝑛0) 1.2 − (𝑛1) 2.3 + (𝑛2) 3.4 + ⋯ +
Putting x = - k, 1 1
(−1)𝑛 (𝑛𝑛) (𝑛+1)(𝑛+2) = 𝑛+2. (Proved)
n! = ∑𝑛𝑘=0(−1)−𝑘 𝐴𝑘 . 𝑘! (𝑛 − 𝑘)!
⤇ 𝐴𝑘 = (−1)𝑘 (𝑛𝑘).
Q9. A regular five pointed star is inscribed in
𝑛 a circle of radius r. Show that the area of the
(ii)Considering (1 + 𝑥) = 𝑛𝑐0 + 𝑛𝑐1 𝑥 +
𝝅
𝟏𝟎𝒓𝟐 𝐭𝐚𝐧( )
𝑛𝑐2 𝑥 2 + ⋯ + 𝑛𝑐𝑛 𝑥 𝑛 . region inside the star is 𝟏𝟎
𝝅 .
𝟑−𝒕𝒂𝒏𝟐 ( )
𝟏𝟎
Integrating w.r.t.x, we have

Solution:-
121
Suppose, O be the centre of the circle which lies Q10. For the following function f study its
in the star and whereas ⦟MOL = 𝜃, so, ⦟LAM = derivatives and use them to sketch its graph
𝜃 on plain paper:
2
.
𝒙−𝟏 𝒙+𝟏
Here 5. R. 𝜃 = 2𝜋r f(x) = 𝒙+𝟏 + 𝒙−𝟏 for x ≠ -1, 1.
2𝜋 𝑥−1 𝑥+1
∴𝜃= Solution:- f(x) = 𝑥+1 + 𝑥−1 [𝑓𝑜𝑟 𝑥 ≠ 1, 𝑥 ≠
5
2(𝑥 2 +1) 4 −8𝑥
From 𝛥OAL, −1] = (𝑥 2 −1)
= 2 + 𝑥 2 −1. ∴ 𝑓 ′ (𝑥) = (𝑥 2 −1)2 .
𝜋
⦟AOL = 2 5 ⟹ 2 = 5 .
1 𝜋 For, −∞ < 𝑥 < −1, 𝑓 ′ (𝑥)𝑖𝑠 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒;
1 𝜋 For, -1 < x < 0, 𝑓 ′ (𝑥) is positive;

⦟LAO= 2 ⦟𝐴𝑂𝐿 = 10
For, 0 < x <1, 𝑓 ′ (𝑥) is negative;
⦟OLA = 𝜋- (⦟AOL+⦟LAO)
For, 1< x < ∞, 𝑓 ′ (𝑥) is negative.
𝜋 𝜋 7𝜋
= 𝜋- ( + ) =
5 10 10
Let, AL = a, OL = b & OA= R (given)

x -3 -2 0 - ½ ½ 2 3
𝑎 𝑏 𝑅 f(x) 1 1 - 1 1 1 2
∴ From 𝛥 OAL, we have, 𝜋 = 𝜋 = 7𝜋
22 33 -33 33 33
sin
5
sin
10
sin
10
2
𝜋 𝜋
sin sin
5 10
∴a=R 7𝜋 &𝑏 =𝑅 7𝜋
sin sin
10 10
1 7𝜋 1
Thus area of 𝛥AOL = 2 𝑎𝑏 sin 10 = 2 𝑅 2
𝜋 𝜋
sin sin 10 𝜋
5 × sin 7
𝜋 10
𝑠𝑖𝑛2 7 10
1 𝜋 𝜋 𝜋
= 𝑅 2 2 sin cos sin
2 10 10 10
𝜋 𝜋
7𝜋 𝜋 𝑅 2 𝑠𝑖𝑛2 10 cos 10
[∵ sin = sin 3 ] =
10 10 𝜋 3𝜋
3 sin − 4 sin
10 10
2 𝜋
𝑅 tan 10
= 𝜋
3 − 𝑡𝑎𝑛2 10
𝜋 𝜋
[Dividing 𝑁 𝑟 & 𝐷 𝑟 by sin 10 𝑐𝑜𝑠 2 10]
𝜋
10𝑅2 tan
10
Hence, required area of the star = 𝜋
3−𝑡𝑎𝑛2
10
[proved]
122
PROBLEMS WITH SOLUTIONS FOR Similarly O, N, 𝑂2 are collinear and BN / NC =

OM / N𝑂2 = 𝑟 /𝑟2 .
I.S.I. / C.M.I. ENTRANCE TESTS
Let P be the intersection of l with AB; the lines
AN, BM, CP concur at the orthocenter of ABC,
so by Ceva’s theorem.
1. Prove that for all natural numbers n ≥ 3
there exist odd natural numbers 𝒙𝒏 , 𝒚𝒏 AP / PB = (AM / MC) (CN / NB)= 𝑟2 /𝑟1. Now let
such that 𝟕𝒙𝒏 𝟐 + 𝒚𝒏 𝟐 = 𝟐𝒏 . 𝐷1 𝑎𝑛𝑑 𝐷2 be the intersections of l with
𝐶𝐷1 𝑂1 𝐶
Sol: For n = 3, we have 𝑥3 = 𝑦3 = 1. Now 𝐵𝑂1 𝑎𝑛𝑑 𝐴𝑂2 . Then 𝐷 𝑃
= 𝑃𝐵 =
1
𝑟1 𝐶𝐷 𝑟2 𝐶𝐷
suppose that for a given natural number n we , 𝑎𝑛𝑑 𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝐷 𝑃2 = 𝑃𝐴 . Thus 𝐷 𝑃1 =
𝑃𝐵 2 1
have odd natural numbers 𝑥𝑛 , 𝑦𝑛 such that 𝐶𝐷2
𝑎𝑛𝑑 𝐷1 = 𝐷2 , and so 𝐴𝑂2 , 𝐵𝑂1 , 𝑙 have a
7𝑥𝑛2 + 𝑦𝑛2 = 2𝑛 we shall exhibit a pair (X, Y) 𝐷2 𝑃
such that 7𝑋 2 + 𝑌 2 = 2𝑛 we shall exhibit a pair common point.

(X, Y) such that 7𝑥𝑛 2 + 𝑦𝑛 2 = 2𝑛+1 . In fact,
3. Let a, b, c be real numbers and let M be
𝑥𝑛 ± 𝑦𝑛 2 7𝑥𝑛 ± 𝑦𝑛 2 the maximum of the function 𝒚 = │𝟒𝒙𝟑 +
7( ) +( ) = 2(7𝑥𝑛 2 + 𝑦𝑛 2 )
2 2 𝒂𝒙𝟐 + 𝒃𝒙 + 𝒄│ in the interval │-1, 1│.
= 2𝑛+1 Show that M ≥ 1 and find all cases where
equality occurs.
(𝑥𝑛 + 𝑦𝑛 ) │𝑥𝑛 −𝑦𝑛 │
One of 2
𝑎𝑛𝑑 2
is odd (as their
Sol.: a = 0, b = -3, c = 0, where M = 1, with the
sum is the larger of 𝑥𝑛 𝑎𝑛𝑑 𝑦𝑛 which is odd),
maximum achieved at -1, -1/2, ½ , 1. On the
giving the desired pair.
other hand, if M < 1 for some choice of a, b, c,
2. The circles 𝒌𝟏 𝒂𝒏𝒅 𝒌𝟐 with respective then
centers 𝑶𝟏 𝒂𝒏𝒅 𝑶𝟐 are externally tangent
(4𝑥 3 + 𝑎𝑥 2 + 𝑏𝑥 + 𝑐) − (4𝑥 3 + 3𝑥)
at the point C, while the circle k with
center O is externally tangent 𝒌𝟏 𝒂𝒏𝒅 𝒌𝟐 . Must be positive at -1, negative -1/2, positive at
Let l be the common tangent of 𝒌𝟏 𝒂𝒏𝒅 𝒌𝟐 ½, and negative at 1, which is impossible for a
at the point C and let AB be the diameter quadratic function. Thus M ≥ 1, and the same
of k perpendicular o l. Assume that O and argument shows that equality only occurs for
A lie on the same side of l. Show that that (a, b, c) = (0, -3, 0). (Note: this is a particular
the lines 𝑨𝑶𝟐 , 𝑩𝑶𝟏 , 𝒍 have a common case of the minimum deviation property of
point. Chebyshev polynomials).
Sol.: Let 𝑟, 𝑟1 , 𝑟2 be the respective radii of 4. The real numbers 𝒂𝟏 , 𝒂𝟐 , … , 𝒂𝒏 (𝒏 ≥ 𝟑)
𝑘, 𝑘1 , 𝑘2 . Also let M and N be the intersections from an arithmetic progression. There
of AC and BC with k. Since AMB is a right exists a permutation
triangle, the triangle AMO is isosceles and 𝒂𝒊𝟏 , 𝒂𝒊𝟐 , … , 𝒂𝒊𝒏 𝒐𝒇 𝒂𝟏 , 𝒂𝟐 , … , 𝒂𝒏 which is a
geometric progression. Find the numbers
∠𝐴𝑀𝑂 = ∠𝑂𝐴𝑀 = ∠𝑂1 𝐶𝑀 = ∠𝐶𝑀𝑂1
𝒂𝟏 , 𝒂𝟐 , … 𝒂𝒏 if they are all different and the
Therefore 𝑂, 𝑁, 𝑂1 are collinear and AM / MC = largest of them as equal to 1996.
OM / M𝑂1 = 𝑟/𝑟1
123
Sol.: Let 𝑎1 < 𝑎2 < −< 𝑎𝑛 = 1996 and let q So p = 3, suppose p, q ≠3; then p│5𝑞 − 2𝑞
be the ratio of the geometric progression and q│5𝑝 − 2𝑝 . Without lose of generality
𝑎𝑖1 … … … 𝑎𝑖𝑛 ; clearly q≠ 0 ± 1. By reversing assume p >q, so that (p, q -1) = 1. Then if a is
the geometric progression if needed, we may an integer such that 2a ≡5 (mod q), then the
assume |q| > 1, and so |𝑎𝑖1 |< |𝑎𝑖2 | < −|𝑎𝑖𝑛 |. order of a mod q divides p as well as q -1, a
Note that either all of the terms are positive, or contradiction.
they alternate in sign; in the latter case, the
Hence one of p, q is equal to 3. If q ≠ 3, then
terms of either sign form a geometric
q│53 − 23 = 9.13. so q = 13, and similarly p
progression by themselves. ∊(3, 13).
There cannot be three positive terms, or else Thus the solutions are (p, q) = (3, 3), (3, 13),
we would have a three term geometric (13, 3).
progression a, b, c which is also an arithmetic
progression, violating the AM –GM inequality. 6. Find the side length of the smallest
equilateral triangle in which three dises of
Similarly, there cannot be three negative terms, radii 2, 3, 4 can be placed without overlap.
so there are at most two terms of each sign and
n ≤4. Sol.: A short computation shows that dises of
radii 3 and 4 can be fit into two corners of an
If n = 4, we have 𝑎1 < 𝑎2 < 0 < 𝑎3 < equilateral triangle of side 11√3 so as to just
𝑎4 𝑎𝑛𝑑 2𝑎2 = 𝑎2 + 𝑎3 , 2𝑎3 = 𝑎2 + 𝑎4 . In this touch, and that a disc of radius 2 easily fits into
case, q < -1 and the geometric progression is the third corner without overlap. On the other
either 𝑎3 , 𝑎2 , 𝑎4 , 𝑎1 𝑜𝑟 𝑎2 , 𝑎3 , 𝑎1 , 𝑎4 . Suppose hand, if the discs of radii 3 and 4 fit into an
the former occurs (the argument in similar in equilateral triangle without overlap, there exists
the latter case): then a line separating them (e.g. a tangent to one
2𝑎3 𝑞 = 𝑎3 𝑞 3 + 𝑎3 𝑎𝑛𝑑 2𝑎3 + 𝑎3 𝑞 3 + 𝑎3 𝑞 2, perpendicular to their line of centers) dividing
giving q =1, a contradiction. the triangle into a triangle and a (possibly
degenerate) convex quadrilateral. Within each
We deduce n = 3 and consider two possibilities. piece, the disc can be moved into one of the
If 𝑎1 < 𝑎2 < 0 < 𝑎3 = 1996, 𝑡ℎ𝑒𝑛 2𝑎2 = corners of the original triangle. Thus the two
𝑎2 𝑞 2 + 𝑎2 𝑞, so 𝑞 2 + 𝑞 − 2 = 0 𝑎𝑛𝑑 𝑞 = −2, discs fit into the corners without overlap, so the
yielding (𝑎1 , 𝑎2 , 𝑎3 ) = (−3992, −998, 1996). If side length of the triangle must be at least
𝑎1 < 0 < 𝑎2 < 𝑎3 = 1996, then 11√3.
2𝑎2 = 𝑎2 𝑞 + 𝑎2 𝑞2 , so again q = -2, yielding 7. The equilateral ABCD is inscribed in a

(𝑎1 , 𝑎2 , 𝑎3 ) = (−998, 499, 1996). circle. The lines AB and CD meet at E, while
the diagonals AC and BD meet at F. The
5. Find all prime numbers p, q for which pq
circumcircles of the triangles AFD and BFC
divides (𝟓𝒑 − 𝟐𝒑 )(𝟓𝒒 − 𝟐𝒒 ).
meet again at H. Prove that ∠EHF= 90°.
Sol.: If p│5𝑝 − 2𝑝 , 𝑡ℎ𝑒𝑛𝑝│5 -2 by Fermat’s
Sol.: (We use directed angles modulo 𝜋.) Let O
theorem,
be the circumcenter of ABCD; then ∠AHB=
∠AHF+∠FHB=∠ADF+∠FCB= 2∠ADB=
124
∠AOB, so O lies on the circumcircle of AHB, are disjoint and none contains the center
and similarly on the circumcircle of CHD. The square, so each contains one colored
radical axes of the circumcircles of AHB, CHD square. In particular, (2, 2) and (2, 4) are not
and ABCD concur; these lines are AB, CD and colored. Replacing (3, 3) with (2, 3) in the
HO, so E, H, O are collinear. Now note that list shows that (3, 2) and (3, 4) are not
𝜋
∠OHF = ∠OHC+∠CHF= ∠ODC+∠CBF = 2 − colored. Similar symmetric arguments now
𝜋
∠𝐶𝐴𝐷 + ∠𝐶𝐵𝐷. 𝑆𝑜 ∠𝐸𝐻𝐹 = ∠𝑂𝐻𝐹 = as show that no squares beside the center
2
desired. (Compare IMO 1985/5.) square can be covered, a contradiction.
Thus 7 squares are needed.
8. A 𝟕 × 𝟕 chessboard is given with its four
corners deleted. (a) Write -5 in the 7 squares listed above
(a) What is the smallest number of and 1 in the remaining squares. Then
squares which can be colored black so clearly each cross has a negative sum,
that an uncolored 5 squares (Greek) but the total of all of the numbers is 5
cross cannot be found? (−7) + (45 -7) = 3.
(b) Prove that an integer can be written in 9. If 𝛼, 𝛽, 𝛾 are the roots of 𝒙𝟑 − 𝒙 − 𝟏 = 𝟎,
𝟏−𝜶 𝟏−𝜷 𝟏−𝜸
each square such that the sum of the compute 𝟏+𝜶 + 𝟏+𝜷 + 𝟏+𝜸.
integers in each 5 squares cross is
negative while the sum of the Sol.: The given quantity equals
numbers in all squares of the board is
1 1 1
positive. 2( + + ) − 3.
𝛼+1 𝛽+1 𝛾+1
Sol.: The 7 squares
Since 𝑃(𝑥) = 𝑥 3 − 𝑥 − 1 has roots 𝛼, 𝛽, 𝛾, the
(2, 5), (3, 2), (3, 3), (4, 6), (5, 4), (6, 2), (6, 5) polynomial 𝑃(𝑥 − 1) = 𝑥 3 − 3𝑥 2 + 2𝑥 − 1
has roots 𝛼+1, 𝛽+1, 𝛾+1.
suffice, so we need only show that 6 or fewer
will not suffice. The crosses centered at By a standard formula, the sum of the
reciprocals of the roots of 𝑥 3 + 𝑐2 𝑥 2 + 𝑐1 𝑥 +
(2, 2), (2, 6), (3, 4), (5, 2), (5, 6), (6, 4) 𝑐0 𝑖𝑠 − 𝑐1 /𝑐0, so the given expression equals
2(2)-3= 1.
are disjoint, so one square must be colored in
each, hence 5 or fewer squares do not suffice. 10. Find all real solution to the following
Suppose exactly 6 squares are colored. Then system of equations:
none of the squares (1, 3), (1, 4), (7, 2) can be 𝟒𝒙𝟐
=𝒚
colored; by a series of similar arguments, no 𝟏 + 𝟒𝒙𝟐
𝟒𝒚𝟐
square on the perimeter can be colored. =𝒛
𝟏 + 𝟒𝒚𝟐
Similarly, (4, 3) and (4, 5) are not covered, and
𝟒𝒛𝟐
by a similar argument, neither is (3, 4) or (5, 4). = 𝒙.
𝟏 + 𝟒𝒛𝟐
Thus the center square (4, 4) must be covered.
4𝑥 2
Sol.: Define 𝑓(𝑥) = (1+4𝑥2 ) ; the range of f is [0,
Now the crosses centered at
1), so x, y, z must lie in that interval. If one of x,
(2, 6), (3, 3), (5, 2), (5, 6), (6, 4) y, z is zero, then all three are, so assume they
125
are nonzero. Then

𝑓(𝑥) 4𝑥
= (1+4𝑥2 ) is at least 1 sin 𝛼 sin 𝛼 sin 𝛽
𝑥 𝐵𝐶 = , 𝐵𝐷 = , 𝐴𝐷 = .
sin 2𝛽 sin 3𝛽 sin 3𝛽
but the AM –GM inequality, with equality for x
= ½ . Therefore x ≤y ≤ z ≤ x, and so equality Thus we are seeking a solution to the equation
holds everywhere, implying x = y = z = ½ . Thus sin(𝜋 − 4𝛽) sin 3𝛽 = (sin(𝜋 − 4𝛽) +
the solutions are (x, y, z) = (0, 0, 0), (½ , ½ , ½ ). sin 𝛽) sin 2𝛽.
11. Let f(n) be the number of permutations Using the sum-to-product formula, we rewrite
𝒂𝟏 , … , 𝒂𝒏 of the integers 1, …, n such that this as
(i) 𝒂𝟏 = 𝟏;
cos 𝛽 − cos 7𝛽 = cos 2𝛽 − cos 6𝛽 + cos 𝛽
(ii) │𝒂𝒊 − 𝒂𝒊+𝟏 │ ≤ 𝟐, 𝒊 = 𝟏, … , 𝒏 − 𝟏.
− cos 3𝛽.
Determine whether f(1996) is divisible by
Cancelling cos 𝛽, we have cos 3𝛽 − cos 7𝛽 =
3.
cos 2𝛽 − cos 6𝛽, which implies
Sol.: Let g(n) be the number of permutations of
sin 2𝛽 sin 5𝛽 = sin 2𝛽 sin 4𝛽.
the desired form with 𝑎𝑛 = 𝑛. Then either
𝜋
𝑎𝑛−1 = 𝑛 − 1 𝑜𝑟 𝑎𝑛−1 = 𝑛 − 2; in the latter Now sin 5𝛽 = sin 4𝛽 , 𝑠𝑜 9𝛽 = 𝜋 𝑎𝑛𝑑 𝛽 = 9 .
case we must have 𝑎𝑛−2 = 𝑛 − 1 𝑎𝑛𝑑 𝑎𝑛−3 =
𝑛 − 3. Hence g(n) = g(n-1) + g(n -3) for n ≥4. In 13. Let 𝒓𝟏 , 𝒓𝟐 , … , 𝒓𝒎 be a given set of positive
particular, the values of g(n) modulo 3 are g(1) = rational numbers whose sum is 1. Define
1, 1, 1, 2, 0, 1, 0, 0….. repeating with period 8. the function f by 𝒇(𝒏) = 𝒏 −
∑𝒎𝒌=𝟏 ⎿⌊𝒓𝒌 𝒏⌋⏌ for each positive integer n.
Now let h(n) = f(n) – g(n); h(n) counts Determine the minimum and
permutations of the desired from where n maximum values of f(n).
occurs in the middle, sandwiched between n-1
and n -2. Removing n leaves an acceptable Sol.: Of course ⎿⌊𝑟𝑘 𝑛⌋⏌ ≤ 𝑟𝑘 𝑛, 𝑠𝑜 𝑓(𝑛) ≥ 0,
permutation, and any acceptable permutation with equality for n = 0, so 0 is the minimum
on n -1 symbols can be so produced except value. On the other hand, we have 𝑟𝑘 𝑛 −
those ending in n -4, n -2, n -3, n -1. Hence h(n) ⎿⌊𝑟𝑘 𝑛⌋⏌ < 1, 𝑠𝑜 𝑓(𝑛) ≤ 𝑚 − 1.
= h(n -1)+ g(n -1) –g(n -4) = h(n -1)+ g(n -2); one
Here equality holds for n = t- 1 if t is the least
checks that h(n) modulo 3 repeats with period
common denominator of the 𝑟𝑘 .
24.
14. Let H be the orthocenter of acute triangle
Since 1996 ≡ 4 (mod 24), we have f(1996) ≡
ABC. The tangents from A to the circle with
f(4) = 4(mod 3), so f(1996) is not divisible by 3.
diameter BC touch the circle at P and Q.
12. Let ∆ABC be an isosceles triangles with AB Prove that P, Q, H are collinear.
= AC. Suppose that the angle bisector of
Sol.: The line PQ is the polar of A with respect to
∠B meets AC at D and that BC = BD + AD.
the circle, so it suffices to show that A lies on
Determine ∠A.
the pole of H.
(𝜋−𝛼)
Sol.: Let 𝛼 =∠A, 𝛽= and assume AB = 1.
4 Let D and E be the feet of the altitudes from A
and B, respectively; these also lie on the circle,
Then by the Law of Sines,
126
and H = AD ∩BE. The polar of the line AD is the 𝑎1 + 𝑏1 = 9 (45, 36)

intersection of the tangents AA and DD, and the
polar of the line BE is the intersection of Let M = {6, 12, 15, 18, 20, 21, 24, 35, 40, 42, 45,
tangents BB and EE. The collinearity of these 48} and T = {1, …, 50} –M. Since each pair listed
above contains an element of M, T does not
two intersections with C = AE ∩ BD follows from
applying Pascal’s theorem to the cyclic have the desire property. Hence we must take k
hexagons AABDDE and ABBDEE. (An elementary ≥│T│+1 = 39. On the other hand, from the
23 pairs mentioned above we can select 12
solution with vectors is also possible and not
pairs which are mutually disjoint:
difficult.)
(6, 3), (12, 4), (20, 5), (42, 7), (24, 8), (18, 9),
15. Find the smallest positive integer K such
(40, 10), (35, 14), (30, 15), (48, 16), (28, 21),
that every K-element subset of (1, 2, …, 50)
(45, 36).
contains two distinct elements a, b such
that a+b divides ab. Any 39-element subset must contain both
elements of one of these pairs. We conclude
Sol.: The minimal value is k = 39. Suppose a, b∊S
the desired minimal number is k = 39.
are such that a + b divides ab. Let c = gcd (a, b)
and put a = c𝑎1 , 𝑏 = 𝑐𝑏1, so that 𝑎1 𝑎𝑛𝑑 𝑏1are 16. Eight singers participate in an art festival
relatively prime. Then c(𝑎1 + where m songs are performed. Each song is
𝑏1 )𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑐 2 𝑎1 𝑏1 , 𝑠𝑜 𝑎1 + 𝑏1 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑐𝑎1 𝑏1 . performed by 4 singers, and each pair of
singers performs together in the same
Since 𝑎1 𝑎𝑛𝑑 𝑏1 have no common factor,
number of songs. Find the smallest m for
neither do 𝑎1 𝑎𝑛𝑑 𝑎1 + 𝑏1 , 𝑜𝑟 𝑏1 𝑎𝑛𝑑 𝑎1 + 𝑏1 .In
which this is possible.
short, 𝑎1 + 𝑏1 divides c.
Sol.: Let r be the number of songs each pair of
Since S ⊆ {1, … , 50}, we have a +b ≤99, so
singers performs together, so that
c(𝑎1 + 𝑏1 ) ≤ 99, which implies 𝑎1 + 𝑏1 ≤ 9, on
the other hand, of course 𝑎1 + 𝑏1 ≥ 3. An 4 8
𝑚( ) = 𝑟( )
exhaustive search produces 23 pairs, a, b 2 2
satisfying the conditions. 14𝑟
And so m = 3
; in particular, m ≥14. However,
𝑎1 + 𝑏1 = 3 (6, 3), (12, 6), (18, 9), (24, 12), (30, m = 14 is indeed possible, using the
15), (36, 18), (42, 21), (48, 24) arrangement
𝑎1 + 𝑏1 = 4 (12, 4), (24, 8), (36, 12), (48, 16) {1, 2, 3, 4} {5, 6, 7, 8} {1, 2, 5, 6} {3, 4, 7, 8}
𝑎1 + 𝑏1 = 5 (20, 5), (40, 10), (15, 10), (30, 20), {3, 4, 5, 6} {1, 3, 5, 7} {2, 4, 6, 8} {1, 3, 6, 8}
(45, 30)
{2, 4, 5, 7} {1, 4, 5, 8} {2, 3, 6, 7} {1, 4, 6, 7}
𝑎1 + 𝑏1 = 6 (30, 6)
{1, 2, 7, 8} {2, 3, 5, 8}
𝑎1 + 𝑏1 = 7 (42, 7), (35, 14), (28, 21)
𝑎1 + 𝑏1 = 8 (40, 24)
127
17. In triangle ABC, ∠𝑪 = 𝟗𝟎°, ∠𝑨 = G(n) = 𝒏 − 𝑮{𝑮(𝒏)} (n= 1, 2, 3,

𝟑𝟎° 𝒂𝒏𝒅 𝑩𝑪 = 𝟏.Find the minimum of the ….)
length of the longest side of a triangle then
inscribed in ABC (that is, one such that (a) 𝑮(𝒌) ≥ 𝑮(𝒌 − 𝟏) for any positive
each side of ABC contains a different integer k;
vertex of the triangle). (b) No integer k exists such that G(k -
1) = G(k) = G(k +1).
Sol.: We first find the minimum side length of
an equilateral triangle inscribed in ABC. Let D be Sol.:
a point on BC and put x = BD. Then take points
E, F on CA, AB, respectively, such that CE = (a) We show by induction that 𝐺(𝑛) −
√3𝑥 𝑥 𝐺(𝑛 − 1) ∊ {0, 1} for all n. If this holds
𝑎𝑛𝑑 𝐵𝐹 = 1 − . A calculation using the up to n, then
2 2
Law of Cosines shows that 𝐺(𝑛 + 1) − 𝐺(𝑛)
= 1 + 𝐺(𝐺(𝑛 − 1))
7
𝐷𝐹 2 = 𝐷𝐸 2 = 𝐸𝐹 2 = 𝑥 2 − 2𝑥 + 1 − 𝐺(𝐺(𝑛)).
4
7 4 2 3 𝐼𝑓 𝐺(𝑛 − 1) = 𝐺(𝑛), 𝑡ℎ𝑒𝑛 𝐺(𝑛 + 1) −
= (𝑥 − ) + 𝐺(𝑛) = 1; otherwise, 𝐺(𝑛 −
4 7 7
1)𝑎𝑛𝑑 𝐺(𝑛) are consecutive integers
Hence the triangle DEF is equilateral, and its
not greater than n, so 𝐺(𝐺(𝑛)) −
3
minimum possible side length is √7. 𝐺(𝐺(𝑛 − 1)) ∊ {0, 1}, again completing
the induction.
We know argue that the minimum possible (b) Suppose that G(k -1)= G(k) = G(k+1)+A
longest side must occur for some equilateral for some k, A. Then
triangle. Starting with an arbitrary triangle, first A= G(k+ 1)= k +1 –G(g(k))= k+1-G(A)
suppose it is not isosceles. Then we can side And similarly A = k –G(A) (replacing k +1
one of the endpoints of the longest side so as to with k above), a contradiction.
decrease its length; we do so until there are two Note: It can be shown that G(n) = ⌊𝑛𝜔⌋
longest sides, say DE and EF. We now fix D, for 𝜔 =
(√5−1)
.
2
move E so as to decrease DE and move F at the
same time so as to decrease EF; we do so until
19. Let ABC be an acute triangle with altitudes
all three sides become equal in length. (It is fine
AP, BQ, CR. Show that for any point P in
if the vertices move onto the extensions of the
the interior of the triangle PQR, there
sides, since the bound above applies in that exists a tetrahedron ABCD such that P is
case as well.) the point of the face ABC at the greatest
distance (measured along the surface of
3
Hence the minimum is indeed √7, as desired. the tetrahedron) from D.
18. Prove that if a sequence {𝑮(𝒏)}∞ Sol.: We first note that if S is the circumcircle
𝒏=𝟎 of
of an acute triangle KLM, then for any point X
integers satisfies
≠S inside the triangle, we have
G(0) = 0,
min{𝑋𝐾, 𝑋𝐿, 𝑋𝑀} < 𝑆𝐾 = 𝑆𝐿 = 𝑆𝑀,
128
Since the discs centered at K, L, M whose Sol.: Suppose K, L, M have already been
bounding circles pass through S cover the entire constructed. The triangle ALK and BYL are
triangle. similar because
Fix a point V in the interior of the triangle PQR, 𝐾𝐴 𝐿𝐵

∠LAK = ∠YBL and 𝐿𝐴 = 𝑌𝐵.Hence ∠ALK = ∠BYL.
we first assume the desired tetrahedron exists Similarly, from the similar triangles ALX and
and determine some of its properties. Rotate BML we get ∠AXL = ∠MLB. We also have ∠MLB
the faces ABD, BCD, CAD around their common = ∠ALK since M, L, K are collinear, we conclude
edges with face ABC into the plane ABC, so that ∠LYB = ∠AXL.
the images 𝐷1 , 𝐷2 , 𝐷3 of D lie outside of triangle
ABC. We shall choose D so that triangle 𝐷1 𝐷2 𝐷3 Now ∠XLY = ∠XLB + ∠BLY = ∠XAL +∠AXL +
is acute, contains triangle ABC and has ∠ABM -∠LYB = 2∠ABC
circumcenter V; this suffies by the above
We are construct the desired line as follows
observation.
draw the arc of points L such that ∠XLY =
In other words, we need a point D such that AV 2∠ABC, and let L be its intersection with AB.
is the perpendicular bisector of 𝐷1 𝐷3, BV that of Then construct M on BC such that ∠BLM =
𝐷1 𝐷2 , and CV that of 𝐷2 𝐷3. We thus need ∠AXL, and let K be the intersection of LM with
∠𝐷1 𝐷2 𝐷3 = 𝜋 − ∠𝐵𝑉𝐶 and so on. Since V lies CA.
inside PQR, the angle BVC is acute, and so
∠𝐷1 𝐷2 𝐷3 is fixed and acute. We may then 21. For which integers k does there exist a
construct an arbitrary triangle 𝐷1 ′𝐷2 ′𝐷3 ′ function f : N →Z such that
similar to the unknown triangle 𝐷1 𝐷2 𝐷3 let V’ (a) f(1995) = 1996, and
be its circumcenter, and construct points A’, (b) f(xy) = f(x) + f(y) + kf(gcd(x, y))for
B’, C’ on the rays from V through the all x, y ∊ N?
midpoints of
Sol.: Such f exists for k = 0 and k = -1. First
𝐷3 ′𝐷1 ′, 𝐷1 ′𝐷2 ′, 𝐷2 ′𝐷3 ′,respectively, so that
take x = y in (b) to get 𝑓(𝑥 2 ) = (𝑘 + 2)𝑓(𝑥).
triangle A’B’C’ and ABC are similar. We can
Applying this twice, we get
also ensure that the entire triangle A’B’C’ lies
inside 𝐷1 ′𝐷2 ′𝐷3 ′. Then folding up the hexagon 𝑓(𝑥 4 ) = (𝑘 + 2)𝑓(𝑥 2 ) = (𝑘 + 2)2 𝑓(𝑥).
𝐴′𝐷1 ′𝐵′𝐷2 ′𝐶′𝐷3 ′ along the edges of triangle
A’B’C’ produces a tetrahedron similar to the On the other hand,
required tetrahedron.
𝑓(𝑥 4 ) = 𝑓(𝑥) + 𝑓(𝑥 3 ) + 𝑘𝑓(𝑥)
= (𝑘 + 1)𝑓(𝑥) + 𝑓(𝑥 3 )
20. An acute angle XCY and points A and B on = (𝑘 + 1)𝑓(𝑥) + 𝑓(𝑥) + 𝑓(𝑥 2 ) + 𝑘𝑓(𝑥)
the rays CX and CY, respectively, are given
such that │CX│< │CA│= │CB│< │CY│. = (2𝑘 + 2)𝑓(𝑥) + 𝑓(𝑥 2 ) = (3𝑘 + 4)𝑓(𝑥).
Show how to construct a line meeting the Setting x = 1995 so that f(x) ≠ 0, we deduce
ray CX and the segments AB, BC at the (𝑘 + 2)2 = 3𝑘 + 4, which has roots k = 0, -1.
points K, L, M, respectively, such that For k = 0, an example is given by
KA.YB = XA.MB= LA.LB ≠ 0
𝑓(𝑝1 𝑒1 … 𝑝𝑛 𝑒𝑛 ) = 𝑒1 𝑔(𝑝1 ) + ⋯ + 𝑒𝑛 𝑔(𝑝𝑛 ).
129
Where g(5) = 1996 and g(p) = 0 for all 23. Let ABC be a triangle and construct
primes p ≠5 for k = 1, as example is given by squares ABED, BCGF, ACHI externally on
the sides of ABC. Show that the points D, E,
𝑓(𝑝1 𝑒1 … 𝑝𝑛 𝑒𝑛 ) = 𝑔(𝑝1 ) + ⋯ + 𝑔(𝑝𝑛 ) F, G, H, I are concyclic if and only if ABC is
22. A triangle ABC and points K, L, M on the equilateral or isosceles right.
sides AB, BC, CA respectively, are given Sol.: Suppose D, E, F, G, H, I are concyclic; the
such that perpendicular bisectors of DE, FG, HI coincide
𝑨𝑲 𝑩𝑳 𝑪𝑴 𝟏
= = = with those of AB, BC, CA respectively, so the
𝑨𝑩 𝑩𝑪 𝑪𝑨 𝟑 center of the circle must be the circumcenter
Show that if the circumcircles of the
O of ABC. By equating the distances OD and
triangles of the triangles AKM, BLK,
OF, we find
CML are congruent, then so are the in
circles of these triangles. (cos 𝐵 + 2 sin 𝐵)2 + 𝑠𝑖𝑛2 𝐵
= (cos 𝐶 + 2 sin 𝐶)2 = 𝑠𝑖𝑛2 𝐶
Sol.: We will show that ABC is equilateral, so
that AKM, BLK, CML are congruent and hence Expanding this end cancelling like terms, we
have the same in radius. determine 𝑠𝑖𝑛2 𝐵 + sin 𝐵 cos 𝐵 = 𝑠𝑖𝑛2 𝐶 +
sin 𝐶 cos 𝐶.
Let R be the common circumradius; then
Now note that
KL = 2R sin A, LM = 2R sin B, MK = 2R sin C,
2(𝑠𝑖𝑛2 𝜃 + sin 𝜃 cos 𝜃) = 1 − cos 2𝜃 + sin 𝜃
So the triangles KLM and ABC are similar.
Now we compare areas: 𝜋
= 1 + √2 sin (2𝜃 − ).
2
4
[AKM] = [BLK] = [CLM] = [ABC],
9 𝜋 𝜋
Thus we either have B = C or 2𝐵 − 4 + 2𝐶 − 4
1
So, [KLM] = 3[ABC] and the coefficient of
3𝜋
1 = 𝜋, 𝑜𝑟 𝐵 + 𝐶 = .
similarity between KLM and ABC must be √ . 4
3
By the law of cosines applied to ABC and In particular, two of the angles must be equal,
AKM. say A and B, and we either have A = B = C, so
the triangle is equilateral, or 𝐵 + (𝜋 − 2𝐵) =
𝑎2 = 𝑏 2 + 𝑐 2 − 2𝑏𝑐 cos 𝐴 3𝜋 𝜋
4
, in which case A = B = 4 and the triangle is
1 2 2𝑝 2 𝑐 2 2𝑏 𝑐 isosceles right.
𝑎 = ( ) + ( ) −2 cos 𝐴.
3 3 3 3 3
24. Let a, b be positive integers with a odd.
2 2 2 Define the sequence {𝒖𝒏 } as follows: 𝒖𝟎 =
From these we deduce 𝑎 = 2𝑏 − 𝑐 , and
similarly 𝑏 2 = 2𝑐 2 − 𝑎2 , 𝑎2 = 2𝑎2 − 𝑏 2 . 𝒃 & n ∊ ℕ.
Combining these gives 𝑎2 = 𝑏 2 = 𝑐 2 , so ABC 𝟏
𝒖 𝒊𝒇 𝒖𝒏 𝒊𝒔 𝒆𝒗𝒆𝒏
is equilateral, as desired. 𝒖𝒏+𝟏 = { 𝟐 𝒏
𝒖𝒏 + 𝒂 𝒐𝒕𝒉𝒆𝒓𝒘𝒊𝒔𝒆
(a) Show that 𝒖𝒏 ≤ 𝒂 for some n ∊ℕ.
(b) Show that the sequence {𝒖𝒏 } is
periodic from some point onwards.
130
Sol: minimum of f occurs with x = 0, in

which case f(x) = 1; since x > 0, we
(a) Suppose 𝑢𝑛 > 𝑎, if 𝑢𝑛 is even, 𝑢𝑛+1 = have strict inequality.
𝑢𝑛 (𝑢𝑛 +𝑎)
2
< 𝑢𝑛 ; if 𝑢𝑛 is odd, 𝑢𝑛+2 = 2
< 26. Starting at (1, 1), a stone is moved in the
𝑢𝑛 . Hence for each term greater than coordinate plane according to the
a, there is a smaller subsequent term. following rules:
These form a decreasing subsequence (i) From any point (a, b), the stone
which must eventually terminate, can move to (2a, b) or (a, 2b).
which only occurs once 𝑢𝑛 ≤ 𝑎. (ii) From any point (a, b), the stone
(b) If 𝑢𝑚 ≤ 𝑎, then for all n ≥ m, either can move to (a –b, b) if a > b, or to
𝑢𝑛 ≤ 𝑎, 𝑜𝑟, 𝑢𝑛 is even and 𝑢𝑛 ≤ 2𝑎, by (a, b –a) if a < b.
induction on n. In particular, 𝑢𝑛 ≤ For which positive integers x, y can
2𝑎 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑚 ≥ 𝑛, and so some value the stone be moved to (x, y)?
of 𝑢𝑛 eventually repeats, leading to a
Sol.: It is necessary and sufficient that gcd(x,
periodic sequence.
y) = 2𝑥 for some nonnegative integer s. We
show necessity by nothing that gcd(p, q) =
25. (a) Find the minimum value of 𝒙𝒙 for x a
gcd(p, q –p), so an odd common divisor can
positive real number.
never be introduced, and nothing that initially
(b) If x and y are positive real numbers, gcd(1, 1)= 1.
show that 𝒙𝒙 + 𝒚𝒙 > 1.
As for sufficiency, suppose gcd(x, y) = 2𝑥 . Of
Sol.: those pairs (p, q) from which (x, y) can be
reached, choose one to minimize p +q.
(a) Since 𝑥 𝑥 = 𝑒 𝑥𝑙𝑜𝑔 𝑥 𝑎𝑛𝑑 𝑒 𝑥 is an Neither p and q can be even, else one of
increasing function of x, it suffices to 𝑝 𝑞
(2 , 𝑞) 𝑜𝑟 (𝑝, 2) is an admissible pair. If p > q,
determine the minimum of x log x.
(𝑝+𝑞)
This is easily done by setting its then (p, q) is reachable from ( 2
, 𝑞), a
derivative 1+ log x to zero, yielding contradiction; similarly p < q is impossible.
1 1
𝑥= . The second derivative 𝑥 is Hence p = q, but gcd(p, q) is a power of 2 and
𝑒
positive for x > 0, so the function is neither p nor q is even. We conclude p =q =
everywhere convex, and the unique 1, and so (x, y) is indeed reachable.
extremum is needed a global
27. Suppose S is a union of finitely many
minimum. Hence 𝑥 𝑥 has minimum
disjoint subintervals of [0, 1] such that no
value 𝑒 −1/𝑒 . 𝟏
two point in S have distance 𝟏𝟎. Show that
(b) If x ≥ 1, then 𝑥 𝑦 ≥ 1 for y > 0, so we
may assume 0< x, y<1. Without loss the total length of the intervals comprising
𝟏
of generality, assume x ≤y; now note S is at most 𝟐.
that the function 𝑓(𝑥) = 𝑥 𝑥 + 𝑦 𝑥 has
derivative 𝑓 ′ (𝑥) = 𝑥 𝑥 log 𝑥 + 𝑦 𝑥−1 . Sol.: Cut the given segment into 5 segments of
1
Since 𝑦 𝑥 ≥ 𝑥 𝑥 ≥ 𝑥 𝑦 𝑓𝑜𝑟 𝑥 ≤ length . Let AB be one of these segments and
5
1
𝑦 𝑎𝑛𝑑 𝑥 ≥ − log 𝑥, we see that M its midpoint.
′ (𝑥)
𝑓 > 0 𝑓𝑜𝑟 0 ≤ 𝑥 ≤ 𝑦 and so the
131
Translate each point of AM by the vector MB. E lie on that circle, so ZN = ZE implies
No colored point can have a colored image, so that ZE ⊥MN.
all of the colored intervals of AB can be placed (b) As determined in (a), MN is the
in MB without overlap, and their total length perpendicular bisector of segment ZE.
1 The angle bisector AI of ∠EAZ passes
therefore does not exceed 10. Applying this
through the midpoint of the minor arc
reasoning to each of the 5 segments gives the
EZ, which clearly lies on MN;
desired result.
therefore this midpoint is k. By
28. Prove that every integer k > 1 has a similar reasoning, L is the midpoint of
multiple less than 𝒌𝟒 whose decimal the major are EZ. Thus KL is also a
expansion has at most four distinct digits. diameter of circle EAZ, so KL = MN.
30. Given 81 natural numbers whose prime
Sol.: Let n be the integer such that 2𝑛−1 ≤ 𝑘 ≤ divisors belong to the set {2, 3, 5}, prove
2𝑛 . For n ≤6 the result is immediate, so there exist 4 numbers whose product is
assume n > 6. the fourth power of an integer.
Let S be the set of nonnegative integers less Sol.: It suffices to take 25 such numbers. To
than 10𝑛 whose decimal digits are all 0s or 1s. each number, associate the triple (𝑥2 , 𝑥3 , 𝑥5 )
Since │S│ = 2𝑛 > 𝑘, we can find two recording the parity of the exponents of 2, 3
elements a < b of S which are congruent and 5 in its prime factorization. Two numbers
modulo, k, and b − a only has the digits 8, 9, 0, have the same triple if and only if their
1 in its decimal representation. On the other product is a perfect square. As long as there
hand, are 9 numbers left, we can select two whose
product is a square, in so doing, we obtain 9
𝑏 − 𝑎 ≤ 𝑏 ≤ 1 + 10 + ⋯ + 10𝑛−1 < 10𝑛
such pairs. Repeating the process with the
< 16𝑛−1 ≤ 𝑘 4 ,
square roots of the products of the pairs, we
Hence b – a is the desired multiple. obtain four numbers whose product is a
fourth power.
29. Let ABC be ab acute triangle, AD, BE, CZ its
altitudes and H its orthocenter. Let AI, A𝛩 31. Prove the following inequality for positive
be the internal and external bisectors of real numbers x, y, z:
angle A. Let M, N be the midpoints of BC, 𝟏 𝟏
(𝒙𝒚 + 𝒚𝒛 + 𝒛𝒙) ( 𝟐
+
AH, respectively. Prove that (𝒙 + 𝒚) (𝒚 + 𝒛)𝟐
(a) MN is perpendicular EZ; 𝟏 𝟗
+ ) ≥ .
(b) If MN cuts the segment AI, A𝛩 at (𝒛 + 𝒙)𝟐 𝟒
the points K, L, then KZ = AH.
Sol.: After clearing denominators, the given
Sol.: inequality becomes
(a) The circle with diameter AH passes ∑ 4𝑥 5 𝑦 − 𝑥 4 𝑦 2 − 3𝑥 3 𝑦 3 + 𝑥 4 𝑦𝑧 − 2𝑥 3 𝑦 2 𝑧

through Z and E, and so ZN = ZE. On 𝑠𝑦𝑚
the other hand, MN is a diameter of + 𝑥 2 𝑦 2𝑧 2 ≥ 0
the nine-point circle of ABC, and Z and
Where the symmetric sum runs over all six
permutations of x, y, z. (In particular, this
132
means the coefficient of 𝑥 3 𝑦 3 in the final We need only make sure that the sequence
expression is -6, and that 𝑥 2 𝑦 2 𝑧 2 is 6.) obtained is indeed decreasing, but this
follows because by assumption, 𝑚 <
Recall Schur’s inequality: (𝑎𝑘𝑚+1), 𝑎𝑛𝑑 𝑠𝑜 𝑚 − (𝑎𝑘𝑘 ) < (𝑘−1
𝑎𝑘
).
𝑥(𝑥 − 𝑦)(𝑥 − 𝑧) + 𝑦(𝑦 − 𝑧)(𝑦 − 𝑥)
33. Let P(x) be a polynomial with rational
+ 𝑧(𝑧 − 𝑥)(𝑧 − 𝑦) ≥ 0
coefficients such that 𝑷−𝟏 (𝑸) ⊆ 𝑸. Show
Multiplying by 2xyz and collecting symmetric that P is linear.
terms, we get
Sol: By a suitable variable substitution and
constant factor, we may assume P(x) is monic
∑ 𝑥 4 𝑦𝑧 − 2𝑥 3 𝑦 2 𝑧 + 𝑥 2 𝑦 2 𝑧 2 ≥ 0
and has integer coefficients; let P(0)= 𝑐0 . If p
𝑠𝑦𝑚
is a sufficiently large prime, the equation
On the other hand, P(x)= p +𝑐0 has a single real root, which by
assumption is rational and which we may also
∑(𝑥 5 𝑦 − 𝑥 4 𝑦 2 ) + 3(𝑥 5 − 𝑥 3 𝑦 3 ) ≥ 0 assume is positive (since P has positive
𝑠𝑦𝑚 leading coefficient). However, by the rational
root theorem, the only rational roots of P(x) –
By two applications of AM-GM; combining the
p - 𝑐0 can be ±1 𝑎𝑛𝑑 ± 𝑝. Since the root must
last two displayed inequalities gives the
be positive and cannot be 1 for large p, we
desired result.
have P(p) –p -𝑐0 = 0 for infinitely many p, so
32. Prove that for every pair m, k of natural P(x) = x +𝑐0 is linear.
numbers, m has a unique representation in
34. For each positive integer n, find the
the from
𝒂𝒌 𝒂𝒌−𝟏 𝒂𝒕 greatest common divisor of n! +1 and
𝒎 = ( )+( ) + ⋯+ ( ) (n+1)!.
𝒌 𝒌−𝟏 𝒕
Sol: If n + 1 is composite, then each prime
where 𝒂𝒌 > 𝒂𝒌−𝟏 > ⋯ > 𝒂𝒕 ≥ 𝒕 ≥ 𝟏.
divisor of (n+ 1)! is a prime less than n,
Sol.: We first show uniqueness. Suppose m is which also divides n! and so does not divide
represented by two sequences 𝑎𝑘 , … , 𝑎𝑡 and n! +1. Hence f(n) = 1. If n +1 is prime, the
𝑏𝑘 , … . , 𝑏𝑡 . Find the first position in which they same argument shows that f(n) is a power of
differ, without loss of generally, assume this n +1, and in fact n +1 │n! +1 by Wilson’s
position is k and that 𝑎𝑘 > 𝑏𝑘 . Then theorem. However, (𝑛 + 1)2 does not divide
(n +1)!, and thus f(n) = n +1.
𝑏 𝑏 𝑏 −𝑘+1
𝑚 ≤ ( 𝑘 ) + ( 𝑘−1 ) + ⋯ + ( 𝑘 )<
𝑘 𝑘−1 1
𝑏 +1
( 𝑘 ) ≤ 𝑚, a contradiction.
1 35. For each positive integer n, let S(n) be the
sum of the digits in the decimal expansion
To show existence, apply the greedy
of n. Prove that for all n,
algorithm: find the largest 𝑎𝑘 such that
𝑎 𝑺(𝟐𝒏) ≤ 𝟐𝑺(𝒏) ≤ 𝟏𝟎𝑺(𝟐𝒏) & show
( 𝑘 ) ≤ 𝑚, and apply the same algorithm with that there exists n such that S(n) =
𝑚
m and k replaced by 𝑚 − (𝑎𝑘𝑘 ) 𝑎𝑛𝑑 𝑘 − 1. 1996S(3n).
133
Solution: It is clear that S(a +b) ≤ S(a) + 38. Let 𝑭𝒏 denote the Fibonacci sequence, so
S(b), with equality if and only if there are no that 𝑭𝟎 = 𝑭𝟏 = 𝟏 and 𝑭𝒏+𝟐 = 𝑭𝒏+𝟏 + 𝑭𝒏
carries in the addition of a and b. Therefore for n ≥0. Prove that
S(2n) ≤ 2S(n). Similarly S(2n) ≤ 5S(10n) = (i) The statement “𝑭𝒏+𝒌 − 𝑭𝒏 is
5S(n). An example with S(n) = 1996S(3n) is divisible by 10 for all positive
133 … 35 (with 5968 threes). integers n” is true if k = 60 and
false or any positive integer k
36. Let F be +the midpoint of side BC of < 60;
triangle ABC. Construct isosceles right (ii) The statement “𝑭𝒏+𝒕 − 𝑭𝒏 is
triangles ABD and ACE externally on sides divisible by 100 for all positive
AB and AC with the right angles at D and E, integers n” is true if t = 300
respectively. Show that DEF is an isosceles and false or any positive
right triangle. integer t<300.
Solution: Identifying A, B, C with numbers on Solution: A direct computation shows that the
(𝐵+𝐶)
the complex plane, we have F = 2
,𝐷 = Fibonacci sequence has period 3 modulo 2
𝐵 + (𝐴 − 𝐵)𝑟, 𝐸 = 𝐴 + (𝐶 − 𝐴)𝑟, 𝑤ℎ𝑒𝑟𝑒 𝑟 = and 20 modulo 5(compute terms until the
(1+𝑖) 𝐴(1−𝐼) 𝐵 𝐶𝑖
. 𝑇ℎ𝑒𝑛 𝐸 − 𝐹 = 2 − 2 + 2 𝑎𝑛𝑑 𝐷− initial terms 0, 1 repeat, at which time the
2
𝐴(1+𝑖) 𝐵𝑖 𝐶
entire sequence repeats), yielding (a). As for
𝐹 = 2 − 2 − 2 ; in particular, 𝐷 − 𝐹 = (b), one computes that the period mod 4 is 6.
𝑖(𝐸 − 𝐹) and so DEF is an isosceles right The period mod 25 turns out to be 100, which
triangle. is awfully many terms to compute by hand,
but knowing that the period must be a
multiple of 20 helps, and verifying the
37. Show, with proof, how to dissect a square recurrence 𝐹𝑛+8 = 𝑡𝐹𝑛+4 + 𝐹𝑛 , where t is an
into at most five pieces in such a way that integer congruent to 2 modulo 5, shows that
the pieces can be reassembled to from the period divides 100, finally, an explicit
three squares no two of which have the computation shows that the period is not 20.
same area. 39. Prove that for all positive integers n,
𝒏
Solution: We dissect a 7 × 7 square into a 2 × 𝟐𝟏/𝟐 . 𝟒𝟏/𝟒 … . (𝟐𝒏 )𝟏/𝟐 < 4.
2 square A, a 3 × 3 square B, and three pieces
Solution: It is sufficient to show
C, D, E which from a 6 × 6 square, as shown
below. 𝑥
𝑛
∑ = 2;
𝐶𝐶𝐶𝐶𝐶𝐴𝐴 2𝑛
𝑛=1
𝐶𝐶𝐶𝐶𝐶𝐴𝐴
𝐶𝐶𝐶𝐶𝐶𝐷𝐷 𝑥 𝑥 𝑥 𝑥
𝑛 1 1
𝐶𝐶𝐶𝐶𝐶𝐷𝐷 ∑ 𝑛 = ∑ ∑ 𝑘 = ∑ 𝑛−1 = 2.
𝐶𝐶𝐶𝐶𝐵𝐵𝐵 2 2 2
𝑛=1 𝑛=1 𝑛=1 𝑛=1
𝐶𝐶𝐶𝐶𝐵𝐵𝐵
𝐸𝐸𝐸𝐸𝐵𝐵𝐵 40. Let p be a prime number and a, n positive
integers.
Prove that if 𝟐𝒑 + 𝟑𝒑 = 𝒂𝒏 , then n =
1.
134
Solution: If p = 2, we have 22 + 32 = 13 and Solution: If 32 discs are placed in an 8 × 4

n = 1. If p > 2, then p is odd, so 5 divides 2𝑝 + rectangle, they can all move up, left, down,
3𝑝 and so 5 divides a. Now if n > 1, then 25 right, up, etc. To show that a game with 33
2𝑝 +3𝑝 discs must stop, label the board as shown:
divides 𝑎𝑛 and 5 divides 2+3
= 2𝑝−1 −
2𝑝−2 . 3 + ⋯ + 3𝑝−1 ≡ 𝑝2 𝑝−1
(mod 5), a 121212121
contradiction if p ≠ 5. Finally, if p = 5, then 232323232
25 + 35 = 753 is not a perfect power, so n = 1 121212121
232323232
again.
121212121
41. Let ABC be an acute triangle and let D, E, F Note that a disc on 1 goes to a 3 after two
be the feet of the altitudes from A, B, C moves, a disc on 2 goes to a 1 or 3
respectively. Let P, Q, R be the feet of the immediately. And a disc on 3 goes to a 2
perpendiculars from A, B, C to EF, FD, DE, immediately. Thus if k disc start on 1 and k >
respectively. Prove that the lines AP, BQ, 8, the game stops because there are not
CR are concurrent. enough 3s to accommodate these disc. Thus
we assume k ≤8, in which case there are at
Solution: It is a routine exercise to show that
most 16 squares on 1 or 3 at the start, and so
each of AP, BQ, CR passes through the
at least 17 on 2. Of these 17, at most 8 can
circumcenter of ABC, so they all concur.
move onto 3 after one move, so at least 9 end
42. On a 𝟓 × 𝟗 rectangular chessboard, the up on 1; these discs will not all be able to
following game is played. Initially a move onto 3 two moves later, so the game
number of discs are randomly placed on will stop.
some of the squares, no square containing
43. Among triangles with one side of a given
more than one disc. A turn consists of
length l and with given area S, determine
moving all of the discs subject to the
all of those for which the product of the
following rules:
lengths of the three altitudes is maximum.
(i) Each disc may be moved one
square up, down left, or right; Solution: Let A, B be two fixed points with AB
(ii) If a disc moves up or down on one = l, and vary C along a line parallel to AB at
turn, it must move left or right on 2𝑆
distance 𝑙
. The product of the altitudes of
the next turn, and vice versa; 3
(iii) At the end of each turn, no square ABC is 8𝑆 divided by the lengths of the three
can contain two or more discs. sides, so it suffices to minimize AC, BC, or
The game stops if it becomes equivalently to maximize sin 𝐶. Let D be the
impossible to complete another intersection of the perpendicular bisector of
turn. Prove that if initially 33 discs AB with the line through C. If ∠D is not acute,
are placed on the board, the game the optimal triangles are clearly those with a
must eventually stop. Prove also right angle at C.
that it is possible to place 32 discs Suppose ∠D is acute and C ≠ D, and assume C
on the board so that the game can is on the same side of the perpendicular
continue forever. bisector of AB as B: we show ∠D ≥ ∠C, and so
the optimal triangle is ABD. The triangles DAC
135
and DBC have equal base and height, so equal 𝑛

∑ ( ) 2𝑛−2𝑘 .
altitude. However, AC > BC since ∠CAB > 2𝑘
𝑘
∠CBA, so sin ∠𝐷𝐴𝐶 > sin ∠𝐷𝐵𝐶, and since the
former is acute, we have ∠DAC < ∠DBC. To compute this, note that
Adding ∠CAB + ∠ABD to both sides, we get 𝑛
∠DAB + ∠DBA < ∠CAB + ∠CBA, and so ∠ADB (1 + 𝑥)𝑛 + (1 − 𝑥)𝑛 = 2 ∑ ( ) 𝑥 2𝑘 .
2𝑘
𝑘
> ∠ACB, as claimed.
So the answer is
44. Prove that the equation 𝒂𝟐 + 𝒃𝟐 = 𝒄𝟐 + 𝟑
has infinitely many integer solutions (a, b, 1 𝑛 1 𝑛 1 𝑛 1
c). 2 [(1 + ) + (1 − ) ] = (3𝑛 + 1).
2 2 2 2
Sol.: let a be any odd number, let b = 47. What is the minimum number of squares
(𝑎 2 −5) (𝑎 2 −1)
𝑎𝑛𝑑 𝑐 = . Then that one needs to draw on a white sheet in
2 2
order to obtain a complete grid with n
𝑐 2 − 𝑏 2 = (𝑐 + 𝑏)(𝑐 − 𝑏) = 𝑎2 − 3. squares on a side?
45. Let A and B be opposite vertices of a cube Solution: It suffices to draw 2n -1 squares:
of edge length 1. Find the radius of the in terms of coordinates, we draw a square
sphere with center interior to the cube, with opposite corners (0, 0) and (i, i) for
tangent to the three faces meeting at A and 1 ≤ i ≤ n and a square with opposite
tangent to the three edges meeting at B. corners (i, i) and (n, n) for 1 ≤ i≤ n -1.
Solution: Introduce coordinates so that A = To show this many squares are necessary,
(0, 0, 0), B = (1, 1, 1) and the edges are note that the segments from (0, i) to (1, i)
parallel to the coordinate axes. If r is the and from (n -1, i) to (n, i) for 0 < i < n all
radius of the sphere, then (r, r, r) is its center, must lie on different squares, so surely 2n
and (r, 1, 1) is the point of tangency of one of -2 squares are needed. If it were possible
the edges at B. Therefore 𝑟 2 = 2(1 − to obtain the complete grid with 2n -2
𝑟)2 , 𝑔𝑖𝑣𝑖𝑛𝑔 𝑟 2 − 4𝑟 + 2 = 0 and so r = 2 − √2 squares, each of these segments would lie
(the other root puts the center outside of the on one of the squares, and the same
cube). would hold for the segments from (i, 0) to
(i, 1) and from (i, n-1) to (i, n) for 0 < I <
n. Each of the aforementioned horizontal
46. Given an alphabet with three letters a, b, c segments shares a square with only two
find the number of words of n letters of the vertical segments, so the only
which contain an even number of a’s. possible arrangements are the one we
gave above without the square with
Solution: If there are 2k occurrences of a, corners (0, 0) and (n, n), and the 90°
𝑛 rotation of this arrangement, both of
these can occur in (2𝑘 ) places, and the
remaining positions can be filled in 2𝑛−2𝑘 which are insufficient. Hence 2n -1
ways. So the answer is squares are necessary.
48. Consider a triangulation of the plane, i.e. a

covering of the plane with triangles such
136
that no two triangles have overlapping Solution: Assume, on the contrary, that there
interiors, and no vertex lies in the interior exist p > 0 such that 𝑎𝑝+𝑛 = 𝑎𝑛 for every n.
of an edge of another triangle. Let A, B, C Since ⌊𝑥𝑛 ⌋ ⟶ ∞ 𝑎𝑠 𝑛 → ∞,we have
be three vertices of the triangulation and ⎿⌊𝑥 𝑛+𝑝 ⌋⏌ − ⎿⌊𝑥 𝑛 ⌋⏌ > 0 for some n; then
let 𝜽 be the smallest angle of the triangle setting 𝑎𝑛+𝑝 = 𝑎𝑛 and solving for x, we get
∆ABC. Suppose no vertices of the
triangulation lie inside the circumcircle of ⌊𝑥 𝑛+𝑝+1 ⌋ − ⌊𝑥 𝑛+1 ⌋
𝑥=
∆ABC. Prove there is a triangle 𝜎 in the ⌊𝑥 𝑛+𝑝 ⌋ − ⌊𝑥 𝑛 ⌋
triangulation such that 𝜎 ∩ ∆ABC ≠ 𝜃 and
And so x is rational.
every angle of 𝜎 is greater than 𝜃.
Put y = 𝑥 𝑝 and
Sol.: We may assume 𝜃 = ∠A. The case where
ABC belongs to the triangulation is easy, so 𝑝−1
assume this is not the case. If BC is an edge of 𝑏𝑚 = ∑ 𝑥 𝑝−𝑘−1 𝑎𝑚𝑝+𝑘
the triangulation, one of the two triangles 𝑘=0
bounded by BC has common interior points = ⎿⌊𝑥 𝑚+𝑝 ⌋ − 𝑥 𝑝 ⎿⌊𝑥 𝑚 𝑟⌋⏌
with ABC, and this triangle satisfies the = ⎿⌊𝑦 𝑚+1 ⌋ − 𝑦⎿⌊𝑦 𝑚 ⌋⏌.
desired condition. Otherwise, there is a
triangle BEF in the triangulation whose Since 𝑎𝑝+𝑛 = 𝑎𝑝 , we have 𝑏𝑚+1 = 𝑏𝑚 , and y
interior intersects BC. Since EF crosses BC at is also rational number which is not an
an interior point, ∠BEF < ∠BAF < ∠BAC, so integer. Now put 𝑐𝑚 = ⎿⌊𝑦 𝑚+1 −
triangle BEF satisfies the desired condition. 𝑦 𝑚 ⌋⏌; 𝑡ℎ𝑒𝑛 𝑐𝑚+1 = 𝑦𝑐𝑚 = 𝑦 𝑚 𝑐1 . This means
𝑐𝑚 cannot be an integer for large m, a
contradiction.
49. Let m and n be positive integers with 51. Let 𝜃 be the maximum of the six angles
gcd(m, n) = 1. Compute gcd(𝟓𝒎 + between the edges of a regular
𝟕𝒎 , 𝟓𝒏 + 𝟕𝒏). tetrahedron and a given plane. Find the
minimum value of 𝜃 over all positions of
Sol.: Let 𝑠𝑛 = 5𝑛 + 7𝑛 . 𝐼𝑓 𝑛 ≥ 2𝑚 , note that
the plane.
𝑠𝑛 = 𝑠𝑚 𝑠𝑛−𝑚 − 5𝑚 7𝑚 𝑠𝑛−2𝑚 ,
Sol.: Assume the edges of the tetrahedron 𝛤
So gcd(𝑠𝑚 , 𝑠𝑛 ) = gcd(𝑠𝑚 , 𝑠𝑛−2𝑚 ) … similarly, = ABCD have length l. If we place the
if m < n < 2m, we have gcd(𝑠𝑚 , 𝑠𝑛 )= tetrahedron so that AC and BC are parallel to
gcd(𝑠𝑚 , 𝑠𝑛−2𝑚 ). Thus by the Euclidean the horizontal plane H. We obtain 𝜃 = 45°,
algorithm, we conclude that if m + n is even, and we shall show this is the minimum angle.
then gcd(𝑠𝑚 , 𝑠𝑛 ) = gcd(𝑠1 , 𝑠2 ) = 12, and if m Let a, b, c, d be the projections of A, B, C, D to
+ n is odd, then gcd(𝑠𝑚 , 𝑠𝑛 ) = gcd(𝑠0 , 𝑠1 ) = 2. the horizontal plane H, and 𝑙1 , … , 𝑙6 the
projection of the edges 𝐿1 , … , 𝐿6 . Since the
50. Let x > 1 be a real number which is not an angle between 𝐿1 and H has cosine l, it
integer. For n = 1, 2, 3, …., let 𝒂𝒏 = suffices to consider the shortest 𝑙𝑖 .
⎿⌊𝒙𝒏+𝟏 ⌋⏌ − 𝒙⎿⌊𝒙𝒏 ⌋. Prove that the
If a, b, c, d from a convex quadrilateral with
sequence {𝒂𝒏 } is not periodic.
largest angle at a, then one of ab or ad is at
137
1
most since bd ≤ 1. Otherwise, it is easily n even, 𝑙 = 4𝑟 𝑞 2 𝑝2𝑎𝑛−2 𝑞2 𝑝𝑟 . 𝑞 2 𝑝2𝑎𝑛−1 +
√2
shown that one of the 𝑙1 originating from the 1
vertex inside the convex hull has length at n even, 𝑙 = 4𝑟 + 2𝑞 2 𝑝2𝑎𝑛−2 + 𝑞𝑞 2 𝑝𝑟 +
1
most . 𝑞𝑞 2 𝑝2𝑎𝑛−1 + 𝑞
√3
(𝟏+√𝟓) n odd, 𝑙 = 2𝑟 𝑞𝑝2𝑎𝑛−1 𝑞𝑝𝑟 𝑞𝑝2𝑎𝑛−1 −1

52. Let q be a real number with 𝟐
<𝑞<
2. For a number n with binary n even, 𝑙 = 4𝑟 + 1 𝑞 2 𝑝2𝑎𝑛−2 + 1 𝑞 2 𝑝𝑟 +
representation
1 𝑞 2 𝑝2𝑎𝑛−2 +1 + 1
n = 𝟐𝒌 + 𝒂𝒌−𝟏 . 𝟐𝒌−𝟏 + ⋯ + 𝒂𝟏 . 𝟐 + 𝒂𝟎
n even, 𝑙 = 4𝑟 + 3 𝑞 2 𝑝2𝑎𝑛−2 + 𝑞 + 1𝑞 2 𝑝𝑟 +
with 𝒂𝟏 ∈ {𝟎, 𝟏}, we define 𝑷𝒏 as follows
𝑞 + 1𝑞 2 𝑝2𝑎𝑛−2 +1 + 𝑞 + 1
𝒑𝒏 = 𝒒𝒌 + 𝒂𝒌−𝟏 𝒒𝒌−𝟏 + ⋯ + 𝒂𝟏 𝒒 + 𝒂𝟎 .
53. Find all pairs (n, r), with n a positive
Prove that there exist infinitely many positive integer and r a real number, for which the
integers k for which there does not exist a polynomial (𝒙 + 𝟏)𝒏 − 𝒓 is divisible by
positive integer l such that 𝒑𝟐𝒌 < 𝒑𝟏 < 𝒑𝟐𝒌+𝟏 . 𝟐𝒙𝟐 + 𝟐𝒙 + 𝟏.
Solution: Define the sequence 𝑎𝑛 as follows: Sol.: Let t =

(−1+𝑖)
be one of the roots of 2𝑥 2 +
2
𝑚 𝑚 2𝑥 + 1; then (𝑥 + 1)𝑛 − 𝑟 is divisible by
𝑎2𝑚 = ∑ 22𝑘 , 𝑎2𝑚+1 = ∑ 22𝑘+1 . 2𝑥 2 + 2𝑥 + 1 for r real if and only if
𝜋
𝑘=0 𝑘=0 (𝑡 + 1)𝑛 = 𝑟. Since the argument of t + 1 is 4 ,
We will show that k = 𝑎𝑛 satisfies the given this is possible if and only if n = 4m, in which
condition by induction on n. The case n = 0, 1 case (𝑡 + 1)4 𝑚 = (−4)4 . Hence (4𝑚, (−4)𝑚 )
follow by noting 1 < q < q +1 <𝑞 2 < 𝑞 2 + are the only solutions.
1 < 𝑞2 + 𝑞 < 𝑞2 + 𝑞 + 1
54. Let ABC be a triangle and P a point inside it
𝑝 3 2 such that ∠PBC = ∠PCA < ∠PAB. The line
and 𝑝1 ≥ 𝑞 ≥ 𝑞 > 𝑞 + 𝑞 = 𝑃6 𝑓𝑜𝑟 1 ≥ 8.
PB cuts the circumcircle of ABC at B and E,
Now suppose n ≥ 2, assume the induction and the line CE cuts the circumcircle of
hypothesis, and suppose by way of APE at E and F. Show that the ratio of the
contradiction that there exist l such that area of the quadrilateral APEF to the area
𝑝2𝑎𝑛 < 𝑝1 < 𝑝2𝑎𝑛+1 . The argument falls into of the triangle ABP does not depend on the
six cases, which we summarize in a table. The choice of P.
first column gives the conditions of the case,
the second gives a lower bound of 𝑝2𝑎𝑛 , the Sol.: Note that ∠AEP = ∠AEB = ∠ACB =
third is always equal to 𝑝1 , and the fourth ∠CBP, so the lines AE and CP are parallel.
gives an upper bound for 𝑝2𝑎𝑛+1 ; from these a Thus [APE] = [ACE] and [APEF][ACF]. Now
note that ∠AFC = 𝜋- ∠EPA = ∠APB and ∠ACF
contradiction to the induction hypothesis will
= ∠ACE = ∠ABE. Therefore triangles ACF and
become evident.
[𝐴𝐶𝐹] 𝐴𝐶 2
ABP are similar and [𝐴𝐵]
= (𝐴𝐵)
n even, 𝑙 = 2𝑟 + 1𝑞𝑝2𝑎𝑛−1 + 1𝑞𝑝𝑟 +
independent of the choice of p.
1 𝑞𝑝2𝑎𝑛−1 + 1
138
55. Let ABCD be a tetrahedron with ∠BAC = sequence 𝝐𝟏 , 𝝐𝟐 , … , 𝝐𝒏 , of elements of {-1,

∠ACD and ∠ABD = ∠BDC. Show that 0, 1}, not all zero, 𝒏𝟑 does not divide
edges AB and CD have the same length. 𝝐𝟏 𝒙𝟏 + 𝝐𝟐 𝒙𝟐 + ⋯ + 𝝐𝒏 𝒙𝒏 .
Sol.: Assume AB ≠ CD. Draw the plane Solution: The statement holds for n = 9 by
through AC bisecting the dihedral angle choosing 1, 2, 22 , … , 28 , since in that case
formed by the planes ABC and ACD, then
draw a line l in that plane perpendicular to AC │𝜖1 + ⋯ + 𝜖𝑔28 │ ≤ 1 + 2 + ⋯ + 28 < 93 .
through the midpoint O to AC. Now let B’ and
However, if n = 10, then 210 > 103 , so by the
D’ be the images of B and D, respectively,
pigeonhole principle, there are two subsets A
under the half-turn around the line l; by
and B of {𝑥1 , … , 𝑥10 } whose sums are
assumption, B’ ≠ D and D’ ≠ B; since ∠BAC =
congruent modulo 103 . Let 𝜖1 = 1 if 𝑥𝑖 occurs
∠ACD, B’ lies on CD and D’ lies on AB. Now
in A but not in B, -1 if 𝑥𝑖 occurs in B but not in
note that the quadrilateral BB’D’D has total
A, and 0 otherwise; then ∑ 𝜖𝑖 𝑥𝑖 is divisible by
angular sum 2𝜋. However, a non-polar
𝑛3 .
quadrilateral always has total angular sum
less than 2𝜋 (divide it into two triangles, 58. Let x, y be real numbers. Show that if the
which each have angular sum 𝜋, and apply the set
spherical triangle inequality) ∠ABC + ∠CBD
{𝐜𝐨𝐬(𝒏𝝅𝒙) + 𝐜𝐨𝐬(𝒏𝝅𝒚) │𝒏 ∈ 𝑵}
> ∠ABD, so the lines AB and CD are coplanar.
Is finite, then x, y ∈ Q.
Contradicting the assumption that ABCD is a
tetrahedron. Sol.: Let 𝑎𝑛 = cos 𝑛𝜋𝑥 𝑎𝑛𝑑 𝑏𝑛 = sin 𝑛𝜋𝑥.
Then
56. For a natural number k, let p(k) denote the
smallest prime number which does not (𝑎𝑛 + 𝑏𝑛 )2 + (𝑎𝑛 − 𝑏𝑛 )2 = 2(𝑎𝑛 2 + 𝑏𝑛 2 )
divide k. If p(k) > 2, define q(k) to be the = 2 + (𝑎2𝑛 + 𝑏2𝑛 ).
product of all primes less than p(k),
otherwise let q(k)= 1. Consider the If {𝑎𝑛 + 𝑏𝑛 } is finite, it follows that {𝑎𝑛 − 𝑏𝑛 }
𝒙𝒏 𝒑(𝒙𝒏 ) is also a finite set, and hence that {𝑎𝑛 } is
sequence. 𝒙𝟎 = 𝟏, 𝒙𝒏+𝟏 = 𝒏=
𝒒(𝒙𝒏 )
finite, since
𝟎, 𝟏, 𝟐, …
Determine all natural numbers n such 1
𝑎𝑛 = [(𝑎𝑛 + 𝑏𝑛 )(𝑎𝑛 − 𝑏𝑛 )].
that 𝒙𝒏 = 𝟏𝟏𝟏𝟏𝟏𝟏. 2
Sol.: An easy induction shows that if And similarly {𝑏𝑛 } is finite. In particular,
𝑝0 , 𝑝1 , …, are the primes in increasing order 𝑎𝑚 = 𝑎𝑛 for some m < n, and so (n –m)𝜋x is
an n has base 2 representations 𝑐0 + 2𝑐1 + an integral multiple of 𝜋. We conclude x and y
4𝑐2 + ⋯, then 𝑥𝑛 = 𝑝0 𝑐0 𝑝1 𝑐1 … in particular, are both rational.
111111 = 3.7.11.13.37 =
59. Let ABCD be a cyclic quadratilateral and
𝑝1 𝑝3 𝑝4 𝑝5 𝑝10 , 𝑠𝑜 𝑥𝑛 = 111111 if and only if n
let M be the set of incenters and excenters
= 210 + 25 + 24 + 23 + 21 = 1082.
of the triangles BCD, CDA, DAB, ABC (for a
57. Find the greatest positive integer n for total of 16 points). Show that there exist
which there exist n nonnegative integers two sets of parallel lines K and L, each
𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏, not all zero, such that for any
139
consisting of four lines, such that any line Now consider the excenters of the from
of K ∪ L contains exactly four points M. 𝑋𝑌 where X and Y are opposite vertices in
ABCD. We shall prove the claim with K =
Solution: Let T be the midpoint of the arc {𝐵𝐶 𝐶𝐵 , 𝐼𝐶 𝐼𝐵 , 𝐼𝐷 𝐼𝐴 , 𝐴𝐷 𝐷𝐴 }, L =
AB of the circumcircle of ABC, I the {𝐴𝐵 𝐵𝐴 , 𝐼𝐴 𝐼𝐵 , 𝐼𝐶 𝐼𝐷 , 𝐶𝐷 𝐷𝐶 }.
incenter of ABC, and 𝐼𝐵 , 𝐼𝐶 the excenters of
ABC opposite B and C, respectively. We Consider the rectangle 𝐵𝐶 𝐼𝐷 𝐵𝐴 𝑃, where P
first show TI = TA = TB = T𝐼𝑐 . Note that is an unknown point. From the second
observation above, the midpoint K of
(∠𝐶+∠𝐴)
∠TAI = ∠TAB + ∠BAI = = diagonal 𝐵𝐴 𝐵𝐶 is the midpoint of arc CDA,
2
∠𝐼𝐶𝐴 + ∠𝐼𝐴𝐶 = ∠𝑇𝐴𝐼 so it lies on the internal bisector BK of
triangle ABC. Again by the first
So TI = TA, and similarly TI = TB. observation, we conclude M = 𝐷𝐴 ,
Moreover, in the right triangle so𝐷𝐴 lies on the lines 𝐵𝐶 𝐶𝐵 and 𝐵𝐴 𝐴𝐵 , and
𝜋 𝜋 so on, proving the claim.
𝐴𝐼𝐶 𝐼, ∠𝐴𝐼𝐶 𝑇 = − ∠𝐴𝐼𝑇 = − ∠𝑇𝐴𝐼
2 2
60. Let n ≥ 3 be an integer and 𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏−𝟏
= ∠𝑇𝐴𝐼𝐶 , 𝑠𝑜 𝑇𝐴 = 𝑇𝐼𝐶 𝑎𝑙𝑠𝑜 nonnegative integers such that
𝒙𝟏 + 𝒙𝟐 + ⋯ + 𝒙𝒏−𝟏 = 𝒏
We next show that the midpoint U of 𝐼𝐵 𝐼𝐶 𝒙𝟏 + 𝟐𝒙𝟐 + ⋯ + (𝒏 − 𝟏)𝒙𝒏−𝟏
is also the midpoint of the arc BAC. Note = 𝟐𝒏 − 𝟐.
that the line 𝐼𝐵 𝐼𝐶 bisects the exterior Find the minimum of the sum
angles of ABC at A, so the line 𝐼𝐵 𝐼𝐶 passes 𝒏−𝟏
through the midpoint V of the arc BAC. 𝑭(𝒙𝟏 , … , 𝒙𝒏−𝟏 ) = ∑ 𝒌𝒙𝒌 (𝟐𝒏 − 𝒌).
Considering the right triangles 𝒌=𝟏
(𝐼 𝐼 )
𝐼𝐵 𝐵𝐼𝐶 𝑎𝑛𝑑 𝐼𝐵 𝐶𝐼𝐶 , we note BU = 𝐵2 𝐶 = Sol.: The desired sum can be written as
𝐶𝑈, so U lies on the perpendicular
𝑛−1
bisector of BC, which suffices to show U =
V. (Note that 𝐼𝐵 𝑎𝑛𝑑 𝐼𝐶 lie on the same 2𝑛(2𝑛 − 2) − ∑ 𝑘 2 𝑥𝑘 .
𝑘=1
side of BC as A, so the same is true of U).
Now note
Let E, F, G, H be the midpoints of the arcs
AB, BC, CD, DA. Let 𝐼𝐴 , 𝐼𝐵 , 𝐼𝐶 , 𝐼𝐷 be the 𝑛−1 𝑛−1
2
incenters of the triangles BCD, CDA, DAB, ∑ 𝑘 𝑥𝑘 = ∑ 𝑥𝑘 + (𝑘 − 1)(𝑘 + 1)𝑥𝑘
ABC, respectively. Let 𝐴𝐵 , 𝐴𝐶 , 𝐴𝐷 be the 𝑘=1 𝑘=1
excenters of BCD opposite B, C, D, ≤𝑛+𝑛

respectively, and so on.
∑ 𝑛 − 1 (𝑘 − 1)𝑥𝑘 = 𝑛 + 𝑛(2𝑛 − 2 − 𝑛)
By the first observation, 𝐼𝐶 𝐼𝐷 𝐶𝐷 𝐷𝐶 is a 𝑘=1
rectangle with center E, and the = 𝑛2 − 𝑛.
diagonals, which contain the points C and
Hence the quantity in question is at most
D, have length 2EA = 2EB. Similarly, we
obtain rectangle centered at F, G, H.
140
2𝑛(2𝑛 − 2) − (𝑛2 − 𝑛) = 3𝑛2 − 3𝑛, with 3, but 427 ≡ 1(mod 27), so this fails. Hence p
equality for 𝑥1 = 𝑛 − 1, 𝑥2 = ⋯ = 𝑥𝑛−2 = < q.
0, 𝑥𝑛−1 = 1.
Since p and q are odd primes, q ≥ p +2, so
61. Let n, r be positive integers and A a set of (3𝑝−1)
< 3. Since this quantity is an integer,
(𝑞−1)
lattice points in the plane, such that any
and it is clearly greater than 1, it must be 2.
open disc of radius r contains a point of A.
That is, 2q = 3p +1. On the other hand, p -1
Show that for any coloring of the points of (9𝑝+1)
A using n colors, there exist four points of divides 3q -1= 2
as well as (9p +1) –(9p
the same color which are the vertices of a -9) = 10. Hence p = 11, q = 17.
rectangle.
63. Let n ≥ 3 be an integer and p ≥ 2n -3 a
Sol.: Consider a square of side length L = prime. Let M be a set of n points in the
4n𝑟 2 with side parallel to the coordinate axes. plane, no three collinear, and let f: M ⟶{0,
One can draw (2𝑛𝑟 2 ) = 4𝑛2 𝑟 2 disjoint disks 1, …, p -1} be a function such that:
of radius r inside the square, hence such a (i) Only one point of M maps to 0,
square contains at least 4𝑛2 𝑟 2 points of A. and
(ii) If A, B, C are distinct points in
The lattice point in A lie on L -1 = 4n𝑟 2 − 1 M and k is the circumcircle of
vertical lines; by the pigeonhole principle, the triangle ABC, then
some vertical line contains n +1 points of A.
Again by the pigeonhole principle, two of ∑ 𝒇(𝑷) ≡ 𝟎(𝒎𝒐𝒅 𝑷).
these points are colored in the same color. 𝑷 ∈𝑴∩𝒌
Now consider an infinite horizontal strip Show that all of the points of M lie on a
made of ribbons of side length L; some two of circle.
them have two points in the same position in
the same color, and these four points from the Solution: Let X be the point mapping to 0. We
vertices of a rectangle. first show that if every circle through X and
two points of M contains a third point of M,
62. Find all prime numbers p, q for which the then all of the points of M lie on a circle.
congruence 𝜶𝟑𝒑𝒒 ≡ 𝜶(𝒎𝒐𝒅 𝟑𝒑𝒒) holds Indeed, consider an inversion with center at
for all integers 𝛼. X. Then the image of M – {X} has the property
that the line through any two of its points
Sol.: Without loss of generality assume p ≤ q; contains a third point; it is a standard result
the unique solution will be (11, 17), for which that this means the points are collinear.
one many check the congruence using the (Otherwise, find a triangle ABC minimizing
Chinese Remainder Theorem. the length of the altitude AH; there is another
point N on BC, but then either ABN OR CAN
We first have 23𝑝𝑞 ≡ 2(𝑚𝑜𝑑 3), which means
has a shorter altitude than AH, contradiction).
p and q are odd. In addition, if 𝛼 is a primitive
root mod p, then 𝛼 3𝑝𝑞−1 ≡ 1 (𝑚𝑜𝑑 𝑝) implies Now suppose the points of M do not lie on a
that p -1 divides 3pq -1 as well as 3pq -1- circle. By the above, there exists a circle
3q(p -1) = 3q -1, and conversely that q -1 passing through M and only two points A, B of
divides 3p -1. If p = q, we now deduce p = q = M. Let f(A) = i, so that by the hypothesis, f(B)
141
= p –i. Let a be the number so circles passing 1 1 1 1 1 1 1 2

through X, A and at least one other point of M, + + ≥( + + − )
𝑥 𝑦 𝑧 𝑥 𝑦 𝑧 𝑛
let b be the number of circles passing through
1 1 1
X, B and at least one other point of M, and let And hence + + ≤ 1.
𝑥 𝑦 𝑧
S be the sum of f(P) over all P in M. By adding
the relations obtained from the circles 65. Let n be a positive integer and D a set of n
through X and A, we get S + (a -1) i ≡ 0 (mod concentric circles in the plane. Prove that
p), and similarly, S + (b -1) (p –i) ≡ 0 (mod if the function f : D ⟶D satisfies
p). Therefore a + b -2 ≡ 0 (mod p) ; since a + d(f(A), f(B)) ≥ d(A, B) for all A, B, 𝜖, D,
b ≤2n +4 < p, we have a + b = 2 and so a = b then d(f(A), f(B)) = d(A, B) for every
= 1, contradicting the assumption that the A, B, 𝜖D.
points do not all lie on a circle.
Sol.: Label the circles 𝐷1 , … , 𝐷𝑛 in increasing
64. Let x, y, z be real numbers. Prove that the order of radius, and let 𝑟1 denote the radius
following conditions are equivalent. 𝐷𝑖 . Clearly the maximum of d(A, B) occurs
𝟏 𝟏 𝟏 when A and B are antipodal points on D. Let
(i) x, y, z > 0 and + + ≤ 𝟏.
𝒙 𝒚 𝒛
ABCD be the vertices of a square inscribed in
(ii) For every quadrilateral with
𝐷𝑛 ; then f(A) and f(C) are antipodal, as are
sides a, b, c, d, 𝒂𝟐 𝒙 + 𝒃𝟐 𝒚 +
f(B) and f(D). In addition, each of the minor
𝒄𝟐 𝒛 > 𝒅𝟐 . arcs f(A) f(B) and f(B) f(C) must be at least a
Sol.: To show (i) implies (ii), note that quarter arc, thus f(B) bisects one of the
semicircles bounded by f(A) and f(C), and
𝑎2 𝑥 + 𝑏 2 𝑦 + 𝑐 2 𝑧 f(D) bisects the other. Now if P is any point on
1 1 the minor arc AB, then the arcs f(P) f(A) and
≥ (𝑎2 𝑥 + 𝑏 2 𝑦 + 𝑐 2 𝑧) ( +
𝑥 𝑦 f(P) f(B), which are at least as long as the arc
1 PA and PB, and up to the quarter arc f(P) f(B).
+ ) ≥ (𝑎 + 𝑏 + 𝑐)2 > 𝑑2 .
𝑧 We conclude f is isometric on 𝐷𝑛 .
Using Cauchy-Schwarz after the first Since f is clearly injective and is now bijective
inequality. on 𝐷𝑛 𝑓 maps 𝐷1 𝑈 … . 𝑈𝐷𝑛−1 into itself. Thus
we many repeat the argument to show that f
To show (i) implies (ii), first note that if x ≤ 0,
is isometric on each 𝐷𝑖 . To conclude, it
we may take a quadrilateral of sides a = n, b
suffices to show that distances between
= 1, c = 1, d = n and get y + z >𝑛2 (1 − 𝑥), a
adjacent circles, say 𝐷1 and 𝐷2, are preserved.
contradiction for large n. Thus x > 0 and
This is easy; choose a square ABCD on 𝐷1 and
similarly y > 0, z > 0. Now use a quadrilateral
1 1 1 1 1 1 1 A’, B’, C’, D’ be the points on 𝐷2 closet to A, B,
of sides 𝑥 , 𝑦 , 𝑧 𝑎𝑛𝑑 𝑥 + 𝑦 + 𝑧 − 𝑛, where n is C, D, respectively. Then A’B’C’D’ also from a
𝑥 𝑦 𝑧 1 1 1 square, and the distance from A to C’ is the
large. We then get 𝑥 2 + 𝑦2 + 𝑧2 > (𝑥 + 𝑦 + 𝑧 −
maximum between any point on 𝐷1 and any
1 2
) point on 𝐷3. Hence the eight points maintain
𝑛
their relative position under f, which suffices
Since this holds for all n, we may take the to prove isometry.
limit as n⟶∞ and get
142
66. Let n ≥ 3 be an integer and X ⊆ {1, 2, …, Sol.: There are more numbers that not of this
𝒏𝟑 } a set of 3𝒏𝟐 elements. Prove that one form. Let n = 𝑘 2 + 𝑚3 , where k, m, n ∈ N and
can find the distinct numbers 𝒂𝟏 , … , 𝒂𝟗 in n ≤ 1000000. Clearly k ≤ 1000 and m ≤ 100.
X such that the system Therefore there cannot be more numbers in
𝒂𝟏 𝒙 + 𝒂𝟐 𝒚 + 𝒂𝟑 𝒛 = 𝟎 the desired from than the 1000000 pairs (k,
𝒂𝟒 𝒙 + 𝒂𝟓 𝒚 + 𝒂𝟔 𝒛 = 𝟎 m).
𝒂𝟕 𝒙 + 𝒂𝟖 𝒚 + 𝒂𝟗 𝒛 = 𝟎
Has a solution (𝒙𝟎 , 𝒚𝟎 , 𝒛𝟎 ) in nonzero 68. Let x, y, p, n, k be natural numbers such
integers. that
𝒙𝒏 + 𝒚𝒏 = 𝒑𝒌 .
Sol.: Label the elements of X in increasing
order 𝑥1 < ⋯ < 𝑎3𝑛2 , and put Prove that if n > 1 is odd, and p is an odd
prime, then n is a power of p.
𝑋1 = {𝑥1 , … , 𝑥𝑛2 }, 𝑋2 = {𝑥𝑛2 +1 , … . , 𝑥2𝑛2 }, 𝑋3
= {𝑥𝑛2 +1 , … , 𝑥3𝑛2 }, Sol.: Let m = gcd(x, y). Then x = m𝑥1 , 𝑦 =
𝑚𝑦1 and by virtue of the given equation,
Define the function f: 𝑋1 × 𝑋2 × 𝑋3 → 𝑋 × 𝑋 𝑚𝑛 (𝑥1 𝑛 + 𝑦1 𝑛 ) = 𝑝𝑘 , and so m = 𝑝𝛼 for some
as follows: f(a, b, c) = (b –a, c –b). nonnegative integer 𝛼. It follows that 𝑥1 𝑛 +
𝛼
𝑦1 𝑛 = 𝑝𝑘−𝑛 . (1)
The domain of f contains 𝑛6 elements. The
range of f, on the other hand, is contained in Since n is odd,
the subset of X × 𝑋 of pairs whose sum is at
most 𝑛3 , a set of cardinality. 𝑥1 𝑛 + 𝑦1 𝑛
= 𝑥1 𝑛−1 − 𝑥1 𝑛−2 𝑦1
𝑥1 + 𝑦1
𝑛3 −1 + 𝑥1 𝑛−3 𝑦1 2 − ⋯
𝑛3 (𝑛3 − 1) 𝑛6
∑ 𝑘= < . − 𝑥1 𝑦1 𝑛−2 + 𝑦1 𝑛−1 ,
2 2
𝑘=1
Let A denote the right side of the equation. By
By the pigeonhole principle, some three the condition p > 2, it follows that at least one
triples (𝑎𝑖 , 𝑏𝑖 , 𝑐𝑖 ) (i = 1, 2, 3) map to the same of 𝑥1 , 𝑦1 is greater than 1, so since n > 1. A >
pair, in which case x =𝑏1 − 𝑐1 , 𝑦 = 𝑐1 − 1.
𝑎1 , 𝑧 = 𝑎1 − 𝑏1 is a solution in nonzero
𝛼
integers. Note that 𝑎𝑖 , cannot equal 𝑏𝑗 since 𝑋1 From (1) it follows that A(𝑥1 + 𝑦1 ) = 𝑝𝑘−𝑛 ,
and 𝑋2 and so on, and that 𝑎1 = 𝑎2 implies so since 𝑥1 + 𝑦1 > 1, A >1, both of these
that the triple (𝑎1 , 𝑏1 , 𝑐1) and (𝑎2 , 𝑏2 , 𝑐2 ) are numbers are divisible by p, moreover, 𝑥1 +
identical, a contradiction. Hence the nine 𝑦1 = 𝑝𝛽 for some natural number 𝛽.
numbers chosen are indeed distinct.
Thus
67. Which are there more of among the
natural numbers from 1 to 1000000, 𝐴 = 𝑥1 𝑛−1 − 𝑥1 𝑛−2 (𝑝𝛽 − 𝑥1 ) + ⋯
inclusive: numbers that can be − 𝑥1 (𝑝𝛽 − 𝑥1 )𝑛−2
represented as the sum of a perfect square + (𝑝𝛽 − 𝑥1 )𝑛−1
and a (positive) perfect cube, = 𝑛𝑥1 𝑛−1 + 𝐵𝑝.
or numbers that cannot be?
143
Since A is divisible by p and 𝑥1 is relatively We have a contradiction.

prime to p, it follows that n is divisible by p.
70. Show that in the arithmetic progression
𝑝𝑞 𝑝𝑞 𝑘 𝑝 𝑞 with first term 1 and ratio 729, there are
Let n = pq. Then 𝑥 + 𝑦 = 𝑝 𝑜𝑟 (𝑥 ) +
(𝑦 𝑝 )𝑞 = 𝑝𝑘 . If q > 1, then by the same infinitely many powers of 10.
argument, p divides q. If q =1, then n = p.
Sol.: We will show that for all natural
Repeating this argument, we deduce that n =
numbers n, 1081𝑛 − 1 is divisible by 729. In
𝑝𝑙 for some natural number l.
fact, 1081𝑛 − 1 = (1081 )𝑛 − 1𝑛 =
(1081 − 1). 𝐴, 𝑎𝑛𝑑
69. In the Duma there are 1600 delegates, who
have formed 16000 committees of 80 1081𝑛 − 1 = ⏟
9…9
81
persons each. Prove that one can find two
committees having no fewer than four =⏟
9…9… ⏟
10 … 01 ⏟
10 … 01 … ⏟
10 … 01
common members. 9 8 8 8
= 9⏟
1…9…⏟
10 … 01 ⏟
10 … 01 … ⏟
10 … 01
Sol.: Suppose any two committees have at
9 8 8 8
most three common members. Have two
deputies count the possible ways to choose a The second and third factors are composed of
chairman for each of three sessions of the 9 units, so the sum of their digits is divisible
Duma. The first deputy assumes that any by 9, that is, each is a multiple of 9. Hence
deputy can chair any session, and so gets 1081𝑛 − 1 is divisible by 93 = 729, as is
16003 possible choices. The second deputy 1081𝑛 − 1 for any n.
makes the additional restriction that all of the
71. Two piles of coins lie on a table. It is
chairmen belong to a single committee. Each
known that the sum of the weights of the
of the 16000 committees yields 803 choices,
coins in the two piles are equal, and for
but this is an over count; each of the 16000
(16000−1) any natural number k, not exceeding the
pairs of committees give at most 33
2 number of coins in either pile, the sum of
overlapping choices. Since the first deputy the weights of the k heaviest coins in the
counts no fewer possibilities than the second, first pile is not more than that of the
we have the inequality second pile. Show that for any natural
number x, if each coin (in either pile) of
16000.15999 3
16003 ≥ 16000. 803 − 3 . weight not less than x is replaced by a coin
2
of weight x, the first pile will not be lighter
However, than the second.
16000.15999 3 Sol.: Let the first pile have n coins of weights

1600. 803 − 3
2
> 16000. 803 𝑥1 ≥ 𝑥2 ≥ ⋯ ≥ 𝑥𝑛 , and let the second pile
16000.15999 42 have m coins of weights 𝑦1 ≥ 𝑦2 ≥ ⋯ ≥
− 𝑦𝑚 , 𝑤ℎ𝑒𝑟𝑒 𝑥1 ≥ ⋯ ≥ 𝑥𝑠 ≥ 𝑥 ≥ 𝑥𝑠+1 k and
2 2
𝑦1 ≥ ⋯ ≥ 𝑦𝑡 ≥ 𝑥 ≥ 𝑦𝑡+1 ≥ ⋯ ≥ 𝑦𝑚 . (If there
16000. 43 are no coins of weight greater than x, the
= + 213 . 106 − 212 . 106 > 212 . 106
4 result is clear). We need to show that 𝑥𝑠 +
= 16003 .
144
𝑥𝑠+1 + ⋯ + 𝑥𝑛 ≥ 𝑥𝑡 + 𝑦𝑡+1 + ⋯ + 𝑦𝑚 . Since L’s. Number the rows 1,…, 5 and the columns
𝑥1 + ⋯ + 𝑥𝑛 = 𝑦1 + ⋯ + 𝑦𝑚 = 𝐴, this 1, …, 7, and consider the 12 squares lying at
inequality can be equivalently written 𝑥𝑠 + the intersections of odd numbered rows with
(𝐴 − 𝑥1 − ⋯ − 𝑥𝑚 ) ≥ 𝑥𝑡 + (𝐴 − 𝑦1 − ⋯ − 𝑦𝑡 ), odd numbered columns. Each of these cells is
which in turn can be rewritten covered by k L’s, so at least 12k L’s must be
used in total. But these cover 3. 12k > 35k
𝑥1 + ⋯ + 𝑥𝑠 + 𝑥(𝑡 − 𝑠) ≤ 𝑦1 + ⋯ + 𝑦𝑡 , cells in total, a contradiction.
This is what we will prove, 73. Points E and F are given are given on side
If t ≥ s, then BC of convex quadrilateral ABCD (with E
closer than F to B). It is known that ∠BAE
𝑥1 + ⋯ + 𝑥𝑠 + 𝑥(𝑡 − 𝑠) = ∠CDF and ∠EAF = ∠FDE. Prove that
= (𝑥1 + ⋯ + 𝑥𝑠 ) ∠FAC = ∠EDB.
+⏟ (𝑥 + ⋯ + 𝑥)
𝑡−𝑠 Solution: By the equality of angles EAF and
≤ (𝑦1 + ⋯ + 𝑦𝑠 ) FDE, the quadrilateral AEFD is cyclic.
+ (𝑦𝑠+1 + ⋯ + 𝑦𝑡 ), Therefore ∠AEF + ∠FDA = 180°. By the
equality of angles BAE and CDF we have
Since 𝑥1 + ⋯ + 𝑥𝑠 ≤ 𝑦1 + ⋯ + 𝑦𝑠 (from the
given condition) and 𝑦𝑠+1 ≥ ⋯ ≥ 𝑦𝑡 ≥ 𝑥. ∠ADC + ∠ABC = ∠FDA +∠CDF +∠AEF -∠BAE
= 180°
If t < s, then 𝑥1 + … + 𝑥𝑠 + 𝑥(𝑡 − 𝑠) ≤ 𝑦1 +
⋯ + 𝑦𝑡 is equivalent to Hence the quadrilateral ABCD is cyclic, so
∠BAC = ∠BDC. It follows that ∠FAC = ∠EBD.
𝑥1 + ⋯ + 𝑥𝑠 ≤ 𝑦1 + ⋯ + 𝑦𝑡 + (𝑥
⏟ + ⋯ + 𝑥)
𝑡−𝑠 74. Find all natural numbers n, such that there
exist relatively prime integers x and y and
The latter inequality follows from the fact
an integer k >1 satisfying the equation
that
𝟑𝒏 = 𝒙𝒌 + 𝒚𝒌 .
𝑥1 + ⋯ + 𝑥𝑠 ≤ 𝑦1 + ⋯ + 𝑦𝑠
= (𝑦1 + ⋯ + 𝑦𝑡 )
Sol.: The only solution is n = 2.
+ (𝑦𝑡+1 + ⋯ + 𝑦𝑠 )𝑎𝑛𝑑 𝑦𝑠 ≤ ⋯
≤ 𝑦𝑡+1 ≤ 𝑥. Let 3𝑛 = 𝑥 𝑘 + 𝑦 𝑘 , where x, y are relatively
prime integers with x > y, k > 1, and n a
natural number. Clearly neither x nor y is a
72. Can a 𝟓 × 𝟕 checkerboard be covered by multiple of 3. Therefore, if k is even𝑥 𝑘 𝑎𝑛𝑑 𝑦 𝑘
L’s (figures formed from a 𝟐 × 𝟐 square by are congruent to 1 mod 3, so their sum is
removing one of its four 𝟏 × 𝟏 corners), congruent to 2 mod 3, and so is not a power
not crossing its borders, in several layers of 3.
so that each square of the board is covered
by the same number of L’s? If k is odd and k > 1, then 3𝑛 = (𝑥 +
𝑦)(𝑥 𝑘−1 − ⋯ + 𝑦 𝑘−1 ). Thus x + y = 3𝑚 for
Sol.: No such covering exists. Suppose we are some m ≥ 1. We will show that n ≥ 2m. Since
given a covering of a 5 × 7 checkerboard with 3
𝑘
(see the solution to Russia 3), by putting
L’s such that every cell is covered by exactly k
145
𝑥1 = 𝑥 𝑘/3 𝑎𝑛𝑑 𝑦1 = 𝑦 𝑘/3 we may assume k = arbitrary sequence of real numbers 𝑐0 , … , 𝑐𝑛 .

3. From the given condition,
𝑚 𝑚 𝑛 𝑛 𝑛
Then 𝑥 3 + 𝑦 3 = 3𝑚 and x + y = 3𝑛 . To prove
the inequality n ≥ 2m, it suffices to show that ∑ 𝑎𝑖 𝑏𝑖 = ∑ 𝑎𝑖 ∑ 𝑐𝑗 𝑖 = ∑ 𝑐𝑖 ∑ 𝑎𝑖 𝑖 𝑗 = 0.
𝑗
𝑖=1 𝑖=1 𝑗=0 𝑗=0 𝑗=1

𝑥 3 + 𝑦 3 ≥ (𝑥 + 𝑦)2 , or 𝑥 2 − 𝑥𝑦 + 𝑦 2 ≥ 𝑥 +
𝑦. Since x ≥ y +1, 𝑥 2 − 𝑥 = 𝑥(𝑥 − 1) ≥ Suppose now that the sequence 𝑎1 , … , 𝑎𝑚 has
𝑥𝑦, 𝑎𝑛𝑑 (𝑥 2 − 𝑥 + 𝑥𝑦) + (𝑦 2 − 𝑦) ≥ k pairs of neighbors that differ in sign, where
𝑦(𝑦 − 1) ≥ 0, and the inequality n ≥ 2m k < n +1, and let 𝑖1 , … , 𝑖𝑘 be the indices of the
follows. first members of these pairs.
From the identity (𝑥 + 𝑦)3 − (𝑥 3 + 𝑦 3 ) = Let 𝑏𝑖 = 𝑓(𝑖) = (𝑖 − 𝑥1 )(𝑖 − 𝑥2 ) … (𝑖 − 𝑥𝑘 ),
3𝑥𝑦(𝑥 + 𝑦) it follows that 32𝑚−1 − 3𝑛−𝑚−1 = 1
where 𝑥𝑘 = 𝑖𝑘 + 2 (𝑖 = 1, 2, … , 𝑘). The
𝑥𝑦.
function f changes sign only at the points
But 2m -1 ≥ 1, and n –m -1 ≥n -2m ≥0. If 𝑥1 , … , 𝑥𝑘 , and so 𝑏1 𝑎𝑛𝑑 𝑏𝑖+1 have different
strict inequality occurs in either place in the signs if and only one of the 𝑥𝑙 falls between
last inequality, then 32𝑚−1 − 3𝑛−𝑚−1 is them, which means i = 𝑖𝑙 . We deduce that the
divisible by 3 while xy is not. Hence n –m -1 = sequences 𝑎1 , … , 𝑎𝑚 𝑎𝑛𝑑 𝑏1 , … , 𝑏𝑚 have the
n -2m = 0, and so m = 1, n = 2 and 32 = 23 + same pairs of neighbors of opposite sign.
13 . Since 𝑎𝑚 𝑎𝑛𝑑 𝑏𝑚 are positive, we have that
𝑎𝑖 𝑎𝑛𝑑 𝑏𝑖 have the same sign for i = 1, …., m,
Note: The inequality 𝑥 2 − 𝑥𝑦 + 𝑦 2 ≥ 𝑥 + 𝑦 so ∑𝑚 𝑖=1 𝑎𝑖 𝑏𝑖 >0, a contradiction.
can alternatively be shown by nothing that
𝑥 2 − 𝑥𝑦 + 𝑦 2 − 𝑥 − 𝑦 = (𝑥 − 𝑦)2 +
(𝑥 − 1)(𝑦 − 1) − 1 ≥ 0, 76. At the vertices of a cube are written eight
pair wise district natural numbers, and on
Since (𝑥 − 𝑦)2 ≥ 1. each of its edges is written the greatest
common divisor of the numbers at the end
points of the edge. Can the sum of the
75. Show that if the integers 𝒂𝟏 , … , 𝒂𝒎 are numbers written at the vertices be the
nonzero and for each k = 0, 1, …, m(n < m same as the sum of the numbers written at
-1), the edges?
𝒂𝟏 + 𝒂𝟐 𝟐𝒌 + 𝒂𝟑 𝟑𝒌 + ⋯ + 𝒂𝒎 𝒎𝒌 = 𝟎,
Sol.: This is not possible. Note that if a and b
Then the sequences 𝒂𝟏 , … , 𝒂𝒎 contains at least are natural numbers with a > b, then gcd(a,
𝑎
n + 1 pairs of consecutive terms having b) ≤ b and gcd(a, b) ≤2 .It follows that if a ≠ b,
opposite sings. (𝑎+𝑏)
then gcd(a, b)≤ 3
. Adding 12 such
Solution: We many assume 𝑎𝑚 > 0, since inequalities, corresponding to the 12 edges,
otherwise we may multiply each of the we find that the desired condition is only
(𝑎+𝑏)
numbers by -1. Consider the sequence possible if gcd(a, b) = in each case. But
3
𝑏1 , … , 𝑏𝑚 , where 𝑏𝑖 = ∑𝑛𝑗=0 𝑐𝑗 𝑖 𝑗 for an in this case the larger of a and b is twice the
smaller; suppose a = 2b. Consider the
146
numbers c and d assigned to the vertices of 78. Can the number obtained by written the
the other end points of the other two edges numbers from 1 to n in order (n >1) be
coming out of the vertex labeled a. Each of the same when read left-to-right and right-
these is either half of or twice a. If at least one to left?
is less a, it equals b; otherwise, both are equal.
Either option contradicts the assumption that Sol.: This is not possible. Suppose N = 123
the numbers are distinct. …321 is an m digit symmetric number,
formed by writing the numbers from 1 to n in
77. Three sergeants and several solders serve succession. Clearly m >18. Also let A and B be
in a platoon. The sergeants take turns on the numbers formed from the first and last k
duty. The commander has given the digits, respectively, of N, where k = ⌊𝑚/2⌋⎿ .
following orders: Then if 10𝑝 is the largest power of 10 dividing
(a) Each day, at least one task must be A, then n> 2. 10𝑝+1 , that is, n has at most p
issued to a soldier. +2 digits. Moreover, A and B must contain the
(b) No soldier may have more than fragments
two tasks or receive more than one
tasks in a single day. 99
⏟ …9⏟
100 … 01 𝑎𝑛𝑑 ⏟
100 … 0 ⏟
199 … 9
𝑝 𝑝 𝑝 𝑝
(c) The lists of soldiers receiving tasks
for two different days must not be Respectively, which is impossible.
the same.
(d) The first sergent violating any of 79. Do there exist three natural numbers
these orders will be jailed. greater than 1, such that the square of
each, minus one, is divisible by each of the
Can at least one of the sergeants, others?
without conspiring with the others,
Sol.: Such integers do not exist. Suppose a ≥ b
give tasks according to these rules and
≥ c satisfy the desired condition. Since 𝑎2 −
avoid being jailed?
1is divisible by b, the numbers a and b are
Sol.: The sergeants who goes third can avoid relatively prime. Hence the number 𝑐 2 − 1,
going to jail. We call a sequence of duties by which is divisible by a and b, must be a
the first, second and third sergeants in multiple of ab, so in particular 𝑐 2 − 1 ≥
succession a round. To avoid going to jail, the 𝑎𝑏. 𝐵𝑢𝑡 𝑎 ≥ 𝑐 𝑎𝑛𝑑 𝑏 ≥ 𝑐, 𝑠𝑜 𝑎𝑏 ≥ 𝑐 2 , a
third sergeant on the last day of each round contradiction.
gives tasks to precisely those soldiers who
80. In isosceles triangle ABC (AB = BC) one
received one task over the previous two days.
draws the angle bisector CD. The
(Such soldiers exist by the third condition).
perpendicular to CD through the center of
With this strategy, at the end of each cycle
the circumcircle of ABC intersects BC at E.
each soldier will have received either two
The parallel to CD through E meets AB at
tasks or none, and the number of the latter
F. Show that BE = FD.
will have decreased. It will end up, at some
point, that all of the soldiers have received Solution: We use directed angles modulo 𝜋.
two tasks, and the first sergeant will go to jail. Let O be the circumcircle of ABC, and K the
intersection of BO and CD. From the equality
of the acute angles BOE and DCA having
147
perpendicular sides, it follows that ∠BOE = 𝑀2 2𝑀

Hence 𝑘 ≤ 𝑚4 + 𝑚3, contradiction the fact that
∠KCE (CD being an angle bisector), which
P may have arbitrarily large degree.
means the points K, O, E, C lie on a circle.
From this it follows that ∠OKE = ∠OCE; but 82. The natural numbers a and b are such that
∠OCE = ∠OBE, so OB = OC, and hence ∠BKE 𝒂+𝟏 𝒃+𝟏
𝒃
+ 𝒂
= ∠KBE, or in other words BE = KE.
Moreover, ∠BKE = ∠KBE = ∠KBA, and so KE is an integer. Show that the greatest common
∥ AB. Consequently, FEKD is a parallelogram
divisor of a and b is not greater than √𝒂 + 𝒃.
and DF = KE. Therefore, DF = KE = BE as
desired. Solution: Let d = gcd(a, b) and put a =
(𝑚𝑑+1)
md and b = nd. Then we have +
81. Does there exist a finite set M of nonzero 𝑛𝑑
(𝑛𝑑+1) (𝑚2 𝑑+𝑚+𝑛2 𝑑+𝑛)
real numbers, such that for any natural = is an integer, so
𝑚𝑑 𝑚𝑛𝑑
number n a polynomial of degree no less that in particular, d divides 𝑚2 𝑑 + 𝑚 +
than n with coefficients in M, all of whose 𝑛2 𝑑 + 𝑛 and also m + n. However, this
roots are real and belong M? means d ≤ m + n, and so d ≤
Solution: Such a set does not exist. Suppose √𝑑(𝑚 + 𝑛) = √𝑎 + 𝑏 .
on the contrary that M = {𝑎1 , 𝑎1 , … , 𝑎𝑛 }
83. Let G be the centroid of the triangle ABC.
satisfies the desired property. Let m = min
Prove that if AB + GC = AC + GB, then ABC
{│𝑎1 │, …, │𝑎𝑛 │} and M = max {│𝑎1 │, …,
is isosceles.
│𝑎𝑛 │}; the condition implies M ≥ m > 0.
Sol.: Let a, b, c, be the lengths of sides BC, CA,
Consider the polynomial P(x) = 𝑏𝑘 𝑥 𝑘 + ⋯ +
AB, respectively. By Stewart’s theorem and
𝑏1 𝑥 + b0 all of whose coefficients b0 , … , bk are
the fact that G trisects each median (on the
roots x1 , … . , xk lie in M. By Vieta’s theorem.
side further from the vertex), we deduce
𝑏𝑘−1
− = 𝑥1 + ⋯ 𝑥𝑘 9𝐺𝐵2 = 2𝑎2 + 2𝑐 2 − 𝑏 2 , 9𝐺𝐶 2
bk
= 2𝑎2 + 2𝑏 2 − 𝑐 2 .
𝑏𝑘−2
𝑥1 𝑥2 + 𝑥1 𝑥3 + ⋯ + 𝑥𝑘−1 𝑥𝑘 = Now assume b > c. Assuming AB + GC = AC +
𝑏𝑘
GB, we have
And so
3(𝑏 − 𝑐) = √2𝑎2 + 2𝑏 2 − 𝑐 2
2
𝑏𝑘−1 𝑏𝑘−2 − √2𝑎2 + 2𝑐 2 − 𝑏 2
𝑥1 2 + ⋯ + 𝑥𝑘 2 = 2 −2 .
𝑏𝑘 𝑏𝑘
3(𝑏 2 − 𝑐 2 )
It follows that =
√2𝑎2 + 2𝑏 2 − 𝑐 2 + √2𝑎2 + 2𝑐 2 − 𝑏 2
2 2 2
𝑏𝑘−1 2 𝑏𝑘−2 3(𝑏 2 − 𝑐 2 )
𝑘𝑚 ≤ 𝑥1 + ⋯ + 𝑥𝑘 = −2 <
𝑏𝑘 2 𝑏𝑘
√2 (𝑏 − 𝑐)2 + 2𝑏 2 − 𝑐 2 + √2 (𝑏 − 𝑐)2 + 2𝑐 2 − 𝑏 2
𝑀2 𝑀
≤ 2+2 .
𝑚 𝑚 Since 𝑎2 > (𝑏 − 𝑐)2 by the triangle inequality.
However,
148
2 (𝑏 − 𝑐)2 + 2𝑏 2 − 𝑐 2 = (2𝑏 − 𝑐)2 , so we more other agents, but no two agents are
have both watching each other. Moreover, any
10 agents can be ordered so that the first a
3(𝑏2 −𝑐 2 )
3(𝑏 − 𝑐) < . watching the second, the second is
2𝑏−𝑐+│2𝑐−𝑏│
watching the third, etc. , and the last is
If b ≤2c then the two sides are equal, a watching the first. Show that any 11 agents
contradiction. If b ≤ 2c we get 9(𝑏 − 𝑐)2 < can also be so ordered.
3(𝑏 2 − 𝑐 2 ); upon dividing off 3(b –c) and
Sol.: We say two agents are partners if
rearranging, we get 2b < 4c, again a
neither watches the other. First note that
contradiction. Thus we cannot have b > c or
each agent watches at least 7 others; if an
similarly b < c, so b = c.
agent were watching 6 or fewer others, we
84. Find all real solutions of the equation could take away 6 agents and leave a group of
10 which could not be arranged in a circle.
√𝒙𝟐 − 𝒑 + 𝟐√𝒙𝟐 − 𝟏 = 𝒙 Similarly, each agent is watched by at least 7
others. Hence each agent is allied with at
For each real value of p. most one other.
Sol.: Squaring both sides, we get Given a group of 11 agents, there must be one
agent x who is not allied with any of the
𝑥 2 = 5𝑥 2 − 4 − 𝑝 + 4√(𝑥 2 − 𝑝)(𝑥 2 − 1
others in the group (since allies come in
Isolating the radical and squaring again, we pairs). Remove that agent and arrange the
get other 10 in a circle. The Removed agent
watches at least one of the other 10 and is
16(𝑥 2 − 𝑝)(𝑥 2 − 1) = (4𝑥 2 − 𝑝 − 4)2 , watched by at least one. Thus there exists a
pair, u, v of agents with u watching v, u
Which reduces to (16 − 8𝑝)𝑥 2 = 𝑝2 − 8𝑝 + watching x and x watching v (move around
16. Since x ≥ 0(it is the sum of two square the circle until the direction of the arrow to x
│𝑝−4│
roots), we have x = changes); thus x can be spliced into the loop
√16−8𝑝
between u and v.
If a solution exists. We need only determine 𝒏
when this value actually satisfies. Certainly 86. Let ∏𝟏𝟗𝟗𝟔 𝟑 𝒌𝟏
𝒏=𝟏 (𝟏 + 𝒏𝒙 ) = 𝟏 + 𝒂𝟏 𝒙 +
we need p ≤ 2. In that case plugging in our 𝒂𝟐 𝒙𝒌𝟐 + ⋯ + 𝒂𝒎 𝒙𝒌𝒎 ,

claimed value of x and multiplying through by
where 𝒂𝟏 , 𝒂𝟐 , … , 𝒂𝒎 are nonzero and 𝒌𝟏 <
√16 − 8𝑝 gives │3p -4│+2│p│ = 4 –p. 𝒌𝟐 < ⋯ < 𝒌𝒎 . Find 𝒂𝟏𝟗𝟗𝟔 .
4 4
If p ≥ 3 this becomes 6p = 8, or p = 3; if 0 ≤ p Sol.: Note that 𝑘𝑖 is the number obtained by
4
≤3 this holds identically; if p ≤ 0 this writing i in base 2 and reading the result as a
number in base 3, and 𝑎𝑖 is the sum of the
becomes 4p = 0, or p = 0. We conclude there
exponents of the powers of 3 used. In
exists a solution if and only if 0≤ 𝑝 ≤ 4/3, in
particular, 1996 = 210 + 29 + 28 + 27 + 26 +
which case it is the solution given above.
23 + 22 , 𝑠𝑜 𝑎1996 = 10 + 9 + 8 + 6 + 6 + 3 +
85. At port Aventura there are 16 secret 2 = 45.
agents. Each agent is watching one or
149
87. In a parallelogram ABCD with ∠A <𝟗𝟎°, triangles of total base less than 1 and height
the circle with diameter AC meets the lines at most h, as is the area contained in the
CB and CD again at E and F, respectively, triangle but not the rectangles. Hence the sum
and the tangent to this circle at A meets BD 1 ℎ
differs from 2 but at most 2, as desired.
at P. Show that P, F, E are collinear.
89. In a convex quadrilateral ABCD, triangles
Sol.: Without loss of generality, suppose B, D,
ABC and ADC have the same area. Let E be
P occur in that order along BD. Let G and H be
the intersection of AC and BD, and let the
the second intersection of AD and AB with the
parallels through E to the lines AD, DC, CB,
circle. By Menelaos’s theorem, it suffices to
BA meet AB, BC, CD, DA at K, L, M, N,
show that
respectively. Compute the ratio of the
𝐶𝐸. 𝐵𝑃. 𝐷𝐹 areas of the quadrilaterals KLMN and
=1 ABCD.
𝐸𝐵. 𝑃𝐷. 𝐹𝐶
Find note that Solution: The triangles EKL and DAC are
homothetic, so the ratio of their areas equals
𝐵𝑃 𝐴𝐷 sin ∠𝐵𝐴𝑃 sin ∠𝐴𝑃𝐷 sin ∠𝐵𝐴𝑃
= sin ∠𝐴𝑃𝐵 sin ∠𝐷𝐴𝑃 = sin ∠𝐷𝐴𝑃 𝐸𝐾 𝐸𝐿 𝐵𝐸 2 1
𝐴𝐵 𝐷𝑃 (𝐴𝐷) (𝐶𝐷) = (𝐵𝐷) = 4, since B and D are
Since AP is tangent to the circle, ∠BAP = equidistant from the line AC. Similarly the
1
∠HAP ratio of the areas of EMN and BCA is 4, so the
1
= 𝜋 - ∠HCA = 𝜋 -∠FCA; similarly, ∠DAP = union of the triangles EKL and EMN has area 4
∠GCA = ∠EAC. We conclude that of ABCD.
𝐵𝑃 𝐴𝐷
=
sin ∠𝐹𝐴𝐶
=
𝐹𝐶 As for triangle EKN, its base KN is parallel to
𝐴𝐵 𝐷𝑃 sin ∠𝐸𝐴𝐶 𝐸𝐶
BD and half as long, so its area is one-fourth
𝐷𝐹 𝐷𝐴 that of ABD. Similarly EML has area one-
Finally we note that = because the right
𝐵𝐸 𝐴𝐵 fourth that of BCD, and so the union of the
triangles AFD and AED have the same angles
two triangles EKN and EML has area one
at B and D and are thus similar. This prove
fourth that of ABCD, and so the quadrilateral
the claim.
KLMN has area one-half that of ABCD.
88. Given real number s 0 = 𝒙𝟏 < 𝒙𝟐 < ⋯ <
90. Find the maximum number of pair wise
𝒙𝟐𝒏 < 𝒙𝟐𝒏+𝟏 = 𝟏 with 𝒙𝒊+𝟏 − 𝒙𝒊 ≤ 𝒉 for 1
disjoint sets of the from 𝑺𝒂,𝒃 =
𝟏−𝒉
≤ i ≤ 2n, show that 𝟐
< {𝒏𝟐 + 𝒂𝒏 + 𝒃: 𝒏 ∈ 𝒁}𝒘𝒊𝒕𝒉 𝒂, 𝒃 ∈ 𝒁.
𝟏+𝒉
∑𝒏𝒊=𝟏 𝒙𝟐𝒊 (𝒙𝟐𝒊+𝟏 − 𝒙𝟐𝒊−𝟏 ) < .
𝟐 Solution: Only two such sets are possible, for
Sol.: The different between the middle example, with (a, b) = (0, 0) and (0, 2) (since
1 2 is not a difference of squares). There is no
quantity and is the difference between the
2 loss of generality in assuming a ∈ {0, 1} by a
sum of the areas of the rectangles bounded by suitable shift of n, and the sets generated by
the lines x = 𝑥2𝑖−1 , 𝑥 = 𝑥2𝑖+1 , 𝑦 = 0, 𝑦 = 𝑥2𝑖 (0, a) and (1, b) have the common value
and the triangle bounded by the lines y = 0, x (𝑎 − 𝑏)2 + 𝑎 = (𝑎 − 𝑏)2 + (𝑎 − 𝑏) + 𝑏.Thus
= 1, x = y. The area contained in the we have a = 0 or a = 1 universally.
rectangles but not the triangle is a union of
150
First suppose a = 0. If b –c ≠ 2 (mod 4), then m +n ≤ 197. Moreover, m +n and m –n

(0, b) and (0, c) gives a common value are both odd or both even, so 11, 110 and
because b –c is a difference of squares, clearly 1010 lead to no solutions. From this we
this precludes having three disjoint sets. Now get exactly five acceptable factorizations.
suppose a = 1. If b –c is even, we can find x, y
such that b –c = (x +y +1) (x –y), and so 𝑥 2 + 101 = (m+ n) (m –n) = 101 × 1
𝑥 + 𝑏 = 𝑦 2 + 𝑦 + 𝑐, again, this precludes 1001 = (m +n) (m –n) = 143 × 7
having three disjoint sets.
1001 = (m +n) (m –n) = 91 × 11
91. For which ordered pairs of positive real
numbers (a, b) is the limit of every 1001 = (m+ n) (m –n) = 77 × 13
sequence {𝒙𝒏 } satisfying the condition.
𝐥𝐢𝐦 (𝒂𝒙𝒏+𝟏 − 𝒃𝒙𝒏 ) = 𝟎 1100 = (m+ n) (m –n) = 110 × 10
𝒏 →𝜶
Giving the solutions (M, N) = (2601,
Sol.: The holds if and only if b < a, if b > a, the 2500), (5625, 4624), (2601, 1600),
𝑏 𝑛
sequence 𝑥𝑛 = ( ) satisfies the condition (2025, 1024), (3600, 2500).
𝑎
but does not go to zero, if b = a, the sequence
1 1 93. A function f defined on the positive
𝑥𝑛 = 1 + 2 + ⋯ + 𝑛 does likewise. Now integers satisfies f(1) = 1996 and
suppose b < a. If L and M are the limit inferior 𝒇(𝟏) + 𝒇(𝟐) + ⋯ + 𝒇(𝒏) =
and limit superior of the given sequence, the 𝒏𝟐 𝒇(𝒏)(𝒏 > 1).
𝑏
condition implies M ≤ (𝑎) 𝐿; since L ≤ M, we
Sol.: An easy induction will show that
𝑏
have M ≤ (𝑎) 𝑀, and so L, M ≥ 0. Similarly,
𝑏
2 × 1996
the condition implies L ≥ (𝑎) 𝑀, and since M 𝑓(𝑛) =
𝑛(𝑛 + 1)
𝑏
≥ L, we have L ≥ (𝑎) 𝐿, so L, M ≤ 0; therefore
Namely,
L = M = 0 and the sequence converges to 0.
1 3992 3992
𝑓(𝑛) = 𝑛2 −1 ( + ⋯ + (𝑛−1)𝑛)
92. Consider the pair of four –digit positive 1.2
integers (M, N) = (3600, 2500). Notice 3992 1 1 1 1 1

that M and N are both perfect squares, = 𝑛2 −1 (1 − 2 + 2 − 3 + ⋯ + 𝑛−1 − 𝑛)
with equal digits in two places, and
3992 1
differing digits in the remaining two = (𝑛+1)(𝑛−1) (1 − 𝑛)
places. Moreover, when the digits differ,
3992 𝑛−1 3992
the digit in M is exactly one greater than = (𝑛+1)(𝑛−1) 𝑛
= 𝑛(𝑛+1)
the corresponding digit in N. Find all pairs
of four –digit positive integers (M, N) with 2
In particular, f(1996) = 1997
these properties.
𝒏
Sol.: If M = 𝑚2 𝑎𝑛𝑑 𝑁 = 𝑛2, then (m+ n) 94. Define 𝒒(𝒏) = ⌊ ⌋ (𝒏 = 𝟏, 𝟐, … ).
⌊√𝒏⌋
(m –n) ∈{11, 101, 110, 1001, 1010, 1100}.
Determine all positive integers n for which
Since M and N are four-digit numbers, we q(n) > q(n +1).
must have 32 ≤ n <m ≤ 99, and so 65 ≤
151
Sol.: We have q(n) > q(n+1) if and only if n If x = 0, we have m = 1, yielding (x, y, z) = (0,
+1 is a perfect square. Indeed, if n +1 = 𝑚2 , 1, 2). Otherwise, 3𝑚 − 1 is divisible by 4, so m
𝑥 𝑚 𝑚
then is even and 22+1 = (3 2 + 1) (3 2 − 1). The
𝑚2 − 1 𝑚2 two factors on the right are powers of 2
𝑞(𝑛) = ⎣ ⎦ = 𝑚 + 1, 𝑞(𝑛 + 1) = ⎣ ⎦ differing by 2, so they are 2 and 4, giving x =
𝑚−1 𝑚
=𝑚 4 and (x, y, z) = (4, 2, 5).
On the other hand, for n = 𝑚2 + 𝑑 with 0 ≤ 97. The sides a, b, c and u, v, w of two triangles
𝑚2 +𝑑 𝑑 ABC and UVW are related by the
d≤ 2m, 𝑞(𝑛) = ⎣ 𝑚 ⎦ =𝑚+ ⎣𝑚⎦
equations.
Which is non-decreasing.
𝒖(𝒗 + 𝒘 − 𝒖) = 𝒂𝟐 ,
95. Let a, b, c be positive real numbers.
𝒗(𝒘 + 𝒖 − 𝒗) = 𝒃𝟐 ,
(a) Prove that 𝟒(𝒂𝟑 + 𝒃𝟑 ) ≥ (𝒂 + 𝒃)𝟑
(b) Prove that 𝟗(𝒂𝟑 + 𝒃𝟑 + 𝒄𝟑 ) ≥ 𝒘(𝒖 + 𝒗 − 𝒘) = 𝒄𝟐 .
(𝒂 + 𝒃 + 𝒄)𝟑
Prove that ABC is acute, and express the angles
Sol.: Both parts follow from the Power Mean U, V, W in terms of A, B, C.
inequality: for r > 1 and 𝑥1 , … , 𝑥𝑛 positive,
Sol.: Note that 𝑎2 + 𝑏 2 − 𝑐 2 = 𝑤 2 − 𝑢2 −
𝑥1 𝑟 + ⋯ + 𝑥𝑛 𝑟
1/𝑟
𝑥1 + ⋯ + 𝑥𝑛 𝑣 2 + 2𝑢𝑣 = (𝑤 + 𝑢 − 𝑣)(𝑤 − 𝑢 + 𝑣) > 0 by
( ) ≥ , the triangle inequality, so cos 𝐶 > 0. By this
𝑛 𝑛
reasoning, all of the angles of triangle ABC are
Which in turn follows from Jensen’s acute. Moreover,
inequality applied to convex function 𝑥 𝑟 .
𝑎2 + 𝑏 2 − 𝑐 2
cos 𝐶 =
96. Find all Solutions in non-negative integers 2𝑎𝑏
x, y, z of the equation.
𝟐𝒙 + 𝟑𝒚 = 𝒛𝟐 (𝑤 + 𝑢 − 𝑣)(𝑤 − 𝑢 + 𝑣)
=√
4𝑢𝑣
Sol.: If y = 0, then 2𝑥 = 𝑧 2 − 1 = (𝑧 + 1)(𝑧 −
1), so z +1 and z -1 are powers of 2. The only
powers of 2 which differ by 2 are 4 and 2, so 𝑤 2 − 𝑢2 − 𝑣 2 + 2𝑢𝑣 1
=√ = √1 − cos 𝑈
(x, y, z) = (3, 0, 3). 4𝑢𝑣 √2
If y > 0, then 2𝑥 is a quadratic residue modulo From which we deduce U = 1 − 2𝑐𝑜𝑠 2 𝐴 =

3, hence x is even. Now we have 3𝑦 = 𝑧 2 − cos(𝜋 − 2𝐴).
𝑥 𝑥
2𝑥 = (𝑧 + 22 ) (𝑧 − 22 ). The factors are Therefore U = 𝜋 -2A, and similarly V = 𝜋- 2B,
powers of 3, say z+2𝑥/2 = 3𝑚 and z −2𝑥/2 = W = 𝜋- 2C.
𝑥
3𝑛 , but then 3𝑚 − 3𝑛 = 22+1 . Since the right
98. Two circles 𝑺𝟏 and𝑺𝟐 touch each other
side is not divisible by 3, we must have n = 0
𝑥 externally at K; they also touch a circle S
and 3𝑚 − 1 = 22+1 . internally at 𝑨𝟏 𝒂𝒏𝒅 𝑨𝟐, respectively. Let
P be one point of intersection of S with the
152
common tangent to 𝑺𝟏 𝒂𝒏𝒅 𝑺𝟐 at K. The 2 sin 2 + 4 sin 4 + ⋯ + 178 sin 178

line P𝑨𝟏 𝒎𝒆𝒆𝒕𝒔 𝑺𝟏 𝒂𝒈𝒂𝒊𝒏 𝒂𝒕 𝑩𝟏 , and P𝑨𝟐 = 90 cot 1 (2)
meets 𝑺𝟐 again at 𝑩𝟐 . Prove that 𝑩𝟏 𝑩𝟐 is a
common tangent to 𝑺𝟏 𝒂𝒏𝒅 𝑺𝟐 . Which is equivalent to
Sol.: It suffices to show that ∠𝐵2 𝐵1 𝑂1 = 2 sin 2 sin 1 + 2(2 sin 4 . sin 1) + … + 89
𝜋
∠𝐵1 𝐵2 𝑂2 = 2 , where 𝑂1 𝑎𝑛𝑑 𝑂2 are the (2 sin 178 . sin 1) = 90 cos 1. (3)
centers of 𝑆1 𝑎𝑛𝑑 𝑆2 , respectively. By power –
of-a-point. P𝐴1 . 𝑃𝐵1 = 𝑃 𝐾 2 = 𝑃𝐴2 . 𝑃𝐵2 , so Using the identity 2 sin 𝑎 . sin 𝑏 = cos(𝑎 − 𝑏) −
triangles P𝐴1 𝐴2 𝑎𝑛𝑑 𝑃𝐵2 𝐵1 are similar. cos(𝑎 + 𝑏), we find
1
Therefore ∠P𝐵1 𝐵2 = ∠𝑃𝐴2 𝐴1 = 2 ∠𝑃𝑂𝐴1 , 2 sin 2 . sin 1 + 2(2 sin 4 . sin 1) + ⋯ + 89
where O is the center of S.
(2 sin 178 . sin 1)
Now note that the homothety at 𝐴1 carrying
𝑆1 to S takes 𝑂1 𝑡𝑜 𝑂 𝑎𝑛𝑑 𝐵1 𝑡𝑜 𝑃, so ∠𝑃𝑂𝐴1 = = (cos 1 − cos 3) + 2(cos 3 − cos 5) + ⋯ +
∠𝐵1 𝑂1 𝐴1. From this we deduce ∠P𝐵1 𝐵2 = 89(cos 177 − cos 179)
∠𝐵1 𝑂1 𝑁, where N is the midpoint of 𝐴1 𝐵1 .
= cos 1 + cos 3 + cos 5 + ⋯ + cos 175
Finally, ∠𝐵2 𝐵1 𝑂1 = 𝜋 − ∠P𝐵1 𝐵2 − ∠𝑂1 𝐵1 𝑁 =
𝜋
2
, as desired. cos 177 − 89 cos 179
99. Find all solutions in positive real numbers = cos 1 + (cos 3 + cos 177) + ⋯
a, b, c, d to the following system of + (cos 89 + cos 91)
equations: − 89 cos 179
a + b+ c + d = 12
= cos 1 + 89 cos 1 = 90 cos 1,
abcd = 27 +ab +ac +ad +bc +bd +cd.
So (1) is true.
Sol.: The first equation implies abcd = ≤ 81 by
the arithmetic geometric mean inequality, Note: An alternate solution involves complex
with equality holding for a = b = c = d = 3. numbers. One expresses sin n as
Again by AM-GM,
𝜋𝑖𝑛 −𝜋𝑖𝑛
1/2 (𝑒 180 −𝑒 180 )
abcd ≥ 27 +6 (𝑎𝑏𝑐𝑑) 𝑎𝑛𝑑 𝑢𝑠𝑒𝑠 𝑡ℎ𝑒 𝑓𝑎𝑐𝑡 𝑡ℎ𝑎𝑡
(2𝑖)
However, 𝑥 2 − 6𝑥 − 27 ≥ 0 𝑓𝑜𝑟 𝑥 ≤
𝑥 + 2𝑥 2 + ⋯ + 𝑛𝑥 𝑛 = (𝑥 + ⋯ + 𝑥 𝑛 ) +
−3 𝑜𝑟 𝑥 ≥ 9, so (𝑎𝑏𝑐𝑑)1/2 ≥ 9, hence abcd ≥
(𝑥 2 + ⋯ + 𝑥 𝑛 ) + ⋯ + 𝑥 𝑛
81. We conclude abcd = 81, and hence a = b=
c= d= 3. 1
= 𝑥−1 [(𝑥 𝑛+1 − 𝑥) + (𝑥 𝑛+1 − 𝑥 2 ) + ⋯ +
100. Prove that the average of numbers n (𝑥 𝑛−1 − 𝑥 𝑛 )]
𝐬𝐢𝐧 𝒏° (𝒏 = 𝟐, 𝟒, 𝟔, … , 𝟏𝟖𝟎)𝒊𝒔 𝐜𝐨𝐭 𝟏°.
𝑛𝑥 𝑛+1 𝑥 𝑛+1 −𝑥
= − .
𝑥−1 (𝑥−1)2
Solution: All arguments of trigonometric
functions will be in degrees. We need to prove 101. For any nonempty set S of real
numbers, let 𝜎(S) denote the sum of the
153
elements of S. Given a set A of n positive triangle ABC and the interior of its
integers, consider the collection of all 𝟐
reflection A’B’C’ in l has area more than
𝟑
distinct sums 𝜎(S) as S ranges over the
the area of triangle ABC.
nonempty subsets of A. Prove that this
collection of sums can be partitioned into n Solution :
classes so that in each classes, the ratio of
the largest sum of the smallest sum does In all of the solutions, a, b, c denote the lengths
not exceed 2. of the sides BC, CA, AB, respectively, and we
assume without loss of generality that a ≤ b ≤
Sol.: Let A = {𝑎1 , 𝑎2 , … , 𝑎𝑛 } where 𝑎1 < 𝑎2 < c.
⋯ < 𝑎𝑛 . For i = 1, 2, …, n let 𝑠𝑖 = 𝑎1 + 𝑎2 +
⋯ + 𝑎𝑖 𝑎𝑛𝑑 𝑡𝑎𝑘𝑒 𝑠0 = 0. All the sums is Choose l to be the angle bisector of ∠A. Let P be
question are less than or equal to 𝑠𝑛 , and if 𝜎 is the intersection of l with BC. Since AC ≤ AB, the
one of them, we have intersection of triangles ABC and A’B’C’ is the
disjoint union of two congruent triangles. APC
𝑠𝑖−1 < 𝜎 < 𝑠𝑖 (1) and APC’. Considering BC as a base, triangles
APC and ABC have equal altitudes, so their
For an appropriate i. Divide the sums into n
areas are in the same are in the same ratio as
classes by letting 𝐶𝑖 denote the class of sums
their bases:
satisfying (1). We claim that these classes have
the desired property. To establish this, it 𝐴𝑟𝑒𝑎 (𝐴𝑃𝐶) 𝑃𝐶
= .
suffices to show that (1) implies. 𝐴𝑟𝑒𝑎 (𝐴𝐵𝐶) 𝐵𝐶
1 Since AP is the angle bisector of ∠A, we have

𝑠 < 𝜎 < 𝑠𝑖 (2)
2 𝑖 𝐵𝑃 𝑐
= 𝑏, so
𝑃𝐶
Suppose (1) holds. The inequality 𝑎1 + 𝑎2 +
𝑃𝐶 𝑃𝐶 1
⋯ + 𝑎𝑖−1 = 𝑠𝑖−1 < 𝜎 shows that the sum 𝜎 = =𝑐
𝐵𝐶 𝐵𝑃 + 𝑃𝐶 +1
contains at least one addend 𝑎𝑘 𝑤𝑖𝑡ℎ 𝑘 ≥ 𝑖. 𝑏
Then since then 𝑎𝑘 ≥ 𝑎𝑖 , we have
Thus it suffices to prove
𝑠𝑖 − 𝜎 < 𝑠𝑖 − 𝑠𝑖−1 = 𝑎𝑖 ≤ 𝑎𝑘 ≤ 𝜎, which
2 2
together with 𝜎≤ 𝑠𝑖 implies (2). 𝑐 > . (1)
+1 3
𝑏
Note: The result does not hold if 2 is replaced
by any smaller constant c. To see this, choose n 𝐵𝑢𝑡 2𝑏 ≥ 𝑎 + 𝑏 > 𝑐 by the triangle inequality,
𝑐
such that 𝑐 < 2 − 2−(𝑛−1) and consider the set so 𝑏
< 2 and thus (1) holds.
{1, … , 2𝑛−1 }. If this set is divided into n subsets,
103. An n –term sequence {𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏 } in
two of 1,……, 2𝑛−1 , 1 + …….+ 2𝑛−1 must lie in
which each term is either 0 or 1 is called a
the subset, and their ratio is at least (1+…..+
binary sequence of length n. Let an be the
2𝑛−1 )/(2𝑛−1 ) = 2 − 2(𝑛−1) > c.
number of binary sequences of length n
102. Let ABC be a triangle. Prove that there containing no three consecutive terms
is a line l (in the plane of triangle ABC) such equal to 0, 1, 0 in that order. Let 𝒃𝒏 be the
that the intersection of the interior of number of binary sequences of length n
154
that contain no four consecutive terms All angles will be in degrees. Let x = ∠PCB. Then
equal to 0, 0, 1, 1 or 1, 1, 0, 0 in that order. ∠PBC = 80 –x. By the Law of Sines,
Prove that 𝒃𝒏+𝟏 = 𝟐𝒂𝒏 for all positive
𝑃𝐴 𝑃𝐵 𝑃𝐶 sin ∠𝑃𝐵𝐴 sin ∠𝑃𝐶𝐵 sin ∠𝑃𝐴𝐶
integers n. 1 = 𝑃𝐵 𝑃𝐶 𝑃𝐴 = sin ∠𝑃𝐴𝐵 sin ∠𝑃𝐵𝐶 sin ∠𝑃𝐶𝐴
Sol.: We refer to the binary sequences counted sin 20 sin 𝑥 sin 40 4 sin 𝑥 sin 40𝑐𝑜𝑠 10
= sin 10 sin(80−𝑥) sin 30 = sin(80−𝑥)
.
by (𝑎𝑛 ) and (𝑏𝑛 ) as “type A” and “type B”,
respectively. For each binary sequence The identity 2 sin 𝑎 . cos 𝑏 = sin(𝑎 − 𝑏) +
(𝑥1 , 𝑥2 , … , 𝑥𝑛 ) there is a corresponding binary sin(𝑎 + 𝑏)now yields
sequence (𝑦0 , 𝑦1 , … , 𝑦𝑛 ) obtained by setting
2 sin 𝑥(sin 30+sin 50) sin 𝑥(1+2 cos 40)
𝑦0 = 0 𝑎𝑛𝑑 𝑦1 = 𝑥1 + 𝑥2 + ⋯ + 𝑥𝑖 mod 2, i = 1= = ,
sin(80−𝑥) sin(80−𝑥)
1, 2, …, n. (2)
So,
(Addition mod 2 is defined as follows: 0 +0 = 1
+1 = 0 and 0 + 1 = 1 +0 = 1.) Then 2 sin 𝑥 cos 40 = sin(80 − 𝑥) − sin 𝑥 =
2 sin(40 − 𝑥) cos 40.
𝑥𝑖 = 𝑦𝑖 + 𝑦𝑖−1 𝑚𝑜𝑑 2, 𝑖 = 1, 2, … , 𝑛,
This gives x = 40 –x and thus x = 20. It
And it is easily seen that (1) provides a one-to – follows that ∠ACB = 50 = ∠BAC, so triangle
one correspondence between the set of all ABC is isosceles.
binary sequences of length n and the set of
binary sequences of length n +1 in which the 105. Solve the system of equations:
𝟏
first term is 0. Moreover, the binary sequence √𝟑𝒙 (𝟏 + 𝒙+𝒚) = 𝟐
(𝑥1 , 𝑥2 , … , 𝑥𝑛 ) has three consecutive terms 𝟏
√𝟕𝒚 (𝟏 − 𝒙+𝒚) = 𝟒√𝟐
equal 0, 1, 0 in that order if and only if the
corresponding sequence (𝑦0 , 𝑦1 , … , 𝑦𝑛 ) has four
Sol.: Let u =√𝑥, 𝑦 = √𝑦, so the system
consecutive terms equal to 0, 0, 1, 1 or 1, 1, 0, 0
in that order, so the first is of type A if and only becomes
if the second is of type B. The set of Type B 𝑢 2
sequences of length n +1 in which the first term 𝑢+ =
𝑢2 + 𝑣 2 √3
is 0 is exactly half the total number of such
sequences, as can be seen by means of the 𝑣 4√2
𝑣− = .
mapping in which 0’s and 1’s are interchanged. 𝑢2 +𝑣 2
√7
Now let z = u +vi; the system then reduces to

the single equation
104. Triangle ABC has the following
property: there is an interior point P such 1 1 2√2
𝑧+ = 2( + 𝑖).
that ∠PAB = 10°, ∠𝑷𝑩𝑨 = 𝟐𝟎°, ∠𝑷𝑪𝑨 = 𝑧 √3 √7
𝟑𝟎°, 𝒂𝒏𝒅 ∠𝑷𝑪𝑨 = 𝟒𝟎° . Prove that
triangle ABC is isosceles. Let t denote the quantity inside the
parentheses; then
First Solution :
𝑧 = 𝑡 ± √𝑡 2 − 1
155
=
1
+
2√2
𝑖 ±(
2
+ 3, 4 occur in a block. Thus the number of
√21)
√3 √7 √21
permutations of the desired from is n! -24 (n -
From which we deduce 2)! + 24(n -3)!
2 2 108. Determine all function f: ℕ ⟶ℕ

1 2 2√2
𝑢= ( ± ) ,𝑣 = ( ± √2) . satisfying (for all n ∈ℕ)
√3 √21 √7
𝒇(𝒏) + 𝒇(𝒏 + 𝟏)
106. Let ABCD be a tetrahedron with AB =
= 𝒇(𝒏 + 𝟐)𝒇(𝒏 + 𝟑)
AC = AD and circumcenter O. Let G be the
− 𝟏𝟗𝟗𝟔.
centroid of triangle ACD, let E be the
midpoint of BG, and let F be the midpoint Sol.: From the given equation, we deduce
of AE. Prove that OF is perpendicular to BG
𝑓(𝑛) − 𝑓(𝑛 + 2)
if and only if OD is perpendicular to AC.
= 𝑓(𝑛 + 3)[𝑓(𝑛 + 2)
Sol.: We identify points with their vectors − 𝑓(𝑛 + 4)]
originating from the circumcenter, so that A. B =
If f(1) > f(3), then by induction, f(2m -1) > f(2m
A. C = A.D and
+1) for all m > 0, giving an infinite decreasing
𝐴2 = 𝐵2 = 𝐶 2 = 𝐷 2 . sequence f(1), f(3), …. Of positive integers, a
𝑁𝑜𝑤 (𝑂 − 𝐹). (𝐵 − 𝐺) contradiction. Hence f(1) ≤ f(3), and similarly
1 f(n) ≤ f(n +2) for all n.
= (𝐴 + 𝐸). (𝐵 − 𝐺)
2
1 Now note that
= [(2𝐴 + 𝐵 + 𝐺). (𝐵 − 𝐺)]
4
1 0 = 1996 + 𝑓(𝑛) + 𝑓(𝑛 + 1) − 𝑓(𝑛
= [18𝐴. 𝐵 − 6𝐴. (𝐴 + 𝐶 + 𝐷) + 9𝐵2 + 2)𝑓(𝑛 + 3)
36
− (𝐴 + 𝐶 + 𝐷)2 ] ≤ 1996 + 𝑓(𝑛 + 2)
1 + 𝑓(𝑛 + 3)
= [2𝐴. 𝐷 − 2𝐶. 𝐷]
36 − 𝑓(𝑛 + 2)𝑓(𝑛 + 3)
Therefore OF ⊥ BF if and only if OD ⊥ AC. = 1997 − [𝑓(𝑛 + 2) − 1][𝑓(𝑛 + 3) − 1].
In particular, either f(n +2) = 1 or f(n +3) ≤

1997, and vice versa. The numbers f(2m+1) –
107. Determine, as a function of n, the
f(2m-1) are either all zero or all positive, and
number of permutations of the set {1, 2, …,
similarly for the numbers f(2m+ 2) –f(2m). If
n} such that no three of 1, 2, 3, 4 appear
they are both positive, eventually f(n +2) and
consecutively.
f(n+3) both exceed 1997, a contradiction.
Sol.: There are n! permutations in all. Of those,
We now split into three cases. If f(2m) and f(2m
we exclude (n -2)! Permutations for each
+1) are both constant, we have [f(2m) -
arrangement of 1, 2, 3, 4 into an ordered triple
1][f(2m+1)-1] = 1997 and so either f(2m) = 1
and one remaining element, or 24(n -2)! in all.
and f(2m +1) = 1997 or vice versa. If f(2m +1) is
However, we have twice excluded each of the
constant but f(2m) is not, then 𝑓(2𝑚 + 1) = 1
24(n-3)! Permutations in which all four of 1, 2,
156
for all m and 𝑓(2𝑚 + 2) = 𝑓(2𝑚) + 1 𝜋+𝛼 1 𝛼

2
cot 4 − 6 cot 2 .
1997, 𝑠𝑜 𝑓(2𝑚) = 1997(𝑚 − 1) + 𝑓(2).
110. Let a, b, c, d be four nonnegative real
Similarly, if f(2m) is not constant, then f(2m)= 1
numbers satisfying the condition
and f(2m +1) = 1997m + f(1).
𝟐(𝒂𝒃 + 𝒂𝒄 + 𝒂𝒅 + 𝒃𝒄 + 𝒃𝒅 + 𝒄𝒅)
109. Consider triangles ABC where BC = 1 + 𝒂𝒃𝒄 + 𝒂𝒃𝒅 + 𝒂𝒄𝒅
𝝅 + 𝒃𝒄𝒅 = 𝟏𝟔
and ∠BAC has a fixed measure 𝜶 > 𝟑 .
Determine which such triangle minimizes Prove that
the distance between the incenter and
𝟐
centroid of ABC, and compute this distance 𝒂+𝒃+𝒄+𝒅≥ (𝒂𝒃 + 𝒂𝒄 + 𝒂𝒅
𝟑
in terms of 𝛼.
+ 𝒃𝒄 + 𝒃𝒅 + 𝒄𝒅)
Sol.: If we fix B and C and force A to lie above And determine when equality occurs.
the line BC, then A is constrained to an arc. The
centroid of ABC is constrained to the image of Sol.: For i = 1, 2, 3, define 𝑠𝑖 as the average of
1 the products of the i-element subsets of {a, b, c,
that arc under a homothety at the midpoint of
3
BC. On the other hand, the incenter subtends d}. Then we must show
(𝜋/𝛼)
an angle of 2
at BC, so it is also constrained 3𝑠2 + 𝑠3 = 4 ⇒ 𝑠1 ≥ 𝑠2 .
to lie on an arc, but its arc passes through B and
It suffices to prove the (unconstrained)
C. Since the top of the incenter arc lies above
homogeneous inequality
the top of the centroid arc, the arcs cannot
intersect (or else their circles would intersect 3𝑠2 2 𝑠1 2 + 𝑠3 𝑠1 3 ≥ 4𝑠2 3 ,
four times). Moreover, if we dilate the centroid
arc about the midpoint of BC so that its image is As then 3𝑠2 + 𝑠3 = 4 will imply
tangent to the incenter arc at its highest point,
(𝑠1 − 𝑠2 )3 + 3(𝑠1 3 − 𝑠2 3 ) ≥ 0.
the image lies between the incenter arc and BC.
In other words, the distance from the incenter We now recall two basic inequalities about
to the centroid is always at least the symmetric means of nonnegative real numbers.
corresponding distance for ABC isosceles. Hence The first is Schur’s inequality:
we simply compute the distance for ABC
isosceles. Hence we simply compute the 3𝑠1 3 + 𝑠3 ≥ 4𝑠1 𝑠2 .
distance in that case. The incenter makes an While the second,
(𝜋/𝛼)
isosceles triangle of vertex angle 2
, so its
1 𝑠1 2 ≥ 𝑠2
2 cot(𝜋−𝛼)
altitude is 4
.
Is a case of Maclaurin’s inequality 𝑠𝑖 𝑖+1 ≥
Meanwhile, the distance of the centroid to BC is 𝑠𝑖+1 𝑖 .These combine to prove the claim:
1 1
that of A to BC, or 6 cot(𝛼/2). The desired
3 𝑠2 2 𝑠3
distance is thus 3𝑠2 2 𝑠1 2 + 𝑠3 𝑠1 3 ≥ 3𝑠2 2 𝑠1 2 + ≥ 4𝑠2 3 .
𝑠1
157
Finally, for those who have only seen Schur’s this the right inequality follows. For the left, we
inequality in three variables, note that in need only show (𝑚 + 𝑥)(𝑚 + 1 − 𝑥) ≥ 2𝑥 for
general any inequality involving 𝑠1 , … , 𝑠𝑘 which x ≤n; this rearranges to (𝑚 − 𝑥)(𝑚 + 1 + 𝑥) ≥
holds for n ≥ k variables also holds for n +1 0, which holds because 𝑚 ≥ 𝑛 ≥ 𝑥.
variables, by replacing the variables 𝑥1 , … , 𝑥𝑛+1
by the roots of the derivative of the polynomial 113. Let 𝑷𝟏 , 𝑷𝟐 , 𝑷𝟑 , 𝑷𝟒 be four points on a
(𝑥 − 𝑥1 ) … (𝑥 − 𝑥𝑛−1 ). circle, and let 𝑰𝟏 be the incenter of the
triangle 𝑷𝟐 𝑷𝟑 𝑷𝟒 , 𝑰𝟐 be the incenter of the
111. Let ABCD be a quadrilateral with AB = triangle 𝑷𝟏 𝑷𝟑 𝑷𝟒 , 𝑰𝟑 be the incenter of the
BC = CD = DA. Let MN and PQ be two triangle 𝑷𝟏 𝑷𝟐 𝑷𝟒 𝒂𝒏𝒅 𝑰𝟒 be the incenter of
segments perpendicular to the diagonal BD the triangle P1P2P3. Prove that I1, I2, I3 and
and such that the distance between them I4 are the vertices of a rectangle.
𝑩𝑫
is d > , with M ∈ AD, N ∈ DC, P ∈AB, and
𝟐 Sol.: Without loss of generally, assume
Q ∈ BC. Show that the perimeter of the 𝑃1 , 𝑃2 , 𝑃3 , 𝑃4 occur on the circle in the order. Let
hexagon AMNCQP does not depend on the 𝑀12 , 𝑀23 , 𝑀34 , 𝑀41 be the midpoints of arcs
positions of MN and PQ so long as the 𝑃1 𝑃2 , 𝑃2 𝑃3 , 𝑃3 𝑃4 , 𝑃4 𝑃1 , respectively.
distance between them remains constant.
Then the line 𝑃3 𝑀1 is the angle bisector of
Solution: The lengths of AM, MN, NC are all ∠𝑃2 𝑃3 𝑃1 and so passes through 𝐼4 . Moreover,
linear in the distance between the segments the triangle 𝑀12 , 𝑃2 𝐼4 is isosceles because
MN and AC; if this distance is h, extrapolating ∠𝐼4 𝑀12 𝑃2 = ∠𝑃1 𝑃2 𝑃3
from the extremes MN = AC and M = N = D
gives that = 𝜋 − 2∠𝑃1 𝑃2 𝐼4 − 2∠𝑀12 𝑃2 𝑃1
2𝐴𝐵 − 𝐴𝐶 = 𝜋 − 2∠𝑀12 𝑃2 𝐼4
𝐴𝑀 + 𝑀𝑁 + 𝑁𝐶 = 𝐴𝐶 +
𝐵𝐷/2
Hence the circle centered at M passing through
In particular, if the segments MN and PQ 𝑃1 and 𝑃2 also passes through 𝐼4 , 𝑎𝑛𝑑 likewise
maintain constant total distance from AC, as through 𝐼3 .
they do if their distance remains constant, the
From this we determine that the angle bisector
total perimeter of the hexagon is constant.
of ∠𝑃3 𝑀12 𝑃4 is the perpendicular bisector of
112. Let m and n be positive integers such 𝐼3 𝐼4. On the other hand, this angle bisector
that n ≤ m. Prove that passes through 𝑀34 , so it is simply the line
(𝒎 + 𝒏)! 𝑀12 𝑀34; by symmetry, it is also the
𝟐𝒏 𝒏! ≤ ≤ (𝒎𝟐 + 𝒎)𝒏 . perpendicular bisector of 𝐼1 𝐼2. We conclude
(𝒎 − 𝒏)!
that 𝐼1 𝐼2 𝐼3 𝐼4 is a parallelogram.
Sol.: The quantity in the middle is (𝑚 + 𝑛)(𝑚 +
𝑛 − 1) … (𝑚 − 𝑛 + 1). If we pair off terms of To show that 𝐼1 𝐼2 𝐼3 𝐼4 is actually a rectangle, it
the form (𝑚 + 𝑥)𝑎𝑛𝑑 (𝑚 + 1 − 𝑥), we get now suffices to show that 𝑀12 𝑀34 ⊥ 𝑀23 𝑀41.
products which do not exceed 𝑚(𝑚 + 1), since To see this, simply note that the angle between
the function 𝑓(𝑥) = (𝑚 + 𝑥)(𝑚 + 1 − 𝑥) is a these lines is half the sum of measure of the
1
concave parabola with maximum at 𝑥 = 2. From arcs 𝑀12 𝑀23 𝑎𝑛𝑑 𝑀34 𝑀41, but these arcs
clearly comprise half of the circle.
158
114. The national Marriage Council wishes 2

2(𝑥 + 𝑦) ≥ 𝑥 + 𝑦 + 2√𝑥𝑦 = (√𝑥 + √𝑦)
to invite n couples to from 17 discussion
groups under the following conditions: By the AM-GM inequality, with equality for x =
(a) All members of the group must be y. Substituting 𝑥 = 𝑎 + 𝑏 − 𝑐, 𝑦 = 𝑏 + 𝑐 − 𝑎 we
of the same sex, i.e. they are either get
all male or all female.
(b) The difference in the size of any √𝑎 + 𝑏 − 𝑐 + √𝑏 + 𝑐 − 𝑎 ≤ 2√𝑎,
two groups is either 0 or 1. Which added to the two analogous inequalities
(c) All groups have at least one yields the desired result. Inequality holds for
number. 𝑎 + 𝑏 − 𝑐 = 𝑏 + 𝑐 − 𝑎 = 𝑐 + 𝑎 − 𝑏, 𝑖. 𝑒. 𝑎 =
(d) Each person must belong to one 𝑏 = 𝑐.
and only one group.
116. Let k ≥1 be an integer. Show that
Find all values of n, n ≤ 1996, for which this is there are exactly 𝟑𝒌−𝟏 positive integers n
possible. Justify your answer. with the following properties:
Sol.: Clearly n ≤ 9 since each of 17 groups must (a) The decimal representation of n
contain at least one member. Suppose there are consists of exactly k digits.
k groups of men and 17 –k groups of women; (b) All digits of k are odd.
without loss of generality, we assume k ≤ 8. If (c) The number n is divisible by 5.
𝒏
m is the minimum number of members in a (d) The number m = 𝟓 has k odd
group, then the number of men of women is at (decimal) digits.
most 𝑘(𝑚 + 1), while the number of women is
Sol.: The multiplication in each place must
at least (𝑘 + 1)𝑚. As there are the same
produce an even number of carries, since these
number as men as women, we have 𝑘(𝑚 +
will be added to 5 in the next place and an odd
1) ≥ (𝑘 + 1)𝑚, 𝑠𝑜 𝑚 ≤ 𝑘 ≤ 8, and the
digit must result. Hence all of the digits of m
maximum number of couples is 𝑘(𝑘 + 1) ≤ 72.
must be 1, 5 or 9 and the first digit must be1,
In fact, any number of couples between 9 and
since m and n have the same number of
72 can be distributed: divide the men as evenly
as possible into 8 groups, and divide the women decimal digits. Hence there are 3𝑘−1 choices for
as evenly as possible into 9 groups. Thus 9 ≤ n m and hence for n.
≤ 72 is the set of acceptable numbers of 117. A convex hexagon ABCDEF satisfies the
couples. following conditions:
115. Let a, b and c be the lengths of the (a) Opposite sides are parallel (i.e. AB
sides of a triangle. Prove that ∥DE, BC ∥EF, CD ∥FA).
(b) The distances between opposite
√𝒂 + 𝒃 − 𝒄 + √𝒃 + 𝒄 − 𝒂
sides are equal (i.e. d(AB, DE)=
+ √𝒄 + 𝒂 − 𝒃
d(BC, EF)= d(CD, FA), where d(g, h)
≤ √𝒂 + √𝒃 + √𝒄
denotes the distance between
Sol.: By the triangle inequality, 𝑏 + 𝑐 − lines g and h).
𝑎 𝑎𝑛𝑑 𝑐 + 𝑎 − 𝑏 𝑎𝑏𝑐 positive. For any positive (c) The angles ∠FAB and ∠CDE are
x, y, we have right.
159
Show that diagonals BE and CF By two applications of the power mean

intersects at an angle of 𝟒𝟓°. inequality.
Sol.: The conditions imply that A and D are 120. A convex polyhedron P and a sphere S
opposite vertices of a square APDQ such that B, are situated in space such that S intercepts
C, E, F lie on AP, PD, DQ, QA, respectively and on each edge AB of P a segment XY with
that all six sides of the hexagon are tangent to 𝟏
AX = XY = YB = 𝟑 𝑨𝑩. Prove that there
the inscribed circle of the square. The diagonals
exists a sphere T tangent to all edges of P.
BE and CF meet at the center O of the square.
Let T, U, V be the feet of perpendiculars from O Sol.: Let AB and BC be two edges of the
to AB, BC, CD; then ∠TOB = ∠BOU by reflection polyhedron, so that the sphere meets AB in a
across OB, and similarly ∠UOC = ∠COV. segment XY with AX = XY = YB and meets BC in a
𝜋
Therefore 2 = 2∠𝐵𝑂𝐶, proving the claim. segment ZW with BZ = ZW = WC. In the plane
ABC the points X, Y, Z, W lie on the cross-section
118. The polynomials 𝑷𝒏 (𝒙) are defined by of the sphere, which is a circle. Therefore BY. BX
𝑷𝟎 (𝒙) = 𝟎, 𝑷𝟏 (𝒙) = 𝒙 and 𝑷𝒏 (𝒙) = = BZ. BW by power –of-a point; this clearly
𝒙𝑷𝒏−𝟏 (𝒙) + (𝟏 − 𝒙)𝑷𝒏−𝟐 (𝒙) 𝒏 ≥ 𝟐. implies AB = BC, and so the center of S is
For every natural number n ≥ 1, find equidistant from AB and BC. We conclude that
all real numbers x satisfying the any two edges of P are equidistant from S and
equation 𝑷𝒏 (𝒙) = 𝟎. so there is a sphere concentric with S tangent to
all edges.
Sol.: One shows by induction that
𝑥
𝑃𝑛 (𝑥) = [(𝑥 − 1)𝑛 − 1]
𝑥−2
121. Natural numbers k, n are given such
Hence 𝑃𝑛 (𝑥) = 0 if and only if x = 0 or 𝑥 = 1 + that 1 < k < n. Solve the system of n
𝑒 2𝜋𝑖𝑘/𝑛 for some k ∈ {1, …, n -1}. equations.
𝒙𝒊 𝟑 (𝒙𝒊 𝟐 + ⋯ + 𝒙𝒊+𝒌−𝟏 𝟐 ) = 𝒙𝒊−𝟏 𝟐 𝟏 ≤
𝒊≤𝒏
in n real unknowns 𝒙𝟏 , … , 𝒙𝒏 . (Note:
119. The real numbers x, y, z, t satisfy the
𝒙𝟎 = 𝒙𝒏 , 𝒙𝟏 = 𝒙𝒏+𝟏 , 𝒆𝒕𝒄.)
equalities 𝒙 + 𝒚 + 𝒛 + 𝒕 = 𝟎 𝒂𝒏𝒅 𝒙𝟐 +
𝒚𝟐 + 𝒛𝟐 + 𝒕𝟐 = 𝟏. Prove that Sol.: The only solution is 𝑥1 = ⋯ 𝑥𝑛 = 𝑘 −1/3 .
−𝟏 ≤ 𝒙𝒚 + 𝒚𝒛 + 𝒛𝒕 + 𝒕𝒙 ≤ 𝟎. Let L and M be the smallest and largest of the
𝑥𝑖 , respectively. If M = 𝑥𝑖 , then
Sol.: The inner expression is (𝑥 + 𝑧)(𝑦 + 𝑡) =
−(𝑥 + 𝑧)2 , so the second inequality is obvious. 𝑘𝑀3 𝐿2 ≤ 𝑥𝑖 3 (𝑥𝑖 2 + ⋯ + 𝑥𝑖+𝑘−1 2 ) = 𝑥𝑖−1 2
As for the ≤ 𝑀2
first, note that 1
And so M ≤ (𝑘𝐿2 ). Similarly, if L = 𝑥𝑗 , then
1
1 = (𝑥 2 + 𝑧 2 ) + (𝑦 2 + 𝑡 2 ) ≥ 2 [(𝑥 + 𝑧)2 +
𝑘𝐿3 𝑀3 ≥ 𝑥1 3 (𝑥𝑖 2 + ⋯ + 𝑥𝑖−𝑘+1 2 ) = 𝑥𝑖−1 2
(𝑦 + 𝑡)2 ] ≥ [(𝑥 + 𝑧)(𝑦 + 𝑡)] ≥ 𝐿2
160
1 the bricks, A’B’ is an edge of the

and so 𝐿 ≥ (𝑘𝑀2 ). Putting this together, we get
other and AB ∥A’B’ then AB = A’B’.
1 (b) Prove the same statement with
𝐿 ≥ 𝑘𝑀2 ≥ 𝑘𝐿4
100 replaced by a smaller number.
And so 𝐿 ≥ 𝑘 −1/3 ; 𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦, 𝑀 ≥ 𝑘 −1/3 . The smaller the number, the better
Obviously L ≤ M, so we have L = M = the solution.
𝑘 −1/3 𝑎𝑛𝑑 𝑥1 = ⋯ = 𝑥𝑛 = 𝑘 −1/3 .
Sol.: We prove the claim with 97 bricks. For
122. Shows that there do not exist each integer up to 16, we tabulate the number
nonnegative integers k and m such that k! of nonparallel bricks that volume (disallowing
+48 = 48 (𝒌 + 𝟏)𝒎 . cubical bricks and bricks with a dimension
greater than 10) and their total volume:
Sol.: Suppose such k, m exist. We must have
48│k!, so k ≥ 6; one checks that k = 6 does not Volume 2 3 4 5 6 7 8 9 10 12 14 15 16
yield a solution, so k ≥ 7. In that case k! is Number 3 3 6 3 9 3 9 6 9 15 6 6 12
(𝑘!+48) Total 6 9 24 15 54 21 72 54 90 180 74
divisible by 32 and by 9, so that is
48 90 192
relatively prime to 6, as then is k +1.
If k +1 is not prime, it has a prime divisor Assuming no two bricks are parallel, the 90
greater than 3, but this prime divides k! and not smallest bricks have total volume 891. The 7
k! +48. Hence k +1 is prime, and by Wilson’s other bricks each have volume at least 18,
theorem k! +1 is a multiple of k +1. Since k! +48 giving a total volume of at least 1017, a
is as well, we find k +1 = 47, and we need only contradiction.
46!
check that is not a power of 47. We check
48+1 We have not determined the optimal constant
46!
that = 29(𝑚𝑜𝑑 53) (by cancelling as many (one can improve the above bound to 96
48+1
terms as possible in 46! Before multiplying), but easily), but we note that an arrangement with
that 47 has order 13 modulo 53 and that none 73 nonparallel bricks is possible.
of its powers is congruent to 29 modulo 53.
123. We are given a collection of

rectangular bricks, no one of which is cube. 124. Let O and G be the circumcenter and
The edge lengths are integers. centroid, respectively, of triangle ABC, If R
For every triple of positive integers (a, is the circumradius and r the inradius of
b, c), not all equal, there is sufficient ABC, show that
supply of 𝒂 × 𝒃 × 𝒄 bricks. Suppose 𝑶𝑮 ≤ √𝑹(𝑹 − 𝟐𝒓).
that the bricks completely tile a 𝟏𝟎 ×
Sol.: Using vectors with original at O, we note
𝟏𝟎 × 𝟏𝟎 box. 1 1
(a) Assume that at least 100 bricks that 𝑂𝐺 2 = (𝐴 + 𝐵 + 𝐶)2 = 𝑅 2 +
9 3
2 2
have been used. Prove that there
9
𝑅 (cos 2𝐴 + cos 2𝐵 + cos 2𝐶).
exist at least two parallel bricks,
that is, if AB is an edge of one of
161
Hence 𝑅 2 − 𝑂𝐺 2 =
(𝑎 2 +𝑏2 +𝑐 2 )
. On the other doublings, and 2𝑛 − 1 can be obtained in one
9
more step.
hand, by the standard area formula K = 𝑟𝑠 =
𝑎𝑏𝑐 𝑎𝑏𝑐
4𝑅
, we have 2𝑟𝑅 = (𝑎+𝑏+𝑐). We now note that Hence we can obtain 22 − 1, 24 − 1, … , 2256 −
1 𝑖𝑛 (1 + 1) + (2 + 1) + ⋯ + (128 + 1) =
(𝑎2 + 𝑏 2 + 𝑐 2 )(𝑎 + 𝑏 + 𝑐) ≥ 9𝑎𝑏𝑐 263 steps. In 243 steps, we turn 2256 −
1 𝑖𝑛𝑡𝑜 2499 − 2243 . Now notice that the
By two applications of the AM-GM inequality,
numbers 2243 − 2115 , 2115 − 251 , 251 −
so 2𝑟𝑅 ≤ 𝑅 2 − 𝑂𝐺 2 , proving the claim.
219 , 219 − 23 , 23 − 21 , 21 − 1 have all be
125. Let ABCDE be a convex pentagon, and written down; in 6 steps, we now obtain 2499 −
let M, N, P, Q, R be the midpoints of sides 1. We make this into 2998 − 1 in 500 steps, and
AB, BC, CD, DE, EA, respectively. If the make 21996 − 1 in 999 steps. Adding 1 for the
segments AP, BQ, CR, DM have a common initial 1, we count
point, show that this point also lies on EN.
1 + 263 + 243 + 6 + 500 + 999 = 2012
Sol.: Let T be the common point, which we take
Numbers written down, as desired.
as the origin of a vector system. Then 𝐴 × 𝑃 =
0, or equivalently 𝐴 × (𝐶 + 𝐷) = 0, which we 127. Let ℤ+ denote the set of nonzero
may write 𝐴 × 𝐶 = 𝐷 × 𝐴. integers. Show that an integer p > 3 is
prime if an only if for any a, b ∈ ℤ+ , exactly
Similarly, we have 𝐵 × 𝐷 = 𝐸 × 𝐵, 𝐶 × 𝐸 =
one of the numbers
𝐴 × 𝐶, 𝐷 × 𝐴 = 𝐵 × 𝐷. Putting these equalities
𝒑−𝟏
together gives 𝐸 × 𝐵 = 𝐶 × 𝐸, 𝑜𝑟 𝐸 × 𝑵𝟏 = 𝒂 + 𝒃 − 𝟔𝒂𝒃 + ,
𝟔
(𝐵 + 𝐶) = 0, which means the line EN also 𝒑+𝟏
𝑵𝟐 = 𝒂 + 𝒃 + 𝟔𝒂𝒃 +
passes through the origin T. 𝟔
belongs to ℤ+ .
Sol.: If 𝑁1 = 0, then 𝑝 = (6𝑎 − 1)(6𝑏 − 1) is

126. Show that there exists a subset A of composite; similarly, 𝑁2 = 0 𝑖𝑚𝑝𝑙𝑖𝑒𝑠 𝑝 =
the set {1, 2, …, 1996} having the following −(6𝑎 + 1)(6𝑏 + 1) is composite. Conversely,
properties: suppose that p is composite. If p ≡ 0, 2, 3 or 4
(a) 1, 𝟐𝟏𝟗𝟗𝟔 − 𝟏 ∈ 𝑨; (mod 6), then 𝑁1 𝑎𝑛𝑑 𝑁2 are not integers.
(b) Every element of A, except 1, is the
sum of two (not necessarily Otherwise, all divisors of p are congruent to ±1
distinct) elements of A; (mod 6). So there exist natural numbers c, d
(c) A contains at most 2012 elements. such that
Sol.: We state the problem a bit differently: we 𝑝 = (6𝑐 + 1)(6𝑑 + 1)𝑜𝑟(6𝑐 − 1)(6𝑑
want to write down at most 2012 numbers, − 1)𝑜𝑟(6𝑐 + 1)(6𝑑 − 1).
starting with 1 and ending with 21996 − 1, such
In the first case, 𝑁2 is not an integer and 𝑁1 = 0
that every number written is the sum of two
for 𝑎 = −𝑐, 𝑏 = −𝑑.
numbers previously written. If 2𝑛 − 1 has been
written, then 2𝑛 (2𝑛−1 ) can be obtained by n
162
In the second case, 𝑁2 is not an integer and 130. Two sets of intervals A, B on a line are
𝑁1 = 0 for 𝑎 = 𝑐, 𝑏 = 𝑑. given. The set A contains 𝟐𝒎 − 𝟏 intervals,
every two of which have a common
In the third case, 𝑁1 is not an integer and 𝑁2 = 0 interior point. Moreover, each interval in A
for 𝑎 = 𝑐, 𝑏 = −𝑑. contains at least disjoint intervals of B.
128. Let M be a nonempty set and *a binary Show that there exists an interval in B
operation on M. That is, to each pair (a, b) which belongs to at least m intervals from
∈𝑴 × 𝑴 one assigns an element a * b. A.
Suppose further that for any a, b ∈M,
Sol.: Let 𝛼1 = [𝑎𝑖 , 𝑏𝑖 ](𝑖 = 1, … , 2𝑚 − 1) be the
(a* b)*b = a and a*(a* b) = b.
intervals, indexed so that 𝑎1 ≤ 𝑎2 ≤ ⋯ ≤
(a) Show that a *b = b *a for all a, b
𝑎2𝑚−1 . Choose k ∈{𝑚, … , 2𝑚 − 1} to minimize
∈M.
𝑏𝑘 . By assumption, the interval 𝛼𝑘 contains two
(b) For which finite sets M does such a
disjoint intervals from B, say 𝛽1 =
binary operation exist?
[𝑐1 , 𝑑1 ] 𝑎𝑛𝑑 𝛽2 = [𝑐2 , 𝑑2 ]. Without loss of
Sol.: generality, assume
(a) First note that [a* (a* b)] *(a* b) = a by 𝑎𝑘 ≤ 𝑐1 < 𝑑1 < 𝑐2 < 𝑑2 ≤ 𝑏𝑘 .
the first rule. By the second rule, we
If 𝑑1 ≤ 𝑏𝑖 for i = 1, 2, …, m, then 𝛽1 ⊂ 𝛼1 for i =
may rewrite the left side as b* (a *b), so
1, 2, …, m, so 𝛽1 satisfies the desired property.
b* (a *b) = a and so b *a = b*[b* (a* b)].
Otherwise, 𝑑1 > 𝑏𝑥 for some s ∈ {1, 2, …, m}. By
b* a = b*[b*(a* b)]. By the second rule
assumption, 𝑐2 > 𝑑1 > 𝑏8 . Since no two of the
this equals a *b, so a* b = b* a.
𝛼 are disjoint, we have 𝑏8 ≥ 𝑎𝑖 for all i, so 𝑐2 >
(b) Such sets exist for all finite sets M.
𝑎𝑖 . On the other hand, by the choice of 𝑘, 𝑏𝑘 <
Identify M with {1, …, n} and define
𝑏1 for i = m, …, 2𝑚1 . Therefore 𝑎𝑖 < 𝑐2 < 𝑑2 ≤
a* b = c ⟺a + b+ c = 0 (mod n).
𝑏𝑘 ≤ 𝑏𝑖 for each 𝑖 ∈ {𝑚, 𝑚 + 1, … , 2𝑚 −
It is immediate that the axioms are
1}, 𝑎𝑛𝑑 𝑠𝑜 𝛽2 has the desired property.
satisfied.
131. The points E and D lie in the interior of
129. Determine whether there exist a sides AC and BC respectively, of a triangle
function f: ℤ⟶ℤ such that for each k = 0, 1, ABC. Let F be the intersection of the lines
…, 1996 and for each m ∈ℤ the equation AD and BE. Show that the area of triangles
𝒇(𝒙) + 𝒃𝒙 = 𝒎 has at least one solution x ABC and ABF satisfies.
∈ℤ.
𝑺𝑨𝑩𝑪 │𝑨𝑪│ │𝑩𝑪│
= + −𝟏
Sol.: Each integer y can written uniquely as 𝑺𝑨𝑩𝑭 │𝑩𝑬│ │𝑩𝑫│
1997m +k with m ∈ℤ and k ∈ {0, …, 1996}.
Sol.: Let the line parallel to BC through F meet
Define the function f by 𝑓(𝑦) = 𝑚 − 𝑘𝑦; then
AB at K and AC at N, Let the line parallel to CA
𝑓(𝑥) + 𝑘𝑥 = 𝑚 has the solution 𝑥 = 1997𝑚 +
through F meet BC at ME and AB at P; let the
𝑘, so the condition satisfied.
line parallel to AB through F meet BC at L and
CA at O. Let 𝑣𝐶 𝑎𝑛𝑑 𝑣𝐹 be the distances of C
and F, respectively, to the line AB. Then
163
𝑆𝐴𝐵𝐶 𝑣𝐶 𝐵𝐶 𝐵𝐿 + 𝐿𝑀 + 𝑀𝐶 Then note that (by the Law of Sines in triangle

= = = .
𝑆𝐴𝐵𝐹 𝑣𝐹 𝐹𝐾 𝐹𝐾 ABD and ADC)
Under the homothety through B carrying F to E, sin ∠𝑀𝐴𝐵 𝐵𝐷 sin ∠𝐴𝐵𝐷

= .
the segment PM maps to AC. Thus sin ∠𝑁𝐴𝑀 𝐷𝐶 sin ∠𝐷𝐶𝐴
𝐿𝑀 𝐹𝑀 𝐸𝐶 𝐴𝐶 By the law of Sines in triangle BNC,

= = = − 1.
𝐹𝐾 𝐹𝑃 𝐴𝐶 𝐴𝐸
𝐵𝐶 2 𝑠𝑖𝑛2 ∠𝐵𝑁𝐶
And similarly = ;
𝐵𝑁 2 𝑠𝑖𝑛2 ∠𝐵𝐶𝑁
𝐶𝑀 𝑁𝐹 𝐶𝐷 𝐵𝐶 𝐵𝑀 𝐵𝐶 2
= = = − 1. Therefore 𝑀𝑁 = 𝐵𝑁2 if and only if
𝐹𝐾 𝐹𝐾 𝐵𝐷 𝐵𝐷
sin ∠𝐴𝐵𝐷 sin ∠𝐵𝑁𝐶
The required assertion follows by putting this all = ,
sin ∠𝐴𝐵𝑀 sin ∠𝐵𝐶𝑁
together and nothing BL = FK.
Which if we put
132. Let n be a natural number. A cube of
side length n can be divided into 1996 𝛼 = ∠𝐴𝐵𝑀, 𝛽 = ∠𝐵𝐶𝑁, 𝜃 = ∠𝑁𝐵𝐶 becomes
cubes whose side lengths are also natural
numbers. Determine the smallest possible sin(𝛼 + 𝜃) sin 𝛽 = sin(𝛽 + 𝜃) sin 𝛼.
value of n. Rewriting each side as a difference of cosines
Sol.: Since 1996 >123 , we must have n ≥ 13, and cancelling, this becomes
and we now show n = 13 suffices, Inside a cube cos(𝛼 + 𝜃 − 𝛽) = cos(𝛽 − 𝛼 + 𝜃).
of edge 13, we place one cube of edge 5, one
cube length 4, and 2 of length 2, and fill the Both angles in this equation are between –𝜋
remainder with cubes of edge 1. The number of and 𝜋, so the angles are either equal or
cubes used is negatives of each other. The latter implies 𝜃 = 0,
which is untrue, so we deduce 𝛼 = 𝛽, and so
133 − (53 − 1) − (43 − 1) − 2(23 − 1) = 𝐵𝑀 𝐵𝐶 2
= if and only if ∠ABM = ∠BCN, that is, if
2197 − 124 − 63 − 2(7) = 1996, as desired. 𝑀𝑁 𝐵𝑁 2
AB is tangent to the circumcircle of BNC.
133. Let M be the midpoint of the median
AD of triangle ABC. The line BM intersects 134. Three counters A, B, C are placed at the
side AC at the point N. Show that AB is corners of an equilateral triangle of side n.
tangent to the circumcircle of NB if and The triangle is divided into triangles of side
only if the following equality holds: length 1. Initially all lines of the figure are
𝑩𝑴 𝑩𝑪𝟐 painted blue. The counters move along the
= . lines, painting their paths red, according to
𝑩𝑵 𝑩𝑵𝟐
the following rules:
Sol.: First note that (by the Law of Sines in (i) First A moves, then B, then C,
triangles ABM and AMN) then A, and so on in
𝐵𝑀 sin ∠𝑀𝐴𝐵 sin ∠𝑀𝑁𝐴 succession. On each turn, each
= . counter moves the full length
𝐵𝑁 sin ∠𝐴𝐵𝑀 sin ∠𝑁𝐴𝑀
164
of a side of one of the short indeed be 50, 51, …, 99. Clearly we maximize
triangles. the number of chosen numbers by taking them
(ii) No counter may retrace a two apart, and the list has odd length, so taking
segment already painted red, 99, 98 …, 50 is the only draw a graph with {1, …,
through it can stop on a red 99} as vertices, where two numbers are
vertex, even if another counter adjacent if they sum to 99 or 100.
is already there.
Show that for all integers n >0 136. Let M be the intersection of the
it is possible to paint all of the diagonals of the trapezoid ABCD. A point P
segments red in this fashion. such that ∠APM = ∠DPM is chosen on the
base BC. Prove that the distance from C to
Sol.: The cases n = 1, 2, are trivial; we use them the line AP is equal to the distance from B
as the base cases for an inductive proof. We to the line DP.
describe the moves for A, understanding that
the moves for B and C are the same moves Sol.: Since M lies on the internal angle bisector
2𝜋 4𝜋 of angle ∠APD, it lies at the same distance from
rotated by 𝑎𝑛𝑑 , respectively. To fix
3 3 the lines AP and DP. The ratio of this distance to
directions, imagine the triangle is oriented with 𝐴𝑀
the distance from C to AP is 𝐴𝐶
, while the ratio
one side parallel to the horizontal and the third
vertex above it, and suppose A starts at the of this distance to the distance from B to DP is
𝐵𝑀 𝐴𝑀 𝐵𝑀
bottom left. We first move A right for n –1 𝑀𝐷
. 𝐵𝑢𝑡 𝑀𝐶 = 𝑀𝐷 by similar triangles, so the
steps. We then alternate moving it up to the left latter two distances are indeed the same.
and down to the left for a total of 2n –5 steps.
137. In a group of several people, some are
We then trace a path through the inner triangle acquainted with each other and some are
of side n –2 using the induction hypothesis, not. Every evening, one person invites all
ending at another corner. Finally, we follow the of his acquaintances to a party and
unused edges from that corner, ending three introduces them to each other. Suppose
steps later. that after each person has arranged at
least one party, some two people are still
135. Fifty numbers are chosen from the set unacquainted. Prove that they will not be
{1, …, 99}, no two which sum to 99 or 100.
introduced at the next party.
Prove that the chosen numbers must be
50, 51, …, 99. Sol.: We claim that two people unacquainted
after each person has held at least one party lie
Sol.: In the sequence in different connected components of the
99, 1, 98, 2, 97, 3,… 51, 49, 50, any two adjacent original (and final) graph of acquaintance. If two
numbers sum to 99 or 100, so both cannot people are connected by a path of length n,
occur. Grouping the numbers into 49 pairs plus they will be connected by a path of length n -1
one extra, we see at most 50 numbers can after one person along the path (including
occur, and 50 must be one of them. Since we either of the two people at the ends) holds a
must step at least two terms along the list to party, by a path of length n -2 after two of them
make the next choice, the numbers must hold a party, and so on. After each person holds
165
a party, the two people on the ends will be 𝑠𝑛 = (3 + 5)𝑠𝑛−1 − 3.5. 𝑠𝑛−2
acquainted.
So 𝑠𝑛−1 must also divide 3.5. 𝑠𝑛−2 . If n >1, then
138. There are n parking spaces along a one 𝑠𝑛−1 is coprime to 3 and 5, so 𝑠𝑛−1 must divide
–way road down which n drivers are 𝑠𝑛−2, which is impossible since 𝑠𝑛−1 > 𝑠𝑛−2 .
travelling. Each driver goes to his favorite
140. Let M be the midpoint of side BC of
parking space and parks there if it is free;
triangle ABC, and let 𝒓𝟏 𝒂𝒏𝒅 𝒓𝟐 be the
otherwise, he parks at the nearest free
radii of the incircles of triangles ABM and
place down the road. If there is no free
ACM. Prove that 𝒓𝟏 < 2𝒓𝟐 .
space after his favorite, he drives away.
How many lists 𝒂𝟏 , … , 𝒂𝒏 of favorite Sol.: Recall that the area of a triangle equals its
parking spaces are there which permit all in radius times half its perimeter. Since ABM
of the drivers to park? and ACM have equal area, we have
Sol.: There are (𝑛 + 1)𝑛−1 such lists. To each 𝑟1 𝐴𝐶 + 𝐴𝑀 + 𝐶𝑀
list of preferences (𝑎1 , … , 𝑎𝑛 ) which allows all =
𝑟2 𝐴𝐵 + 𝐴𝑀 + 𝐵𝑀
drivers to park, associate the list (𝑏2 , … , 𝑏𝑛 ),
where 𝑏𝑖 is the difference mod n+ 1 between And it suffices to show AC + AM + CM <2AB +
the numbers of the space driver i wants and the 2AM +2BM;
space the previous driver took. Clearly any two
Since BM = CM, this simplifies to AC < 2AB + AM
lists give rise to different sequences of 𝑏𝑖 .
+CM.
We now argue that any list of 𝑏𝑖 comes from a
In fact, by the triangle inequality, AC < AM +CM,
list of preferences. Imagine that the n parking
so we are done.
spaces are arranged in a circle with an extra
phantom space put in at the end. Put the first 141. Several positive integers are written on
driver in any space, then for i = 2, …, n, put a blackboard. One can erase any two
driver i in the first available space after the distinct integers and write their greatest
space 𝑏𝑖 away from the space taken by driver i- common divisor and least common
1; this gives a list of preferences if and only if multiple instead. Prove that eventually the
the one space not taken at the end is the numbers will stop changing.
phantom space. However, by shifting the
position of the first driver, we can always Sol.: If a, b are erased and c < d are written
ensure that the phantom space is the space not instead, we have c ≤ min (a, b) and d ≥ max (a,
taken. Thus the sequences of 𝑏𝑖 are equal in b); moreover, ab = cd. From this we may
number to the lists of preferences, so there are conclude 𝑎 + 𝑏 ≤ 𝑐 + 𝑑 by writing 𝑎𝑏 + 𝑎2 =
(𝑛 + 1)𝑛−1 of each. 𝑐𝑑 + 𝑎2 ≤ 𝑎𝑐 + 𝑎𝑑 (the latter since (𝑑 −
𝑎)(𝑐 − 𝑎) ≤ 0) and dividing both sides by a.
139. Find all positive integers n such that Thus the sum of the numbers never decreases,
𝟑𝒏−𝟏 + 𝟓𝒏−𝟏 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 𝟑𝒏 + 𝟓𝒏 . and it is obviously bounded (e.g. by n times the
product of the numbers, where n is the number
Sol.: This only occurs for n = 1. Let 𝑠𝑛 = 3𝑛 + 5𝑛
of numbers on the board); hence it eventually
and note that
166
stops changing, at which time the numbers an even integer, so Sergey can find at least one
never change. more zero.
142. No three diagonals of a convex 1996 – 145. Find all quadruples of polynomials
gon meet in a point. Prove that the 𝑷𝟏 (𝒙), 𝑷𝟐 (𝒙), 𝑷𝟑 (𝒙), 𝑷𝟒 (𝒙) with real
number of triangles lying in the interior of coefficients such that for each quadruple
the 1996-gon and having sides on its of integers x, y, z, t such that 𝒙𝒚 − 𝒛𝒕 = 𝟏,
diagonal is divisible by 11. one has
𝑷𝟏 (𝒙)𝑷𝟐 (𝒚) − 𝑷𝟑 (𝒛)𝑷𝟒 (𝒕𝟎 = 𝟏.
Sol.: There is exactly one such triangle for each
choice of six vertices of the 1996-gon: if A, B, C, Sol.: If 𝑃1 (1) = 0, then 𝑃3 (𝑧)𝑃4 (𝑡) = −1 for
D, E, F are the six vertices in order, the each pair of integers z, t, and so 𝑃3 𝑎𝑛𝑑 𝑃4 are
corresponding triangle is formed by the lines constant functions; moreover, 𝑃1 (𝑥)𝑃2 (𝑦) = 0,
AD, BE, CF. Hence the number of triangle is so one of 𝑃1 𝑎𝑛𝑑 𝑃2 is identically zero. Ignoring
(1996
6
) ; since 1991 is a multiple of 11, so is the such cases, which are easily enumerated, we
number of triangles. assume 𝑃𝑖 (1) ≠ 0 for all i.
143. Prove that for every polynomial 𝒙𝟐 + We first note that 𝑃1 (𝑥)𝑃2 (1) = 𝑃1 (1)𝑃2 (𝑥)
𝒑𝒙 + 𝒒 with integer coefficients, there for all nonzero integers x, so that 𝑃1 𝑎𝑛𝑑 𝑃2 are
exists a polynomial 𝟐𝒙𝟐 + 𝒓𝒙 + 𝒔 with equal up to a scalar factor; similarly, 𝑃3 𝑎𝑛𝑑 𝑃4
integer coefficients such that the sets of are equal up to a scalar factor. Now note that
values of the two polynomials on the 𝑃1 (𝑥)𝑃2 (𝑎𝑦) = 𝑃1 (𝑎𝑥)𝑃2 (𝑦) for all nonzero a,
integers are disjoint. x, y, so that the difference between the two
sides is identically zero as a polynomial in a. In
Sol.: If p is odd, then 𝑥 2 + 𝑝𝑥 + 𝑞 has the same particular, that means no term in 𝑃1 (𝑥)𝑃2 (𝑦)
parity as q for all integers x, and it suffices to has unequal exponent in x and y, and the same
choose r even and s of the opposite parity as q. is true of 𝑃1 (𝑥)𝑃1 (𝑦) on the other hand, if
If p = 2m is even, then 𝑥 2 + 𝑝𝑥 + 𝑞 = 𝑃1 (𝑥) has term of more than one degree, then
(𝑥 + 𝑚)2 + (𝑞 − 𝑚)2 which is congruent to 𝑃1 (𝑥)𝑃1 (𝑦) contains a term with different
𝑞 − 𝑚2 𝑜𝑟 𝑞 − 𝑚2 + 1 modulo 4. Now it degrees in x and y. Hence 𝑃1 (𝑥) = 𝑐𝑥 𝑘 for
suffices to choose r even and s congruent to some integer k and some constant c, and
𝑞 − 𝑚2 + 2 modulo 4. similarly 𝑃2 (𝑥) = 𝑑𝑥 𝑘 , 𝑃3 (𝑥) = 𝑒𝑥 𝑚 , 𝑃4 (𝑥) =
𝑓𝑥 𝑚 .
144. Sergey found 11 different solutions to
𝟗𝟔
the equation 𝒇 (𝟏𝟗𝒙 − ) = 𝟎. Prove that Thus we must determine when 𝑐𝑑𝑥 𝑘 𝑦 𝑘 −
𝒙
if he had tried harder, he could have found 𝑒𝑓𝑧 𝑚 𝑡 𝑚 = 1 whenever 𝑥𝑦 − 𝑧𝑡 = 1 in
at least one more solution. integers. Clearly k = m since otherwise one of
the two terms on the left dominates the other,
96 and cd =1 by setting x = y = 1 and z = t = 0, and
Sol.: The equations 19𝑥 − 𝑥
= 𝑡 can be
rewritten 19𝑥 2 − 𝑡𝑥 − 96 = 0; 𝑠𝑖𝑛𝑐𝑒 𝑡 2 + similarly ef = 1. Now note that (𝑥𝑦)𝑘 − (𝑧𝑡)𝑘 =
19.96 > 0, it always has two real roots. 1 can only happen in general for k = 1, since for
Therefore the number of zeroes of f (if finite) is k >1, there are no consecutive perfect k-th
powers. We conclude 𝑃1 (𝑥) = 𝑐𝑥, 𝑃2 (𝑥) =
167
𝑥 𝑥
, 𝑃3 (𝑥) = 𝑒𝑥, 𝑃4 (𝑥) = for some nonzero real impossible. Without loss of generality, assume
𝑐 𝑒
numbers c, e. that b –k ≠ 1 is not the final corner. The first
player now marks (a, b). If the second player
146. Two players play the following game covers (a, b) and (a, b+1), the position is again
on a 𝟏𝟎𝟎 × 𝟏𝟎𝟎 board. The first player stable. Otherwise, the first player marks (𝑎 +
marks a free square, then the second 1, 𝑏 − 1) and the second player is forced to
player puts a 𝟏 × 𝟐 domino down covering cover it and (𝑎 + 2, 𝑏 − 1). Then the first player
two free squares, one of which is marked. marks (𝑎 + 2, 𝑏 − 2) and the second player is
This continuous until one player is unable forced to cover it and (𝑎 + 3, 𝑏 − 2), and so on.
to move. The first player wins if the entire After (𝑎 + 𝑘, 𝑏 − 𝑘) is marked, the result is a
board is covered, otherwise the second stable position.
player wins. Which player has a winning
strategy? (Note that the assumption b –k ≠ 1 ensures
that the moves described do not cross the edge
Sol.: The first player has a winning strategy. Let of the board.) To finish the proof, we need to
us say a position is stable if every square below show that such a chain of corners must exist.
or to the right of a free square is free. Then we Write the labels (𝑎1 , 𝑏1 ), … , (𝑎𝑘 , 𝑏𝑘 ) in a row,
claim the first player can always ensure that on and join two adjacent labels by a segment if
his turn, either the position is stable or there is they are of the form (𝑎, 𝑏), (𝑎 + 1, 𝑏 − 1). If
a free square with exactly one free neighbor (or two adjacent labels (𝑎, 𝑏), (𝑎 + 𝑖, 𝑏 − 𝑗) are not
both). joined by a segment, then either i = 1 or j = 1
but not both. If i = 1, draw an arrow between
Let us label the square in the i-th row and j-th
the labels pointing towards (𝑎 + 𝑖, 𝑏 − 𝑗);
column as (i, j), with (1, 1) in the top left. We
otherwise draw the arrow the other way. Also
call a free square a corner if is not below or to
draw arrows pointing to (𝑎1 , 𝑏1 )𝑎𝑛𝑑 (𝑎𝑘 , 𝑏𝑘 ).
the right of another free square. Let
There is now one more chain of corners (joined
(𝑎1 , 𝑏1 ), (𝑎2 , 𝑏2 ), … , (𝑎𝑘 , 𝑏𝑘 ) be the corners
by segments) than arrows, so some chain has
from top to bottom.
two arrows pointing to it. That chain satisfies
First notice that if (a, b) is a corner such that the condition above, so the first player can use
both (𝑎 + 1, 𝑏 − 1)𝑎𝑛𝑑 (𝑎 − 1, 𝑏 + 1) are it to create another stable position.
nonfree (or off the board), then the first player Consequently, the first player can ensure
may mark (a, b), and however the second player victory.
moves, the result will be a stable position. More
147. Let BD be the bisector of angle B in
generally, if (𝑎, 𝑏), (𝑎 + 1, 𝑏 − 1), … , (𝑎 +
triangle ABC. The circumcircle of triangle
𝑘, 𝑏 − 𝑘) are corners and (𝑎 − 1, 𝑏 +
BDC meets AB at E, while the circumcircle
1)𝑎𝑛𝑑 (𝑎 + 𝑘 + 1, 𝑏 − 𝑘 − 1) are both nonfree
of triangle ABD meets BC at F. Prove that
or off the board, the first player can be sure to
AE = CF.
return to a stable position.
Sol.: By power-of-a-point. AE .AB = AD. AC and
To show this, first note that we cannot have 𝐴𝐸 𝐴𝐷 𝐵𝐶
both a = 1 and b –k = 1, or else the number of CF. CB = CD. CA, so 𝐶𝐹 = (𝐶𝐷 ) (𝐴𝐵). However,
non-free squares would be odd, which is
168
𝐴𝐵 𝐴𝐷 that did not allow travel from any town to

𝐶𝐵
= 𝐶𝐷 by the angle bisector theorem, so AE =
any other town. Prove that more of half of
CF.
the assignments remained.
148. A 𝟏𝟎 × 𝟏𝟎 table consists of positive
integers such that for every five rows and Sol.: We will prove the same statement for n ≥
five columns, the sum of the numbers at 6 towns. First suppose n = 6. In this case there
their intersections is even. Prove that all of are 215 assignments, and an assignment is
the integers in the table are even. rejected only if either one town has road to all
of the others in the same direction, or if there
Sol.: We denote the first five entries in a row as are two sets of three towns, such that within
the “head” of that row. We first show that the each town the roads point in a circle, but all of
sum of each head is even. We are given that the the roads from one set to the other point in the
sum of any five heads is even; by subtracting same direction. There are 5.211 had
two such sums overlapping in four heads, we assignments of the first kind and 20.8 of the
deduce that the sum of any two heads is even. second kind, so the fraction of good
Now subtracting two such relations from a sum 5
assignments is at least .
8
of five heads, we determine that the sum of any
head is even. For n ≥ 6, we claim that the fraction of good
assignments is at least
By a similar argument, the sum of any five
entries in a row is even. 𝑛−𝑖
5 1
∏ (1 − 𝑖−1 ).
By the same argument as above, we deduce 8 2
𝑖=6
that each entry is even.
We show this by induction on a good
149. Prove that there are no positive assignment or r h -1 vertices can be extended to
integers a and b such that for each pair p, q a good assignment on vertices simply by
of distinct primes greater than 1000, the avoiding having all edges from the last vertex
number 𝒂𝒑 + 𝒃𝒒 is also prime. pointing in the same direction, which occurs in
2 cases out of 2𝑛−1 .
Sol.: Suppose a, b are so chosen, and let m be a
prime greater than a +b, by Dirichet’s theorem, Now it suffices to show that the above
1
there exist infinitely many primes in any expression is more than 2.
nonzero residue class modulo m; in particular,
there exists a pair p, q such that p ≡ b (mod m), In fact,
q ≡ -a (mod m), giving 𝑎𝑝 + 𝑏𝑞 is divisible by m, ∞ ∞
a contradiction. 1 −1 𝑖−4
∏ (1 − ) ≤ 1 + ∑ 𝑖
2 2
𝑖=5 𝑖=5
150. There are 2000 towns in a country,
each pair of which is linked by a road. The ∞ ∞ ∞
1 𝑖+1 1 1
Ministry of Reconstruction proposed all of = 1 + 5∑ 𝑖 = 1 + 5 ∑∑ 𝑖
2 2 2 2
𝑖=0 𝑖=0 𝑘=𝑖
the possible assignments of one way traffic
to each road. The ministry of
Transportation rejected each assignment
169
∞
1 1 4 9 Consider that box, now we have four colours
= 1+ 5∑ 𝑖 =1+ 5 = (white, black, red, yellow) and hence there
2 2 −1 2 8
𝑖=0 33
must be at least ( 4 )+1 = 9 balls of the same
Thus the fraction of good assignments is at least
5 8 5 1
colour.
(8) (9) = 9 > 2.
There can be at most 4 different sizes
151. Find all real numbers satisfying available for these 9 balls of the same
𝟔𝒙 + 𝟐𝟐𝒙 + 𝟐𝟒𝒙 − 𝟑𝟔𝒙 − 𝟏𝟔𝒙 = 𝟏. colour, For if there were 5 (or
more)different sizes, then collection of 5
Ans:- Rewrite the given relation as:
balls, all of different sizes, would not satisfy
6𝑥 + 4𝑥 − 36𝑥 + 24𝑥 − 16𝑥 = 1 the given property.
Let 6𝑥 = 𝑎, 4𝑥 = 𝑏, we have Thus of these 9 balls there must be at least 3

balls of the same size.
a+ b -𝑎2 + 𝑎𝑏 − 𝑏 2 = 1
153. Find all continuous function f : (0,
2 2
⇒𝑎 − 𝑎𝑏 + 𝑏 − 𝑎 − 𝑏 + 1=0 ∞)⟶(0, ∞) ∋ f (1)= 1 and
⇒ 2𝑎2 − 2𝑎𝑏 + 2𝑏 2 − 2𝑎 − 2𝑏 + 2=0 𝟏 𝒙 𝟏 𝒙 𝟐

𝟐
∫ (𝒇(𝒕)) 𝒅𝒕 = (∫ 𝒇 (𝒕)𝒅𝒕)
⇒ (𝑎2 − 2𝑎𝑏 + 𝑏 2 )+ (𝑎2 − 2𝑎 + 1)+ (𝑏 2 − 𝟐 𝟎 𝒙 𝟎
2𝑏 + 1)=0 𝑥
Ans:- Define , F (x) = ∫0 𝑓(𝑡)𝑑𝑡 and G
𝑥
⇒ (𝑎 − 𝑏)2 + (𝑎 − 1)2 + (𝑏 − 1)2 =0 (x)= ∫0 (𝑓(𝑡))2 𝑑𝑡
∴ a= 1 and b= 1 when a= b. Since f: (0, ∞) ⟶ (0, ∞)

⇒ 4𝑥 = 1 𝑎𝑛𝑑 6𝑥 = 1, giving x= 0 only. we have F (x)> 0 ∀ 𝑥 > 0
152. Two boxes contain between them 1 1
Also, 𝐺(𝑥) = {𝐹(𝑥)}2 , from the given
65 balls of several different sizes. Each 2 𝑥
condition on differentiation, we have
ball is white, black, red, or yellow. If
you take any five balls of the same 1 1 1
𝐺′(𝑥)= 𝑥 . 2𝐹(𝑥). 𝐹 ′ (𝑥) − 𝑥 2 (𝐹(𝑥))2
colour, at least two of them will always 2
be of the same size (radius). Prove that 1 2

This means that (𝐹(𝑥))2= 𝐹(𝑥) 𝐹 ′ (𝑥) −
there are at least three balls which lie 2 𝑥
1
in the same box, have the same colour 𝑥 2 (𝐹(𝑥))2
and are of the same size.
1 𝑥𝐹′ (𝑥) 2 𝑥𝐹′ (𝑥)
or, 2 ( ) =2 −1
Sol: We will make repeated use of pigon– 𝐹(𝑥) 𝐹(𝑥)
hole- principle (PHP). As there are 65 balls
Solving this equation as a quadratic in
and 2 boxes , one of these boxes must 𝑥𝐹′ (𝑥)
65 we have
contain at least [ 2 ]+1 = 33 balls. 𝐹(𝑥)
170
𝑥𝐹′ (𝑥) Let z= x+ y

= 2 ± 2 = 𝑘(say)
𝐹(𝑥)
𝑑𝑦 𝑑𝑦 2𝑥
𝑑𝐹(𝑥) 𝑑𝑥 Now, 4x + 6y𝑑𝑥 = 0 ⇒𝑑𝑥 = − 3𝑦
On integration, we obtain ∫ =𝑘 ∫
𝐹(𝑥) 𝑥
2𝑥
𝑘 At the touching point. -3𝑦 = -1
⇒ ln 𝐹(𝑥)= klnx + ln𝜆 ⇒ 𝐹(𝑥)= 𝜆𝑥
3𝑦
⇒ f (x)=𝜆k𝑥 𝑘−1 ⇒ f (1) = 1 ⇒ 2x= 3y and 2𝑥 2 + 3𝑦 2=1 ⇒ 2 ( 2 )2 +
(3𝑦 2 ) = 1
⇒ 𝜆k=1
2
∴ f(x)= 𝑥 𝑘−1 = 𝑥1+√2 /𝑥
1−√2
⇒ 15𝑦 2 = 2 ⇒ y= ±√15
√[𝒙]+√{𝒙}
154. Let x ≥ 𝟏, 𝒇(𝒙) = , 3 2 3
√𝒙 ∴ x= (±√ ) = ±√ ∴ Max (z)=
2 15 10
where [.] denotes G.I.F. and { }
denotes fractional part. Determine the 3 2 5
√ + √15 = .
10 √30
smallest number k ∋ f(x)≤ 𝒌 for each
x≥𝟏 157. For any positive a, b prove that
𝟏 𝟏
Ans:- Let x = a+ b where a= [x], b= {x} (𝒂 + 𝒂)𝟐 + (𝒃 + 𝒃)𝟐 ≥ 𝟖.
√𝑎+√𝑏 Ans: AM ≥ GM
f(x)=
√𝑎+𝑏
1 1
𝑎+𝑏+2√𝑎𝑏 2√𝑎𝑏 (𝑎 + 𝑎)2 + (𝑎 + 𝑎)2 ≥
2
(f(𝑥)) = =1+
𝑎+𝑏 𝑎+𝑏 1 1
2√(𝑎 + 𝑎)2 + (𝑏 + 𝑏)2
Using AM≥ 𝐺𝑀, ≤ 1 + 1 ⇒ 𝑓(𝑥) ≤ √2.
1 𝑎 𝑏
≥ 2(ab+𝑎𝑏 + 𝑏 + 𝑎)
155. Solve the equation (√𝟐 + √𝟐)𝒙 +
(√𝟐 − √𝟐)𝒙 = 𝟐𝒙 1
≥ 2(2+2) [∵ ab + 𝑎𝑏 ≥ 2]
√2 𝜋 𝜋
Ans:- 1+ = 1 + 𝑐𝑜𝑠 4 = 2 cos2 8
2 158. Find the following limit:
𝟏 𝟏 𝟏
2+ √2 𝑥 2− √2 𝑥 𝐥𝐢𝐦 ( + + ⋯+ )
( 4 ) ⁄2 + ( 4 ) ⁄2 𝒙→∞ √𝒏𝟐 +𝟏 √𝒏𝟐 +𝟐 √𝒏𝟐 +𝒏
𝑛
𝜋 𝜋 Ans:- Let 𝑢𝑛 = √𝑛2
= (𝑐𝑜𝑠 8 )𝑥 + (𝑠𝑖𝑛 8 )𝑥 +𝑛
𝑛 1
⇒ x= 2 ∴ lim 𝑢𝑛 = lim = lim = 1.
𝑥→∞ 𝑥→∞ √𝑛2 +𝑛 𝑥→∞ √1+ 1
𝑛
156. Maximize x+ y subject to the

condition that 2𝒙𝟐 + 𝟑𝒚𝟐 ≤ 𝟏. By Cauchy’s first theorem:-
𝑢1 +⋯+𝑢𝑛
lim ( ) = 1.
𝑥2 𝑦2 𝑥→∞ 𝑛
Ans:- 1⁄ + 1⁄ ≤ 1
2 3
171
1 1 1 1 5 1 3 6
So, lim (√𝑛2 + √𝑛2 + ⋯ + √𝑛2 )= 1. Ans:- P(1)= 1+22 = 4 < 2 − 2 = 2 = 4.
𝑥→∞ +1 +2 +𝑛
159. For any real number x and for any The statement is true for n= 2.
positive integer n show that
Let , the statement is true for n= m.
𝟏 𝟐 𝒏−𝟏
[x]+[x+𝒏] + [𝒙 + 𝒏] + ⋯ + [𝒙 + ]= 1 1 1 1
𝒏 ∴P(m)= 1+22 + 32 + ⋯ + 𝑚2 < 2 − 𝑚.
[𝒏𝒙]
Now, we need to show that the statement is
Ans:- Let x= [x]+y, where 0 ≤ y < 1,
also true for n=m+1.
Let p be an integer such that P-1 ≤ 𝑛𝑦 < 𝑃 1 1 1 1
P(m+1)= 1+22 + 32 + ⋯ + 𝑚2 < 2 − (𝑚+1)2
𝑘 𝑘
Now, x+𝑛 = [𝑥] + 𝑦 + 𝑛
1 1 1
< 2− + . [∵ <
𝑚 𝑚(𝑚+1) (𝑚+1)2
𝑃+𝑘−1 𝑘 𝑃+𝑘
Also, <𝑦+𝑛< 1
∀ 𝑚 > 1]
𝑛 𝑛
𝑚(𝑚+1)
𝑃−1+𝑘
So, long as < 1 , i.e. , k < n-(P-1) 1
𝑛 < 2-𝑚+1.
𝑘
So, 𝑦 + 𝑛 < 1 and consequently ∴ The statement is true for n= m+1
𝑘
[x+𝑛] = [x]for k= 0, 1, 2, …, n-P. So, for all n ∊ ℕ the statement is true.
𝑘 Hence proved.
But [x+𝑛] = [x]+1 for k= n-P+1, …..n-1.
𝝅
161. In a 𝛥PQR, ⦟R = 𝟐 . If
1 𝑛−1
∴[x]+ [x+𝑛]+…+[x+ ] 𝑷 𝑸
𝑛 𝒕𝒂𝒏 𝟐 𝒂𝒏𝒅 𝒕𝒂𝒏 𝟐 are the roots of
([𝑥] + [𝑥] + ⋯ + [𝑥]) +
=⏟ equation a𝒙𝟐 + 𝒃𝒙 + 𝒄= 0 (a≠0), then
(([𝑥] + 1) + ([𝑥] + 1) + ⋯ + ([𝑥 + 1))] show that a + b = c.
⏟
𝑝 𝑄
Ans:- (a) tan + tan =
= n[x]+(P-1)……………………(1) 2 2
𝑏 𝑃 𝑄 𝑐 𝑃 𝑄 𝜋
− 𝑎 , tan 2 tan 2 = 2 ∴2+2=
Also, [nx]=[n[x]+ny]= n[x]+(P-1) 4
𝑝 𝑄
Since P-1 ≤ ny < P……(2) tan + tan 𝜋
2 2
∴ 𝑝 𝑄 = tan = 1
1 − tan tan 4
2 2
From equation (1) & (2),
𝑏
1 𝑛−1 −
[x]+[x+𝑛]+…+[x+ ] = [nx]. ⟹ 𝑎
𝑐 =1 ⟹𝑏 =𝑐−𝑎 ⟹𝑎+
𝑛 1−
𝑎
160. Prove that for n > 1, 1+𝟐𝟐 + 𝟑𝟐 + ⋯ +

𝟏 𝟏 𝑏=𝑐
𝟏 𝟏
<2−𝒏
𝒏𝟐
172
162. If A and B are real orthogonal 164. If 0 < u < 1 and 𝒖𝒏+𝟏 = 𝟏 −
matrices of the same order and |B|+|A|= 0. √𝟏 − 𝒖𝒏 ∀ 𝒏 > 1,
Prove that |A+ B|= 0 Prove that (i) {𝒖𝒏 } converges to zero
Ans:- |A|+|B|=0 𝒖𝒏+𝟏 𝟏
(ii) 𝐥𝐢𝐦 =𝟐
𝒏⟶∞ 𝒖𝒏
⇒ |A|= −|B|
Ans:- (i) 0 < 𝑢1 < 1
|A|.|B|=−1 [∵ |B|=|𝐵 −1 |as they are
orthogonal] ⇒ 0 < √1 − 𝑢1 < 1
Let, C = A (𝐴𝑇 + 𝐵 𝑇 )B ⇒ 0 < 1 -√1 − 𝑢1 < 1

⇒ |C|= |A𝐴𝑇 𝐵 + 𝐴𝐵 𝑇 𝐵| = |𝐵 + 𝐴| i.e. 0 < 𝑢2 < 1
………..(i)
Similarly, 0 < 𝑢3 < 1 ….. and so on.
And |C|= |A||𝐴𝑇 + 𝐵 𝑇 ||𝐵| = −|𝐴𝑇 + 𝐵 𝑇 |
Let 0 < 𝑢𝑛 < 1, then 0 < 1- √1 − 𝑢𝑛 < 1,
⇒ - |(𝐴 + 𝐵)𝑇 | = −|𝐴 + 𝐵|…………..(ii)
i.e. 0 < 𝑢𝑛+1 < 1
|𝐴 + 𝐵| = −|𝐴 + 𝐵|
Thus {𝑢𝑛 } is bounded.
⇒ 2 |A +B|=0
Again, 𝑢𝑛+1 − 𝑢𝑛 = 1-√1 − 𝑢𝑛 -𝑢𝑛
⇒ |A+ B|=0
=(1- 𝑢𝑛 )- √1 − 𝑢𝑛
163. Determine whether there is a one –to
– one function f: ℝ⟶ ℝ such that = (√1 − 𝑢𝑛 )2 − √1 − 𝑢𝑛
𝟏
f(𝒙𝟐 )-[f(𝒙)]𝟐 ≥ 𝟒 ∀ 𝒙 = √1 − 𝑢𝑛 (√1 − 𝑢𝑛 − 1)
1
Ans:- Take x= 0, then f(0) – (f(0))2 ≥ 4 < 0 as 0 < √1 − 𝑢𝑛 < 1
1 1
⇒ (f(0))2 + (2)2 − 2. 2 . f(0) ≤ 0 ∴ 𝑢𝑛+1 < 𝑢𝑛 as 0 < √1 − 𝑢𝑛 <1
1 ∴ {𝑢𝑛 } is monotonically decreasing. ∴ {𝑢𝑛 }

⇒ (f(0) − )2 ≤ 0 converges two zero.
2
1 1 𝑢𝑛+1
⇒ f(0) − 2 = 0 ⇒ f(0) = 2 (ii) Let lim 𝑢𝑛 = 𝑙, then lim
𝑛⟶∞ 𝑛⟶∞ 𝑢𝑛
1
Also, taking x=1 we have f(1) - 2 = 0 ∴ ∴ lim
1− √1−𝑙
= lim
𝑙
= 1+
1 1
=2
1 𝑛⟶∞ 𝑙 𝑛⟶∞ 𝑙(1+ √1−𝑙 ) √1−0
f(0) = f(1)= 2
; Since 𝑢𝑛 converges to zero.
∴ This is not one -to –one function.
173
165. Let g: ℝ⟶ ℝ be a continuous 167. Let F (x) = ∑𝒏𝒌=𝟎 𝒂𝒌 𝒙𝒌 , where 𝒂𝒌

𝒙−𝟏 𝒂
function ∋ g(x) = g ( ) ∀ x. satisfy ∑𝒏𝒌=𝟎 𝒌 = 𝟎 so that there exists a
𝟐 𝒌+𝟏
real root of f (x) = 0 in the interval (0,
Show that g must be a constant function. 1)
𝑥−1 𝑥
Ans:- g(x) = g ( ) Ans:- F (x) = ∫0 𝑓(𝑡)𝑑𝑡 =
2
𝑥 𝑥 𝑘+1
𝑥−1
𝑥−1
2
−1 𝑥−3 ∫0 (∑𝑛𝑘=0 𝑎𝑘 𝑡 𝑘 )𝑑𝑡 = ∑𝑛𝑘=0 𝑎𝑘 . 𝑘+1
⇒g( )=g( )=g( )
2 2 4
𝑥−1
Clearly F (x) satisfies the conditions of
Again putting x= Rolle’s Theorem as F (0) = 0 and
2
𝑥−1 𝑥−7 𝑎
g( )= g ( ) and so on F (1) =∑𝑛𝑘=𝑜 𝑘+1
𝑘
=0
2 2
Generally we have, g(
𝑥−1
)= g (
𝑥−(2𝑛 −1)
) Hence ∃ a ‘c’ ∊ (0, 1) ∋ F′(c) =0 ⇒ F (c) =0
2 2𝑛
𝟏 𝟏 𝟏 𝟏
𝑥 1 168. Show that 1+ 𝟐 + 𝟑 + 𝟒 + ⋯ . + can
∴ g (x)= g (2𝑛 − 1 + 2𝑛 ) 𝒏
never be an integer value.
∴ lim 𝑔 (𝑥) = 𝑔 (−1) 1 1 1
𝑛⟶∞ Ans:- We are to show:- 1+ 2 + 3 + 4 +
1 𝑎𝑛 𝑜𝑑𝑑 𝑛𝑢𝑚𝑏𝑒𝑟
⇒ g (x)= g (-1)= constant ∀ x. ⋯.+ = 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟 ∀ 𝑛 > 1
𝑛
166. Find the greatest and least value of 1 1 1 1

Let, P (n): 1+ 2 + 3 + 4 + ⋯ . + 𝑛=
the function f (x)= 𝒙𝟑 − 𝟑𝒙𝟐 + 𝟐𝒙 + 𝟏 in
𝑎𝑛 𝑜𝑑𝑑 𝑛𝑢𝑚𝑏𝑒𝑟
[2, 3]. ∀𝑛 >1
𝑎𝑛 𝑒𝑣𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟
Ans:- f (x)= 𝑥 3 − 3𝑥 2 + 2𝑥 + 1 1
When n=2, LHS= 1+ 2 = 2 = 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟
3 𝑎𝑛 𝑜𝑑𝑑 𝑛𝑢𝑚𝑏𝑒𝑟
f′(x)= 3𝑥 2 − 6𝑥 + 2; f′ (2) = 2 > 0; f′

∴ P (2) is true. Let P (m)be true
(3) =11 > f′ (2)
1 1 1 1
∴ f(x) is an increasing function ⇒ 1+ 2 + 3 + 4 + ⋯ . + =
𝑚
𝑎𝑛 𝑜𝑑𝑑 𝑛𝑢𝑚𝑏𝑒𝑟 𝑘
= (𝑠𝑎𝑦)
Note that f″(x) = 6x -6 > 0 ∀ x ∊ [2, 3] 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟 𝑟
𝑘 1
∴ f(x) is concave. Now, P (m+1) = + 𝑚+1
𝑟
Thus the function has min. value at x= 2 and m is odd or even,

max. Value at x= 3
But in case, it can be shown that
∴ minimum value= f(2)=1 ∴ maximum
𝑎𝑛 𝑜𝑑𝑑 𝑛𝑢𝑚𝑏𝑒𝑟
value = f(3) = 7 P (m)= 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟
∴P (n) is true for all n ∊ℕ
174
169. Let f: ℝ → ℝ be differentiable and = 11(99a + a + b)

assume there is no x 𝒊𝒏 ℝ ℈ f(x) = f’(x) =
Since, 𝑛2 is divisible by112 , we see that 11 |
0. Show that S = {x| 0≤ 𝒙 ≤ 𝟏 ; 𝒇(𝒙) = 𝟎}
(a+b)
is finite.
i.e. a+b=11. Since 𝑛2 𝑖𝑠 a square , bcan’t be
Ans:- Consider 𝑓 −1 ({0}). Since {0} is
0,1,2,3,5,7 or 8 . Checking the remaining we
closed and f is continuous 𝑓 −1 ({0}) is
see that 7744= 882
closed. Therefore, S=[0,1]∩ 𝑓 −1 ({0}) is
closed and bounded subset of ℝ. Hence, S is 171. Find the maximum value of
complete. 𝒄𝒐𝒔𝜶𝟏 . 𝒄𝒐𝒔𝜶𝟐 . 𝒄𝒐𝒔𝜶𝒏 , under the
restrictions
Assume S is infinite.
0 <𝜶𝟏 , 𝜶𝟐 , … 𝜶𝒏 ≤ 𝟐 𝒄𝒐𝒕𝜶𝟏 . 𝒄𝒐𝒕𝜶𝟐 . 𝒄𝒐𝒕𝜶𝒏
Then there is a limit point 𝑥 ∊ 𝑆;
= 1.
i.e. there is a sequence {𝑥𝑛 } of distinct
Ans.
points in S which converges to x.
Given, (cot 𝛼1 ). (cot 𝛼2 ) …. (cot 𝛼𝑛 ) = 1
Also, as all points are in S, 𝑓(𝑥𝑛 ) = 𝑓(𝑥) =
0 ∀ 𝑛 ∊ 𝑁. ⟹cos 𝛼1 . cos 𝛼2 … . cos 𝛼𝑛 =
sin 𝛼1 . sin 𝛼2 … . sin 𝛼1 …………….(1)
We now show that f’(x) =0.
Now, (cos 𝛼1 . cos 𝛼2 … . cos 𝛼𝑛 )2 =
Since.|𝑥𝑛 − 𝑥|→0 ,
(cos 𝛼1 . cos 𝛼2 … . cos 𝛼𝑛 )(cos 𝛼1 . cos 𝛼2 … . cos 𝛼𝑛 )
so
=
𝑓(𝑥+(𝑥𝑛 −𝑥))−𝑓(𝑥) (cos 𝛼1 . cos 𝛼2 … . cos 𝛼𝑛 )(
f’(x) = lim
𝑛→∞ 𝑥𝑛 −𝑥
sin 𝛼1 . sin 𝛼2 … . sin 𝛼𝑛 ) [from (1)]
𝑓(𝑥𝑛 )−𝑓(𝑥)
= lim 1 1
𝑛→∞ 𝑥𝑛 −𝑥 = 2𝑛 sin 2𝛼1 . sin 2𝛼2 … . sin 2𝛼𝑛 ≤ 2𝑛
=0 1
∴ (cos 𝛼1 . cos 𝛼2 … . cos 𝛼𝑛 )2 ≤ 2𝑛
The last equality holds since f(x) = f(𝑥𝑛 ) =0
holds ∀ 𝑛 ∊ 𝑁. 1 1
∴cos 𝛼1 . cos 𝛼2 … . cos 𝛼𝑛 ≤ √2𝑛 ≤ 𝑛
22
170. The four digit number aabb is a [∵cos 𝛼𝑖 ≥ 0]
square. Find the number.
172. Let f(x, y) = 0 is a circle such that f(0,
2
Ans:- aabb = 𝑛 𝜆) = 0 and f(𝜆,0) = 0 have equal roots and
f(1,1)= - 2 then the radius of the circle is
Then 𝑛2 = 1100a + 11b
(a) 4 (b) 8
= 11(100a + b)
(c) 2 (d) 1
175
Ans. (c) 174. Prove that
Let f(x, y) = 𝑥 2 + 𝑦 2 + 2𝑔𝑥 + 2𝑓𝑦 + 𝑐 = 𝟏 𝟏

1 < 𝟏𝟎𝟎𝟏 + 𝟏𝟎𝟎𝟐 + ⋯ + 𝟑𝟎𝟎𝟏 <
𝟏 𝟒
𝟑
0 𝑏𝑒 𝑡ℎ𝑒 𝑟𝑒𝑞𝑢𝑖𝑟𝑒𝑑 𝑐𝑖𝑟𝑐𝑙𝑒
1
Ans:- consider 2001 numbers 𝑘 , 1001 ≤
f(0, 𝜆) = 𝜆2 + 2𝑓𝜆 + 𝑐 = 0 ………….(1)
𝑘 ≤ 3001
f(𝜆, 0) = 𝜆2 + 2𝑔𝜆 + 𝑐= 0…………….(2)
Using AM- HM inequality, we get
∵ (1) and (2) have equal roots.
1
(∑3001 3001
𝑘=1001 𝑘 )(∑𝑘=1001 𝑘 ≥ (2001)
2
∴ D= 0
But ∑3001
𝑘=1001 𝑘 = (2001)
2
⟹ 𝑓 2 = 𝑔2 = 𝑐
1
∴ f(x, y) = 𝑥 2 + 𝑦 2 + 2𝑔𝑥 ± 2𝑓𝑦 + 𝑔2 = 0 Hence we get the inequality ∑3001
𝑘=1001 > 1 𝑘
f(1, 1) = - 2 ⟹ 𝑔2 + 2𝑔 ± 2𝑔 + 4 = 0 On the other hand grouping 500 terms at a

time, we also have
when f = - g, 𝑔2 = −4 (not possible)
1 500 500 500 500
S= ∑3𝑛+1
𝑘=𝑛+1 𝑘 < + 1500 + 2000 + 2500 +
∴ f = g and g = f = -2 and c = 4 1000
1 1 1 1 1 1 3851 4
< + 3 + 4 + 5 + 3001 = 3000 < 3
3001 2
∴ Radius of circle is 2.
1
[Remarks:- if S =∑3001
𝑘=1001 𝑘, there are (2n+
173. Let s=√𝟏 + √𝟐 + √𝟑 + ⋯ + √𝟏𝟎𝟎𝟎𝟎
𝟏𝟎𝟎𝟎 1) terms in the sum and the middle term is
and I=∫𝟎 √𝒙 𝒅𝒙. Show that I ≤ 𝒔 ≤ 𝑰 +
1 29 7
𝟏𝟎𝟎. ; then < 𝑆 < 6 ].
2𝑛+1 27
1000 1
Ans:- I=∫0 √𝑥 𝑑𝑥 = ∫0 √𝑥 𝑑𝑥 + 175. Let A be a set containing n elements.
2 10000 If the number of elements in the set,
∫1 √𝑥 𝑑𝑥 + ⋯ + ∫9999 √𝑥 𝑑𝑥
1 2 B = {(x, y, z) : x ∊A, y ∊A, z ∊A and x, y, z,
→∫0 0. 𝑑𝑥 + ∫1 √1 dx
10000 1
are not all distinct} is equal to 280,
+….+∫9999 √9999 𝑑𝑥 ≤ 𝐼 ≤ ∫0 1. 𝑑𝑥 +
2 10000 then find the value of n?
∫1 √2 𝑑𝑥 + ⋯ + ∫9999 √10000 dx
Ans; According to question 𝑛3 − (𝑛3). 3! =
→√1 +√2 +…..+√9999 ≤ 𝐼 ≤ √1 +√2
280
+…..+√10000
∴ 𝑛3 − 𝑛(𝑛 − 1)(𝑛 − 2) = 280
→I ≤ 𝑆
⟹ n(𝑛2 − 𝑛2 + 3𝑛 − 2)= 280
Also, S ≤ 𝐼 + √10000
⟹ n(3n- 2)= 280= 10(3.10- 2)
∴ I ≤ 𝑆 ≤ 𝐼 + 100
176
TOPIC WISE SOLVED Sol.: Let 𝑃(𝑛): 𝑥 𝑛 − 1 = 𝜆(𝑥 − 𝑘)

PROBLEMS
𝑁𝑜𝑤, 𝑃(1): 𝑥 − 1
INDUCTION = 𝜆1 (𝑥 − 𝑘) 𝐴𝑙𝑠𝑜, 𝑃(2): 𝑥 2
− 1 = 𝜆2 (𝑥 − 𝑘)
(Objective Type) ⟹ 𝑃(2): (𝑥 − 1)(𝑥 + 1)
= 𝜆2 (𝑥 − 𝑘)
1. The sum of n terms of the series 𝟏. 𝟑𝟐 +
𝟐. 𝟓𝟐 + 𝟑. 𝟕𝟐 + ⋯ ∞ 𝒊𝒔 ∴ Least value of k which the proposition P(n)
𝒏 is true is k = 1.
(a) 𝟒𝒏𝟑 + 𝟒𝒏𝟐 + 𝒏 (b) 𝟔 (𝒏 + 𝟏)(𝟔𝒏𝟐 +
𝒏(𝒏+𝟏) 4. 𝑰𝒇 𝟏 + 𝟓 + 𝟏𝟐 + 𝟐𝟐 + 𝟑𝟓 + ⋯ to n terms =
𝟏𝟒𝒏 + 𝟕) (c) (d) none.
𝟔 𝒏𝟐 (𝒏+𝟏)
, nth term of series is
𝟐
2 2 2
Sol. : Let 𝑝(𝑛): 1. 3 + 2. 5 + 3. 7 + ⋯ +
(𝟐𝒏−𝟏) 𝒏(𝟑𝒏−𝟏) 𝟐𝒏(𝟐𝒏+𝟏)
(𝑛)(2𝑛 + 1)2 (a) , (b) , (c) , (d)
𝟐 𝟐 𝟑
none.
∴ 𝑃(𝑛): ∑ 𝑛 (2𝑛 + 1)2 ⟹
𝑃(𝑛): ∑ 𝑛 (4𝑛2 + 4𝑛 + 1) Sol.: Let 𝑃(𝑛): 1 + 5 + 12 + 22 + 35 + ⋯ (n
terms)
⟹ 𝑃(𝑛): ∑ 𝑛 (4𝑛2 + 4𝑛2 + 𝑛) ⟹
𝑃(𝑛): 4 ∑ 𝑛3 + 4 ∑ 𝑛2 + ∑ 𝑛 ∴ 𝑃(𝑛) = 𝑛2 (𝑛+1)
1 = 𝑛𝑡ℎ 𝑡𝑒𝑟𝑚 𝑜𝑓 𝐿𝐻𝑆 = 𝑃(𝑛) − 𝑃(𝑛−1)
2
𝑛(𝑛 + 1)(6𝑛2 + 14𝑛 + 7).
6
𝑛2 (𝑛+1) (𝑛−1)2 𝑛
𝒏 𝒏+𝟐 ⟹ 𝑃(𝑛) − 𝑃(𝑛−1) = −
2. 𝟏𝟎 + 𝟑. 𝟒 + 𝑲 K is divisible by 9 for all 2 2
n ∊N. Then the least +ve integral value of k is- 𝑛
⟹ 𝑃(𝑛) − 𝑃(𝑛−1) = {𝑛2 + 𝑛 − 𝑛2 + 2𝑛 − 1}
2
(a) 5, (b) 3, (c) 1, (d) none.
𝑛
∴ 𝑇𝑛 = 𝑃(𝑛) − 𝑃(𝑛−1) = 2 (3𝑛 − 1)
Sol. Let 𝑃(𝑛): 10𝑛 + 3. 4𝑛+2 + 𝑘 =
9𝜆 (𝑤ℎ𝑒𝑟𝑒 𝜆 ∊ 𝐼)
⟹ 𝑃(1): 10 + 3. 43 + 𝑘 = 9 𝜆1 5. 𝟏𝟑 + 𝟐𝟑 + 𝟑𝟑 + ⋯ + 𝟏𝟎𝟎𝟑 = 𝒌𝟐 , 𝒕𝒉𝒆𝒏 𝒌 =

⟹ 𝑃(1): 202 + 𝑘
= 9𝜆1 … … … (1)𝐴𝑙𝑠𝑜, 𝑃(2): 100 + 3. 44 + 𝑘 (a) 1010, (b) 5050, (c) 10501, (d) none
= 9𝜆2
Sol.: 13 + 23 + 33 + ⋯ + 1003 = 𝑘 2 ⟹
⟹ 𝑃(2): 868 + 𝑘 = 9𝜆2 … … … … . (2) ∑100 3
𝑛=1 𝑛 = 𝑘
2
2
From (1) and (2), then minimum value of k is 100(100 + 1) 100.101
⟹{ } = 𝑘2 ⟹ 𝑘 =
5 such that P(n) is divisible by 9. 2 2
= 5050
Note that k here will not be negative as k is

3. 𝒙𝒏 − 𝟏 is divisible by 𝒌 − 𝒌. Then the least
sum of cubes of +ve integers.
+ve integral value of k is
(a) 1, (b) 2, (c) 3, (d) none
177
𝟏𝟑 𝟏𝟑 +𝟐𝟑 1 2𝑛
6. Sum till n terms of the series 𝟏
+ 𝟏+𝟑
+ ∴ 𝑃(𝑛) = 2 (1 − )=
𝑛+1 𝑛+1
𝟏𝟑 +𝟐𝟑 +𝟑𝟑
𝟏+𝟑+𝟓
= 𝝅 𝐬𝐢𝐧 𝟐𝒏𝒙
8. For all n∊ N, ∫𝟎 𝒅𝒙 =
𝐬𝐢𝐧 𝒙
𝟒𝒏𝟐 +𝟑 𝒏(𝒏+𝟏)𝟑 𝒏(𝟐𝒏𝟐 +𝟗𝒏+𝟏𝟑)
(a) 𝟓
, (b) 𝟔
, (c) 𝟐𝟒
, (d) 𝝅
(a) – 𝝅, (b) 0, (c) 𝟐 (d) none
none
𝜋 sin 2𝑛𝑥
13 13 +23 13 +23 +33 Sol.: Let 𝑃(𝑛) = ∫0 𝑑𝑥
Sol.: Let 𝑃(𝑛) = 1
+ 1+3
+ 1+3+5
+ sin 𝑥
⋯ (𝑛 𝑡𝑒𝑟𝑚𝑠) 𝜋 sin 2𝑛𝑥 𝜋

STEP I : ⟹𝑃(1) = ∫0 sin 𝑥
𝑑𝑥 = 2 ∫0 cos 𝑥 =
13 +23 +⋯+𝑛3 0
⟹ 𝑃(𝑛) ∶ ∑ 1+3+5…….(𝑛 𝑡𝑒𝑟𝑚𝑠) ⟹
∑ 𝑛3 𝐹𝑜𝑟 𝑛 = 1
𝑃(𝑛) : ∑ { }
𝑛2
STEP II: ⟹ For n = 𝑛1 , Let us assume that the
1 𝑛2 (𝑛+1)2 1
⟹ 𝑃(𝑛) : ∑ {4 𝑛2
} ⟹ 𝑃(𝑛) : 4 ∑(𝑛2 + proposition is true for n = m
2𝑛 + 1)
𝜋 sin 2𝑘𝑥
∴ 𝑃(𝑚) = ∫0 sin 𝑥
𝑑𝑥 = 0 … … … . . (1)
1
⟹ 𝑃(𝑛) ∶ {∑ 𝑛2 + 2 ∑ 𝑛 + ∑(1)}
4
STEP III: Let us prove the proposition for n =
1 𝑛(𝑛+1) 1 m +1. If the proposition is true for n = m+1,
⟹ 𝑃(𝑛) : 4 { 2 + 3 𝑛(𝑛 + 1)(2𝑛 + 1) + 𝑛}
then it was also true for n = m. Thus the
1
⟹ 𝑃(𝑛) : 24 𝑛 {3(𝑛 + 1) + 2(𝑛 + 1)(2𝑛 + 1) + proposition will be true for all n∊ N.
6} 𝑃(𝑚+1) − 𝑃(𝑚)
𝜋
1 sin[2(𝑘 + 1)𝑥] − sin 2𝑘𝑥
∴ 𝑃(𝑛) : 24 𝑛(2𝑛2 + 9𝑛 + 13) = ∫ 𝑑𝑥
0 sin 𝑥
𝟏 𝟏 𝟏
7. 𝟏
+ 𝟏+𝟐 + 𝟏+𝟐+𝟑 + ⋯ up to(n+1) terms is 𝑃(𝑚+1) + 𝑃(𝑚)
𝜋
equal to 2 cos[(2𝑘 + 1)𝑥] − sin 𝑥
= ∫ 𝑑𝑥
0 sin 𝑥
𝟐𝒏 𝒏 𝟐𝒏
(a) 𝒏+𝟏
, (b) 𝒏+𝟏, (c) 𝒏+𝟐 (d) none
sin(2𝑘 + 1) 𝑥 𝜋
1 1 1
⟹ 𝑃(𝑚+1) − 𝑃(𝑚) = [ ]
Sol.: Let 𝑃(𝑛) : + + + ⋯ (𝑛 + 2𝑘 + 1 0
1 1+2 1+2+3
1)𝑡𝑒𝑟𝑚𝑠 2
⟹ 𝑃(𝑚+1) − 𝑃(𝑚) = (0 − 0) = 0
1 2 2𝑘 + 1
𝑡𝑛 = = ⟹ 𝑡𝑛
1 + 2 + 3 + ⋯ + 𝑛 𝑛(𝑛 + 1) ∴ 𝑃(𝑚+1) = 𝑃(𝑚)
1 1
= 2[ − ]
𝑛 𝑛+1 Since the proposition is true for n = m+1,
thus it was also true for n = m. Hence the
1 1 1
⟹ 𝑃(𝑛) : {(1 − ) + ( − ) + ⋯ proposition is true ∀ n ∊ N.
2 2 3
1 1
+( − )}
𝑛 𝑛+1
178
𝟏 𝟏 𝟏 𝑎1+1 = 3𝑎1 − 2𝑎0 = 3(3) − 2(2) = 5

9. 𝟏.𝟒 + 𝟒.𝟕 + 𝟕.𝟏𝟎 + ⋯ to n terms
𝟏 𝟏 𝟏 Therefore, the result is true for 𝑎2 = 22 +

(a) , (b) , (c) , (d) none
𝟓𝒏−𝟏 𝟓𝒏+𝟏 𝒏+𝟒 1 𝑛 = 1 and 2
1 1 1
Sol.: Let 𝑃(𝑛) : + + + ⋯ 𝑛 𝑡𝑒𝑟𝑚𝑠 Step II: Assume that the result is true for n =
1.4 4.7 7.10
k.
1 1 1 1 1 1 1 1
⟹ 𝑃(𝑛) : (1 − ) + ( − ) + ( − )
3 4 3 4 7 3 7 10 𝑎𝑘 = 2𝑘 + 1
+ ⋯ (𝑛 𝑡𝑒𝑟𝑚𝑠)
Step III: for n = k +1
1 1 1 1 1
⟹ 𝑃(𝑛) ∶ {1 − + − + ⋯ +
3 4 4 7 (3𝑛 − 2) 𝑎𝑘−1 = 3𝑎𝑘 − 2𝑎𝑘−1 = 3(2𝑘 + 1) −
1 2(2𝑘−1 + 1) = 3. 2𝑘 + 3 − 2𝑘 − 2 = 2. 2𝑘 +
− }
3𝑛 + 1 1 = 2𝑘+1 + 1
1 1 𝑛
⟹ 𝑃(𝑛) : {1 − } ∴ 𝑃(𝑛) : . (By the induction assumption)
3 3𝑛 + 1 3𝑛 + 1
This shows that the result is true for n = k
𝒏𝟕 𝒏𝟓
10. For every positive integer 𝒏, 𝟕
+ 𝟓
+ +1. Hence by the principle of mathematical
𝟐𝒏𝟑 𝒏 induction. The result is true for all n ∊ N.
𝟑
− 𝟏𝟎𝟓
𝒅𝒙 𝒚
(a) an integer (b) a rational number (c) an 2) Prove that 𝒅𝒙𝒏 = (−𝟏)𝒏−𝟏 . (𝒏 −
𝝅 𝝅
odd integer (d) none 𝟏)! 𝐬𝐢𝐧 {𝒏 𝟐 − 𝒚} 𝒔𝒊𝒏𝒏 { 𝟐 + 𝒚} ∀ 𝒏 ∈
𝑛7 𝑛5 2𝑛3 𝑛 𝑵, 𝒘𝒉𝒆𝒓𝒆 𝒚 = 𝐭𝐚𝐧−𝟏 𝒙.
Sol.: Let 𝑃(𝑛) : 7
+ 5
+ 3
− 105
𝑑𝑥𝑦
Sol.: Let 𝑃(𝑛) = 𝑑𝑥 𝑛
= (−1)𝑛−1 . (𝑛 −
1 1 2 1
⟹ 𝑃(1) : + + − ⟹ 𝑃(1) 𝜋 𝜋
7 5 3 105 1)! sin {𝑛 ( 2 − 𝑦)} 𝑠𝑖𝑛𝑛 { 2 +
15 + 21 + 70 − 1
= 𝑦} … … … … (1)
105
16 4 2 2 Step I: For n = 1
= 1 ⟹ 𝑃(2) : 8 ( + + ) − = 15
7 5 3 105
𝑑𝑦 𝑑 1
LHS of (1) 𝑑𝑥 = 𝑑𝑥 tan−1 𝑥 = 1+𝑥 2 +
∴ By induction 𝑃(𝑛) is an integer ∀ n ∊ N. 1
1+𝑡𝑎𝑛2 𝑦
1
(SUBJECTIVE TYPE) (∵ 𝑦 = tan−1 𝑥) =
𝑠𝑒𝑐 2 𝑦
= 𝑐𝑜𝑠 2 𝑦 … … … … … (2)
1) Given 𝒂𝒏+𝟏 = 𝟑𝒂𝒏 − 𝟐𝒂𝒏−𝟏 𝒂𝒏𝒅 𝒂𝟎 =
𝟐, 𝒂𝟏 = 𝟑, show that 𝒂𝒏 = 𝟐𝒏 + 𝟏 ∀ n∊ N 𝜋 𝜋
= sin ( − 𝑦) sin ( − 𝑦)
2 2
Sol.: Step I. For n = 1 𝑎1 = 21 + 1 = 3 = (−1)1−1 (1 − 1)!
𝑛=2 𝜋 𝜋
sin ( − 𝑦) sin ( + 𝑦) = 𝑅. 𝐻. 𝑆 𝑜𝑓 (1)
2 2
179
Therefore, P(1) is true. 𝜋 𝑘𝜋

= (−1)𝑘−1 𝑘! 𝑠𝑖𝑛𝑘+1 ( 2 + 𝑦) sin { 2 −
𝜋
Step II: Assume it is true for n = k, then 𝑘𝑦 − 2 − 𝑦}
𝑑𝑘 𝑦 𝜋 𝜋
𝑃(𝑘) : 𝑑𝑥 𝑘
= (−1)𝑘−1 (𝑘 − 1)! sin {𝑘 2 − = (−1)𝑘−1 𝑘! 𝑠𝑖𝑛𝑘+1 ( 2 + 𝑦) sin {(𝑘 −
𝜋 𝜋
𝑦} 𝑠𝑖𝑛𝑘 { 2 + 𝑦} 1) − (𝑘 + 1)𝑦}
2
Step III: For n = k+1. 𝜋

= (−1)𝑘−1 𝑘! 𝑠𝑖𝑛𝑘+1 ( 2 + 𝑦) ×
𝑑 𝑘+1 𝑦 𝜋
𝑃(𝑘 + 1): = (−1)𝑘 𝑘! sin {𝑘 + − sin {𝜋 + (𝑘 − 1) 2 − (𝑘 + 1)𝑦}
𝑑𝑥 𝑘+1
𝜋 𝜋
1 (2 − 𝑦)} 𝑠𝑖𝑛𝑘+1 { 2 + 𝑦} 𝜋
= (−1)𝑘−1 𝑘! 𝑠𝑖𝑛𝑘+1 ( 2 + 𝑦) sin {(𝑘 +
𝜋
L. H. S. 1) 2 − (𝑘 + 1)𝑦}
𝑑 𝑘+1 𝑦 𝑑 𝑑𝑘 𝑦 𝑑 𝜋
𝑑𝑥 𝑘+1
= 𝑑𝑥 [𝑑𝑥 𝑘 ] = 𝑑𝑥 {(−1)𝑘−1 (𝑘 − = (−1)𝑘−1 𝑘! 𝑠𝑖𝑛𝑘+1 ( 2 + 𝑦) sin {(𝑘 +
𝜋 𝜋 𝜋
1)! sin {𝑘 − 𝑦} 𝑠𝑖𝑛𝑘 { + 𝑦}} 1) ( 2 − 𝑦)}
2 2
(by assumption step) = 𝑅. H. S.
𝑑 𝜋 This shows that the result is true for n =

= (−1)𝑘−1 (𝑘 − 1)! [sin {𝑘 ( k+1. Hence by the principle of
𝑑𝑦 2
𝑘
𝜋 mathematical induction the result is true
− 𝑦)} 𝑠𝑖𝑛 ( + 𝑦)]
2 for all n ∊ N.
𝑑𝑦
= (−1)𝑘−1 (𝑘 − 1)!
𝑑𝑥
3) Given that 𝒂𝒓 , 𝒃𝒓 , 𝒂𝒏𝒅 𝒄𝒓 are (+) ve real
𝜋 𝑑 𝜋
[sin {𝑘 ( 2 − 𝑦)} . 𝑑𝑦 𝑠𝑖𝑛𝑘 ( 2 + 𝑦) + numbers for r = 1, 2, 3, …, n and that
𝜋 𝑑 𝜋 𝑑𝑦
𝑠𝑖𝑛𝑘 ( 2 + 𝑦) 𝑑𝑦 sin {𝑘 ( 2 − 𝑦)}] 𝑑𝑥 𝒂𝒓 𝟐 = 𝒃𝒓 𝟐 + 𝒄𝒓 𝟐 , 𝒓 = 𝟏, 𝟐, … , 𝒏
𝑨𝒏 = 𝒂𝟏 + 𝒂𝟐 + ⋯ + 𝒂𝒏 ; 𝑩𝒏 = 𝒃𝟏 +
𝜋 𝒃𝟐 + ⋯ + 𝒃𝒏 ;
= (−1)𝑘−1 (𝑘 − 1)! [sin {𝑘 ( −
2 𝑪𝒏 = 𝒄𝟏 + 𝒄𝟐 + ⋯ + 𝒄𝒏
𝜋 𝜋
𝑦)} 𝑘 𝑠𝑖𝑛𝑘−1 ( 2 + 𝑦) cos ( 2 + 𝑦) − Prove that 𝑨𝟐 𝒏 ≥ 𝑩𝟐 𝒏 + 𝑪𝟐 𝒏
𝜋 𝜋
𝑠𝑖𝑛𝑘 ( 2 + 𝑦) cos {𝑘 ( 2 −
𝑦)}] . 𝑐𝑜𝑠 2 𝑦 𝑓𝑟𝑜𝑚 (2) Sol.: Let 𝑃(𝑛) : 𝐴2 𝑛 ≥ 𝐵2 𝑛 + 𝐶 2 𝑛
𝜋 Step I: For n = 1, 𝐴1 = 𝑎1 , 𝐵1 = 𝑏1 , 𝐶1 = 𝑐1
= (−1)𝑘−1 (𝑘 − 1)! 𝑠𝑖𝑛𝑘−1 ( 2 +
𝜋
𝑦) [sin {𝑘 ( 2 − 𝑦)} cos ( 2 + 𝑦) −
𝜋 𝑆𝑖𝑛𝑐𝑒, 𝑎1 2 = 𝑏1 2 +
𝜋 𝜋 𝜋 𝑐1 2 𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒, 𝐴1 2 ≥ 𝐵1 2 + 𝐶1 2
sin ( 2 + 𝑦) cos {𝑘 ( 2 − 𝑦)}] 𝑠𝑖𝑛2 ( 2 + 𝑦) So the result is true for n = 1
180
Step II: Assume it is true for n = k, then 𝐴𝑘 2 ≥ 𝑑𝑘

𝑖. 𝑒. 𝑑𝑥 𝑘 (
log 𝑥
) =
(−1)𝑘 𝐾!
(log 𝑥 − 1 −
𝑥 𝑥 𝑘+1
𝐵𝑘 2 + 𝐶𝑘 2 1 1
…. )
2 𝑘
Step III: For n = k+1
Step III: For n = k +1
Now 𝐴𝑘+1 = 𝐴𝑘 + 𝑎𝑘+1 , 𝐵𝑘+1 = 𝐵𝑘 +
𝑏𝑘+1 , 𝐶𝑘+1 = 𝐶𝑘 + 𝑐𝑘+1 𝑑 𝑘+1 log 𝑥 𝑑 𝑑 𝑘 log 𝑥
We have ( ) = [ ( )]
𝑑𝑥 𝑘+1 𝑥 𝑑𝑥 𝑑𝑥 𝑘 𝑥
Let 𝐵𝑘 = 𝑟 cos 𝜃 𝑎𝑛𝑑 𝐶𝑘 = 𝑟 sin 𝜃
𝐶𝑘 𝑑 (−1)𝑘 𝐾! 1 1
∴ 𝐵2 𝑘 + 𝐶 2 𝑘 = 𝑟 2 tan−1 ( ) = 𝜃 = [ 𝑘+1 (log 𝑥 − 1 − … . . )]
𝐵𝑘 𝑑𝑥 𝑥 2 𝑘
∵ 𝐵2 𝑘 + 𝐶 2 𝑘 ≤ 𝐴2 𝑘 (by assumption
step) (by assumption)
∴ 𝑟 2 ≤ 𝐴2 𝑘 𝑖. 𝑒. 𝑟 ≤ 𝐴𝑘
1 1 1 1
𝐹𝑢𝑟𝑡ℎ𝑒𝑟, 𝑠𝑖𝑛𝑐𝑒 𝑎𝑘+1 2 ≥ 𝑏𝑘+1 2 + = (−1)𝑘 𝐾! [𝑥𝑘+1 (𝑥) + (log 𝑥 − 1 − 2 … . . 𝑘) −
𝑐𝑘+1 2 (𝑓𝑜𝑟 𝑟 = 𝑘 + 1) (𝑘+1)
( 𝑥 𝑘+2 )]
𝑏𝑘+1 2 𝑐𝑘+1 2
1= ( ) +( )
𝑎𝑘+1 𝑎𝑘+1 (−1)𝑘 𝐾! 1 1
= 𝑥 𝑘+2
[1 − (𝑘 + 1) [log 𝑥 − 1 − 2 … . − 𝑘]]
𝑏𝑘+1 𝑐𝑘+1
𝑃𝑢𝑡 = cos 𝛼 , = sin 𝛼
𝑎𝑘+1 𝑎𝑘+1 (−1)𝑘+1 𝐾! 1 1
𝑆𝑜 𝑡ℎ𝑎𝑡 𝐵𝑘+1 = 𝐵𝑘 + 𝑏𝑘+1 = = [(𝑘 + 1) (log 𝑥 − 1 − 2 − ⋯ − 𝑘) −
𝑥 𝑘+2
𝑟 cos 𝜃 + 𝑎𝑘+1 cos 𝛼 and 𝐶𝑘+1 = 𝐶𝑘 + 1]
𝑐𝑘+1 = 𝑟 sin 𝜃 + 𝑎𝑘+1 sin 𝛼 𝑡ℎ𝑒𝑛
𝐵𝑘+1 2 + 𝐶𝑘+1 2 = 𝑟 cos 𝜃 + (−1)𝑘+1 (𝑘+1)! 1 1 1
= 𝑥 𝑘+2
[log 𝑥 − 1 − 2 − ⋯ − 𝑘 − 𝑘+1]
𝑎𝑘+1 cos(𝜃 − 𝛼) ≤ 𝑟 2 + 𝑎𝑘+1 2 +
2𝑟𝑎𝑘+1 (∵ cos(𝜃 − 𝛼) ≤ 1) = This shows that the result is true for n = k+1.
(𝑟 + 𝑎𝑘+1 )2 Hence by the mathematical induction, the
= 𝐴𝑘+1 2 (∵ 𝑟 ≤ 𝐴𝑘 ) result is true for all n ∊ N.
𝑇ℎ𝑢𝑠 𝐵𝑘+1 2 + 𝐶𝑘+1 2 < 𝐴𝑘+1 2
5) Let 𝒇. 𝑹 → 𝑹 such that 𝒇(𝒙 + 𝒚) =
This shows that the result is true for n = k+1. 𝒇(𝒙). 𝒇(𝒚)∀ 𝒙, 𝒚 ∊ 𝑹, to show that 𝒇(𝒏) =
Hence, by the principle of mathematical 𝒌𝒏 , where k is real number and n is non-
induction the result is true for all n ∊ N. negative integer. Hence or otherwise show
𝒅𝒏 𝐥𝐨𝐠 𝒙 (−𝟏)𝒏 .𝒏!
that 𝒇(𝒙) = 𝒌𝒙 for all rational x.
4) Prove that 𝒅𝒙𝒏 ( 𝒙
) = 𝒙𝒏+𝟏
(𝐥𝐨𝐠 𝒙 −
𝟏 𝟏 Sol.: ∵ 𝑓(𝑥 + 𝑦) =
𝟏 − … . . ) ∀ 𝒏 ∈ 𝑵 𝒂𝒏𝒅 𝒙 = 𝟎.
𝟐 𝒏 𝑓(𝑥)𝑓(𝑦) … … … … … (1)
𝑑 log 𝑥
Sol.: Step I: For n = 1 L. H. S. 𝑑𝑥 ( ) = 𝑃𝑢𝑡𝑡𝑖𝑛𝑔 𝑥 = 0, 𝑦 = 0 𝑤𝑒 𝑔𝑒𝑡 𝑓(0) =
𝑥
1−log 𝑥 1, 𝑙𝑒𝑡 𝑘 = 𝑓(1)
𝑥2
We will show that 𝑓(𝑛) = 𝑘 𝑛 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ≥ 0
(−1)1 1
= 𝑥 1+1
(log 𝑥 − 1) R. H. S. which is true
Step I: For 𝑛 = 0, 𝑓(0) = 𝑘 0 1, so the
for n = 1
result is true for n = 0.
Step II: Assume it is true for n = k.
181
Step II: Assume it is true for n = p, when p

is positive integer 𝑓(𝑝) = 𝑘 𝑝 Sol.: Let 𝑃(𝑛) = √𝑎 + √𝑎 + √𝑎 + ⋯ + √𝑎 <
Step III: For n = p + 1 1+√(4𝑎+1)

2
𝑝 𝑝+1
𝑓(𝑝+1) = 𝑓(𝑝) 𝑓(1) = 𝑘 . 𝑘 = 𝑘 (by
1+√(4𝑎+1)
assumption step) Step I: For n = 0, then √𝑎 < 2
This show that the result is true for all ⟹ 2√𝑎 < 1 + √(4𝑎 + 1) ⟹ 4𝑎 <
non-negative integers.
1 + 4𝑎 + 1 + 2√(4𝑎 + 1)
Again if p is negative integer 𝑖. 𝑒. 𝑝 = −𝑚. ⟹ 2√(4𝑎 + 1) + 2 > 0 which is true
Where m is positive integer. Then we can 𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒, 𝑃(1) 𝑖𝑠 𝑡𝑟𝑢𝑒
write Step II: Assume it is true for n = k,
then
𝑓(0) = 𝑓(𝑝+𝑚) ⟹ 𝑓(𝑝) 𝑓(𝑚) =
1 (𝑏𝑦 𝑎𝑠𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛 𝑠𝑡𝑒𝑝)
𝑃(𝑘) : √𝑎 + √𝑎 + √𝑎 + ⋯ + √𝑎 <
⟹ 𝑓(𝑝) 𝑘 𝑚 = 1 1+√(4𝑎+1)
2
⟹ 𝑓(𝑝) = 𝑘 −𝑚 ⟹ 𝑓(𝑝) = 𝑘 𝑝 it is true for K-radical signs
negative integer Step III: For n = k+1
𝑝
Finally let 𝑛 = 𝑞 when p, q> 0 and then
𝑃(𝑘+1) : √𝑎 + √𝑎 + √𝑎 + ⋯ + √𝑎 <
𝑓(𝑝) = 𝑓(𝑛𝑞) = 𝑓(𝑛 + 𝑛 + ⋯ 𝑞 𝑡𝑖𝑚𝑒𝑠) 1+√(4𝑎+1)
2
2 (𝑘 + 1)𝑟𝑎𝑑𝑖𝑐𝑎𝑙 𝑠𝑖𝑔𝑛𝑠
= 𝑓(𝑛) 𝑓(𝑛) 𝑓(𝑛) … . . 𝑞 𝑓𝑎𝑐𝑡𝑜𝑟𝑠 = [𝑓(𝑛) ]
For assumption step
𝑞
∴ 𝑓(𝑝) = [𝑓(𝑛) ] (𝑏𝑦 𝑎𝑠𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛 𝑠𝑡𝑒𝑝)
√𝑎 + √𝑎 + √𝑎 + ⋯ + √𝑎 < 1+√(4𝑎+1)
𝑝 2
⟹ 𝑓(𝑛) = 𝑘 = 𝑘 𝑛 .
𝑞
k-radical signs
Hence the result is true for all rational ⟹
number.
√𝑎 + √𝑎 + √𝑎 + ⋯ + √𝑎
6) Show that for all n ∊ N,
√𝒂 + √𝒂 + √𝒂 + ⋯ + √𝒂 ≤ 𝟏+√𝟒𝒂+𝟏 1 + √(4𝑎 + 1)
𝟐 <𝑎+
2
where ‘a’ is fixed positive number and n
radical signs are taken on L.H.S.
182
Step II: Assume it is true for n = k, i.e.

(𝑋𝑌)𝑘 = ∑𝑘𝑟=0 𝑘𝐶𝑟 𝑋𝑘−𝑟 𝑌𝑟
⟹ √𝑎 + √𝑎 + √𝑎 + √𝑎 + ⋯ + √𝑎
Step III: For n = k+1, we have (𝑋𝑌)𝑘+1 =
[𝑘𝐶0 𝑋𝑘−0 𝑌0 + 𝑘𝐶1 𝑋𝑘−1 𝑌1 + 𝑘𝐶2 𝑋𝑘−2 𝑌2 +
1 + √(4𝑎 + 1) ⋯ + 𝑘𝐶𝑘 𝑋0 𝑌𝑘 ]
< √𝑎 + 1
2
= 𝑘𝐶0 (𝑋𝑘 𝑌1 + 𝑌0 𝑋𝑘+1 ) + 𝑘𝐶1 (𝑋𝑘−1 𝑌2 +
2𝑎 + 1 + √(4𝑎 + 1) 𝑌1 𝑋𝑘 ) + 𝑘𝐶2 (𝑋𝑘−2 𝑌3 + 𝑌2 𝑋𝑘−1 ) + ⋯ +
=√
2 𝑘𝐶𝑘 (𝑋0 𝑌𝑘+1 + 𝑌1 𝑋𝑘 )
(𝑘 + 1) radical signs
= 𝑘𝐶0 𝑋𝑘+1 𝑌0 + (𝑘𝐶0 + 𝑘𝐶1 )𝑋𝑘 𝑌1 +
4𝑎 + 2 + 2√(4𝑎 + 1)
= √ (𝑘𝐶1 + 𝑘𝐶2 )𝑋𝑘−1 𝑌2 + (𝑘𝐶2 + 𝑘𝐶3 )𝑋𝑘−1 𝑌3 +
4
⋯ + ⋯ + 𝑘𝐶𝑘 𝑋0 𝑌𝑘+1
2
(√4𝑎 + 2) + 1 + 2√(4𝑎 + 1)
= √ = 𝑘 + 1𝐶0 𝑋𝑘+1 𝑌0 + 𝑘 + 1𝐶1 𝑋𝑘 𝑌1
4
+ 𝑘 + 1𝐶2 𝑋𝑘−1 𝑌2 + ⋯
2
= √(
1+√(4𝑎+1)
) =
1+√(4𝑎+1) + 𝑘 + 1𝐶𝑘+1 𝑋0 𝑌𝑘+1
2 2
= ∑𝑘+1
𝑟=0 𝑘 + 1𝐶𝑟 𝑋𝑘+1−𝑟 𝑌𝑟 .
This shows that the result is true for n =

= √𝑎 + √𝑎 + √𝑎 + √𝑎 + ⋯ + √𝑎
k+1. Hence by the principle of
mathematical induction, the result is true
1 + √(4𝑎 + 1) for all n ∊ N.
<
2
(𝑘 + 1) radical signs 8) Suppose the natural number are divided
into groups (1); (2, 3); (4, 5, 6); (7, 8, 9,
Which is true for n = k +1 10); ……… and that every second group is
Hence by the principle of deleted. Prove that the sum of the terms of
mathematical induction the result is the first k groups, which remain after
true for all n ∊ N. deletion, is always 𝒌𝟒 .
Sol.: The remaining groups are (1); (4, 5,

7) Show that for all 𝒏 ≥ 𝟏, (𝑿𝒀)𝒏 =
6); (11, 12, 13, 14, 15); ……….. step I. Sum
∑𝒏𝒓=𝟎 𝒏𝑪𝒓 𝑿𝒏−𝒓 𝒀𝒓 where X and Y are
of the terms in first group = 1 = 14 and
functions of x and 𝒙𝒏 denotes the nth
sum of the terms in the terms in the 1st
derivation of X with respect to x.
two groups = 1+(4+5+6)= 16= 24 . The
Sol.: Step I: For n = 1, result is true for k = 1 and k = 2 step II.
Assume that the sum of the terms of the
(𝑋𝑌)1 = 𝑋𝑌1 + 𝑌𝑋1 = 𝑋0 𝑌1 + 𝑌0 𝑋1 = first k groups 𝑘 4
∑1𝑅=0 1𝐶𝑟 𝑋1−𝑟 𝑌𝑟 which is true for all n = 1
Step III. Now considering the (𝑘 + 1)𝑡ℎ
group
183
𝜋
1st term in the 1st group = 1 1 2
= ∫ (1 + cos 2𝑥) 𝑑𝑥
1st term in the 2nd group = (1+2)+1= 4 2 0
𝜋
1 sin 2𝑥
= 2 (𝑥 + 2
) 02
1st term in the 3rd group =
1 𝜋 𝜋
(1+2+3+4)+1= 11 = ( )= 2
2 2 2
………………………………………………
Therefore, the result is true for n -1
………………………………………………
Step II: For n = k+1
1st term in the (k+1) th group = 𝜋
2
(1+2+3+…+2k)+1 𝐼𝑘+1 = ∫ 𝑐𝑜𝑠 𝑘+1 𝑥 cos(𝑘 + 1)𝑥 𝑑𝑥
0
=k(1+2k)+1 = (2𝑘 2+k+1) 𝜋
2
= ∫ 𝑐𝑜𝑠 𝑘 𝑥 (cos(𝑘
The number of terms in the (k+1)th 0
group = (2k +1) + 1)𝑥 𝑑𝑥)𝑑𝑥
𝜋
∴ The sum of the terms in the (k+1) the 2
𝐼𝑘+1 − 𝐼𝑘 = ∫ 𝑐𝑜𝑠 𝑘 𝑥 {cos(𝑘 + 1)𝑥 cos 𝑥
group 0
− cos 𝑘𝑥}𝑑𝑥
(2𝑘 + 1)
= [2 (2𝑘 2 + 𝑘 + 1) + 2𝑘] 𝜋
2
= ∫02 𝑐𝑜𝑠 𝑘 𝑥 {cos(𝑘 + 1)𝑥 cos 𝑥 −
= (2𝑘 + 1)(2𝑘 2 + 2𝑘 + 1) cos(𝑘 + 1)𝑥 cos 𝑥 − sin(𝑘 +
1)𝑥 sin 𝑥}𝑑𝑥
= 4𝑘 3 + 6𝑘 2 + 4𝑘 +
{∵ cos 𝑘𝑥 = cos[(𝑘 + 1)𝑥 − 𝑥]
1 … … … … … … … . (1)
= cos(𝑘 + 1) 𝑥 cos 𝑥
Sum of the terms in the first (k+1) groups + sin(𝑘 + 1)𝑥 sin 𝑥}
= (sum of first k group) + (sum of terms = sin(𝑘 + 1) 𝑥. 𝑐𝑜𝑠 𝑘 𝑥(− sin 𝑥)𝑑𝑥
in the (k+1)th group) = 𝑘 4 + 4𝑘 3 +
Integrating by parts
6𝑘 2 + 4𝑘 + 1 by assumption step and (1)
= (𝑘 + 1)4 . 𝜋
𝑐𝑜𝑠 𝑘+1 𝑥 2
𝐼𝑘+1 − 𝐼𝑘 = [sin(𝑘 + 1) 𝑥 ]
This show that the result is true for n = (𝑘 + 1) 0
𝜋
k+1. Hence, by the principal of 2
− ∫ (𝑘 + 1)
mathematical induction, the result is true 0
for all n ∊N. 𝑐𝑜𝑠 𝑘+1
cos(𝑘 + 1)𝑥 𝑑𝑥 = 0 − 𝐼𝑘+1
𝝅 (𝑘 + 1)
𝝅
9) Show that ∫𝟎𝟐 𝒄𝒐𝒔𝒏 𝒙 𝐜𝐨𝐬 𝒏𝒙 𝒅𝒙 = 𝟐𝒏+𝟏 1 1 𝜋 𝜋
𝐼𝑘+1 = 𝐼𝑘 = . 𝑘+1 . 𝐼𝑘+1 = 𝑘+2
2 2 2 2
𝜋
𝜋
Sol.: Let 𝐼𝑛 = ∫02 𝑐𝑜𝑠 𝑛 𝑥 cos 𝑛𝑥 𝑑𝑥 = This shows that the result is true for n = k+1.
2𝑛+1
𝜋 Hence, by the principal of mathematical

Step I: For n = 1, 𝐼1 = ∫02 cos 𝑥 cos 𝑥 𝑑𝑥 induction, the result is true for all n ∊ N.
184
𝑚
10) Show that ∑𝒏𝒌=𝟎 𝒌𝟐 𝒏𝑪𝒌 = 𝒏(𝒏 +
= 𝑃(𝑚) + ∑(𝑘 + 1)2 𝑚𝐶𝑘 (𝑅𝑒𝑝𝑙𝑎𝑐𝑒 𝑘 𝑏𝑦 𝑘
𝟏)𝟐𝒏−𝟐 𝒇𝒐𝒓 𝒏 ≥ 𝟏.
𝑘=0
Sol.: Let 𝑃(𝑛) = ∑𝑛𝑘=0 𝑘 2 𝑛𝐶𝑘 + 1)

𝑚
= 𝑛(𝑛 + 1)2𝑛−2 𝑓𝑜𝑟 𝑛 ≥ 1. = 𝑃(𝑚) + ∑(𝑘 2 + 2𝑘 + 1) 𝑚𝐶𝑘
𝑘=0
Step I: For n = 1 𝑚
1 = 𝑃(𝑚) + ∑ 𝑘 2 𝑚𝐶𝑘
𝑘=0
𝑃(1) = ∑ 𝑘 2 1𝐶𝑘 = 0 + 1 1𝐶1 = 1 𝑚 𝑚
𝑘=0
+ 2 ∑ 𝑘 𝑚𝐶𝑘 + ∑ 𝑚𝐶𝑘
= 1(1 + 1) 21−2
𝑘=0 𝑘=0
𝑤ℎ𝑖𝑐ℎ 𝑖𝑠 𝑡𝑟𝑢𝑒 𝑓𝑜𝑟 𝑛 = 1 = 2𝑃(𝑚) + 2𝑚 2𝑚−1

Step II: Assume it is true for n –m + 2𝑚 (𝑓𝑟𝑜𝑚 𝑏𝑖𝑛𝑜𝑚𝑖𝑎𝑙 𝑡ℎ𝑒𝑜𝑟𝑒𝑚)
𝑚 = 2𝑚(𝑚 + 1)2𝑚−2 + 2𝑚 . 2𝑚−1 + 2. 2𝑚−1

𝑖. 𝑒. 𝑃(𝑚) = ∑ 𝐾 2 𝑚𝐶𝑘 = 𝑚(𝑚 + 1)2𝑚−2
𝑘=0
= (𝑚 + 1)(𝑚 + 2)2𝑚−1
Step III: For n = m+1 This show that the result is true for n = m+1.
Hence, by the principal of mathematical
𝑚+1 𝑚+1
induction, the result is true for all n ∊ N.
𝑃(𝑚+1) = ∑ 𝑘 2 𝑚 + 1𝐶𝑘 = 0 + ∑ 𝐾 2
𝑘=0 𝑘=1
𝑚
11) Show that the sequence {𝒂𝒏 }, where 𝒂𝒏 =
𝑚 + 1𝐶 𝑘 = ∑ 𝑘 2 𝑚 + 1𝐶 𝑘 𝟏.𝟑.𝟓….(𝟐𝒏−𝟏)
𝑘=1 𝟐.𝟒.𝟔…..𝟐𝒏
√(𝟐𝒏 + 𝟏) is a monotonic
2
+ (𝑚 + 1) 𝑚 + 1𝐶𝑚+1 decreasing sequence.
𝑚
1.3.5……(2𝑛−1)
= ∑ 𝑘2 Sol.: ∴𝑎𝑛 = √(2𝑛 + 1)
2.4.6…..2𝑛
𝑘=1
√3
(𝑚𝐶𝑘 + 𝑚𝐶𝑘−1 ) + (𝑚 + 1)2 Step I. For n= 1, 2 𝑎1 = , 𝑎2 =
2
𝑚 1.3 3√5
2 √(4 + 1) =
= ∑ 𝑘 𝑚𝐶 𝑘 2.4 8
𝑘=1
𝑚 𝐻𝑒𝑟𝑒 𝑎1 > 𝑎2 (∴ 2 > 1)
2 2
+ [∑ 𝑘 𝑚𝐶𝑘−1 + (𝑚 + 1) ]
It is monotonic decreasing function which is
𝑘=1
𝑚+1 true for n = 1, 2
= 𝑃(𝑚) + ∑ 𝑘 2 𝑚𝐶𝑘−1
Step II. Assume it is true for n = k, then
𝑘=1
𝑎𝑘−1 > 𝑎𝑘 (∵ 𝑘 > 𝑘 − 1)
Step III. For n = k+1
185
𝑎𝑘+1 1 + 𝑎 + 𝑎2 + ⋯ + 𝑎𝑘 + 𝑎𝑘+1
1.3.5 … . . (2𝑘 − 1)(2𝑘 + 1) 𝑃(𝑘+1) :
𝑎 + 𝑎2 + ⋯ + 𝑎𝑘−1 + 𝑎𝑘
= . √(2𝑘 + 3) 𝑘+2
2.4.6 … . .2𝑘(2𝑘 + 2)
≥
𝑎𝑘 (2𝑘 + 1) − √(2𝑘 + 3) 𝑘
= . 𝑜𝑟 1 + 𝑎 + 𝑎2 + ⋯ + 𝑎𝑘 + 𝑎𝑘+1
√(2𝑘 + 1) (2𝑘 + 2)
𝑘+2
≥
⟹ 𝑎𝑘+1 𝑘
(𝑎 + 𝑎2 + ⋯ + 𝑎𝑘 ) … … … … … . (1)
𝑎𝑘 √(2𝑘 + 1)(2𝑘 + 3)
= … … … … … (1) 𝐵𝑦 𝑎𝑠𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛 𝑠𝑡𝑒𝑝, 𝑤𝑒 𝑔𝑒𝑡
(2𝑘 + 2)
1 + 𝑎 + 𝑎2 + ⋯ + 𝑎𝑘
𝑘+1
√(2𝑘 + 1)(2𝑘 + 3) ≥( ) (𝑎 + 𝑎2
𝐴𝑠𝑠𝑢𝑚𝑒 𝑘−1
(2𝑘 + 2)
+ ⋯ + 𝑎𝑘−1 )
< 1 … … … . (2)
𝐴𝑑𝑑𝑖𝑛𝑔 𝑎𝑘+1 to both sides, we get
𝑡ℎ𝑒𝑛 (2𝑘 + 1)(2𝑘 + 3) < (2𝑘 + 2)2 1 + 𝑎 + 𝑎2 + ⋯ + 𝑎𝑘 + 𝑎𝑘+1
𝑘+1
⟹ 4𝑘 2 + 8𝑘 + 3 < 4𝑘 2 + 8𝑘 + 4 ⟹ 0 < ≥( ) (𝑎 + 𝑎2
𝑘−1
1 which is true. + ⋯ + 𝑎𝑘−1 )
+ 𝑎𝑘+1 … … … (2)
From (1) and (2), we get 𝑎𝑘+1 < 𝑎𝑘 (∵ 𝑘 +
𝑘+1
1 > 𝑘) 𝑎𝑠𝑠𝑢𝑚𝑒 ( ) (𝑎 + 𝑎2 + ⋯ + 𝑎𝑘−1 )
𝑘−1
This show that the result is true for n = k+1. 𝑘+2
+ 𝑎𝑘+1 ≥ ( )
Hence, by the principal of mathematical 𝑘
induction, the result is true for all n ∊ N. (𝑎 + 𝑎2 + ⋯ + 𝑎𝑘 ) … … … … … . (3)
𝑘 + 1 (𝑘 + 2)
𝑡ℎ𝑒𝑛 ( − ) (𝑎 + 𝑎2 + ⋯
𝑘−1 𝑘
+ 𝑎𝑘−1 ) + 𝑎𝑘+1
12) If ‘a’ fixed real number ≥ 𝟐, then show
𝟏+𝒂+𝒂𝟐 +⋯+𝒂𝒏 𝒏+𝟏
𝑘+2 𝑘
that 𝒂+𝒂𝟐+⋯+𝒂𝒏−𝟏 ≥ 𝒏−𝟏 , 𝒏 ∈ 𝑵, 𝒏 > 1. ≥( )𝑎
𝑘
2
1+𝑎+𝑎2 +⋯+𝑎 𝑛 𝑛+1 ⟹ (𝑎 + 𝑎2 + ⋯ + 𝑎𝑘−1 )
Sol.: let 𝑃(𝑛) : 𝑎+𝑎2 +⋯+𝑎𝑛−1 ≥ 𝑘(𝑘 − 1)
𝑛−1
(𝑘 + 2) 2
1+𝑎+𝑎 2 3
− 𝑎 ≥0
Step I. For n = 2 𝑃(2) : ≥ 1:1 + 𝑎 + 𝑘
𝑎
⟹ 2(𝑎 + 𝑎2 + ⋯ + 𝑎𝑘−1 )
𝑎2 ≥ 3𝑎
+ 𝑘(𝑘 − 1)𝑎𝑘+1
: 𝑎2 − 2𝑎 + 1 ≥ 0 ∶ (𝑎 − 1)2 ≥ 0 𝑘+2 𝑘
− 𝑎 ≥0
𝑤ℎ𝑖𝑐ℎ 𝑖𝑠 𝑡𝑟𝑢𝑒 𝑓𝑜𝑟 𝑛 = 2 𝑘
⟹ 2(𝑎 + 𝑎2 + ⋯ + 𝑎𝑘−1 )
Step II. Assume it is true for n = k, then + 𝑎𝑘 {(𝑘 − 1)𝑘𝑎
− (𝑘 + 2)} ≥ 0
1 + 𝑎 + 𝑎2 + ⋯ + 𝑎𝑘 𝑘 + 1
𝑃(𝑘) : ≥ ⟹ 2(𝑎 + 𝑎 + ⋯ + 𝑎𝑘−1 )
2
𝑎 + 𝑎2 + ⋯ + 𝑎𝑘−1 𝑘−1
+ 𝑎𝑘 (𝑘 − 1)(𝑘(𝑎 − 1)
Step III. For n = k+1, we have to show that − 2) ≥ 0
186
Which is true 1 1
It remains to be observed that 21 ! + 22 ! +
∵ 𝑎 ≥ 2 𝑎𝑛𝑑 𝑘 ≥ 2 1
{ ⋯ + 2𝑘 ! < 1.
∴ 𝑘 − 1 ≥ 1, 𝑘(𝑎 − 1) − 2 ≥ 0
From (2) and (3), we get 14) The positive integers

𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏 𝒂𝒏𝒅 𝒚𝟏 , 𝒚𝟐 , … , 𝒚𝒏 are given.
1 + 𝑎 + 𝑎2 + ⋯ + 𝑎𝑘 + 𝑎𝑘+1 The sums 𝒙𝟏 + 𝒙𝟐 + ⋯ + 𝒙𝒏 𝒂𝒏𝒅 𝒚𝟏 +
𝑘+2
≥( ) (𝑎 + 𝑎2 𝒚𝟐 + ⋯ + 𝒚𝒏 are equal and less than 𝒎𝒏.
𝑘 Prove that one may cross out some of the
+ ⋯ + 𝑎𝑘 )
terms in the equality 𝒙𝟏 + 𝒙𝟐 + ⋯ + 𝒙𝒏 =
1 + 𝑎 + 𝑎2 + ⋯ + 𝑎𝑘 + 𝑎𝑘+1 𝒚𝟏 + 𝒚𝟐 + ⋯ + 𝒚𝒏 . So that one, again gets
∴
𝑎 + 𝑎2 + ⋯ + 𝑎𝑘 an equality
𝑘+2
≥ … … … (4)
𝑘
Sol.: The conditions of the problem imply that
Hence, the statement (4) is true for n = k+1
𝑆 = 𝑥1 + ⋯ + 𝑥𝑚 = 𝑦1 + ⋯ + 𝑦𝑛 is at least 2
and by the principle of mathematical
(since 𝑚 ≤ 𝑠, 𝑛 ≤ 𝑠, 𝑠 < 𝑚𝑛). If 𝑚 = 𝑛 =
induction, it is true for all natural numbers.
2, 2 ≤ 𝑆 ≤ 3, the assertion is easy to check.
13) Let 𝒂𝟏 , … , 𝒂𝒏 be positive integers s.t. 𝒂𝟏 ≤ We prove in the general case by induction on
⋯ ≤ 𝒂𝒏 . 𝑚 + 𝑛 = 𝑘, if 𝑘 ≥ 4. 𝐿𝑒𝑡 𝑥1 > 𝑦1 be the largest
numbers among 𝑥𝑖 𝑎𝑛𝑑 𝑦𝑖 respectively (1 ≤
𝟏 𝟏
Prove that 𝒂𝟏
+ ⋯ + 𝒂 = 𝟏 ⟹ 𝒂𝒏 < 𝟐𝒏 𝑖 ≤ 𝑚, 1 ≤ 𝑗 ≤ 𝑛). The case 𝑥𝑖 = 𝑦𝑖 is
𝒏
obvious. To apply the induction hypothesis to
Sol.: Suppose 𝑎𝑛 ≥ 2𝑛 ! By backward the equality (𝑥1 − 𝑦1 ) + 𝑥2 + ⋯ + 𝑥𝑚 = 𝑦2 +
induction, we prove that 𝑎𝑘 ≥ 2𝑘 ! 𝑓𝑜𝑟 𝑘 = ⋯ + 𝑦𝑛 𝑤𝑖𝑡ℎ 𝑘 − 1 = 𝑚 + 𝑛 − 1 on both
1, … . , 𝑛 sides, it is sufficient to check the inequality
𝑆 ′ = 𝑦2 + ⋯ + 𝑦𝑛 < 𝑚(𝑛 − 1). 𝑆𝑖𝑛𝑐𝑒, 𝑦1 >
Suppose that the assumption is proved for 𝑠 𝑠 (𝑛−1)
, 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑆 ′ < 𝑆 − = 𝑚𝑛 =
𝑘 = 𝑛, 𝑛 − 1, … . . , 𝑚 + 1. Then, 𝑛 𝑛 𝑛
𝑚(𝑛 − 1).
1 𝑚 1
≤ √
𝑎𝑚 𝑎1 … . . 𝑎𝑚
NUMBER THEORY
1 1
≤ 𝑚√1 − − ⋯ −
𝑎1 𝑎𝑚 (Objective Type)
1) If the unit digit in 𝟒𝟓𝟗 × 𝟒𝟔 × 𝟐𝟖 × 𝟒𝟖𝟒 is

1 1 1
= 𝑚√1 − + ⋯+ ≤ 𝑚√ 2, then the digit in place of * is
𝑎𝑚+1 𝑎𝑛 𝑎1 … 𝑎𝑚 (a) 3; (b) 5; (c) 7; (d) none
𝑛
1 1 Sol.: (9 × 6 × 4) = 216. In order to obtain 2 at
≤ 𝑚√ ∑ 𝑖
≤ the unit place he must multiply 216 by 2 or 7.
2 ! 2𝑚!
𝑖=𝑚+1
∴ of the given numbers, we have 7.
187
2) If the unit’s digit in (𝟑𝟏𝟐𝟕)𝟏𝟕𝟑 is (6) The last two digits in 𝟏𝟗𝟏𝟗𝟗𝟏 is
(a) 1; (b) 3; (c) 7; (d) none (a) 17; (b)18; (c) 19; (d) none
Sol.: Unit digit is (3127)173 = unit digit in 7173. Sol.:

Now, 74 gives unit ……digit 1.
Because 1910 = 1 (𝑎𝑛𝑑 100), 191991 =
∴ 173 = (74 )43 × 71 . Thus 7173 gives unit (1910 )199 . 19 = 1.19 (𝑚𝑜𝑑 100). The last two
digit 7. digit number is 19.
3) 𝟒𝟔𝟏 + 𝟒𝟔𝟐 + 𝟒𝟔𝟑 + 𝟒𝟔𝟒 is divisible by (7) The sum 𝟏𝟏𝟗𝟗𝟗 + 𝟐𝟏𝟗𝟗𝟗 + ⋯ + 𝟐𝟎𝟎𝟎𝟏𝟗 is
(a) 3; (b) 10; (c) 11; (d) none multiple of
(a) 1998; (b) 1999; (c) 2000; (d)
Sol.: 461 (1 + 4 + 42 + 43 ) = 461 × 85 = none
460 × 340 which is clearly divisible by 10.
Sol.:
4) A number when divided successively by 4
and 5 leaves remainders 1 and 4 Because ∑2000
1001 𝑖
1999
= ∑1000
1 (𝑗 +
1999 1000
respectively. When it is successively 1000) = ∑1 (𝑗 − 1001)1999 =
divided by 5 and 4, then the respectively ∑1000
1 (−𝑘)1999
remainder will be
(a) 2, 3; (b) 3, 2; (c) 4, 1; (d) none =
∑1000
1 (𝑖)1999 (𝑚𝑜𝑑 2001), it follows that
Sol.:
2000 1000 2000
1999 1999
∴ y = (5 × 1 + 4) = 9 ∑𝑖 = ∑𝑖 + ∑ 𝑖 1999
1 1 1
∴x = (4x+1)=4 × 9+1= 37 1000 1000
= ∑ 𝑖 + ∑ (−𝑖)1999
Now, 37 when divided successively by 1 1
5 and 4. = 0 (𝑚𝑜𝑑 2001)
∴ Respectively remainders (2, 3) (8) January 1, 2000, falls on a Saturday, the

day of the week will January 1, 2020 is
5) When the sum 𝟏𝟓 + 𝟐𝟓 + 𝟑𝟓 + ⋯ + 𝟗𝟗𝟓 + (a) Sunday; (b) Wednesday; (c)
𝟏𝟎𝟎𝟓 is divided by 4, then remainder is Friday; (d) none
(a) 1; (b) 2; (c) 3; (d)none
Sol.: Because there are 20 years in the
Sol.: We see that the unit of 5th power of any range 2000-2019 of which five are
no. is the unit digit of the same no…………. So, leap years, January 1, 2020, falls on
the sum of the unit digit of 5th powers of day 20+5≡ 4 (mod 7) i.e. Wednesday.
numbers from 1 to 100 = (0 + 1 + 2 + ⋯ +
9) × 10 = 450 (9) The number Zeros at the end, if 100! Is
fully expanded and written out is
The remaining parts of the given sum will be (a) 23; (b) 24; (c) 25; (d) none
divisible by 4. Now, if we divide 450 by 4,
then the quotient is 112 and the remainder is Sol.: Highest power of 2 in 100! is 97.
2, which is the required remainder. Similarly power of 5 in 100! is 24.
188
Each pair of 5 and 2 will give rise to a 10 or a 13 + 23 + 33 = 36

zero at the end. Hence the number of zero in 23 + 33 + 43 = 36} All these numbers are
100! is equal to 24. 33 + 43 + 53 = 36
divisible by 9.
(10) If n is positive odd integer., then 𝒏𝟑 − 𝒏
𝒏 is divisible by (13) 𝟐𝟐 + 𝟏 where n is a positive integer
(a) 15; (b) 20; (c) 24; (d) none greater than one ends in
(a) 5; (b) 7; (c) 9; (d) none
Sol.: 𝑛3 − 𝑛 = (𝑛 − 1)𝑛(𝑛 + 1)= product of 𝑛 𝑛
three consecutive positive intergers and is Sol.: For 22 + 1 𝑓𝑜𝑟 𝑛 > 1, 22 + 1 = 24 +
divisible by 3!= 6. 1 = 17 𝑓𝑜𝑟 𝑛 = 2
𝑛 𝑛
Also (𝑛 − 1)𝑎𝑛𝑑 (𝑛 + 1) are consecutive even 22 + 1 = 28 + 1 = 257 𝑓𝑜𝑟 𝑛 = 3 , 22 + 1 =
integers and their product is divisible by 4. 216 + 1 = 56537 𝑓𝑜𝑟 𝑛 = 4 and so, on we
observe that it ends with 7.
Hence 𝑛3 − 𝑛 is divisible by 6 × 4 = 24 if n is
positive odd. (14) When 𝟐𝒏 − 𝟏 is a prime, then the sum
of the reciprocals of all the divisors of the
(11) Sum of all the divisors of 360 number 𝟐𝒏 (𝟐𝒏 − 𝟏) is
excluding 1 and itself is (a)
𝟏
; (b)
𝟏
;
𝟏
(c) ; (d) none
(a) 1170; (b) 924; (c) 809; (d) 723 𝟐𝒏 𝟐𝒏+𝟏 𝟐
Sol.: Sum of all reciprocals of all the divisors

Sol.: 𝑁 = 360 = 23 × 32 × 51 =
of the number 2𝑛 (2𝑛 − 1). Sum of all divisors
𝑃1 𝛼1 . 𝑃2 𝛼2 . 𝑃3 𝛼3
including
The sum of all the distinct positive integral
1 𝑎𝑛𝑑 𝑖𝑡𝑠𝑒𝑙𝑓 2𝑛−1 (2𝑛 − 1)
divisor of 360 =
2𝑛−1 . (2𝑛 − 1)
𝑃1 𝛼1 +1 − 1 𝑃2 𝛼2 +1 − 1 𝑃3 𝛼3 +1 − 1 2𝑛 (2𝑛 − 1)
=( )( )( ) = 𝑛−1 𝑛 =2
𝑃1 − 1 𝑃2 − 1 𝑃3 − 1 2 . (2 − 1)
24 − 1 33 − 1 52 − 1 15 26 24
= . . = . .
2−1 3−1 5−1 1 2 4 (Subjective Type)
= 1170
𝟏𝟑
This includes 1 and the number 360. Thus 1) Prove that 𝟐𝟕𝟎 + 𝟑𝟕𝟎
sum of all the divisors of 360 excluding 1 and
Sol.: Observe that 270 + 370 = 435 + 935 , and
itself is 1170 − 361 = 809.
that 35 is odd. Now 𝑎𝑛 + 𝑏 𝑛 is divisible by
(12) The sum of all cubes of three 𝑎 + 𝑏 when n is odd.
consecutive integers is divisible by
From this is follows that 435 + 935 is divisible
(a) 9; (b) 12; (c) 18; (d) none
by 13.
Sol.: Try by trial method
2) Find the number of positive integer n less
𝟔
than 1991 for which 𝒏𝟐 + 𝟑𝒏 + 𝟐.
189
Sol. Note that 𝑛2 + 3𝑛 + 2 = (𝑛 + 1)(𝑛 + 2) So 𝑎 − 𝑐 𝑎𝑛𝑑 𝑏 − 𝑐 are a pair of

and that 6 = 2 × 3. So if 6 is to be a divisor of complementary factors of 𝑐 2 . Suppose that
𝑛2 + 3𝑛 + 2, then either (a) 6 is divisor of 𝑛 + 𝑎 − 𝑐 𝑎𝑛𝑑 𝑏 − 𝑐 share a prime factor P.
1; or (b) 6 is a divisor of 𝑛 + 2; or (c) 3 is a
divisor of 𝑛 + 1, and 2 is a divisor of 𝑛 + 2; or Then 𝑝2 is a divisor of 𝑐 2 , so p is a divisor of c.
(d) 2 is a divisor of 𝑛 + 1 and 3 is a divisor of This means that P is a divisors of a and b as
𝑛 + 2. well which cannot happen as a and b are
coprime.
Possibility (a) holds for n = 5, 11, 17, ………….
, 1991, or 332 values in all. Possibility (b) Since the product of the coprime numbers
holds for n = 4, 10, 16, ….. , 1990 another 332 𝑎 − 𝑐 𝑎𝑛𝑑 𝑏 − 𝑐 is a square, each of them is a
𝑐2
values. Possibility (c) holds for n = 2, 8, 14, squares. Let 𝑎 − 𝑐 = 𝑢2 , 𝑏 − 𝑐 = 𝑢2 , where u
…… , 1998, another 332 values, and is a divisors of c. This leads to 𝑎 + 𝑏 = 𝑐 +
possibility (d) holds for n = 1, 7, 13, ….. , 𝑐2 𝑐2 𝑐 2
𝑢2 + 𝑐 + 𝑢2 = 𝑢2 + 2𝑐 + 𝑢2 = (𝑢 + 𝑢) , and
1987, yet another 332 values. So there are
4 × 332 = 1328 values of n between 1 and so a+ b is a square.
1991 for which 𝑛2 + 3𝑛 + 2 is divisible by 6.
5) Find the number of pairs (x, y) of integers
3) Prove that the positive integers that have for which 𝟐𝒙𝒚 − 𝟓𝒙 + 𝒚 = 𝟓𝟓.
an odd number of divisors are the squares.
Sol.: We need to find all pairs (x, y) of integers
Sol.: We know this by exhibiting a pairing such that 2𝑥𝑦 − 5𝑥 + 𝑦 = 55. Write the
between the divisors of an integer. Let n be a equation as 𝑦(2𝑥 + 1) = 5𝑥 + 55, 𝑜𝑟 𝑦 =
5𝑥+55
given positive integer and let d be any 2𝑥+1
. From this equation it follows that 2𝑥 +
divisors of n. Then 𝑛/𝑑 is an integer, and it is 1 is a divisor of 5𝑥 + 55. Since 5x +55=
also a divisors of n because 𝑛 = (𝑑 × 𝑛/𝑑). If 2(2𝑥 + 1) + (𝑥 + 53), it further follows that
n is not a square, then each divisors acquires 2𝑥 + 1 is a divisor of x +53 and therefore
one and precisely one mate The divisors now also of 2(x+53) = 2x +106. Since 2x +106=
get grouped into pairs, and this tell us that the (2𝑥 + 1) + 105, this means that 2x +1 is a
number of divisor is even (for it is twice the divisors of 105.
number of pairs.)
Next, since 105 = 3 × 5 × 7, the divisors of
4) Given that a, b, c are positive integers with 105 are ±1, ±3, ±5, ±7, ±15, ±35, 𝑎𝑛𝑑 ± 105.
𝟏 𝟏 𝟏
no common factor and such that 𝒂 + 𝒃 = 𝒄, Since 2x +1 may assume any of these values,
then prove that (a+ b) is a square. the possible values of x are
0, −1, 1, −2, 2, −3, 3, −4, 7, −8, 10, −11, 17, −18, 52 𝑎𝑛𝑑 −
Sol.: This is clearly to be analyzed along the 53. The values of y are readily found from the
same links as problem 7, but it is an trickier relation 𝑦 =
(5𝑥+55)
and we obtain the
1 1 1 (2𝑥+1)
one. From the relation 𝑎 +𝑏 = . We obtain
𝑐 following pairs (x, y), that solve the given
𝑐(𝑎 + 𝑏) = 𝑎𝑏 𝑜𝑟 𝑎𝑏 − 𝑐(𝑎 + 𝑏) = 0. equation
Adding 𝑐 2 to both sides and factorizing we get (−53, 2), (−18, 1), (−11, 0), (−8, −1), (−4, −5),
(𝑎 − 𝑐)(𝑏 − 𝑐) = 𝑐 2 .
(−3, −8), (−2, −15), (−1, −50), (0, 55),
190
(1, 20), (2, 13), showing that √2 is not rational), that 𝜙 is not
rational; that is, it does not equal the ratio of
(3, 10), (7, 6), (10, 5), (17, 4)𝑎𝑛𝑑 (52, 3)
two non-zero integers. This has the following
𝑜𝑟 sixteen pairs in all. implication. If c and d are integers such that
c𝜙 +d = 0, then c and are both 0. For if c𝜙 +d
6) N is a 50 digit number (in base -10). All 𝑑
= 0 and c ≠ 0 then we have 𝜙 = − 𝑐 , a
digits except the 26th (from the left) are 1.
rationed number. Since this can’t be, we must
Given that N is divisible by 13, find its 26th
have c = 0; but this forces d to be 0 too.
digit.
By definition, substituting 0 for x in 𝑥 2 − 𝑥 −
Sol.: Let x be the 26th digit of N. In base −10.
1 yields 0, Since 𝑎𝑥 17 + 𝑏𝑥 16 + 1 is a multiple
N= of 𝑥 2 − 𝑥 + 1, substituting 𝜙 for x in 𝑎𝑥 17 +
11111111 … … 1111 𝑥 ⏟
⏟ 11111111 … … 1111 𝑏𝑥 16 + 1 must yield 0; that is 𝑎 𝜙17 + 𝑏𝜙16 +
25 𝑜𝑛𝑒𝑠 24 𝑜𝑛𝑒𝑠 1 = 0. Since the result of substituting 𝜙 in
𝑥 2 − 𝑥 − 1yields 0, we must have 𝜙 2 = 𝜙 +
We now apply the ‘alternating 3-digit sum’
1. This relation allows us to express all
testing divisibility by 13. Recalling that the
powers of 𝜙 in the form c𝜙 +d where c and d
sum has to be computed starting from the
are integers. For example, 𝜙 3 = 𝜙 + 𝜙 2 =
right. We computer the All sum as 𝐴 + ̅11 ̅̅̅𝑥 −
𝜙 × (𝜙 + 1) = 𝜙 2 + 𝜙 = 2𝜙 + 1, the
𝐵 + 11, where
relation, 𝜙 = 𝜙+ I being used repeatedly.
𝐴= ⏟
111 − 111 + ⋯ − 111 𝐵 Similarly, 𝜙 4 = 𝜙 × 𝜙 3 = 𝜙 × (2𝜙 + 1) =
8 𝑏𝑙𝑜𝑐𝑘𝑠 2𝜙 2 + 𝜙 = 3𝜙 + 2. In general, if we have
= ⏟
111 − 111 + ⋯ + 111 expressed 𝜙 𝑛−1 in the form c𝜙+d, then, we
7 𝑏𝑙𝑜𝑐𝑘𝑠
have 𝜙 𝑛 = 𝜙 × 𝜙 𝑛−1 = 𝜙 × (𝑐𝜙 + 𝑑) =
Clearly A = 0 and B = 111. So, the All sum is 𝑐𝜙 2 + 𝑑𝜙 = 𝑐(𝜙 + 1) + 𝑑𝜙 = (𝑐 + 𝑑)𝜙 + 𝑐
̅̅̅̅𝑥 − 100 𝑜𝑟 1̅𝑥, which obviously is divisible
11
by 13 only for x = 3. Since we have already expressed 𝜙 4 in the
stated form, We may now do the same for any
Hence, the 26th digit of N is 3. higher power of 𝜙 . We display below some of
the results of these computations,
7) Find integers a, b such that 𝒙𝟐 − 𝒙 − 𝟏 is a
divisor of the polynomial 𝒂𝒙𝟏𝟕 + 𝒃𝒙𝟏𝟔 + 𝟏 𝜙 5 = 50 + 3, 𝜙 6 = 8𝜙 + 5,
Sol.: This is a difficult problem, and its 𝜙 7 = 1.3𝜙 + 8, 𝜙 8 = 21𝜙 +

solution should be studied with great care. A 13, … ….
few new ideas are used in the analysis, which
were not discussed in the earlier chapters. … … … … .. 𝜙15 = 610𝜙 + 377,
Consider the equation 𝑥 2 − 𝑥 − 1 = 0. It has 𝜙16 = 987𝜙 + 610, 𝜙17 =

two solutions of which one is the number 𝜙 1597𝜙 + 987,
√5+1
(the ‘golden ratio’) given by 𝜙 = 2
= As already noted that if c and d are integers,
1.6180339 …………. It can be shown (by such that c𝜙 +d = 0, then we have c = 0 and d
arguments similar to those used earlier, in = 0. Since a and b are integers, so are
191
1597𝑎 + 987𝑏 𝑎𝑛𝑑 987𝑎 + 610𝑏 + neither 22 3 = 12 𝑛𝑜𝑟 32 2 = 12 is the form

1 𝑎𝑛𝑑 𝑡ℎ𝑢𝑠 𝑤𝑒 𝑑𝑒𝑑𝑢𝑐𝑒 𝑡ℎ𝑎𝑡 𝑃2 + 11 for any time P.
1597𝑎 + 987𝑏 = 0, 987𝑎 + 610𝑏 =

−1
9) Find the positive integer n for which the
This is a pair of simultaneously equations in a following holds if its divisors are listed in
and b, and it is easily solved (by the usual increasing order as
elimination technique) we obtain a = 987, b 𝒅𝟏 , 𝒅𝟐 , 𝒅𝟑 , … , 𝒘𝒊𝒕𝒉 𝒅𝟏 = 𝟏 𝒕𝒉𝒆𝒏 𝒏 =
= -1597. We thus obtain the required answer 𝒅𝟏𝟑 + 𝒅𝟏𝟒 + 𝒅𝟏𝟓 𝒂𝒏𝒅 (𝒅𝟓 + 𝟏)𝟑 = 𝒅𝟏𝟓 +
and we see that there is just one pair of 𝟏
integers (a, b) such that 𝑥 2 − 𝑥 − 1 is a
divisors of 𝑎𝑥 17 + 𝑏𝑥 16 + 1; namely (a, b) = Sol.: An impossible problem? Not quite; Let
𝑛 𝑛 𝑛
(987, -1597). 𝑎= ,𝑏 = 𝑎𝑛𝑑 𝑐 = . Then since 𝑑13 +
𝑑13 𝑑14 𝑑15
𝑑14 + 𝑑15 = 𝑛 𝑎𝑛𝑑 𝑑13 < 𝑑14 < 𝑑15 , we
8) Find all prime numbers P such that the 1 1 1
deduce that 𝑎 > 𝑏 > 𝑐, 𝑎𝑛𝑑 𝑎 + 𝑏 + 𝑐 = 1.
number 𝑷𝟐 + 𝟏𝟏 has exactly 6 divisors.
Sol.: We first note that the choice p =2 does In this equation we must have 𝑐 > 1. (𝐼𝑓 𝑐 =
not work as 22 + 11 = 15 = 3 × 5 has 4 and 1, 𝑡ℎ𝑒 𝑙𝑒𝑓𝑡 𝑠𝑖𝑑𝑒 𝑤𝑜𝑢𝑙𝑑 𝑒𝑥𝑐𝑒𝑒𝑑1. ) If 𝑐 ≥ 3,
1 1 1 1 1 1
not 6 divisors. So P must be an odd prime, then a>b>3, and 𝑎 + 𝑏 + 𝑐 < 3 + 3 + 3 = 1;
implying that 𝑃2 + 11 is even and therefore the above equation could never hold good so
contains the prime 2 as a factor. we must have c>3, which implies that c = 2
1 1 1
We know now use the formula for d(n), the and therefore that a>b>2 and + = Next,
𝑏 2 𝑎
1 1
divisor function. Since 6 = 3 × 2, there are suppose that 𝑏 ≥ 4. Then a >4 and 𝑎 + 𝑏 <
precisely two categories of number with 6 1 1 1 1 1 1
+ 4 = 2; the equation 𝑎 + 𝑏 = 2 could never
divisors, those of the kind 𝑞 5 (with q prime) 4
hold good so, b<4, which means that b= 3.
and those of the kind 𝑞 2 𝑟(with q, r unequal 1 1 1
primes). So, if 𝑃2 + 11 has 6 divisors, then Since + = . We get a = 6. So the values of
𝑎 𝑏 2
𝑃2 + 11 = 𝑞 5 𝑜𝑟 𝑞 2 𝑟 where q, r are primes, q a, b, c are now all known using these values
𝑛 𝑛 𝑛
≠ r. The 1st case is quickly ruled out, our we see that 𝑑13 = 6 , 𝑑14 = 3 𝑎𝑛𝑑 𝑑15 = 2 .
earlier observation tells us that q = 2, but this Three deductions now follows:
does not work, as there is no prime P with
2 3
𝑃2 + 11 = 25 . (a) n is divisible by 6, so , ;
𝑛 𝑛
Now we shall consider 𝑃2 + 11 = 𝑞 2 𝑟. (b) as n cannot have a proper divisor

𝑛
Observe that P = 3 works; for 32 + 11 = 20 = greater than 2 (this is true for any n),
22 × 5, which has 6 divisors. We need to only there can be only divisor after 𝑑15 ,
consider the case when P>3. Since P is prime, namely n itself; implying that n has
it is indivisible by 3, so p ≡±1, which means exactly 16 divisors, with 𝑑16 = 𝑛;
𝑛
that 𝑝2 ≡ 1 (𝑚𝑜𝑑 3) and therefore that 𝑃2 + (c) 2 + 1 is a cube (its cube root is 𝑑5 + 1)
11 ≡ 0 (𝑚𝑜𝑑 3) so, 3 is a divisor of 𝑃2 + 11.
This means that q, r are 2, 3 in some order. Next, suppose that 5 is a divisor of n. Then,
However, neither possibility works; for depending upon whether n is divisible by 4 or
192
not, the first five divisors of n are either1, 2, 3, where p is a prime number greater than 5.
4, 5 or 1, 2, 3, 5, 6. So either 𝑑5 = 5 𝑜𝑟 𝑑5 = 6. Each of these cases must now be considered.
𝑛
The first possibility leads to 2 + 1 = In each case, the first four divisors of n are 1,
(5 + 1)3 = 216 𝑜𝑟 𝑛 = 430. while the second 2, 3, 6. We quickly ascertain that p = 7 does
𝑛 not yield a solution because none of the
leasts to 2 + 1 = (6 + 1)3 = 343 𝑜𝑟 𝑛 = 684.
numbers 12 × 7 + 1 = 85, 27 × 7 + 1 =
But 430 is not divisible by 6 (whearas, it is
6
190, 3 × 73 + 1 = 1030 is a cube. Therefore,
already know that 𝑛) and 684 is not divisible p> 7, which in facts means that 𝑝 ≥ 11. If n =
by 5. This contradictory state of affairs tells 24p then the next divisor after 6 is 𝑑5 = 8,
𝑛
us that n does not have 5 as a prime factor. yielding 2 + 1 = (8 + 1)3 = 729, 𝑜𝑟 𝑛 =
Since 16 has following five factorization; 16 1456, but this cannot be, as 24 is not even a
=8 × 2 = 4 × 4 = 4 × 2 × 2 = 2 × 2 × 2 × 2, divisor of 1456.
there are five classes of numbers with 16
divisors; those of the kinds 𝑝15 , 𝑝7 × 𝑞, 𝑝3 × If n = 54p then the next divisor after 6 is
𝑛
𝑞 3 , 𝑝3 × 𝑞 × 𝑟 𝑎𝑛𝑑 𝑝 × 𝑞 × 𝑟 × 𝑠 where p, q, r, 𝑑5 9, 𝑦𝑒𝑖𝑙𝑑𝑖𝑛𝑔 + 1 = (9 + 1)3 =
2
s are distinct primes, each greater than 5. We 1000, 𝑜𝑟 𝑛 = 1998 = 54 × 37. Therefore p =
shall now consider each of these cases in turn. 37. Does this fit the given condition the 16
divisors of 1998 are 1, 2, 3, 6, 9, 18, 27, 37, 54,
We already know that n is divisible by the
74, 111, 222, 333, 666, 999 and 1998,
primes 2 and 3, so the possibility n = 𝑝15 is
therefore 𝑑5 = 9, 𝑑13 = 333, 𝑑14 = 999. The
ruled out.
conditions do indeed hold good!
If 𝑛 = 𝑝7 × 𝑞. then we must have 𝑛 = 27 ×
Finally, of 𝑛 = 6𝑝3 , 𝑤𝑖𝑡ℎ 𝑝 ≥ 11, 𝑡ℎ𝑒𝑛 𝑑5 = 𝑝.
3 = 384 𝑜𝑟 𝑛 = 37 × 2 = 4374; 𝑤ℎ𝑖𝑙𝑒 𝑖𝑓 𝑛 =
So we obtain the equation 3𝑝3 +
𝑝3 × 𝑞 3 , 𝑡ℎ𝑒𝑛 𝑤𝑒 𝑚𝑢𝑠𝑡 ℎ𝑎𝑣𝑒 𝑛 = 23 × 33 =
𝑛 1(𝑝 + 1)3 , 𝑜𝑟 3𝑝3 = 𝑝3 + 3𝑝2 + 3𝑝. This
216. In one of these three cases is 2 + 1 a 3
implies that , an absurdity. So there is no
cube. So, this possibility too is ruled out. 𝑝
solution to be found here.
If 𝑝 × 𝑞 × 𝑟 × 𝑠, then, as earlier, 2, 3 ∊ {p, q, r,
s}. So, n is of the form 6pq where p, q are Thus there is just one number which fits the
distinct primes, say with 5 < 𝑝𝑞. The 16 given conditions: 𝑛 = 1998 = 2 × 33 × 37.
divisors of n are in this case 1, 2, 3, 6,
10) Let n be the positive integer with at least
𝑝(= 𝑑5 ), … , 𝑝𝑞(= 𝑑13 ), 2𝑝𝑞(𝑑14 , 3𝑝𝑞 =
𝑛 4 divisors and let its divisors is be
𝑑15 ), 6𝑝𝑞. The relation 2 + 1 = (𝑑5 + 1)3 𝒅𝟏 , 𝒅𝟐 , 𝒅𝟑 , 𝒅𝟒 , … ., where 𝒅𝟏 < 𝒅𝟐 < 𝒅𝟑 <
reduces to 3𝑝𝑞 + 1 = (𝑝 + 𝒅𝟒 < ⋯ , 𝑤𝑖𝑡ℎ 𝒅𝟏 = 𝟏. find all possible
1)3 , 𝑤ℎ𝑖𝑐ℎ 𝑦𝑒𝑖𝑙𝑑𝑠 3𝑝 = 𝑝2 + 3𝑝 + 3. Since 3 values of n it is known that n = 𝒅𝟏 𝟐 +
is a divisor of each of the quantities 3q, 3p 𝒅𝟐 𝟐 + 𝒅𝟑 𝟐 + 𝒅𝟒 𝟐
3
and 3, we must have 𝑝2 , which is absurd as p
Sol.: Obviously 𝑑1 = 1. If n were odd, then all
is a prime number greater than 5. So this
its divisors would be old and 1+𝑑2 2 + 𝑑3 2 +
possibilities is also ruled out.
𝑑4 2 would be a sum of four old numbers,
If 𝑛 = 𝑝3 × 𝑞 × 𝑟, 𝑡ℎ𝑒𝑛 2, 3 ∈ {𝑝, 𝑞, 𝑟}, so n is therefore even; a contradiction. So n is even,
one of the following forms: 24𝑝, 54𝑝, 6𝑝3 , which means that 𝑑2 = 2. Let 𝑑3 𝑎𝑛𝑑 𝑑4 be
193
denoted by a and b, for the case of writing; 1 1 𝑝 1 1 𝑝

that 1 + 𝑝−1 = 𝑝−1 , 2 + 𝑝−2 = 2(𝑝−2), and
𝑎 𝑏
then 𝑛 = 5 + 𝑎2 + 𝑏 2 , 𝑤𝑖𝑡ℎ , , 2 < 𝑎 < 𝑏. more generally, for any i(1 < 𝑖 ≤ 𝑝 − 1)
𝑛 𝑛
Suppose that a is even. Then 𝑎 = 22 = 4 (the 1 1 𝑝 1 1

+ 𝑝−𝑖 = 𝑖(𝑝−𝑖) so the sum 1 + 2 + ⋯ + (𝑝−1)
1
𝑖
only possibility) so 𝑛 = 21 + 𝑏 2 and since b 𝑝 𝑝
must be old, it is the least odd prime divisor may be written in the from + +
𝑝−1 2(𝑝−2)
2𝑏 2𝑏 𝑏 𝑝 (𝑝−1)
of n. Since 𝑛
it follows that 21 + 𝑏 2 , 𝑠𝑜 21 and 3(𝑝−3)
… … . , 𝑤𝑖𝑡ℎ 2 fractions in all, each
therefore b = 3 or 7, which means that n = 30 with a numerator p. The 1cm of the
or 70. It may be checked however that neither denominators of these fraction is not divisible
30 nor 70 fits given conditions. by p, as the numbers 𝑝 − 1, 2(𝑝 − 2), 3(𝑝 −
3), …., are not divisible by p(each is a product
So a is odd, and therefore is even, can be 4?
of number less than p, therefore not divisible
Then it can only be the case that a = 3 and by p). So the p in the numerator remains-it
𝑛 = 5 + 32 + 42 = 30. But 30 does not fit the does not get cancelled away with anything in
conditions so b > 4, and since b is first even the denominator. It follows that the
divisors of after 2, it must happen that b = 2a. numerator of sum contains a factor of p. In
So, 𝑛 = 5 + 𝑎2 + (2𝑎)2 𝑜𝑟 𝑛 = 5 + (1 + 𝑎2 ). other words, 𝐴𝑝 is divisible by p. In fact, for
𝑎 𝑎
Since 𝑛 we must have 5 + (1 + 𝑎2 ). Since a primes p greater than 3, 𝐴𝑝 is divisible not
just by p but by 𝑝2 ; but this is lot harder to
and 1+𝑎2 have no factors in common, we
𝑎 prove and we shall not attempt it here. The
conclude that 5 ∴ a = 5, forcing 𝑛 = 5 × 26 =
reader should refer to the text by Hardy and
130. And this does fit the given conditions: wright for a proof.
The first four divisors of 130 are 1, 2, 5, 10
𝟏 𝟏 𝟏 𝟏
and indeed 130 = 12 + 22 + 52 + 102 . So 12) If the sum 𝟏 + + + ⋯ + + be
𝟐 𝟑 𝟗𝟗 𝟏𝟎𝟎
there is precisely one number which satisfies 𝑨
computed and written as . Where A and
the given conditions. 𝑩
B are positive integer with no common
11) Let p > 2 be a prime suppose, the sum 𝟏 + factors. Show that neither A nor B is
𝟏 𝟏 𝟏 𝑨𝒑
+ + ⋯+ be denoted by where divisible by 5.
𝟐 𝟑 𝒑−𝟏 𝑩𝒑
Ap and Bp are co-prime positive integers. Sol.: We start by grouping the denominators
For example, when p = 5, we get the sum 1, 2, …, 100 into different, subsets depending
𝟐𝟓
𝟏𝟐
, 𝒔𝒐 𝑨𝟓 = 𝟐𝟓, 𝑩𝟓 = 𝟏𝟐 𝒂𝒏𝒅 𝒘𝒉𝒆𝒏 𝒑 = upon their divisibility by 5. Specifically for k
𝟑𝟖𝟏 𝟕 = 0, 1 and 2, let 𝑆𝑘 be the set of numbers n
𝟏𝟏 we get the sum 𝟐𝟓𝟐𝟎 , 𝒔𝒐 𝑨𝟏𝟏 =
between 1 and 100 (both inclusive) for which
𝟕𝟑𝟖𝟏, 𝑩𝟏𝟏 = power (5, n)= k. That is, so has all the non-
𝟓 𝟏𝟏
𝟐𝟓𝟐𝟎 𝒐𝒃𝒔𝒆𝒓𝒗𝒆 𝒕𝒉𝒂𝒕 𝑨 𝒂𝒏𝒅 𝑨 . Show multiple of 5, 𝑆1 has the multiples of 5 which
𝟓 𝟏𝟏
𝑷
that 𝑨 is always hold. are not multiplies of 25, and 𝑆2 has the
𝒑 multiplies of 25:
Sol.: Since 𝑃 − 1 is an even number, we pay 𝑆0 =
pair the numbers 1, 2, 3, …, P -1 thus; {1, 2, 3, 4, 5, 6, 7, 8, … , 97, 98, 99}
{1, 𝑝 − 1}, {2, 𝑝 − 2} … … ., the sum of the 𝑆1
numbers in each pair being P. Now observe = {5, 10, 15, 20, 30, … , 85, 90, 95}
194
𝑆2 = {25, 50, 75, 100} 100! 1 1 1 1

[( + + + ) + ⋯
5 1 2 3 4
Next, let 𝐴𝑘 for k = 0, 1, 2 be defined thus: 1 1 1 1
+( + + + )]
16 17 18 19
1 1 1 1
𝐴0 = 100! (1! + + + +
2 3 4 6 The dots represent two more bracketed
1 expressions (there are four such expression
+ ⋯ + ).
99 in all). Each bracketed expression on the right
1 1 1 1
𝐴1 = 100! ( + + + yields a fraction with a numerator which is a
5 10 15 20
multiple of 25. So it follows that, power (5,
1 1
+ + ⋯ + ). 𝐴1 ) ≥ 24 − 1 + 2 = 25. When the same
30 95
1 1 1 1 argument is applied to the defining
𝐴2 = 100! ( + + + ) expression for 𝐴0 , it yields the following sum:
25 50 75 100
(The bracketed expressions on the right are, 1 1 1 1

100! [( + + + )
respectively the sums of the reciprocals of the 1 2 3 4
1 1 1 1
of the numbers in 𝑠0 , 𝑠1 and 𝑠2) obviously, +( + + + )]
𝐴0 , 𝐴1 , 𝐴2 are integers (multiplication by 100! 96 97 98 99
𝐴 𝐴0 +𝐴1 +𝐴2
“clears the function”) and 𝐵 = 100!
. And as each bracketed expression on the
right yields a fraction with denominator
100! 1 1 1
Now observe that 𝐴2 = (1 + + + )− invisible by 5 and a numerator which is a
25 2 3 4
2𝑝 implying that power (5, 𝐴2 )= power (5, multiple of 25, we have power (5, 𝐴0 ) ≥ 24 +
100 100 2 = 26. Summarizing our finding, we have
100!) since power (5, 100!) = [ ] + [ 25 ] =
5 power (5, 𝐴0 ) ≥ 26,
20 + 4 = 24, we deduce that power (5, 𝐴2 ) =
24. 𝑃𝑜𝑤𝑒𝑟 (5, 𝐴1 ) =≥ 25,
Next, let us consider 𝐴1 . We shall make 𝑃𝑜𝑤𝑒𝑟 (5, 𝐴2 ) ≥ 24

repeated use of the following readily-verified
From which it follows that power
identity
(5, 𝐴0 + 𝐴1 + 𝐴2 ) = 24.
1 1 1
+ + Finally using the fact that power (5, 100!) =
5𝑛 + 1 5𝑛 + 2 5𝑛 + 3 𝐴
1 24, we deduce that in the fraction 𝐵 =
+
5𝑛 + 4 𝐴0 +𝐴1 +𝐴2
the numerator and denominator are
50(2𝑛 + 1)(5𝑛2 + 5𝑛 + 1) 100!
= divisible by the same power of 5. This means
(5𝑛 + 1)(5𝑛 + 2)(5𝑛 + 3)(5𝑛 + 4)
that when common factors are cancelled
Observe that the denominator on the right is away, 5 is not present as a factor in either the
indivisible by 5, as is the quantity 5𝑛2 + 5𝑛 + numerator or denominator; that is both A and
𝑎
1. So, if the sum on the left is written as 𝑏 B are indivisible by 5.
where a, b are coprime, then b is indivisible 13) Show that if the positive integer n is such
by 5, and power (5, a) is at least 2(by virtue that 2n +1 and 3n +1 are both squares,
of the factor of 50). Now rewrite the 𝟒𝟎
then .
expression for 𝐴1 as 𝒏
195
Sol.: Let 2𝑥 + 1 = 𝑥 2 𝑎𝑛𝑑 3𝑥 + 1 = 𝑦 2 where 14) Let T be the set of all triplets (a, b, c) of
x and y are n for which these equations holds integers such that 𝟏 ≤ 𝒂 ≤ 𝒃 ≤ 𝒄 ≤ 𝟔. For
are shown in the following table: each triplet (a, b, c) in T, take the number
a× 𝒃 × 𝒄 and odd all these nmubers
x 1 9 89 881 corresponding to all the triplets in T. Show
y 1 11 109 1079 …….. that this sum is divisible by 7.
n 0 40 3960 388080……… Sol.: If (a, b, c) is a valid triplet then (7 −

𝑐, 7 − 𝑏, 7 − 𝑎) is also a valid triple as 1 ≤
This table is full of tantalizing patterns! (7 − 𝑐) ≤ (7 − 𝑏) ≤ (7 − 𝑎) ≤ 6. Note
(7 − 𝑏) ≠ 𝑏 etc.
We need to so that n is a multiple of 40. Since
(𝑥 2 −1) Let S = ∑1≤𝑎≤𝑏≤𝑐≤6(𝑎, 𝑏, 𝑐) then by the above
𝑛= 2
, this is the same as showing that
𝑥 2 − 1 is a multiple of 80. So , it suffices to
𝑆= ∑ (7 − 6)(7 − 𝑏)(7 − 𝑐)
show the following if x, y are integers such
1≤𝑎≤𝑏≤𝑐≤6
that 3𝑥 2 − 2𝑦 2 = 1, 𝑡ℎ𝑒𝑛 𝑥 2 − 1 (𝑚𝑜𝑑 80).
∴ 2𝑆 = ∑ [(𝑎, 𝑏, 𝑐)
To show this, it is enough to show that 𝑥 2 ≡
1≤𝑎≤𝑏≤𝑐≤6
5
1(𝑚𝑜𝑑 5)𝑎𝑛𝑑 𝑥 2 ≡ 1 (𝑚𝑜𝑑 16); 𝑓𝑜𝑟 𝑖𝑓 𝑥 2 − + (7 − 𝑎)(7 − 𝑏)(7
1 𝑎𝑛𝑑 𝑎𝑙𝑠𝑜
16
− 1 𝑡ℎ𝑒𝑛 𝑐𝑒𝑟𝑡𝑎𝑖𝑛𝑙𝑦
80
−1. − 𝑐)]
𝑥2 𝑥2
In the R. H. S. every term is divisible by 7. i.e.
First we note that x must be odd; for 3𝑥 2 = 7 7
1 + 2𝑦 2 , an odd number. Next, note that since 2𝑠
and hence, 𝑠 .
(±1) ≡ 1(𝑚𝑜𝑑 5)𝑎𝑛𝑑(±2) ≡ 4 mod, all
15) A sequences of numbers 𝒂𝒏 , 𝒏 − 𝟏, 𝟐, …. is
squares are congruent to 0, 1 or 4 (mod 5);
defined as follows: 𝒂𝟏 =
and since (±3)2 ≡ (±5)2 ≡ 9 (mod 16) all 𝟏
odd suppose that 𝑥 2 = 0 (mod 5); then 3𝑥 2 − 𝟐
𝒂𝒏𝒅 𝒇𝒐𝒓 𝒆𝒂𝒄𝒉 𝒏 ≥ 𝟐, 𝒂𝒏 =
𝟐𝒏−𝟑
1 ≡ 1, ( ) 𝒂𝒏−𝟏 𝒔𝒉𝒐𝒘 𝒕𝒉𝒂𝒕 ∑𝒏𝒌=𝟏 𝒂𝒌 <
𝟐𝒏
∴ 2𝑦 2 ≡ −1, 𝑠𝑜 𝑦 2 ≡ 2 (𝑚𝑜𝑑 5); but this is 1 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ≥ 1.

not possible. The possibility 𝑥 2 ≡ 4 (mod 5) 1
Sol.: Given: 𝑎1 = 2 𝑓𝑜𝑟 𝑛 ≥ 2
is ruled out similarly it leads to 𝑦 2 ≡ 3 (mod
5). Therefore, 𝑥 2 ≡ 1 (mod 5). Next, suppose 2𝑘 − 3
that 𝑥 2 ≡ 9 (mod 16); then 3𝑥 2 − 1 ≡ 10 𝑠𝑜, 𝑎𝑛 = 𝑎𝑘−1 𝑓𝑜𝑟 𝑘 ≥ 2.
2𝑘
(mod 16) therefore 2𝑦 2 ≡ 10, leading to 𝑦 2 ≡
5 (mod 16) or 𝑦 2 ≡ 13 (mod 16). But both 𝑜𝑟 2𝑘𝑎𝑘 = (2𝑘 − 3)𝑎𝑘−1
these are impossible! All odd squares are ⟹ 2𝑘𝑎𝑘
congruent to 1 or 9 (mod 16) − (2𝑘 − 3)𝑎𝑘−1 = 0
Therefore, 𝑥 2 ≡ 1 (mod 16) ⟹ 2𝑘𝑎𝑘 − 2(𝑘 − 1)𝑎𝑘−1 − 𝑎𝑘−1 = 0
Since 𝑥 2 ≡ 1 (mod 5) and 𝑥 2 ≡ 1 (mod 16), it ⟹ 2𝑘𝑎𝑘 − 2(𝑘 − 1)𝑎𝑘−1

follows that 𝑥 2 ≡ 1 (mod 80), and therefore = −𝑎𝑘−1 … … … … . . (1)
40
that 𝑛
.
196
𝟏 𝒎
Now adding up Eq. (1) from k = 2 to k = (n 16) Prove that 𝒏 = 𝟖 {(𝟏𝟕 + 𝟏𝟐√𝟐) +
+1), we have 𝒎
(𝟏𝟕 − 𝟏𝟐√𝟐) } + 𝟔 is an integer for all n
4𝑎2 − 2𝑎1 = −𝑎1 ∊ N and hence, show that both
6𝑎3 − 2𝑎2 = −𝑎2
(𝒏 − 𝟏)(𝟐𝒏 − 𝟏) are perfect squares for
8𝑎4 − 6𝑎3 = −𝑎3 … … … … . (2)
⋮ all n ∊ N.
⋮ }
Sol.: As is problem 73, the terms containing
2𝑛𝑎𝑛 − 2(𝑛 − 1)𝑎𝑛−1 √2 vanishes in the expansion of (17 +
= −𝑎𝑛−1 , 2(𝑛 𝑚 𝑚
12√2) + (17 − 12√2) and integral terms
+ 1)𝑎𝑛+1 − 2𝑛𝑎𝑛
are all multiplies of 8 and hence, n is an
1
= −𝑎𝑛 𝑠𝑢𝑚𝑚𝑖𝑛𝑔, 𝐸𝑞. (2), 𝑤𝑒 𝑔𝑒𝑡, 2(𝑛 integers, (prove it) 𝑛 − 1 = × [(17 +
8
+ 1)𝑎𝑛+1 − 2𝑎1 𝑚 𝑚 1
12√2) + (17 − 12√2) + 6 − 8] = 8 ×
𝑛 𝑛 𝑚 𝑚
[(17 + 12√2) + (17 − 12√2) − 2]
= − ∑ 𝑎𝑘 ⟹ ∑ 𝑎𝑘
𝑘=1 𝑘=1 comparing the above expansion from the
= 2𝑎1 − 2(𝑛 + 1)𝑎𝑛+1 result of problem 71. We get,
= 1 − 2(𝑛 + 1)𝑎𝑛+1
17 + 12√2 = (3 + 2√2)2 , 17 − 12√2
1 3 = (3 − 2√2)2 𝑎𝑔𝑎𝑖𝑛 𝑏𝑜𝑡ℎ (17
𝑎1 = , 𝑎𝑛 = (1 − ) 𝑎𝑛−1
2 2𝑛
+ 12√2)(17 − 12√2)𝑎𝑛𝑑 (3
3 1 1 1 1 + 2√2)(3 − 2√2)𝑎𝑟𝑒 𝑒𝑞𝑢𝑎𝑙 𝑡𝑜 1.
⟹ 𝑎2 = (1 − ) , = × =
4 2 2 4 8
3 1 1 𝑚
⟹ 𝑎3 = (1 − ) 𝑆𝑜, × [(17 + 12√2)
6 8 8
𝑚
1 1 1 3 + (17 − 12√2) − 2]
= × = 𝑎𝑛 : (1 − ) 𝑎𝑛−1 is
2 8 16 2𝑛
3 1 𝑚−2
positive as (1 − 2𝑛) 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ≥ 2 is = × {[(3 + 2√2) ]+
8
positive and 𝑎1 , 𝑎2 , 𝑎3 , … … …. are all [(3 − 2√2)𝑚−2 ] − 2 × (3 + 2√2)(3 −
positive. Since each
2√2)}
𝑎𝑖 𝑖𝑠 𝑎 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 𝑜𝑓 (1 −
3 𝑚2 𝑚2
2𝑖
) 𝑎𝑖−1 𝑎𝑛𝑑 𝑎𝑖 > 0 implies that 𝑎2 > 1 (3 + 2√2) + (3 − 2√2)
= ×[ ]
0 … … 𝑎𝑖−1 > 0 and hence, 8 2√2
𝑛
1 𝑚
∑ 𝑎𝑘 = 1 − 2(𝑛 + 1)𝑎𝑛+1 < 1. [ 𝑎𝑛𝑑 2𝑛 − 1 = 4 × [(17 + 12√2) +
𝑘=1 𝑚
(17 − 12√2) + 6 − 4]
∵ 2(𝑛 + 1)𝑎𝑛+1 > 0
1 𝑚
= 4 × [(17 + 12√2) + (17 −
𝑚
12√2) + 2]
197
𝑚 𝑚 𝑛 𝑛 2
(3+2√2) +(3−2√2)
=[ ] and hence the {(1 + √2) − (1 − √2) }
2
𝑚 4
result show that (3 + 2√2) −
𝑚 𝑚
𝑚 (3+2√2) +(3−2√2) Are consecutive integers. For any n,
(3 − 2√2) and 2
𝑛 𝑛 𝑛 𝑛 𝑛 𝑛
(1+√2) +(1−√2) (1 + √2) − (1 − √2) (1 + √2) + (1 − √2)
are and so 2√2
is also an 𝑎𝑛𝑑
2 2
integer and hence, their sum is also an
integer. Thus, Are integers (prove) and hence
1 𝑚 𝑚 𝑛 𝑛 2
32
[(17 + 12√2) + (17 − 12√2) − (1 + √2) − (1 − √2)
{ }
2] is a square integer. To show that 2
1 𝑛 𝑛 2
Exp. (1) can be written as 2 𝑚(𝑚 + 1) (1 + √2) − (1 − √2)
1
={ }
consider the Exp. (2) × 4
32
𝑚 𝑚
[(17 + 12√2) + (17 − 12√2) − 2] 𝑛 𝑛 2
(1 + √2) − (1 − √2)
𝑎𝑛𝑑 { }
𝑛 𝑛 2 𝑛 𝑛 2 2
(1 + √2) + (1 − √2) (1 + √2) − (1 − √2)
={ } { } 𝑛 𝑛 2
2 2√2 (1 + √2) − (1 − √2)
={ }
4
𝑛 𝑛 2
1 {(1+√2) −(1−√2) }
= 2
[ 4
]. 𝑎𝑟𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠. 𝑁𝑜𝑤
𝑛 𝑛 2
(1 + √2) − (1 − √2)
𝑛 𝑛 2 ={ }
{(1 + √2) + (1 − √2) } 4
[ ]
4 2𝑛 2𝑛
(1 + √2) + (1 − √2) −2
=
For all n, we shall show that 4
𝑛 𝑛
𝑛
{(1+√2) −(1−√2) }
𝑛 2 𝑛
{(1+√2) +(1−√2) }
𝑛 2 (3 + 2√2) + (3 − 2√2) − 2
= … … … . . (3)
4 4 4
are consecutive integers clearly, for n 𝑛 𝑛 2
= 1, we get (1 + √2) − (1 − √2)
𝑎𝑛𝑑 𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦, { }
4
𝑛 𝑛 2
{(1 + √2) − (1 − √2) } 8 𝑛 𝑛
= (3 + 2√2) + (3 − 2√2) − 2
4 4 = … … … . (4)
𝑛 𝑛 2 4
{(1 + √2) + (1 − √2) }
= 2 𝑎𝑛𝑑 ∴ From Exp (3) and (4), we find that
4
4
= = 1 𝑎𝑛𝑑 ℎ𝑒𝑛𝑐𝑒 𝑓𝑜𝑟 𝑛 = 1 𝑛 𝑛
4 {(1 + √2) + (1 − √2) }
𝑎𝑛𝑑
𝑛 𝑛 2 4
{(1 + √2) + (1 − √2) }
𝑎𝑛𝑑
4
198
𝑛 𝑛 1 2𝑚+1
{(1 + √2) − (1 − √2) } 𝑓𝑜𝑟 𝑚 = 1, × [(3 + 2√2)
8
4 2𝑚+1
+ (3 − 2√2) − 6]
2𝑘−2 2𝑘+2 1
𝑎𝑟𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑓𝑜𝑟𝑚 𝑎𝑛𝑑 𝑜𝑟 (𝑘 −
4 4 2
1 1
1)𝑎𝑛𝑑 2 (𝑘 + 1) and hence, they differ = × [2 × 3𝐶0 × 33 + 2 × 3𝐶2 × 31
8
1 1 2
by 2 (𝑘 + 1) − 2 (𝑘 − 1) = 1. × (2√2) − 6]
1 𝑛 1 1
𝑆𝑜 × {(17 + 12√2) = × [54 + 144 − 6] = × [192] =
32 8 8
𝑛 24 and hence, is an integer. For any
− (17 − 12√2) − 2}
m>1 let us prove that the expression,
𝑛 𝑛 2 2𝑚+1
1 (1 + √2) − (1 − √2) 1
= ×{ } 𝑓(𝑚 + 1) = [(3 + 2√2) +
8
2 4 2𝑚+1
(3 − 2√2) − 6] is an integer.
𝑛 𝑛 2
(1 + √2) + (1 − √2) Expanding and cancelling the terms,
×{ }
4 we get
=2×
1 (𝑘−1) (𝑘+1)
× 2 𝑜𝑟
1
= 2 (𝑚 − 1 2𝑚+1
2 𝑓(𝑚 + 1) = × [(3 + 2√2)
𝑚(𝑚+1) 8
1)𝑚 𝑜𝑟 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑡𝑙𝑦 and 2𝑚+1
2 + (3 − 2√2) − 6]
hence, the result.
1
1 𝑛 = 4 × [32𝑚+1 + 2𝑚 +
Note: This [(17 + 12√2) +
32 2
𝑛 1𝐶2 . 32𝑚−1 (2√2) + 2𝑚 +
(17 − 12√2) − 2] gives you an
4
infinite family of square and 1𝐶4 . 32𝑚−3 . (2√2) + ⋯ +
2𝑚−1
triangular numbers. 2𝑚 + 1𝐶2 . 3(2√2) − 3]
𝟏 2
17) Show that for 𝒇(𝒎) = 𝟖 {(𝟑 + 1
= 4 × [2𝑚 + 1𝐶2 . 32𝑚+1 . (2√2) +
𝟐𝒎+𝟏 𝟐𝒎+𝟏
𝟐√𝟐) + (𝟑 − 𝟐√𝟐) − 4
2𝑚 + 1𝐶4 . 32𝑚−3 . (2√2) + ⋯ +
𝟔} 𝒃𝒐𝒕𝒉 𝒇(𝒎) + 𝟏 𝒂𝒏𝒅 𝟐𝒇(𝒎) + 𝟏 are 2𝑚
2𝑚 + 1𝐶2𝑚 . 3(2√2) + 32𝑚+1 − 3]
perfect squares for all n∊ N by showing
that 𝒇(𝒎) is an integer. All the terms in the above expression
except 32𝑚+1 − 3 are multiplies of 4,
Sol.: First let us show that the expression
as the even power of (2√2) is a
1 2𝑚+1 multiple of 4. 32𝑚+1 − 3 = 3[9𝑚 − 1]
𝑓(𝑚) = [(3 + 2√2)
8 is also multiple of 4.
2𝑚+1
+ (3 − 2√2) − 6] 1
Now, 𝑓(𝑚) + 1 = 8 × [(3 +
2𝑚+1 2𝑚+1
2√2) + (3 − 2√2) − 6] + 1
199
1 2𝑚+1 2𝑚+1 2𝑚+1

= 8 × [(3 + 2√2) + (3 − (1+√2) −(1−√2)
𝑁𝑜𝑡𝑒 𝑡ℎ𝑎𝑡 2√2
is an
2𝑚+1
2√2) − 6 + 8] integer, as all the left over terms
contain 2√2 as a factor in the
1 2𝑚+1
= 8 × [(3 + 2√2) + (3 − numerator.
2𝑚+1
2√2) + 2] 1
𝑁𝑜𝑤, 2𝑓(𝑚) + 1 = 4 × [(3 +
2𝑚+1 2𝑚+1
2 2√2) + (3 − 2√2) − 6] + 1
𝑁𝑜𝑤, 3 + 2√2 = (1 + √2) , 3 −
2
2√2 = (1 − √2) 1 2𝑚+1
= 4 × [(3 + 2√2) + (3 −
1 2𝑚+1 2𝑚+1
𝑆𝑜, 8 × [(3 + 2√2) + 2√2) − 2] Since n is shown. Now,
2𝑚+1 (2n +1) can be written as
(3 − 2√2) + 2]
1 2𝑚+1 2
1 2 2𝑚+1 = × [{(1 + √2) } +
= × [{(1 + √2) } + 4
8
2𝑚+1 2
2 2𝑚+1 {(1 − √2) } − 2]
{(1 − √2) } + 2]
1 2𝑚+1 2
1 2𝑚+1 2 = 4 × [{(1 + √2) } +
= × [{(1 + √2)
8
} +
2𝑚+1 2
2𝑚+1 2 {(1 − √2) } + 2 × {(1 +
{(1 − √2) } + 2]
2𝑚+1
√2)(1 − √2)} ]
1 2𝑚+1 2
= 8 × [{(1 + √2) } +
2𝑚+1 2𝑚+1 2
2𝑚+1 2
(1 + √2) + (1 − √2)
{(1 − √2) } − 2(−1)] ={ }
2
1 2𝑚+1 2 By a similar reasoning, the expression

= 8 × [{(1 + √2) } +
2𝑚+1 2𝑚+1
2𝑚+1 2 (1+√2) +(1−√2)
{(1 − √2) } − 2 × (1 + 2
is an integer.
2𝑚+1 2𝑚+1 Hence, the result.
√2) (1 − √2) ]
2𝑚+1 2𝑚+1
𝑆𝑖𝑛𝑐𝑒 (1 + √2) (1 − √2)
18) Suppose f is a function on the positive
2𝑚+1 integers, which takes integers (i.e. f: N→Z)
= [(1 + √2)(1 − √2)]
with the following properties
= (−1)2𝑚+1 = −1 (a) 𝒇(𝟐) = 𝟐, (b) 𝒇(𝒎,𝒏) = 𝒇(𝒎) . 𝒇(𝒏) ,
(c) 𝒇(𝒎) > 𝒇(𝒏) if m > n. Find
So the given expression is equal to
f(1983).
2𝑚+1 2𝑚+1 2
(1 + √2) − (1 − √2) Sol.: 𝑓(2) = 2, 𝑓(4) = 𝑓(2.2) = 𝑓(2) . 𝑓(2) = 2.2 =
{ }
2√2 4,
200
𝑓(8) = 𝑓(2.4) = 𝑓(2) . 𝑓(4) = 2.4 = 8. Thus we 19) Let a sequence 𝒙𝟏 , 𝒙𝟐 + 𝒙𝟑 , … …. of

infer 𝑓(24) = 2𝑛 that let us use M. I for complex numbers de defined by 𝒙𝟏 =
proving 𝑓(21 ) = 2 by hypothesis………..(1) 𝟎, 𝒙𝒏+𝟏 = 𝒙𝒏−𝟏 𝟐 𝒇𝒐𝒓 𝒏 > 1 where 𝒊𝟐 =
−𝟏. Find the distance of
𝐴𝑠𝑠𝑢𝑚𝑒 𝑓(2𝑛 ) = 2𝑛 … … … … . . (2) 𝒙𝟐𝟎𝟎𝟎 𝒇𝒓𝒐𝒎 𝒙𝟏𝟗𝟗𝟕 in the complex plane.
𝑓(2𝑛+1 ) = 𝑓(2. 2𝑛 ) = 𝑓(2) . 𝑓(2𝑛 ) = Sol.: Let a sequence 𝑥1 = 0, 𝑥2 = 02 − 𝑖,

2. 2𝑛 … … … … … (3)
𝑥3 = (−𝑖)2 − 𝑖 = −1 − 𝑖 = −(1 + 𝑖),
By hypothesis and Eq. (1) and (2), we need to
find f(n) for all n. 𝑥4 = [−(1 + 𝑖)]2 − 𝑖 = 2𝑖 − 𝑖 = 𝑖,
Let us see that happens for 𝑥5 = (𝑖)2 − 𝑖 = −1 − 𝑖 = 𝑥3 ,

𝑓(1) , 𝑓(3) 𝑎𝑡 𝑓𝑖𝑟𝑠𝑡 𝑓(1) < 𝑓(2) . 𝑥6 = (−1 − 𝑖)2
𝑁𝑜𝑤, 𝑓(2) = 𝑓(1×2) = 𝑓(1) × 𝑓(2) ⟹ 𝑓(1) = 1 −𝑖 = 𝑖 = 𝑥4 , 𝑥6 = 𝑥4 𝑎𝑛𝑑 ℎ𝑒𝑛𝑐𝑒 𝑥7 =
𝑥5 𝑎𝑛𝑑 𝑠𝑜 𝑜𝑛 𝑥2𝑛 = 𝑖 𝑓𝑜𝑟 𝑛 ≥ 1, 𝑥2𝑛+1 =
𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝑓(2) < 𝑓(3) < 𝑓(4) , 2 < 𝑓(3) < 4
−1 − 𝑖 𝑥2000 = 𝑖 = (0, 1) in the complex
But the only integer lying between 2 and 4 is plane, 𝑥1997 = (−1, −𝑖) = (−1, −1) in the
3. Thus 𝑓(3) = 3. So, again we guess that 𝑓(𝑛) = complex plane.
𝑛, for all n. Let us prove by using the strong So the distance between 𝑥2000 𝑎𝑛𝑑 𝑥1997 is
principle of mathematical induction.
√12 + 22 = √5.
Let 𝑓(𝑛) = 𝑛 for all n < a, fixed m ∊ N.
Now, we should prove that 𝑓(𝑚) = 𝑚. If m is 20) Show that 𝑭(𝑷𝟏 𝒙𝟏 × 𝑷𝟐 𝒙𝟐 ) = 𝑭(𝑷𝟏 𝒙𝟏 ) ×
𝑭(𝑷𝟐 𝒙𝟐 )
an even integer, then 𝑓(𝑚) = 2𝑘, 𝑎𝑛𝑑 𝑘 < 𝑚.
Sol.: Any divisors of 𝑃1 𝛼1 is 𝑃1 𝑟1 , 𝑤ℎ𝑒𝑟𝑒 0 ≤
So, 𝑓(𝑚) = 𝑓(2𝑘) = 𝑓(2) × 𝑓(𝑘) = 2 × 𝑘 = 2𝑘 =
𝑟 ≤ 𝛼1
𝑚. So all even m, 𝑓(𝑚) = 𝑚. If m is an odd
𝛼1 𝛼1
integer, let m = 2k +1, and 𝑓(2𝑘) < 𝑓(2𝑘+1) < 𝐹(𝑃1 𝛼1 ) = ∑𝑟=0 𝑇3 (𝑃1 𝑟 ) = ∑𝑟=0(𝑟 + 1)3 =
𝑓(2𝑘+2) , 2𝑘 < 𝑓(2𝑘+1) < 𝑓(2𝑘+2) sum of the cubes of the first 𝛼1 + 1 natural
numbers,
(Because the function 𝑓(𝑛) = 𝑛 is true for all
2
even integer n). But only integer lying (𝛼1 + 1)(𝛼1 + 2)
=[ ]
between 2k and 2𝑘 + 2 𝑖𝑠 2𝑘 + 1,(since the 2
range of f is integer)
2
(𝛼1 + 1)(𝛼2 + 2)
Thus, 𝑓(𝑘+1) = 2𝑘 + 1, 𝑖. 𝑒. 𝑓(𝑚) = 𝑚, in the 𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦, 𝐹(𝑃2 𝛼2 ) = [ ]
2
case of odd m also. Thus, 𝑓(𝑛) = 𝑛, for all n∊
N. 𝐹(𝑃1 𝛼1 . 𝑃2 𝛼2 ) = ∑ 𝑇3 (𝑃1 𝑟 . 𝑃2 𝑠 )
0≤𝑟≤𝛼1
∴𝑓(1983) = 1983. 0≤𝑟≤𝛼2
201
𝛼1 𝛼2
The sum of the divisors of 2𝑛 𝑎𝑏 other than
3 (𝑠 3
= ∑ ∑(𝑟 + 1) + 1) 2𝑛 𝑎. 𝑏 is
𝑟=0 𝑠=0
𝛼1
9. 22𝑛−1 (2+1 − 1) − 2𝑛 (9. 22𝑛−1 − 9. 2𝑛−1 +
= ∑(𝑟 1)
𝑟=0
𝛼2 = 9. 23𝑛 − 9. 22𝑛−1 − 9. 23𝑛−1 + 9. 22𝑛−1 −
+ 1)3 (∑(𝑠 + 1)3 ) 2𝑛 = 9. 23𝑛−1 − 2𝑛
𝑠=0
= 2𝑛 (9. 22𝑛−1 − 1) = 2𝑛 . 𝑐.
𝛼1 2
(𝛼2 + 1)(𝛼2 + 2)
= ∑(𝑟 + 1) [ 3
] Thus the sum of the divisors of 2𝑛 . 𝑎𝑏 other
2 than itself is 2𝑛 . 𝑐.
𝑟=0
𝛼1
Now, sum of the divisors of 2𝑛 𝑐 other than
𝛼2 3
𝐹(𝑃2 ). ∑(𝑟 + 1) 2𝑛+1 −1 𝑐 2 −1
itself is × − 2𝑛 . 𝑐 = (2𝑛+1 −
𝑟=0 2−1 𝑐+1
3 𝑛
(𝛼1 + 1)(𝛼2 + 2) 1)(𝑐 + 1) − 2 . 𝑐
𝛼2
= 𝐹(𝑃2 )[ ]
2
= (2𝑛+1 − 1)9. 22𝑛−1 − 2𝑛 (9. 22𝑛−1 − 1)
= 𝐹(𝑃2 𝛼2 ) 𝐹(𝑃1 𝛼2 ) . Hence proved. = 9. 23𝑛 − 9. 22𝑛−1 + 2
= 2𝑛 [9. 22𝑛−1 − 9. 2𝑛−1 + 1]
21) If 𝒏𝟏 𝒂𝒏𝒅 𝒏𝟐 are two numbers, such that = 2𝑛 𝑎𝑏
the sum of all the divisors of 𝒏𝟏 other than
𝒏𝟏 is equal to sum of all the divisors of 𝒏𝟐 i.e. the sum of the divisors of 2𝑛 𝑐 other than
other than 𝒏𝟐 , then the pair (𝒏𝟏 , 𝒏𝟐 ) is 2𝑛 𝑐 equal to 2𝑛 𝑎𝑏.
called an anticable number pair. Given 𝒂 =
𝟑. 𝟐𝒏 − 𝟏, primes numbers, then shows
that (𝟐𝒏 𝒂𝒃, 𝟐𝒏 𝒄) is an anticable pair. 22) If n = 𝑷𝟏 , 𝑷𝟐 , P3 and P1, P2 and P3 are
distinct prime numbers. If ∑𝒅 𝒅 =
Sol.: If N = 𝑃1 𝛼1 , 𝑃2 𝛼2 , … , 𝑃𝑛 𝛼𝑛 , then sum of 𝒏
the divisors N is given by the formula. 𝟑𝑵 𝒐𝒓 𝑶𝒄(𝑵) = 𝟑𝑵, then show that
𝟏
∑𝑵
𝒊=𝟏 = 𝟑.
𝛼1 +1 𝛼2 +1 𝒅𝒊
𝑃1 − 1 𝑃2 −1
∑ 𝑑(𝑁) = ×
𝑃1 − 1 𝑃2 − 1 Sol.: The divisors of N are
𝑃𝑛 𝛼𝑛 +1 − 1 1, 𝑃1 , 𝑃2 , 𝑃3 , 𝑃1 𝑃2 , 𝑃1 𝑃3 , 𝑃2 𝑃3 , 𝑃1 𝑃2 𝑃3. It is given
×…..
𝑃𝑛 − 1 that
So the sum of the divisors of 2𝑛 𝑎. 𝑏 = 1 + 𝑃1 + 𝑃2 + 𝑃3 + 𝑃1 𝑃2 + 𝑃1 𝑃3 +

𝑎 2 −1 𝑏2−1 𝑃2 𝑃3 + 𝑃1 𝑃2 𝑃3 = 3𝑁
(2𝑛+1 − 1) × 𝑎−1 𝑏−1 = (2𝑛+1 − 1)(𝑎 +
1)(𝑏 + 1) 𝑁
1 1 1 1 1 1 1
𝑁𝑜𝑤, ∑ = + + + + +
= (2𝑛+1 − 1)(9. (22𝑛−1 ) 𝑑𝑖 1 𝑃1 𝑃2 𝑃3 𝑃1 𝑃2 𝑃1 𝑃3
𝑖=1
1 1
𝐵𝑢𝑡, 2𝑛 𝑎𝑏 = 2𝑛 [9. 22𝑛−1 − 9. 2𝑛−1 + + +
𝑃2 𝑃3 𝑃1 𝑃2 𝑃3
1](𝑜𝑛 𝑠𝑖𝑚𝑝𝑙𝑖𝑓𝑖𝑐𝑎𝑡𝑖𝑜𝑛)
202
𝑃1 𝑃2 𝑃3 + 𝑃2 𝑃3 + 𝑃1 𝑃3 + 𝑃1 𝑃2 + 𝑃3 + 𝑃2 + 𝑃1 + 1
=
𝑃1 𝑃2 𝑃3
24) All two digit numbers from 10 to 99 are
But the numerator is the sum of the divisors written consecutively, that is N= 101112
of N. ….. 99.
𝟑𝟐
Show that . From which other two digit
𝑖. 𝑒. ∑ 𝑑 = 3𝑁 = 3𝑃1 𝑃2 𝑃3 𝑎𝑛𝑑 ℎ𝑒𝑛𝑐𝑒, 𝑵
𝑑
number you should start so that N is
𝑛 divisible by (i) 3 and (ii) 𝟑𝟐 .
𝑁
1 3𝑃1 𝑃2 𝑃3 Sol.: N is divisible by 9, if the digit sum is
∑ = =3
𝑑𝑖 𝑃1 𝑃2 𝑃3 divisible by 9. The digit sum of N:
𝑖=1
23) Determine with proof all the arithmetic The number of 1𝑠 occurring in the digits from
program with integer terms with the 10 to 19 = 11 and from 20 to 99 = 8
property that for each positive integer n, So, that of ones is 11+8= 19. Similarly,
the sum of the first n terms is a perfect
square. No of 2𝑠 , 3𝑠 , … .9 are all equal to 19.
Sol.: When n = 1, the first term itself is a So, sum of all digits = 19(1 + 2 + 3 + ⋯ +
perfect square 19×9×10
9) = = 19 × 5 × 9 = 855 and hence,
2
Let it be 𝑘 2. The sum to n terms of the Ap is 1011……. 99 is divisible by 9.
𝑛 When the numbers start from 12, the sum of

𝑆𝑛 = [2𝑎 + (𝑛 − 1)𝑑], 𝑤ℎ𝑒𝑟𝑒 𝑎 = 𝑝2
2 the digits becomes 855 − 3 = 852 (since 10,
11 account for the digital sum 3) and, hence is
Since 𝑆𝑛 is a perfect square for every n, the
divisible by 3
nth term 2𝑎 + (𝑛 − 1)𝑑 > 0, for every n and
hence d>0. (a) For divisibility by 3, it could start
from 13, 15, 16, 18, 19, 21, 22, 24,
If n is an odd prime, say P, then
25 ……….
𝑝 (b) For divisibility by 32 = 9 the
𝑆𝑝 = [2𝑎 + (𝑛 − 1)𝑑]
2 numbers may start from any of 18,
19, 27, 28, 36, 37 ……….
Since 𝑆𝑝 is a perfect square 𝑃1 [2𝑎 + (𝑝 − 1)𝑑]
𝑃
i.e. [(2𝑎−𝑑)+𝑝𝑑] 25) When the numbers from 1 to n are written
in decimal notation, it is found that the
𝑃 𝑃 total number of digit in writing all these in
𝐵𝑢𝑡 , 𝑠𝑜 .
𝑝𝑑 (2𝑎 − 𝑑) 1998, find n.
𝑇ℎ𝑖𝑠 𝑖𝑠 𝑝𝑜𝑠𝑠𝑖𝑏𝑙𝑒 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑝𝑟𝑖𝑚𝑒 𝑝, 𝑖𝑓 𝑎𝑛𝑑 𝑜𝑛𝑙𝑦 𝑖𝑓 2𝑎 − Sol.: To write the first nine single digit
𝑑 = 0𝑜𝑟 2𝑎 = 𝑑 i.e. d= 2𝑘 2 number from 1 to 9 both inclusion the no. of
digit used = 9
So, the required A.p is 𝑘 2 , 3𝑘 2 , 5𝑘 2 , … , (2𝑛 −
1)𝑘 2 where k is any natural number. To write the two digits number from 10 to 99,
no of digit used = (99 − 9) × 2 = 180.
203
So, the number of digit used to write numbers If the difference between two perfect square
from 1 to 99 is 189. is 4, then one of them is 4 and the other is
zero. Therefore, 1991 − 𝑎 = ±2, (𝑏 − 𝑐)2 = 0.
Total number of digit used in writing up to n
is 1998. ⟹ 𝑎 = 1991 + 2 = 1993 𝑎𝑛𝑑 𝑏 − 𝑐
= 0 𝑜𝑟 𝑎 = 1991 − 2
The total no. of all three digits numbers = = 1989 𝑎𝑛𝑑 𝑏
(999 × 99) × 3 = 2700 > 1998. So, n should = 𝑐. 𝐵𝑢𝑡 𝑏 + 𝑐 = 2𝑏
be less than 999. = 1991 + 𝑎
No. of digits used to write the three digit = 1991
numbers up to N is 1998 − 189 = 1809. + 1993 𝑜𝑟 1991
+ 1989 ⟹ 𝑏 = 𝑐
In each 3 digit number, we use three digits. = 1992 𝑜𝑟 1990.
So, the number of three digits number in N = So, the only 2 values of a are 1993 and 1989
1809
= 603
3
So, therefore N = 703 − 1 = 702 27) Find the last two digit in (𝟓𝟔𝟕𝟖𝟗)𝟒𝟏
Since up to 702, there are 603, three digit Sol.: 56789 ≡ 89 (mod 100) =
numbers 90 two digit numbers and 9 one −11 (𝑚𝑜𝑑 100)
digit numbers.
∴ (56789)49 ≡ (−11)41 (𝑚𝑜𝑑 100)
≡ (−11)40
26) Find all integers values of a such that × (−11)(𝑚𝑜𝑑 100)
quadratic expressions (𝒙 + 𝒂)(𝒙 + ≡ (11)40 × (−11)(𝑚𝑜𝑑 100)
𝟏𝟗𝟗𝟏) + 𝟏 can be factored as (𝒙 + 𝒃)(𝒙 +
112 ≡ 21 (𝑚𝑜𝑑 100), 114 ≡ 21 ×
𝒄) where b and c are integers.
4 (𝑚𝑜𝑑 100), 116 ≡ 21 × 41 =
Sol.: (𝑥 + 𝑎)(𝑥 + 1991)+= (𝑥 + 𝑏)(𝑥 + 𝑐) 61(𝑚𝑜𝑑 100), 1110 ≡ 41 × 61 ≡
01(𝑚𝑜𝑑 100), 114 ≡ (01)40 ≡
⟹ 1991 + 𝑎 = 𝑏 + 𝑐 𝑎𝑛𝑑 1991𝑎 + 1 1(𝑚𝑜𝑑 100), (−11)41 ≡ 1140 ×
= 𝑏𝑐 (−11)(𝑚𝑜𝑑 100) ≡ 1 × (−11)(𝑚𝑜𝑑 100) ≡
−11 ≡ 89 (𝑚𝑜𝑑 100).
∴ (𝑏 − 𝑐)2 = (𝑏 + 𝑐)2 − 4𝑏𝑐
= (1991 + 9)2 That is the last two digits of (56789)41 are 8
− 4(1991𝑎 + 1) and 9 in that order.
= (1991
⏟ + 𝑎)2 − 4 × 1991𝑎 − 4
= (1991 − 𝑎)2 − 4
28) Prove that [𝒙] + [𝟐𝒙] + [𝟒𝒙] + [𝟖𝒙] +
2 2
𝑜𝑟 (1991 − 𝑎) − (𝑏 − 𝑐) = 4 [𝟏𝟔𝒙] + [𝟑𝟐𝒙] = 𝟏𝟐𝟑𝟒𝟓 has no solution.
Sol.: 12345 ≤ 𝑥 + 2𝑥 + 4𝑥 + 8𝑥 + 16𝑥 +

32𝑥 = 63𝑥
204
∴𝑥≥
12345
= 195
20
, when x = 196, the L H S = (33 )3 (1 + 32 )3 , 𝑝𝑟𝑜𝑣𝑖𝑑𝑒𝑑 3𝑛−9 −
63 21
of the given equation becomes 12348. 35 = 0 = (270)3 , Provided 3𝑛−9 =35
20 i.e., provided n = 14.

∴ 195 21 ≤ 𝑥 < 196. Consider x in the
31
interval(195 32 , 196). The L H S expression of
the given equation= 195 + 0 + 390 + 1 + 31) Two prime’s numbers 𝑷𝟏 , 𝑷𝟐 𝒘𝒊𝒕𝒉 (𝑷𝟏 <
780 + 3 + 1560 + 7 + 3120 + 15 + 6240 + 𝑷𝟐 ) are called twin primes if they differ by
31 = 12342 < 12345. 2. (e.g. 17, 19 or 41, 43). Prove that if
31
𝑷𝟏 , 𝑷𝟐 are twin primes with 𝑷𝟏 bigger
When 𝑥 < 195 32, the LHS is less than 12342. than 3, then 𝑷𝟏 + 𝑷𝟐 is always divisible by
12.
∴ For no value of x. The given equality will be
satisfied. Sol.: Since 𝑃1 , 𝑃2 are twin primes with 𝑃1 < 𝑃2
and 𝑃1 < 3, therefore 𝑃1 , 𝑃1 + 1, 𝑃2 are three
consecutive integers 𝑃1 , 𝑃2 are both odd and
29) Consider the following multiplication in neither of them is divisible by 3. Therefore 𝑃1
decimal notation 𝟗𝟗𝟗 × 𝒂𝒃𝒄 = 𝐝𝐞𝐟 𝟏𝟑𝟐. is of the form 6𝑘 − 1 and 𝑃2 is of the form
Determine the digits a, b, c, d, e, f 6𝑘 + 1. Therefore 𝑃1 + 𝑃2 = 12𝑘. i.e. 𝑃1 + 𝑃2
is a multiple of 12.
Sol.: Since 999 × 𝑎𝑏𝑐 = def 132,
𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 (1000 − 1) × 𝑎𝑏𝑐 = def 132.

32) Determine with proof all the arithmetic
𝑖. 𝑒. 𝑎𝑏𝑐 000 = def 132 + 𝑎𝑏𝑐 progressions with integer terms with the
property that for each positive integer n,
This implies that c = 8, b = 6, a = 8, so that the sum of the first n terms is a perfect is a
𝑎𝑏𝑐 = 868
perfect square.
𝑁𝑜𝑤, 86800 − 868 = def 132 . 𝑖. 𝑒. 867132 = Sol.: Let a be the first term and d the common
def 132 , 𝑠𝑜 𝑡ℎ𝑎𝑡 def 867. difference.
This digits a, b, c, d, e, f are → 8, 6, 8, 8, 6, 7 The sum of n terms, 𝑆𝑛 say, is given by
respectively.
𝑛
𝑆𝑛 = {2𝑎 + (𝑛 − 1)𝑑}
2
30) Given with justification, a natural number Since 𝑆1 (= 𝑎) must be a perfect square,
n for which 𝟑𝟗 + 𝟑𝟏𝟐 + 𝟑𝟏𝟓 + 𝟑𝒏 is a therefore a must be a perfect square, say 𝑘 2,
perfect cube (of an integer). where k is an integer. Also since 𝑆𝑛 is a
perfect square for every n, therefore 2𝑎 +
Sol.: 39 + 312 + 315 + 3𝑛 = 39 (1 + 33 + 36 + (𝑛 − 1)𝑑 > 0 for every n. Consequently d
3𝑛−9 ) = (33 )3 {1 + 3. 32 + (32 )𝑠 + 3𝑛−9 − must be a integer.
3. (32 )2 }
Let us consider the case when n is an odd
prime, say p .
205
𝑃 34) If a, b, x, y are integer greater than 1, such

Then 𝑆𝑝 = 2 {2𝑎 + (𝑝 − 1)𝑑}
that a and b have no common factor except
𝑝
Since 𝑆𝑝 must be a perfect square, and , 1 and 𝒙𝒂 = 𝒚𝒃 , show that 𝒙 = 𝒏𝒃 , 𝒚 = 𝒏𝒂
𝑠𝑝
𝑃2
for some integer n greater than 1.
therefore 𝑆 , 𝑠𝑜 𝑡ℎ𝑎𝑡 𝑃|{(2𝑎 − 𝑑) +
𝑃
𝑝𝑑} 𝑖. 𝑒. 𝑃|{2𝑎 − 𝑑}. Sol.: Since 𝑥 𝑎 = 𝑦 𝑏 , therefore if a prime, say
p, divides x, then it must divide 𝑦 𝑏 , and
This is possible for all primes P, if and only if consequently it must divide y as well.
2𝑎 − 𝑑 = 0 Similarly, if a prime, say q, divide y, then it
must divide x as well. Thus we find that
i.e., if and only if d = 2𝑘 2. Therefore the A.P. is exactly the same primes must occur in the
𝑘 2 , 3𝑘 2 , 5𝑘 2 , 7𝑘 2 , … … .. prime factorization of x and y.
33) How many zeros are there at the end in Let 𝑥 = 𝑃1 𝑒1 𝑃2 𝑒2 𝑃3 𝛼3 … ….
the product of the numbers 1, 2, 3, ….,
1994? 𝑦 = 𝑃1 𝑑1 𝑃2 𝑑2 𝑃3 𝑑3
Sol.: We are required to find the highest 𝑇ℎ𝑒𝑛 𝑥 𝑎 = 𝑦 𝑏 ⟹ (𝑃1 𝑒1 𝑃2 𝑒2 … )𝑎 =

power of 10 contained in the product 1994! 𝑏
(𝑃1 𝑑1 𝑃2 𝑑2 … . )
If P be the highest power of 5 contained in
⟹ 𝑐1 𝑎 = 𝑑1 𝑏, 𝑐2 𝑎 = 𝑑2 𝑏, … … ..
1994! And q be the highest power of 2
contained in 1994! Then highest power of 10 Since a prime to b, therefore it follows that a
contained in 1994! = min{𝑝, 𝑞} divides 𝑑1 𝑎𝑛𝑑 𝑏 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑐1 𝑖. 𝑒 … .,
Since 2 < 5, therefore the highest, power of 5 𝑐1 = 𝑢1 𝑏, which gives 𝑑1 = 𝑢1 𝑎,

contained in 1994! Is less than the highest similarly we have
power of 2 contained in 1994! i.e. p< q
therefore min{𝑝, 𝑞} = 𝑝. To find p we proceed 𝑐2 = 𝑢2 𝑏, 𝑑2 = 𝑢2 𝑎, …, for some
as follows: let [x] denote the greatest integer positive integers 𝑢1 , 𝑢2 …. etc.
not exceeding x. Then the highest power of 5
1994
𝐿𝑒𝑡 𝑛 =
contained in 1994! Is equal to ∑∞
𝑘=1 [ ] 𝑃1 𝑢1 𝑃2 𝑢2 𝑃3 𝑢3 … … . 𝑡ℎ𝑒𝑛 𝑛𝑏 =
5𝑘
observe that the above expression is not an 𝑥, 𝑥 𝑎 = 𝑦.
1994
infinite series because [ 5𝑘
] = 0,
Whenever 5𝑘 > 1994. 35) Let 𝒎𝟏 , 𝒎𝟐 , 𝒎𝟑 , … , 𝒎𝒏 be a re-

1994 1994 1994 arrangement of numbers 1, 2, 3, …, n. Let
Therefore, P = [ 5
] + [ 5 2 ] + [ 53 ] + that n is odd. Prove that the product
1994 1994
[ ] + [ 55 ] + ⋯ = 398 + 79 + 15 + 3 + (𝒎𝟏 − 𝟏)(𝒎𝟐 − 𝟐) … (𝒎𝒏 − 𝒏) is an even
54
0 … . = 495 integer.
Hence the highest power of 10 contained in Sol.: Since n is odd, we have n = 2m +1 for
1994! = 495. some positive integer m. Out of the integer 1,
2, …, n, there are m+ 1 odd ones namely 1, 3,
5, ……, (2m+1) and m even ones, namely 2, 4,
206
6, ….2m. Consider the pairs Thus the possible values of n are 2, 3, 8, 24.
(𝑚1 , 1), (𝑚2 , 2), … , (𝑚𝑛 , 𝑛). By actual verification we find all these values
of n satisfy the given conditions.
Since there are m +1 odd integers among
𝑚1 , 𝑚2 , … , 𝑚𝑛 and only m even integers Thus n = 2, 3, 8, 24
among 1, 2, …, n therefore at least one of the
odd 𝑚𝑖 ′𝑠 must be paired with an odd i, 37) Determine the largest 3-digit prime factor
consequently, for some positive integer i, of the integer 𝟐𝟎𝟎𝟎𝑪𝟏𝟎𝟎𝟎 .
𝑚𝑖 − 𝑖 must be even, and therefore the 2000.1999….1001
product (𝑚1 − 1), (𝑚2 − 2), … , (𝑚𝑛 − 𝑛) Sol.: 2000𝐶1000 = 1.2.3….1000
must be even.
Every three digit prime is a factor of 1, 2, 3,
…., 1000. Also 2000𝐶1000 is an integer. So
every three digit prime occurs in the prime
36) Determine, with proof, all the positive factors of the denominator at least once. The
integers n for which (i) n is not the square greatest three digit prime factor of 2000𝐶1000
𝟑
of any integer and (ii) [√𝒏] 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 𝒏𝟐 . is the one which occurs once in the
denominator and at least twice in the
Sol.: Suppose [√𝑛] = 𝑡. Since n is not the numerator.
square of any integer, therefore √𝑛 must lie
1
strictly between t and t +1 i.e. 𝑡 < √𝑛 < 𝑡 + Therefore it must be less than × 2000. i.e.
3
1. 𝑆𝑜 𝑡ℎ𝑎𝑡 𝑡 2 < 𝑛 < (𝑡 + 1)2 . less than 666 and as close to it as possible.
(Because then only will it occur twice in the
By hypothesis (ii), 𝑡 3 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑛2 . This implies
numerator and once in the denominator).
that 𝑡 2 must divide 𝑛2 , and consequently t Checking the numbers 666, 665, … for
must divide n. Now 𝑡 2 + 𝑡 𝑎𝑛𝑑 𝑡 2 + 2𝑡 are primality we find that 661 is the first prime in
the only positive integers lying between this sequences, which is the desired answer.
𝑡 2 𝑎𝑛𝑑 (𝑡 + 1)2 which are multiples of t.
Therefore we must have either 𝑛 = 𝑡 2 +
𝑡 𝑜𝑟 𝑛 = 𝑡 2 + 2𝑡.
38) Prove that any number N written in base 7
2 3 |𝑛 3 3 |(𝑡 2 2 will be even or odd according as the sum
Case I: 𝑛 = 𝑡 + 1, 𝑡 ⟹𝑡 + 𝑡) ⟹
𝑡 of its digits is even or odd.
(𝑡+1)2
𝑡 Sol.: Let us first observe that for P = 2,

⟹ ⟹ 𝑡 = 1 ⟹ 𝑛 − 2. 2𝑝−1 −1
1 ( ) is not an integer. Therefore 2 cannot
𝑝
Case II: 𝑛 = 𝑡 2 + 2𝑡, 𝑡 3 |𝑛2 ⟹ 𝑡 3 |(𝑡 3 + satisfy the given condition. Next, let p be a
𝑡 2𝑝−1 −1
2𝑡)2 ⟹ (𝑡+2)2 prime of the form 4k +1. Suppose ( 𝑝
) =
𝑚2 , for some odd integer m. It is obvious that
𝑡 m cannot be even. Then 24𝑘 − 1 =
⟹ ⟹ 𝑡 = 1, 2 𝑜𝑟 4 ⟹ 𝑛
4 (4𝑘 + 1)𝑚2 .
= 3, 8 𝑜𝑟 24.
Since every perfect square leaves a remainder
1 when divided by 4, therefore R. H. S. will
207
leave a remainder 1 when divided by 4. But 39) Each of the positive integers 𝒂𝟏 , … , 𝒂𝒏 is
the L. H. S will leave a remainder 3 when less than 1951. The least common multiple
divided by 3. This is not possible. Therefore p of any two of these is greater than 1951.
cannot be of the form 4k +1. Let now p be of 𝟏 𝟏
Show that 𝒂 + ⋯ + 𝒂 < 2.
𝟏 𝒏
the form 4k +3. First consider the case p = 3
2𝑝−1 −1 23−1 −1
(i.e. k = 0)in this case ( )= ( )= Sol.: The numbers of integers from 1 to m,
𝑝 3
𝑚
1 which are multiple of b is [ 𝑏 ]. From the
assumption, we know that none of the
Which is a perfect square. Therefore p = 3 is integers 1, …, 1951 is simultaneously divisible
one of the primes t that we are looking for. by two of the numbers 𝑎1 , … , 𝑎𝑛 . Hence the
Let Now 𝑃 = 4𝑘 + 3, 𝑤𝑖𝑡ℎ 𝑘 > 0, 2𝑝−1 − 1 = number of integers 1, …., 1951 divisible by
19511951
24𝑘+2 − 1(22𝑘+1 − 1)(22𝑘+1 + 1). one of 𝑎1 , … , 𝑎𝑛 𝑖𝑠 [ ]+ ⋯+ [
]. This
𝑎1 𝑎𝑛
1951
number does not exceed 1951. Hence 𝑎 −
Since 22𝑘+1 − 1 𝑎𝑛𝑑 22𝑘+1 + 1 are relatively 1
1951 1951 1951
prime, therefore if their product is of from 1 + ⋯ + 𝑎 − 1 < 1951 𝑎 + ⋯ + 𝑎 <
𝑛 1 𝑛
𝑃𝑚2 , one of them must be 𝑃𝑢2 and the other
𝑛 + 1951 < 2.1951.
must be 𝑣 2 , where u and v are relatively
prime, Since 22𝑘+1 − 1 is of the form 4𝑠 + 1
+ ⋯+
1
< 2. This problem was used at
𝑎1 𝑎𝑛
3 𝑎𝑛𝑑 𝑣 2 must be of the from 4𝑠 + 1,
the MMO 1951. It is due to paul Erdos. The 2
therefore it follows that 22𝑘+1 − 1 cannot be 6
can be replaced by , but even this is not the
of the form 𝑣 2 . Therefore we must have 5
22𝑘+1 − 1 = 𝑃𝑢2 , 22𝑘+1 + 1 = 𝑣 2 . best possible bound.
Now, 22𝑘+1 + 1 = 𝑣 2 ⟹ 22𝑘+1 = 40) If the positive integers x, y satisfy 𝟐𝒙𝟐 +

(𝑣 − 1)(𝑣 + 1), so that 𝑣 − 1 𝑎𝑛𝑑 𝑣 + 1 must 𝒙 = 𝟑𝒚𝟐 + 𝒚, then show that 𝒙 − 𝒚, 𝟐𝒙 +
be both powers of 2. Suppose 𝑣 + 1 = 2𝑎 , 𝑣 − 𝟐𝒚 + 𝟏, 𝟑𝒙 + 𝟑𝒚 + 𝟏 are perfect square.
1 = 2𝑏 . 𝑆𝑜 𝑡ℎ𝑎𝑡 2𝑎 − 2𝑏 = 2. 2𝑎+𝑏 = 22𝑘+1
Sol.: (a) From 2𝑥 2 + 𝑥 = 3𝑦 2 +
𝑁𝑜𝑤, 2𝑎 − 2𝑏 = 2 ⟹ 2𝑏 (2𝑎−𝑏 − 1) = 2 ⟹ 𝑦, 𝑤𝑒 𝑔𝑒𝑡 𝑥 2 = 𝑥 − 𝑦 + 3𝑥 2 − 3𝑦 2 =
2𝑏 = 1 (𝑥 − 𝑦)(3𝑥 + 3𝑦 + 1), 𝑦 2 = 𝑥 − 𝑦 + 2𝑥 2 −
2𝑦 2 = (𝑥 − 𝑦)(2𝑥 + 2𝑦 + 1). Since
2𝑎−𝑏 − 1 = 1 ⟹ 𝑏 = 1, 𝑎 = 2 ∴ 𝑣 − 1 = 3(𝑥 + 𝑦) + 1 𝑎𝑛𝑑 2(𝑥 + 𝑦) + 1 are prime to
2, 𝑣 + 1 = 4, each other and 𝑥 − 𝑦 = gcd(𝑥 2 , 𝑦 2 ) =
gcd(𝑥, 𝑦)2 , 𝑡ℎ𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 3𝑥 + 3𝑦 + 1 =
𝑣 2 = 9 22𝑘+1 + 1 = 9 ⟹ 𝑘 + 1 ⟹ 𝑃 = 7 𝑏 2 𝑎𝑛𝑑 2𝑥 + 2𝑦 + 1 = 𝑎2 must also be
Therefore the only possibility for P is 7. Since squares. This proves (a) (b) with 𝑥 =
27−1 −1 𝑑. 𝑏, 𝑦 = 𝑑. 𝑎, gcd(𝑎, 𝑏) = 1, 𝑤𝑒 𝑔𝑒𝑡 𝑑2 = 𝑥 −
( ) = 9 which is a perfect square,
7 𝑦 From (a) we get 3𝑎2 − 2𝑏 2 = 1 𝑎𝑛𝑑 𝑑2 =
therefore 7 is another prime that we are 𝑑𝑏 − 𝑑𝑎 ⟹ 𝑑 = 𝑏 − 𝑎, 𝑥 = (𝑏 − 𝑎)𝑏, 𝑦 =
looking for. (𝑏 − 𝑎)𝑎. The solutions of 3𝑎2 − 2𝑏 2 = 1 can
be obtained from.
Thus the only primes satisfying the given
condition are 3 & 7.
208
2𝑛+1 sketch of the proof is provided. The third

(√3 + √2) = 𝑎𝑛 + √3 + 𝑏𝑛 √2 by
powering or, simpler, by recurrence . From argument, which only a sketch, is a lovely
hybrid of algebra, number theory and
𝑎𝑛+1 + √3 + 𝑏𝑛+1 √2 = (𝑎𝑛 √3 + 𝑏𝑛 √2)(5 +
combinatory. It was discovered by a
2√6) we get 𝑎𝑛+1 = 5𝑎𝑛 + 4𝑏𝑛 , 𝑏𝑛+1 =
Bulgarian contestant who received a special
6𝑎𝑛 + 5𝑏𝑛 , 𝑎1 = 1, 𝑏1 = 1. The next solutions prize for his creativity.
𝑎2 = 9, 𝑏2 = 11 𝑦𝑒𝑖𝑙𝑑𝑠 𝑥2 = 22, 𝑦2 = 18.
For any p-element subset A of {1, 2, ……….2p}
denote the sum of the elements of A by Γ(A)
2𝑝
41) Several different positive integers lie of the ( 𝑝 ) . 𝑠𝑢𝑐ℎ 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 , 𝐿 =
strictly between two successive square. {1, 2, … , 𝑝} 𝑎𝑛𝑑 𝑅 = {𝑝 + 1, 𝑝 +
Prove that their pair wise products are 2, … ,2𝑝}𝑠𝑎𝑡𝑖𝑠𝑓𝑦 Γ (L) ≡Γ(R)≡ 0 (mod P). For
also different. A≠ LR . we have A ∩ L ≠ 𝜙 ≠ A ∩ R.
Sol.: Let 𝑛2 < 𝑎 < 𝑏 < 𝑐 < 𝑑 < (𝑛 + 1)2 , 𝑎𝑏 = 2𝑝
Portion the ( 𝑝 ) − 2𝑝 elements subsets other
𝑏𝑐. Then 𝑑 − 𝑎 < 2𝑛 our aim is to produce a
contradiction to (1). than L and R into group of size p as follows.
From 𝑎𝑑 = 𝑏𝑐, we conclude that For any set E of integers, define x ⊕E =

{𝑥 + 𝑒(𝑚𝑜𝑑 𝑝): 𝑒 ∊ 𝐸}, where the sums are
𝑎[(𝑎 + 𝑑) − (𝑏 + 𝑐)] = (𝑎 − 𝑏)(𝑎 − 𝑐) > 0. positive and no greater than P. Let A be any p-
Hence element subset other than P. Let A be any p-
element subset other than L or R. Define 𝐴𝐿 =
𝑎 + 𝑑 > 𝑏 + 𝑐. 𝑁𝑜𝑤 (𝑎 + 𝑑)2 − (𝑑 − 𝑎)2 =
𝐴 ∩ 𝐿 𝑎𝑛𝑑 𝐴𝑅 = 𝐴 ∩ 𝑅. (Note that both of
4𝑎𝑑 = 4𝑏𝑐 < (𝑏 +
these sets are non empty). Then the group of
𝑐)2 . 𝑊𝑒 𝑐𝑜𝑛𝑐𝑙𝑢𝑑𝑒 𝑡ℎ𝑎𝑡 (𝑑 − 𝑎)2 >
P subsets in which A lies is 𝐴𝐿 ∪ 𝐴𝑅 , (1 ⊕
(𝑎 + 𝑑)2 − (𝑏 + 𝑐)2 = (𝑎 + 𝑑 + 𝑏 + 𝑐)(𝑎 + 𝐴𝐿 ) ∪ 𝐴𝑅 , (2 ⊕ 𝐴𝐿 ) ∪ 𝐴𝑅 , (𝑃 − 1 ⊕ 𝐴𝐿 ) ∪ 𝐴𝑅
𝑑 − 𝑏 + 𝑐). Each term of the first factor on the
R. H. S. is larger than 𝑛2 , and the second is (In more sophisticated language, we are
𝑛2 ≥ 1. partitioning the subsets into equivalence
classed where two subset A and A’ are in the
Thus we have 𝑑 − 𝑎 > 2𝑛, which contradicts same class if and only if A’∩R= A∩ R and A’
(1). ∩L is a cyclic permutation of A ∩ L within L.)
42) Let a, b, c , d be integers with a > b >c >d This method of grouping subsets has the
>0. Suppose that following properties.
𝒂𝒄 + 𝒃𝒅 = (𝒃 + 𝒅 + 𝒂 − 𝒄)(𝒃 +  Each group contain P distinct subsets,
𝒅 − 𝒂 + 𝒄). Prove that 𝒂𝒃 + 𝒄𝒅 is and each subsets has a different
not prime. element sum modulo P. To see this,
assume that (x ⊕𝐴𝐿 ) ∪𝐴𝑅 =
Sol.: Three different arguments are presented (𝑦 ⊕ 𝐴𝐿 ) ∪ 𝐴𝑅
hence. The first is the most elementary, using This implies that 𝑥 ⊕ 𝐴𝐿 = 𝑦 ⊕
only number theory and counting arguments, 𝐴𝐿 . Let 𝐴𝐿 have n elements. This we
and a detailed proof is given. The second have 𝑎(𝑥 ⊕ 𝐴𝐿 ) = 𝑎(𝑦 ⊕ 𝐴𝐿 ). But this
arguments uses technical topic, so only a implies that 𝑛𝑥 − 𝑛𝑦 ≡ 0 (mod P),
209
which forces x = y because P is prime Let r = p+ q observe that 𝑥𝑖+1 ≡ 𝑥𝑟 +

and 0<n<p. 𝑝(𝑚𝑜𝑑 𝑟). Since −𝑞 ≡ 𝑝(𝑚𝑜𝑑 𝑟). By induction,
 Every subset other than L or R lies in 𝑥𝑖+𝑘 ≡ 𝑥𝑖 + 𝑝𝑘 (𝑚𝑜𝑑 𝑟). In particular, 𝑥𝑛 ≡
exactly one group. Assume that two 𝑥0 + 𝑛𝑝 (𝑚𝑜𝑑 𝑝 + 𝑞). Since 𝑥𝑛 = 𝑥0 = 0, we
groups shared the same subset E. In deduce that r divides up. However, by
other words, assume that assumption p is relatively prime to 9 and hence
𝐸 = (𝑥 ⊕ 𝐴𝐿 ) ∪ 𝐴𝑅 𝑎𝑛𝑑 𝐸(𝑦 ⊕ 𝐵𝐿 )𝐵𝑅 . also to r, and so n = 𝑚𝑟 for some integer m.
Since n > r is assumed, we have m > 1.
Since both x ⊕ 𝐴𝐿 and y⊕ 𝐵𝐿 are
subsets of L, we have 𝐴𝑅 = 𝐸 ∩ 𝑅 = Let 𝑠𝑖 = 𝑥𝑖+𝑝 − 𝑥𝑖 for I = 0, …, (𝑚 − 1)𝑟. By the
𝐵𝑅 . Thus x ⊕ 𝐴𝐿 = 𝑦 ⊕ 𝐵𝐿 or 𝐵𝐿 = previous observation, 𝑠𝑖 is a multiple of r,
(𝑥 + 𝑦) ⊕ 𝐴𝐿 . This shows that the Moreover 𝑠𝑖+1 − 𝑠𝑖 = (𝑥𝑖+𝑟+1 − 𝑥𝑖+𝑟 ) −
collection of subsets (y⊕ 𝐵𝐿 ) ∪ (𝑥𝑖+1 − 𝑥𝑖 ) ≤ 𝑝— 𝑞 = 𝑟 𝑎𝑛𝑑 𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝑠𝑖+1 −
𝐵𝑅 , 𝑦 = 0, 1, 2, … . , 𝑃 − 1 will be the 𝑠𝑖 > −𝑟.
same as the collection (x ⊕ 𝐴𝐿 )∪
𝐴𝑅 , 𝑥 = 0, 1, 2, … , 𝑃 − 1. It follows that It suffices to show that 𝑠𝑖 = 0 for some I, for
exactly one subsets A in each group then we can take our pair to be (𝑖, 𝑖 + 𝑟).If 𝑠0 =
satisfies 𝜎(A) ≡ 0 (mod P), and the 0, we are done so assume that 𝑠0 > 0 (the
total number of such sub sets is argument for 𝑠0 > 0 is similar). Let 𝑠𝑖 be the
1 2𝑝
[( 2 ) − 2] + 2 first non-negative term among 𝑠0 , … , 𝑠(𝑚−1)𝑟 =
𝑃
In fact, we have proved a little bit 𝑥𝑛 − 𝑥0 = 0. Then 𝑠𝑖 − 1 is negative and 𝑠𝑖 is
more than for any r ≠0 (mod P), there non negative, but both are multipliers of r and
1 2𝑝
are exactly [( ) − 2] they differ by at most r. This can only occur if
𝑝 2
𝑠𝑖−1 = −𝑟 𝑎𝑛𝑑 𝑠𝑖 = 0.
Subsets with element sum congruent
to r modulo P. 44) For any positive integer n, let d(n) denote
the number of positive divisors of n
43) Let p, q, n be positive integers with 𝒑 + (including 1 and n itself). Determine all
𝒒 < 𝑛. Let (𝒙𝟎 , 𝒙𝟏 , … , 𝒙𝒏 ) be an (n+1) 𝒅(𝒏)𝟐
positive integers k such that 𝒅(𝒏)
= 𝒌 for
tuple of integers satisfying the following
conditions. some n.
(a) 𝒙𝟎 = 𝒙𝒏 = 𝟎, (b) For each i with
Sol.: Let n = 𝑃1 𝑎1 … … … . 𝑃𝑟 𝑎𝑟
𝟏 ≤ 𝒊 ≤ 𝒏, either 𝒙𝒊 − 𝒙𝒊−𝟏 =
𝑷 𝒐𝒓 𝒙𝒊 − 𝒙𝒊−𝟏 = −𝒒. Show that 𝑇ℎ𝑒𝑛 𝑑(𝑥) = (𝑎1 + 1)(𝑎2 + 1) … . . (𝑎𝑟 +
there exist indicates i > j with (i, j) 1), 𝑎𝑛𝑑
≠ (0, n) such that 𝒙𝒊 = 𝒙𝒋 .
d(𝑛2 ) = (2𝑎1 + 1)(2𝑎2 + 1) … … … (2𝑎𝑟 + 1).
Sol.: Let d be the greatest common factor of p So the ai must be chosen so that
and q; then the problem with p, q 𝑥𝑖 replaced
𝑝 𝑞 𝑥 (2𝑎1 + 1)(2𝑎2 + 1) … … … . . (2𝛼𝑟 + 1) =
by , , is equivalent to the original problem.
𝑑 𝑑 𝑑 𝐾(𝑎1 + 1)(𝑎2 + 1) … (𝑎𝑟 + 1)
Hence without loss of generality, we may
assume p and q are relatively prime.
210
Since all (2𝑎𝑖 + 1) are odd, this clearly mplies Now write 𝑛 = ℎ𝑥 + 𝐾 𝑤𝑖𝑡ℎ 0 ≤ 𝑘 ≤ 𝑥.
that k must odd. We know that conversely,
given any odd k, can find 𝑎𝑖 . 𝑇ℎ𝑒𝑛 − 1 = (𝑝 − 1)𝑛 = (−1)𝑛 (𝑝 −
1)𝑘 (𝑚𝑜𝑑 𝑞). h cannot be even. Because then
We use a form of induction on k. First, it is true (𝑝 − 1)𝑘 = −1(𝑚𝑜𝑑 𝑞), contradicting the
for k = 1 (take n = 1). Second, we show that if it minimality of x. so h is odd and hence
is true for k, then it is true for 2𝑚 𝑘 − 1. That is (𝑝 − 1)𝑘 = 1 (𝑚𝑜𝑑 𝑞) with 0 ≤ 𝑘 < 𝑥 < 𝑦.
sufficient, since any odd number has the form This contradicts the minimality of y unless k = 0,
2𝑚 𝑘 − 1 for some smaller odd number k. Take so n = ℎ𝑥.
𝑎𝑖 = 2𝑖 [(2𝑚 − 1)𝑘 − 1]𝑓𝑜𝑟 𝑖 = 0, 1, … , 𝑚 − 1.
But x <q, so x = 1, so (𝑝 − 1) = −1 (mod q) p
𝑖+1 (2𝑚
𝑇ℎ𝑒𝑛 2𝑎𝑖 + 1 = 2 − 1)𝐾 − and q are primes so q = p as claimed.
(2𝑖+1 − 1)𝑎𝑛𝑑
So p is the smallest prime divisors of n. We are
𝑎𝑖 + 1 = 2𝑖 (2𝑚 − 1)𝐾 − (2𝑖 − 1). also given that 𝑥 < 2𝑝. so either p = n, or p = 2,
n = 4. The latter dues not work, so we have
So the product of the (2𝑎1 + 1)′𝑆 divided by shown that n = p Evidently n = p = 2 and n = p =
the product of the (𝑎𝑖 + 1)′𝑆 is 2𝑚 (2𝑚 − 3 work. Assume now that p > 3 we show that
1)𝐾 − (2𝑚 − 1)𝑑𝑖𝑣𝑖𝑑𝑒𝑑 𝑏𝑦 (2𝑚 − there are no solutions of this type.
(2𝑚 𝑘−1)
1)𝐾, 𝑜𝑟 .
𝑘 Expand (𝑝 − 1)𝑝 + 1 by the binomial theorem,
Thus if we take these 𝑎𝑖 𝑠 together with those to get (since (−1)𝑝 = −1):
giving k, we get 2𝑚 𝑘 − 1 which completes the 1
induction. 1 + −1 + 𝑝2 − 𝑝(𝑝
2
𝑝(𝑝 − 1)𝑝 − 2
− 1)𝑝2 .
6𝑝3
45) Find all pairs (n, p) of positive integers,
such that :P is prime; 𝒏 ≤ 𝟐𝒑; 𝒂𝒏𝒅 (𝒑 − 𝑇ℎ𝑒 𝑡𝑒𝑟𝑚𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑓𝑟𝑜𝑚 𝑝𝑖 𝑤𝑖𝑡ℎ 𝑖 ≥ 3 are
𝟏)𝒏 + 𝟏 is divisible by 𝒏𝒑−𝟏 obviously divisible by 𝑝3 .
Sol.: Evidently (1, P) is a solution for every prime Since the binomial co-efficient by are integral.
p. Assume n >1 and take q to be the smallest Hence the sum is 𝑃2 + (𝑎 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 𝑃3 ). So
prime divisor of n. we first show that q = p. Let x the sum is not divisible by 𝑃3 . But for 𝑝 >
be the smallest positive integer for which 3, 𝑃𝑝−1 is divisible by 𝑝3 . So it cannot divide
(𝑝 − 1)𝑥 = 1 (𝑚𝑜𝑑 𝑞). Certainly y exists and (𝑝 − 1)𝑝 + 1, and there are no more solutions.
indeed y < q.
Since (𝑝 − 1)𝑞−1 = 1 (𝑚𝑜𝑑 𝑞). We know that

(𝑝 − 1)𝑛 = −1(𝑚𝑜𝑑 𝑞) so x exists also. 46) Determine whether or not there exists a
positive integer n such that n is divisible by
Writing 𝑛 = 𝑠𝑦 + 𝑟, 𝑤𝑖𝑡ℎ 0 ≤ 𝑟 < 𝑦, we exactly 2000 different prime numbers, and
conclude that (𝑝 − 1)𝑟 = −1(𝑚𝑜𝑑 𝑞) and 𝟐𝒏 + 𝟏 is divisible by n.
hence 𝑥 ≤ 𝑟 < 𝑦 (r cannot be zero sine 1 is not
-1(mod q)) Sol.: Note that for a odd b, we have
211
2𝑎𝑏 + 1 = (24 + 1)(2𝑎 (𝑏 − 1) − 2𝑎 (𝑏 − 2) + (3) m divides 2𝑚 + 1. Take k to be a product of

⋯ + 1) and so 2𝑎 + 1 is a factor of 2𝑎𝑏 + 1. It is 1999 distinct prime factors dividing 𝑏2000 .
sufficient therefore to find m such that (1) m Then 𝑛 = 𝑘𝑚 is the required number with
has only a few distinct prime factors (2) 2𝑚 + 1 exactly 2000 distinct prime factors which
has a large number of distinct prime factors (3) divides 2𝑛 + 1.
m divides 2𝑚 + 1 (but not m), so that 𝑘𝑚 has
exactly 2000 factors then 𝑘𝑚 still divides 2𝑚 + 47) Let 𝒂𝟏 , 𝒂𝟐 , … be a sequence of integers
1 and hence 2𝑘𝑚 + 1. with infinitely many negative terms
suppose that for each positive integer n,
The simplest case is where m has only one the numbers 𝒂𝟏 , 𝒂𝟐 , … , 𝒂𝒏 leave n different
distinct prime factor P, in other words it is a remainder on division by n. Prove that
power of P. But if P is a prime, then p divides each integer occurs exactly once in the
2𝑝 − 2, so the only p for which p divides. 2𝑝 + sequence.
1 is 3. So the questions are (1) whether 𝑎𝑛 =
2𝑚 + 1 is divisible by 𝑚 = Sol.: Let 𝐴𝑛 = {𝑎1 , … , 𝑎𝑛 }. Elements of 𝐴𝑛 are
34 𝑎𝑛𝑑 (2)𝑎𝑛 ℎ𝑎𝑠 𝑎 𝑙𝑎𝑟𝑔𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 distinct because they are distinct modulo n.
Observe that, for 𝑎𝑖 , 𝑎𝑗 ∊ 𝐴𝑛 , 𝑘 ≔ |𝑎𝑖 − 𝑎𝑗 | <
𝑜𝑓 𝑑𝑖𝑠𝑡𝑖𝑛𝑐𝑡 𝑝𝑟𝑖𝑚𝑒 𝑓𝑎𝑐𝑡𝑜𝑟 𝑎𝑛+1 =
𝑛, because, otherwise, 𝑎1 𝑎 ∊ 𝑎𝑘 𝑎𝑛𝑑 𝐴𝑖 ≡
𝑎𝑛 (2𝑚 − 2𝑚 + 1), 𝑤ℎ𝑒𝑟𝑒 𝑚 = 3𝑛 but 2𝑚 =
𝑎𝑗 𝑚𝑜𝑑 𝑘. Therefore max 𝐴𝑛 − min 𝐴𝑛 < 𝑛.
(𝑎𝑛−1 ), 𝑆𝑜 𝑎𝑛+1 = 𝑎𝑛 (𝑎𝑛 2 − 3𝑎𝑛 +
3). 𝑁𝑜𝑤 𝑎1 = 9, so an induction show that But 𝐴𝑛 consists of n distinct integers. Therefore,
3𝑛+1 divides 𝑎𝑛 , which answer (1) affirmatively. for 𝑚𝑛 = min 𝐴𝑛 , 𝐴𝑛 = {𝑚𝑛 , 𝑚𝑛+1 , … , 𝑚𝑛 +
𝑛 − 1}
Also, since 𝑎𝑛 is a factor of 𝑎𝑛+1 , any prime
dividing 𝑎𝑛 𝑎𝑙𝑠𝑜 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑎𝑛+1 There are infinitely many negative and positive
numbers in the sequence, therefore all integers
𝑃𝑢𝑡 𝑎𝑛 = 3𝑛+1 𝑏𝑛. Then 𝑏𝑛+1 𝑏𝑛 (32𝑛+1 𝑏𝑛 2 −
have to appear in our sequence. This finishes
3𝑛+2 𝑏𝑛 + 1) the proof.
𝑁𝑜𝑤 (32𝑛+1 𝑏𝑛 2 − 3𝑛+2 𝑏𝑛+1 ) > 1, So, it must

have some prime factor p > 1.
48) Determine all pairs (x, y) of integers such
2𝑛+1 2
But P be 3 or divide 𝑏𝑛 𝑠𝑖𝑛𝑐𝑒 (3 𝑏𝑛 − that 𝟏 + 𝟐𝒙 + 𝟐𝟐𝒙+𝟏 = 𝒚𝟐 .
𝑛+2
3 𝑏𝑛+1 ) is a multiple of 3𝑏𝑛 𝑝𝑙𝑢𝑠 1. 𝑆𝑜 𝑏𝑛+1
has at least one prime factor p >3 which does Sol.: If (x, y) is a solution then obviously 𝑥 ≥ 0
not divide 𝑏𝑛 . 𝑠𝑜 𝑏𝑛+1 has at least h distinct and (𝑥, −𝑦) is a solution too. For x = 0, we get
prime factors greater than 3, which answers (2) the two solutions (0, 2) and (0, −2)
affirmatively. But that is all we need we can
Now let (x, y) be a solution with 𝑥 > 0, without
take m in the first paragraph above to be 32000.
loss of generality confine attention to y > 0. The
(1) m has only one distinct prime factor. equation rewritten as 2𝑥 (1 + 2𝑥+1 ) =
(2) 2𝑚+1 = 32001 𝑏2000 ℎ𝑎𝑠 𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 1999 (𝑦 − 1)(𝑦 + 1). Shows that the factors 𝑦 −
distinct prime factors other than 3. 1 𝑎𝑛𝑑 𝑦 + 1 are even exactly one of them
divisible by 9. Hence 𝑥 ≥ 3 and one of these
212
factors is divisible by 2𝑥−1 but not by 2𝑥 . So 𝑦 = the solution (m, n) = (2k, 1). So assume n > 1.
2𝑥+1 𝑚+𝑒 , 𝑚 𝑜𝑑𝑑, 𝑒 = ±1. Plugging this into 𝑚2
Put 𝑛 = 2𝑚𝑛2 −𝑛3 +1.
the original equation we obtain.
Then we have a quadratic equation for m,
2𝑥 (1 + 2𝑥+1 ) = (2𝑥−1 𝑚 + 𝑒)2 − 1 =
namely 𝑚2 − 2ℎ𝑛2 𝑚 + (𝑛3 − 1)ℎ = 0. This
22𝑥−2 𝑚2 + 2𝑥 me or equivalently, 1 + 2𝑥+1 =
has solutions ℎ𝑛2 ± 𝑁, where N is the positive
2𝑥−2 𝑚2 + 𝑚𝑒
square root of 𝑛2 𝑥 4 − ℎ𝑥 3 + ℎ. Since n >1, 𝑛 ≥
Therefore, 1 − 𝑒𝑚 = 2𝑥−2 (𝑚2 − 1, n is certainly real. But the sum and product of
8) … … … … . (𝑖𝑖)𝑓𝑜𝑟 𝑒 = 1 this yields 𝑚2 − 8 ≤ the roots are both positive, so both roots must
0 i.e. m = 1, which fails to satisfy (ii) For e = -1 be positive. The sum is an integer, so, if one
equation (ii) gives us. root is a positive integer, than so is the other.
1 + 𝑚 = 2𝑥−2 (𝑚2 − 8) ≥ 2 (𝑚2 − The larger root ℎ𝑛2 + 𝑁 is greater than ℎ𝑛2 , so
8)𝑖𝑚𝑝𝑙𝑦𝑖𝑛𝑔 ℎ(𝑛3 −1)
the smaller root < < 𝑛. But note that if
ℎ𝑛2
2𝑚2 − 𝑚 − 17 ≤ 0 ℎ𝑒𝑛𝑐𝑒 𝑚 ≤ 3; on the other 2𝑚 − 𝑛 > 0, then since n > 0, we must have
hand m cannot be 1 by (ii). Because m is odd . the denominator (2𝑚 − 𝑛)𝑛2 + 1 smallest than
these values indeed satisfy the given equation. the numerator and hence 𝑚 − 𝑛. So for the
Recall that then 𝑦 = −23 is also good. Thus we smallest root we cannot have 2𝑚 − 𝑛 > 0. But
have the complete list of solutions 2𝑚 − 𝑛 = 0 for the smaller root. Hence ℎ𝑛2 −
𝑛
(𝑥, 𝑦): (0, 2), (0, −2), (4, 23), (4, −23) 𝑁 = 2.
ℎ 2
Now 𝑁 2 = (ℎ𝑛2 − ) = ℎ2 𝑛4 − ℎ𝑛3 +
2
49) Let n be a positive integer and 𝑛2
ℎ, 𝑠𝑜 ℎ = 4
Thus n must be even, put n = 2k
𝑷𝟏 , 𝑷𝟐 , … , 𝑷𝒏 be n prime numbers all
and get the solutions (𝑚, 𝑛) =
larger than 5. Such that 𝑷𝟏 𝟐 + 𝑷𝟐 𝟐 + ⋯ + (𝑘, 2𝑘)𝑎𝑛𝑑 (8𝑘 4 − 𝑘, 2𝑘). We have shown that
𝑷𝒏 𝟐 is divisible by 6. Prove that 6 divides n. any solutions must be of one of the three forms
given, out it is trivial to check that they are all
Sol.: Through possible remainders when divided
indeed solutions.
by 6 are 0, 1, 2, 3, 4, 5, 𝑝𝑖 being prime 𝑝𝑖 2 will
have to leave only remainder 1 or 5. i.e. 𝑝𝑖 2 is of
the from 6𝑚𝑟 ± 1: so should be 𝑝𝑖, Hence 𝑝𝑖 2
is of the form 6𝑚𝑟 + 1: 𝑠𝑜 𝑝𝑖 2 + ⋯ + 𝑝𝑛 2 is QUADRATIC EQUATIONS
divisible by 6 only when n is divisible by 6. AND EXPRESSIONS
50) Find all pairs (m, n) of (+) integers such that (Objective Type)
𝒎𝟐
𝒊𝒔 (+) 𝒗𝒆 𝒊𝒏𝒕𝒆𝒈𝒆𝒓. 𝝅
𝟐𝒎𝒏𝟐 −𝒏𝟑 +𝟏 1) If 𝟎 < 𝛼 < 𝛽 < 𝛾 < 𝟐 , then equation
𝟏 𝟏 𝟏
Sol.: The denominator is 2𝑚𝑛2 − 𝑛3 + 1 = 𝒙−𝐬𝐢𝐧 𝜶
+
𝒙−𝐬𝐢𝐧 𝜷
+
𝒙−𝐬𝐢𝐧 𝜸
= 𝟎 has
𝑛2 (2𝑚 − 𝑛) + 1, 𝑠𝑜 2𝑚 ≥ 𝑛 > 0. 𝐼𝑓 𝑛 = 1, (a) Imaginary root, (b) real and equal
then m must be even, in other words, we have roots, (c) real and unequal root,
(d) rational roots.
213
𝜋 1 1−3𝑡 2 1
Sol.: Since, 0 < 𝛼 < 𝛽 < 𝛾 < (𝑔𝑖𝑣𝑒𝑛) Case I: For 𝑦 = 3 ⟹ = 3 ⟹ 3 − 9𝑡 2 =
2 3−𝑡 2
3 − 𝑡2
⟹ sin 𝛼 < sin 𝛽 < sin 𝛾
⟹𝑡=0
Now the given equation is
1−3𝑡 2
(𝜒 − sin 𝛽)(𝜒 − sin 𝛾) Case II: For = 3 ⟹ 3−𝑡 2
= 3, ⟹ 1 − 3𝑡 2 =
+ (𝜒 − sin 𝛼)(𝜒 − sin 𝛾) 9 − 3𝑡 2
+ (𝜒 − sin 𝛼)(𝜒 − sin 𝛽) = 0
{not possible}
𝐿𝑒𝑡 𝑓(𝑥) = (𝜒 − sin 𝛽)(𝜒 − sin 𝛾)
∑𝒌−𝟏
𝒓=𝟎 𝒙
𝟐𝒓
+ (𝜒 − sin 𝛼)(𝜒 3) If is a polynomial in x for two
∑𝒌−𝟏
𝒓=𝟎 𝒙
𝒓
− sin 𝛾)
values p and q of k, then roots of equation,
+ (𝜒 − sin 𝛼)(𝜒
𝒙𝟐 + 𝒑𝒙 + 𝒒 = 𝟎 cannot be
− sin 𝛽) = 0
(a) Real; (b) positive (c) rational; (d)
⟹ 𝑓(sin 𝛼) = (sin 𝛼 − sin 𝛽)(sin 𝛼 − irrational
sin 𝛾) > 0
∑𝑘−1
𝑟=0 𝑥
2𝑟
Sol.: ∑𝑘−1 𝑟
is a polynomial in x. i.e.
⟹ 𝑓(sin 𝛽) = (sin 𝛽 − sin 𝛼)(sin 𝛽 − 𝑟=0 𝑥
sin 𝛾) < 0
{1 + 𝑥 2 + 𝑥 4 + ⋯ + 𝑥 2(𝑘−1) } is
⟹ 𝑓(sin 𝛾) = (sin 𝛾 − sin 𝛼)(sin 𝛾 − divisible by {1 + 𝑥 + 𝑥 2 + ⋯ + 𝑥 𝑘−1 }
sin 𝛽) > 0
1−𝑥2𝑘
( ) 1+𝑥 𝑘
1−𝑥2
Hence equation f(x) = 0 has once root between ⟹ 1−𝑥𝑘
= (𝑥 ≠ 1) is a polynomial in x if
( ) 1+𝑥
1−𝑥
sin 𝛼 𝑎𝑛𝑑 sin 𝛽 and other between
sin 𝛽 𝑎𝑛𝑑 sin 𝛾. and only if: (1 + 𝑥 𝑘 ) is divisible by (1 +
𝑥)𝑖𝑓 𝑥 = −1
𝟏
2) If 𝒚 = 𝐜𝐨𝐭 𝒙 𝐭𝐚𝐧 𝟑𝒙 , 𝒕𝒉𝒆𝒏
But it is not possible, because the equation is
𝟏 𝟏
(a) 𝒚 < 𝟑 𝒐𝒓 𝒚 > 3; (b) 𝟑 ≤ 𝒚 ≤ 𝟑; not defined for 𝑥 = −1.
𝟏 𝟏
(c) 𝒚 ≤ 𝟑 𝒐𝒓 𝒚 ≥ 𝟑; (iv) 𝟑 ≤ 𝒚 ≤ 𝟏
Hence, there are no real values of x for which
tan 𝑥 1−3𝑡𝑎𝑛2 𝑥 1−3𝑡 2
the equation is defined.
Sol.: 𝑦 = tan 3𝑥 = 3−𝑡𝑎𝑛2 𝑥
⟹𝑦= 3−𝑡 2
Thus, it can be easily said that the roots of the
2
∴ (𝑦 − 3)𝑡 + 1 − 3𝑦 = equation cannot be Rational.
0 𝑠𝑖𝑛𝑐𝑒 𝑡 𝑖𝑠 𝑟𝑒𝑎𝑙 ⟹ ∆≥ 0
∴ 0 − 4(𝑦 − 3)(1 − 3𝑦) ≥ 0 ⟹

(𝑦 − 3)(1 − 3𝑦) ≤ 0 4) If one root of the equation 𝒂𝒙𝟐 + 𝒃𝒙 +
𝒄 = 𝟎 is reciproed of the other root of the
1 1
⟹ 𝑦 ≤ 𝑜𝑟 𝑦 ≥ 3 ⟹ 𝑦 < 𝑜𝑟 𝑦 > 3. equation 𝒂𝟏 𝒙𝟐 + 𝒃𝟏 𝒙 + 𝒄𝟏 = 𝟎, 𝒕𝒉𝒆𝒏
3 3
(a) (𝒂𝒂𝟏 − 𝒄𝒄𝟏 )𝟐 = (𝒃𝒄𝟏 −
1
(𝐻𝑒𝑟𝑒 𝑦 ≠ 3 , 3) 𝒃𝟏 𝒂)(𝒃𝟏 𝒄 − 𝒂𝟏 𝒃)
214
(b) (𝒂𝒃𝟏 − 𝒂𝟏 𝒃)𝟐 = (𝒃𝒄𝟏 − ⟹ 𝛽 𝑛−1 − 𝛼𝛽 𝑛 + 𝑏𝛽 𝑛−1 =

𝒃𝟏 𝒄)(𝒄𝒂𝟏 − 𝒄𝟏 𝒂) 0 … … … (4),
(c) (𝒃𝒄𝟏 − 𝒃𝟏 𝒄)𝟐 = (𝒄𝒂𝟏 −
Adding (3) & (4), we have
𝒂𝟏 𝒄)(𝒂𝒃𝟏 − 𝒂𝟏 𝒃)
(d) None (𝛼 𝑛+1 + 𝛽 𝑛+1 ) − 𝑎(𝛼 𝑛 + 𝛽 𝑛 ) +
Sol.: Let α be a root of the equation 𝑎𝑥 2 + 𝑏𝑥 + 𝑏(𝛼 𝑛−1 + 𝛽 𝑛−1 ) = 0
𝑐=0 ⟹ 𝑣𝑛+1 − 𝑎𝑣𝑛 + 𝑏𝑣𝑛−1 = 0
1
𝑇ℎ𝑒𝑛, 𝛼 is a root of 𝑎1 𝑥 2 + 𝑏1 𝑥 + 𝑐1 = 0 ∴ 𝑣𝑛+1 − 𝑎𝑣𝑛 − 𝑏𝑣𝑛−1
𝑎 6) Let a, b, c be non-zero real numbers, such
⟹ 𝑎𝛼 2 + 𝑏𝛼 + 𝑐 = 0 … … … (1)& 𝛼12 +
𝑏1 that
+ 𝑐2 = 0 𝟏
𝛼
∫𝟎 (𝟏 + 𝒄𝒐𝒔𝟖 𝒙) (𝒂𝒙𝟐 + 𝒃𝒙 +
𝟐
⟹ 𝑐1 𝛼 2 − 𝑏1 𝛼 + 𝑎1 = 0 … … … . (2) 𝒄)𝒅𝒙 = ∫𝟎 (𝟏 + 𝒄𝒐𝒔𝟖 𝒙) (𝒂𝒙𝟐 +
Since (1) & (2) have one root in common, 𝒃𝒙 + 𝒄)𝒅𝒙

𝛼2 𝛼 1
⟹𝑏𝑎 = 𝑐𝑐 = 𝑎𝑏 Then the quadratic equation 𝒂𝒙𝟐 + 𝒃𝒙 + 𝒄 =
1 −𝑏1 𝑐 1 − 𝑎𝑎1 1 −𝑐1 𝑏
𝟎 has
𝑏𝑎1 −𝑏1 𝑐
⟹ 𝛼2 = ,𝛼 =
𝑎𝑏1 −𝑐1 𝑏 (a) No root in (0, 2); (b) at least one root in (0,
𝑐𝑐1 − 𝑎𝑎1 2
𝑎𝑏1 −𝑐1 𝑏
, 𝑁𝑜𝑤, 𝛼 = (𝛼)2 2); (c) two root in (0, 2); (d) two imaginary
roots
⟹ (𝑏𝑎1 − 𝑏1 𝑐)(𝑎𝑏1 − 𝑐1 𝑏) =
(𝑐𝑐1 − 𝑎𝑎1 )2 Sol.: Consider the function
𝑥
𝜙(𝑥) = ∫ (1 + 𝑐𝑜𝑠 8 𝑥) (𝑎𝑥 2 + 𝑏𝑥
0
5) If α and 𝛽 are the roots of the equation
+ 𝑐)𝑑𝑥 ⟹ 𝑓(1)
𝒙𝟐 − 𝒂𝒙 + 𝒃 = 𝟎 𝒂𝒏𝒅 𝒗𝒏 = 𝜶𝒏 + 𝜷𝒏 then = 𝑓(2) … … . . (1)
which of the following is true?
(a) 𝒗𝒏+𝟏 = 𝒂𝒗𝒏 + 𝒃𝒗𝒏−𝟏 ; (b) 𝒗𝒏+𝟏 = Obviously, (a), 𝜙(x) is continuous on [1, 2] and
𝒃𝒗𝒏 + 𝒂𝒗𝒏−𝟏 ; (c) 𝒗𝒏+𝟏 = 𝒂𝒗𝒏 − (b) differentiable on (1, 2), (c) Also, 𝜙(1) =
𝒃𝒗𝒏−𝟏 ; (d) 𝒗𝒏+𝟏 = 𝒃𝒗𝒏 − 𝒂𝒗𝒏−𝟏 ; 𝜙(2) (given)
Sol.: 𝛼 + 𝛽 ∊ 𝑥 2 − 𝑎𝑥 + 𝑏 = 0 𝛼 2 + 𝑎𝛼 + 𝑏 = Therefore, by Rolle’s theorem there exists at

0 … … … … . (1) least point k ∊ (1, 2) such that 𝜙’(k) = 0
𝑜𝑟 𝛽 2 + 𝑎𝛽 + 𝑏 = 0 … … … … … (2) Now, 𝜙(x) = (1 + 𝑐𝑜𝑠 8 𝑥)(𝑎𝑥 2 + 𝑏𝑥 + 𝑐)
𝑀𝑢𝑙𝑡𝑖𝑝𝑙𝑦𝑖𝑛𝑔 (1)𝑏𝑦 𝛼 𝑛−1 𝑎𝑛𝑑 (2)𝑏𝑦 𝛽 𝑛−1 ∴ 𝜙 ′ (𝑘) = 0

⟹ 𝛼 𝑛−1 − 𝑎𝛼 𝑛 + 𝑏𝛼 𝑛−1 = ⟹ (1 + 𝑐𝑜𝑠 8 𝑥)(𝑎𝑘 2 + 𝑏𝑘 + 𝑐) =
0 … … … … . (3) 0
215
𝜋
⟹ 𝑎𝑘 2 + 𝑏𝑘 + 𝑐 = 0 {∵ Sol.: Given ∫02 {𝑎2 (
cos 3𝑥 3
+ 4 cos 𝑥) + 𝑎 sin 𝑥 −
(1 + 𝑐𝑜𝑠 8 𝑥) ≠ 0} 4
𝑎2 sin 3𝑥 3
20 cos 𝑥} 𝑑𝑥 ≤ 3
⟹ {𝑎2 ( 4
+ 4 sin 𝑥) −
2
⟹ 𝑘 𝑖𝑠 𝑎 𝑟𝑜𝑜𝑡 𝑜𝑓 𝑎𝑥 + 𝑏𝑥 + 𝑐 = 𝜋
𝑎2 1
0 𝑖𝑛 (1, 2) 𝑎 cos 𝑥 − 20 sin 𝑥} | 2
0
≤ − ⟹ 𝑎2 (− +
3 12
3 𝑎2
7) If𝟐𝒂 + 𝟑𝒃 + 𝟔𝒄 = 𝟎 (𝒂, 𝒃, 𝒄 ∊ 𝑹) then the 4
)− 0 − 20 + 𝑎 ≤ 3
quadratic equation 𝒂𝒙𝟐 + 𝒃𝒙 + 𝒄 = 𝟎 has 2 𝑎2
(a) At least one in [0, 1]; (b) at least ⟹ 3 𝑎2 + 𝑎 − 20 + 3
≤ 0 ⟹ 𝑎2 +
one root in [2, 3]; (c) at least one 𝑎 − 20 ≤ 0
root in [4, 5]; (d) none
⟹ (𝑎 + 5)(𝑎 − 4) ≤ 0
𝑎 𝑏
Sol.: (A) Let 𝑓(𝑥) = 3 𝑥 3 + 2 𝑥 2 + 𝑐𝑥. We have Thus, a = 1, 2, 3, 4 {∵ a∊ I}
𝑎 𝑏 2𝑎+3𝑏+6𝑐
𝑓(0) = 0 𝑎𝑛𝑑 𝑓(1) = 3 + 2 + 𝑐 = 6
=
10) If (𝒙 − 𝒄) is a factor of order m of the
0
polynomial f(x) of degree n (𝟏 < 𝑚 < 𝑛),
(∵ 2𝑎 + 3𝑏 + 6𝑐 = 0). then x = c is a root of the polynomial
(a) 𝒇𝒎 (𝒙); (b) 𝒇𝒎−𝟏 (𝒙); (c) 𝒇𝒏 (𝒙);
Thus, 0 and 1 are two roots of f(x) = 0. So, (d) none
𝑓 ′ (𝑥) = 0 𝑖. 𝑒. 𝑎𝑥 2 + 𝑏𝑥 + 𝑐 = 0 has at least
one real root between 0 and 1. Sol.: since (𝑥 − 𝑐) is a factor of order m of the
polynomial 𝑓(𝑥)
8) If α, 𝛽 be the roots of the equation 𝟔𝒙𝟐 −
𝟏 ∴ 𝑓(𝑥) = (𝑥 − 𝑐)𝑚 𝜙(𝑥)
𝟔𝒙 + 𝟏 = 𝟎, 𝒕𝒉𝒆𝒏 (𝒂 + 𝒃𝒙 + 𝒄𝒙𝟐 +
𝟐
𝟏
𝒅𝒙𝟑 ) + 𝟐 (𝒂 + 𝒃𝜷 + 𝒄𝜷𝟐 + 𝒅𝜷𝟐 ) = Where 𝜙(x) is a polynomial of degree (𝑛 − 𝑚)
𝒅 𝒄 𝒃 𝒂
(a) 𝟏
+ 𝟐 + 𝟑 + 𝟏𝟐; (b) 𝟏𝟐𝒂 + 𝟔𝒃 + ⟹ 𝑓(𝑥), 𝑓 ′ (𝑥), … . , 𝑓 (𝑚−1) (𝑥) are all
𝒂 𝒃 𝒄 𝒅
𝟒𝒄 + 𝟗𝒅; (c) 𝟏 + 𝟐 + 𝟑 + 𝟒; (d) zero for x = c but 𝑓 𝑚 (𝑥) ≠ 0 𝑎𝑡 𝑥 = 𝑐.
none 11) The value of a for which one root of
1 (𝒂𝟐 − 𝟓𝒂 + 𝟑)𝒙𝟐 + 𝒙(𝟑𝒂 − 𝟏)𝒂 + 𝟐 = 𝟎
Sol.: Here 𝛼 + 𝛽 = 1, 𝛼𝛽 = 6. Thus the given
1
is twice as large as the other is
expression 2 {(𝑎 + 𝑏) + 𝑏(𝛼 + 𝛽) + 𝟏 𝟏 𝟐
(a) 𝟑; (b) − 𝟑; (c) 𝟑, (d) none
𝑎 𝑏 𝑐 𝑑
𝑐(𝛼 2 + 𝛽 2 ) + 𝑑(𝛼 3 + 𝛽 3 )} = + 1 2
+3 + 4
after calculation of values. Sol.: Let α and 2α be the two roots of the given
equation. So,
9) If a is a positive integer, the number of
3𝑎−1
values of a satisfying 𝛼 + 2𝛼 = − 𝑎2 −5𝑎+3 𝑎𝑛𝑑
𝝅
𝐜𝐨𝐬 𝟑𝒙 𝟑
∫𝟎𝟐 {𝒂𝟐 ( + 𝟒 𝐜𝐨𝐬 𝒙) + 𝒂 𝐬𝐢𝐧 𝒙 − 2
𝟒 2𝛼 2 = 𝑎2 −5𝑎+3 , ⟹ 𝛼 =
𝒂𝟐
𝟐𝟎 𝐜𝐨𝐬 𝒙} 𝒅𝒙 ≤ − , 3𝑎−1
𝟑 − 3(𝑎2 −5𝑎+3) 𝑎𝑛𝑑
(a) Only one; (b) two; (c) three; (d)
none
216
1 1 Sol.: Since on solving, we have 𝑥 + 𝑦 + 𝑧 = 0

𝛼2 = ,⟹ 2
𝑎2 − 5𝑎 + 3 𝑎 − 5𝑎 + 3
(3𝑎 − 1)2 ∴ 𝑥 3 + 𝑦 3 + 𝑧 3 = 3𝑥𝑦𝑧 (by definition)
=
9(𝑥 2 − 5𝑎 + 3)
14) The range of values of a for which all the
[∵ 𝛼 =2 (𝛼)2 ], 2 roots of the equation
⟹ 9(𝑎 − 5𝑎 + 3)
= (3𝑎 − 1)2 (𝒂 − 𝟏)(𝟏 + 𝒙 + 𝒙𝟐 ) =
(𝒂 + 𝟏)(𝟏 + 𝒙𝟐 + 𝒙𝟒 ) are
(∵ 𝑎2 − 5𝑎 + 3 ≠ 0), ⟹ −39 + 26
2 imaginary is
= 0, ⟹ 𝑎 = . (a) [−∞, −𝟐]; (b) [𝟐, ∞]; (c) −𝟐 < 𝑎 < 2;
3
(d) none
𝒂𝟐 𝒃𝟐 𝒄𝟐
12) Equation 𝒙−𝜶 + 𝒙−𝜷 + 𝒙−𝝂 = 𝒎 −
Sol.:
𝒏𝟐 𝒙 (𝒂, 𝒃, 𝒄, 𝒎, 𝒏 ∊ 𝑹) has necessarily (1 + 𝑥 + 𝑥 2 )[(𝑎 − 1)(1 − 𝑥 + 𝑥 2 ) −
(a) All the roots real; (b) all the roots (𝑎 + 1)(1 − 𝑥 + 𝑥 3 )]
imaginary; (c) two real and two
imaginary (d) none = 0 (1 + 𝑥 + 𝑥 2 =
0 ℎ𝑎𝑠 𝑖𝑚𝑎𝑔𝑖𝑛𝑎𝑟𝑦 𝑟𝑜𝑜𝑡𝑠)
Sol.: Let 𝑃 + 𝐿𝑞 be a root of given equation
⟹ −2 (1 + 𝑥 2 ) + 2𝑎𝑥 = 0, must have
𝑎2 𝑏2 𝑐2 imaginary roots.
∴ 𝑝−𝛼+𝑙 + 𝑝−𝛽+𝑙 + 𝑝−𝛾+𝑙
𝑞 𝑞 𝑞
⟹ 𝑥 3 − 𝑎𝑥 + 1, must have imaginary roots

𝑎 2 {𝑝−𝛼+𝑙𝑞 } 𝑏2 {(𝑝−𝛽)−𝑙𝑞 }
⟹ (𝑝−𝛼)2 +𝑞2
+ (𝑝−𝛽)2 +𝑞2
+
⟹𝑎2 − 4 < 0 ⟹ −2 < 𝑎 < 2.
𝑐 2 {(𝑝−𝛾)−𝑙𝑞 } 2 2
(𝑝−𝛾)2 +𝑞2
= 𝑚 − 𝑛 𝑝 − 𝑙𝑛 𝑞
15) If a, b , c are non-zero, unequal rational
According to law of equality of complex number then the roots the equation
numbers, we have 𝒂𝒃𝒄𝟐 𝒙𝟐 + (𝟑𝒂𝟐 + 𝒃𝟐 )𝒄𝒙 − 𝟔𝒂𝟐 − 𝒂𝒃 +
𝟐𝒃𝟐 = 𝟎 are
𝑎2 𝑏2 (a) Rational; (b) imaginary; (c)
𝑞[ +
(𝑝 − 𝛼)2 + 𝑞 2 (𝑝 − 𝛽)2 + 𝑞 2 irrational; (d) none
𝑐2
+ + 𝑛2 ] Sol.:
(𝑝 − 𝛾)2 + 𝑞 2
= 0∴𝑞=0
∆= 𝑐 2 (3𝑎2 + 𝑏 2 )2 − 4𝑎𝑏𝑐 2 (−6𝑎2 −
𝐻𝑒𝑛𝑐𝑒 𝑝 + 𝑙𝑞 = 𝑝 is a real number. 𝑎𝑏 + 2𝑏 2 )
⟹ ∆ = 𝑐 2 (3𝑎2 − 𝑏 2 + 4𝑎𝑏)2
13) If 𝒙 = (𝜷 − 𝜸)(𝜶 − 𝜹), 𝒚 = (𝜸 − 𝜶)(𝜷 − 16) If the equation 𝒙𝟐 − 𝟑𝒙𝒌 + 𝟐𝒆𝟐 𝐥𝐨𝐠 𝒌 − 𝟏 =
𝜹) 𝒛 = (𝜶 − 𝜹)(𝜸 − 𝜹) then the value of 𝟎 has real roots such that the product of
𝒙𝟑 + 𝒚𝟑 + 𝒛𝟑 − 𝟑𝒙𝒚𝒛 is roots is 7, then the value of k is
(a) 0; (b) 𝜶𝟔 + 𝜷𝟔 + 𝜸𝟔 + 𝜹𝟔 ; (c) (a) ±𝟏; (b) ±𝟐; (c) ±𝟑; (d) none
𝜶𝟔 𝜷𝟔 𝜸𝟔 𝜹𝟔 ; (d) none 2
Sol.: Since, 𝑒 2 log 𝑘 𝑒 log 𝑘 = 𝑘 2
217
∴ The given equation is 𝑥 2 − 3𝑘𝑥 + 19) Both the root of the equation
(2𝑘 2 − 1) = 0 (𝒙 − 𝒃)(𝒙 − 𝒄) + (𝒙 − 𝒄)(𝒙 −
𝒂) + (𝒙 − 𝒂)(𝒙 + 𝒃) = 𝟎 are
Now, product of roots = 7 (given) always:
⟹2𝑘 2 − 1 = 7 ∴ 𝑘 = ±2 (a) Positive; (b) negative; (c) real; (d)
none
17) Product of real root of 𝒕𝟐 𝒙𝟐 + |𝒙| + 𝟗 = 𝟎,
(a) Is always positive; (b) is always Sol.: The given equation can be written as
negative; (c) does not exist; (d) 3𝑥 2 − 2𝑥(𝑎 + 𝑏 + 𝑐) + 𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎 = 0.
none. 𝑁𝑜𝑤, ∆ 4(𝑎 + 𝑏 + 𝑐)2 − 12(𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎)
Sol.: Since the equation 𝑡 2 𝑥 2 + |𝑥| + 9 = 0 is ⟹ ∆= 2 [(𝑏 − 𝑐)2 + (𝑐 − 𝑎)2 +
always positive for all x ∊ R. (𝑎 − 𝑏)2 ] ⟹ ∆≥ 0. Hence the roots are
real.
∴ The equation does not possess real root.
20) If x denotes the set of real number p for
18) If a, b, c are real and 𝒙𝟑 − 𝟑𝒃𝟐 𝒙 + 𝟐𝒄𝟑 is
which 𝒙𝟐 = 𝒑(𝒙 + 𝒑) has a its roots
divisible by (𝒙 − 𝒂)𝒂𝒏𝒅 (𝒙 − 𝒃), then
greater than P, then x is equal to
(a) 𝒂 = −𝒃 = −𝒄; (b) 𝒂 = 𝟐𝒃 = 𝟐𝒄;
𝟏 𝟏 𝟏
(c) 𝒂 = 𝒃 = 𝒄; 𝒐𝒓 𝒂 = −𝟐𝒃 = (a) (−𝟐, − ), (b) (− , ), (c) null
𝟐 𝟐 𝟒
−𝟐𝒄; (d) none set, (d) (−∞, 𝟎)
Sol.: Since, 𝑓(𝑥) = 𝑥 3 3𝑏 2 𝑥 + 2𝑐 3 is divisible by Sol.: Since the roots are greater than p, i.e. p
𝑥 − 𝑎 𝑎𝑛𝑑 𝑥 − 𝑏 ∴ 𝑓(𝑎) = 0 lies outside both the roots, such that 𝑎𝑓(𝑝) >
0
⟹ 𝑎3 − 3𝑏 2 𝑎 + 2𝑐 3 =
0 … … … . . (1)𝑎𝑛𝑑 𝑓(𝑏) = 0 ⟹ 1(𝑝2 − 2𝑝2 ) > 0 ⟹ 𝑝2 > 0 which
is impossible.
⟹ 𝑏 3 − 3𝑏 3 + 2𝑐 3 =
0 … … (2)𝑎𝑛𝑑 ⟹ −2𝑏3 + 2𝑐 3 = 0 𝐻𝑒𝑛𝑐𝑒, 𝑥 = {𝑝|𝑝 ∊ 𝜙}
∴ 𝑏 = 𝑐. 𝑃𝑢𝑡𝑡𝑖𝑛𝑔, 𝑏 = 𝑐 𝑖𝑛 (1), 𝑤𝑒 𝑔𝑒𝑡. 21) If a and b are rational and 𝛼, 𝛽 be the roots
of 𝒙𝟐 + 𝟐𝒂𝒙 + 𝒃 = 𝟎, then the equation
𝑎3 − 3𝑎𝑏 2 + 2𝑏 3 = 0 ⟹ (𝑎 − 𝑏)(𝑥 2 +
with rational coefficients are one of whose
𝑎𝑏 − 2𝑏 2 ) = 0
roots in 𝜶 + 𝜷 + √𝜶𝟐 + 𝜷𝟐 is
2 2
⟹ 𝑎 − 𝑏 𝑜𝑟 𝑎 + 𝑎𝑏 + 2𝑏 . 𝑇ℎ𝑢𝑠, 𝑎 = (a) 𝒙𝟐 + 𝟒𝒂𝒙 + 𝟐𝒃 = 𝟎; (b) 𝒙𝟐 +
𝑏=𝑐 𝟒𝒂𝒙 − 𝟐𝒃 = 𝟎; (c) 𝒙𝟐 − 𝟒𝒂𝒙 +
𝟐𝒃 = 𝟎; (d) 𝒙𝟐 − 𝟒𝒂𝒙 − 𝟐𝒃 = 𝟎
𝑜𝑟 𝑎2 + 𝑎𝑏 = 2𝑏 2 ⟹ 𝑎 = 𝑏 = 𝑐 𝑎𝑛𝑑
(𝑎 + 2𝑏)(𝑎 − 𝑏) = 0 ⟹ 𝑎 = 𝑏 = Sol.: Since, 𝛼, 𝛽 ∊ 𝑥 2 + 2𝑎𝑥 + 𝑏 = 0(𝑔𝑖𝑣𝑒𝑛)

𝑐 𝑎𝑛𝑑 𝑎 = −2𝑏 ∴ 𝛼 + 𝛽 = −2𝑎 𝑎𝑛𝑑 𝛼𝛽 = 𝑏
∴ 𝑎 = 𝑏 = 𝑐 𝑎𝑛𝑑 𝑎 = −2𝑏 = −2𝑐
𝐿𝑒𝑡 𝑦 = 𝛼 + 𝛽 + √𝛼 2 + 𝛽 2
218
⟹ (𝑦 + 2𝑎)2 = 𝛼 2 + 𝛽 2 = 23) If 𝐬𝐢𝐧 𝜶 𝒂𝒏𝒅 𝐜𝐨𝐬 𝜶 are roots of the

(𝛼 2 + 𝛽 2 )2 − 2𝛼𝛽 = 4𝑎2 − 2𝑏 equation 𝒑𝒙𝟐 + 𝒒𝒙 + 𝒓 = 𝟎, 𝒕𝒉𝒆𝒏
(a) 𝒑𝟐 − 𝒒𝟐 + 𝟐𝒑𝒓 = 𝟎; (b)
⟹ 𝑦 2 + 4𝑎𝑦 + 2𝑏 = 0.
(𝒑 + 𝒓)𝟐 = 𝒒𝟐 − 𝒓𝟐 ; (c) 𝒑𝟐 +
The required equation is 𝑥 2 + 4𝑎𝑦 + 2𝑏 = 0 𝒒𝟐 − 𝟐𝒑𝒓 = 𝟎; (d) (𝒑 − 𝒓)𝟐 =
𝒒𝟐 + 𝒓𝟐
22) Let 𝒇(𝒙) = 𝒙𝟑 + 𝒙𝟐 + 𝟏𝟎𝟎𝒙 + 𝟕 𝐬𝐢𝐧 𝒙,
then the equation 𝒚−𝒇
𝟏
+ 𝒚−𝒇
𝟐 𝟑
+ 𝒚−𝒇 = Sol.: sin 𝛼 , cos 𝛼 𝑝𝑥 2 + 𝑞𝑥 + 𝑟 = 0
(𝟏) (𝟐) (𝟑)
𝑞
𝟎 has ⟹ sin 𝛼 + cos 𝛼 = − 𝑝 and since
(a) No real root; (b) one real root; 𝑟
𝛼 cos 𝛼 = 𝑝
(c) two real roots; (d) more
than two real roots.
𝑞2
⟹ (sin 𝛼 + cos 𝛼)2 =
Sol.: 𝑓(𝑥) = 𝑥 3 + 𝑥 2 + 100𝑥 + 7 sin 𝑥 𝑝2
∴ 𝑓 ′ (𝑥) = 3𝑥 2 + 2𝑥 + 100 + 7 cos 𝑥 𝑞2 2𝑟

⟹ 1 + 2 sin 𝛼 cos 𝛼 = 2
⟹1+
𝑝 𝑝
⟹ 𝑓 ′ (𝑥) = 3𝑥 2 + 2𝑥 + 93 + 7(1 + cos 𝑥) > 0 𝑞2
=
𝑝2
∴ f(x) is an increasing function.
∴ 𝑃2 − 𝑞 2 + 2𝑝𝑟 = 0
⟹ 𝑓(1) < 𝑓(2) < 𝑓(3) 𝑙𝑒𝑡 𝑓(1) = 𝑎, 𝑓(2) =
𝑏, 𝑓(3) = 𝑐, 𝑡ℎ𝑒𝑛 𝑎 < 𝑏 < 𝑐 … … … (1) 24) The roots of the equation 𝟖𝒙𝟐 − 𝟏𝟎𝒙 +
𝟏
1 2 3 𝟑 = 𝟎 are 𝛼 and 𝜷𝟐 > 𝟐, then the equation
Now given equation is 𝑦−𝑎 + + 𝑦−𝑐 =0
𝑦−𝑏 whose roots are (𝜶 + 𝒊𝜷)𝟏𝟎𝟎 𝒂𝒏𝒅 (𝜶 −
⟹ (𝑦 − 𝑏)(𝑦 − 𝑐) + 2(𝑦 − 𝑎)(𝑦 − 𝑐) + 𝒊𝜷)𝟏𝟎𝟎 is
3(𝑦 − 𝑎)(𝑦 − 𝑏) = 0 (a) 𝒙𝟐 − 𝒙 + 𝟏 = 𝟎; (b) 𝒙𝟐 + 𝒙 + 𝟏 =
𝟎; (c) 𝒙𝟐 − 𝒙 − 𝟏 = 𝟎; (d) none
𝐿𝑒𝑡
1 3
Sol.: Since 𝑓(𝑥) = (2𝑥 − 1)(4𝑥 − 3) ∴ 𝑥 = 2 , 4
𝑔(𝑦) = (𝑦 − 𝑏)(𝑦 − 𝑐) + 2(𝑦 − 𝑎)(𝑦 − 𝑐) +
3(𝑦 − 𝑎)(𝑦 − 𝑏) 1 3
𝑁𝑜𝑤, 𝛼 = 2 𝑎𝑛𝑑 𝛽 2 = 4 {∴ 𝛽 2 >
⟹ 𝑔(𝑎) = (𝑎 − 𝑏)(𝑎 − 𝑐) > 0 1
(𝑔𝑖𝑣𝑒𝑛)}
2
⟹ 𝑔(𝑏) = 2(𝑏 − 𝑎)(𝑏 − 𝑐) < 0
1 √3 𝑙𝜋
𝛼 + 𝑖𝛽 = + = 𝑟𝑒 𝑖𝜃 = 𝑒 3 ⟹ 𝑟
⟹ 𝑔(𝑐) = 3(𝑐 − 𝑎)(𝑐 − 𝑏) > 0 2 2
𝜋
= 1 𝑎𝑛𝑑 𝛩 =
∴ given equation 𝑔(𝑦) = 0 has one real root 3
between a and b and other between b and c. 𝑖𝜋
𝐴𝑙𝑠𝑜 , 𝛼 − 𝑖𝛽 = 𝑒 − (𝑐𝑜𝑛𝑗𝑢𝑔𝑎𝑡𝑒)
3
219
𝑙100𝜋 𝑙𝜋 = 𝑎𝑦 3 + (3𝑎𝑦 + 𝑏)𝑦 2 + (3𝑎𝑦 2 + 2𝑏𝑦 +

∴ (𝛼 + 𝑖𝛽)100 = 𝑒 3 = 𝑒 𝑖.3.3𝜋 . 𝑒 3
𝑙𝜋 𝑐) + 𝑎𝑦 3 + 𝑏𝑦 2 + 𝑐𝑦 + 𝑑 collecting all a, b, & c
= −𝑒 3 terms
𝐴𝑙𝑠𝑜, (𝛼 − 𝑖𝛽)100 = 𝑎[𝑦 3 + 𝑦 3 + 3𝑦 2 𝑦 + 3𝑦𝑦 2 ] +

𝑙𝜋
= −𝑒 − 3 (𝑐𝑜𝑛𝑗𝑢𝑔𝑎𝑡𝑒) 𝑏[𝑦 2 + 𝑦 2 + 2𝑦𝑦] + 𝑐(𝑦 + 𝑦) + 𝑑
𝑙𝜋 𝑙𝜋 𝜋 = 𝑎(𝑦 + 𝑦)3 + 𝑏(𝑦 + 𝑦)2 + 𝑐(𝑦 +

𝑆𝑢𝑚 = − (𝑒 3 + 𝑒3) = −2 cos 𝑦)𝑑 … … (3)
3
= −1
⟹ 𝜙(𝑦) = 𝑓(𝑦+𝑦) key point. Let 𝑦 + 𝑦 = 𝑥 ⟹
Product = 1 𝑦 =𝑥−𝑦
∴ Required equation is 𝑥 2 + 𝑥 + 1 = 0 Hence which means the roots of (1) are

decreased by quality y.
∴ If 𝛼1 , 𝛼2 , 𝛼3 a are the roots of (1), and

(SUBJECTIVE TYPE)
𝛽1 , 𝛽2 , 𝛽3 , are the roots of (2), then 𝛼1 −
1) If the root of 𝒇(𝒙) = 𝒂𝒙𝟑 + 𝒃𝒙𝟐 + 𝒄𝒙 + 𝑦 = 𝛽1 ; 𝛼2 − 𝑦 = 𝛽2 ; 𝛼3 − 𝑦 = 𝛽3
𝒅 = 𝟎 are 𝜶𝟏 , 𝜶𝟐 , 𝜶𝟑 and the root of 𝜙(y) = ⟹ 𝛼1 − 𝛽1 = 𝑦; 𝛼2 − 𝛽2 = 𝑦; 𝛼3 − 𝛽3 = 𝑦
𝒇′′ (𝒚)
𝒂𝒚𝟑 + 𝟐!
⟹ 𝛼1 − 𝛽1 = 𝛼2 − 𝛽2 = 𝛼3 − 𝛽3 𝑃𝑟𝑜𝑣𝑒𝑑.
𝒇′ (𝒚)
𝒚𝟐 + 𝟏!
𝒛 + 𝒇(𝒚) =
𝟎 𝒂𝒓𝒆 𝜷𝟏 , 𝜷𝟐 , 𝜷𝟑 , then show that
𝜶𝟏 − 𝜷𝟏 = 𝜶𝟐 − 𝜷𝟐 = 𝜶𝟑 − 𝜷𝟑 . 2) If 𝛼, 𝛽, 𝛽, y, y, 𝛼 are the roots of 𝒂𝒊 𝒙𝟐 +
Sol.: Consider 𝑓(𝑥) = 𝑎𝑥 3 + 𝑏𝑥 2 + 𝑐𝑥 + 𝒃𝒊 𝒙 + 𝒄𝒊 = 𝟏, 𝟐, 𝟑; then show that
𝑑 … … … … (1) (𝜶 + 𝜷 + 𝜸) + (𝜶𝜷 + 𝜷𝒚 + 𝒚𝜶) + 𝜶𝜷𝜸 =
𝟏
𝒂𝒊 −𝒃𝒊 +𝒄𝒊 𝟐
𝑓 ′′ (𝑦) 2 𝑓 ′ (𝑦) {∏𝟑𝒊=𝟎 𝒂𝒊
} − 𝟏.
3
𝜙(𝑦) = 𝑎𝑦 + 𝑦 + 𝑦
2! 1!
+ 𝑓(𝑦) Sol.: Since 𝛼, 𝛽 are roots of 𝑎𝑖 𝑥 2 + 𝑏𝑖 𝑥 + 𝑐𝑖 = 0
= 0 … … … . (2) −𝑏1 𝑐1
∴ 𝛼+𝛽 = & 𝛼𝛽 =
𝑁𝑜𝑤 𝑓(𝑦) = 𝑎𝑦 3 + 𝑏𝑦 2 + 𝑐𝑦 + 𝑑, 𝑓 ′ (𝑦) = 𝑎1 𝑎1
3𝑎𝑦 2 + 2𝑏𝑦 + 𝑐 −𝑏1 𝑐1

1 + 𝛼 + 𝛽 + 𝛼𝛽 = 1 − +
𝑎1 𝑎1
𝑓′′(𝑦) = 6𝑎𝑦 + 2𝑏 𝑎1 − 𝑏1 + 𝑐1
=( )
Substituting above values in equation (2), we 𝑎1
get ⟹ (1 + 𝛼)(1 + 𝛽)
(6𝑎𝑦+2𝑏)
𝑎1 − 𝑏1 + 𝑐1
𝜙(𝑦) = 𝑎𝑦 3 + 𝑦 2 + (3𝑎𝑦 2 + 2𝑏𝑦 + =( ) … … … . . (1)
2! 𝑎1
𝑐)𝑦 + 𝑎𝑦 3 + 𝑏𝑦 2 + 𝑐𝑦 + 𝑑
220
𝑠𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 (1 + 𝛽)(1 + 𝛾) Multiplying equation (2) and (3), we get

𝑎2 − 𝑏2 + 𝑐2
=( ) … … … … (2)𝑎𝑛𝑑 {(1 − 𝑝2 + 𝑝4 ) + 𝑖(𝑝3 − 𝑝1 )}{(1 −
𝑎2
𝑝2 + 𝑝4 ) − 𝑖(𝑝3 − 𝑝1 )}
𝑎3 − 𝑏3 + 𝑐3
(1 + 𝛾)(1 + 𝛼) = ( ) … … … . (3) = (𝑖 − 𝑎)(𝑖 − 𝑏)(𝑖 − 𝑐)(𝑖 − 𝑑)(−𝑖 −
𝑎3
𝑎)(−𝑖 − 𝑏)(−𝑖 − 𝑐)(−𝑖 − 𝑑)
Multiplying equation (1),(2) and (3). We get,
(1 + 𝛼)2 (1 + 𝛽)2 (1 + 𝛾)2 = ⟹ (1 − 𝑝2 + 𝑝4 )2 + (𝑝3 − 𝑝1 )3 =
𝑎𝑖 −𝑏𝑖 +𝑐𝑖 (𝑖 + 𝑎2 )(𝑖 + 𝑏 2 )(𝑖 + 𝑐 2 )(1 + 𝑑2 ).
∏3𝑖=1 ( ) ⟹ 1 + 𝛼 + 𝛽 + 𝛾 + 𝛼𝛽 +
𝑎𝑖
𝑎 −𝑏 +𝑐
1
4) If 𝜷 + 𝒄𝒐𝒔𝟐 𝜶, 𝜷 +
(∏3𝑖=1 ( 𝑖 𝑎 𝑖 𝑖))
2
𝛽𝛾 + 𝛾𝛼 + 𝛼𝛽𝛾 = 𝒔𝒊𝒏𝟐 𝜶 𝒂𝒓𝒆 𝒕𝒉𝒆 𝒓𝒐𝒐𝒕𝒔 𝒐𝒇 𝒙𝟐 + 𝟐𝒃𝒙 + 𝒄 =
𝑖
𝟎 𝒂𝒏𝒅 𝒚 + 𝒄𝒐𝒔𝟒 𝜶, 𝒚 + 𝒔𝒊𝒏𝟒 𝜶 are the roots

⟹ (𝛼 + 𝛽 + 𝛾) + (𝛼𝛽 + 𝛽𝛾 + 𝛾𝛼) + 𝛼𝛽𝛾
1
of 𝒙𝟐 + 𝟐𝒃𝒙 + 𝒄 = 𝟎, the prove that 𝒃𝟐 −
3
𝑎𝑖 − 𝑏𝑖 + 𝑐𝑖
2 𝑩𝟐 = 𝒄 − 𝑪.
= (∏ ( )) − 1.
𝑎𝑖
𝑖=1 Sol.: If 𝛼, 𝛽 are the roots of equation 𝑎𝑥 2 +
𝑏𝑥 + 𝑐 = 0𝑡ℎ𝑒𝑛 (𝛼 − 𝛽)2 = (𝛼 + 𝛽)2 −
3) If a, b, c, d are the roots of the equation 𝑏2 4𝑐 𝑏2 −4𝑎𝑐
𝒙𝟒 + 𝒑𝟏 𝒙𝟑 + 𝒑𝟐 𝒙𝟐 + 𝒑𝟒 = 𝟎, 4𝛼𝛽 = 𝑎2 − 𝑎
= 𝑎2
𝑠𝑖𝑛𝑐𝑒
𝒕𝒉𝒆𝒏 𝒔𝒉𝒐𝒘 𝒕𝒉𝒂𝒕 (𝟏 + 𝒂𝟐 )(𝟏 + 𝒃𝟐 )(𝟏 +
(𝛽 + 𝑐𝑜𝑠 2 𝛼), (𝛽 + 𝑠𝑖𝑛2 𝛼) are roots of equation
𝒄𝟐 )(𝟏 + 𝒅𝟐 ) = (𝟏 − 𝒑𝟐 + 𝒑𝟒 ) +
𝑥 2 + 2𝑏𝑥 + 𝑐 = 0
(𝒑𝟑 − 𝒑𝟏 )𝟐
∴ {(𝛽 + 𝑐𝑜𝑠 2 𝛼), −(𝛽 + 𝑠𝑖𝑛2 𝛼)}2
Sol.: As a, b, c, d are the roots of the given
4𝑏 2 − 4𝑐
equation =
𝑙2
∴ 𝑥 4 + 𝑝1 𝑥 3 + 𝑝2 𝑥 2 + 𝑝3 𝑥 + 𝑝4 = ⟹ 𝑐𝑜𝑠 2 2𝛼 = 4(𝑏 2 − 𝑐) … … … . (1)
(𝑥 − 𝑎)(𝑥 − 𝑏)(𝑥 − 𝑐)(𝑥 −
𝑑) … … … … . . (1) 𝐴𝑙𝑠𝑜, [(𝛾 + 𝑐𝑜𝑠 4 𝛼) − (𝛾 + 𝑠𝑖𝑛4 𝛼)]2
4𝐵2 − 4𝑐
Equation (1) is an identity, so we put x = i on =
𝑙2
both sides
⟹ (𝑐𝑜𝑠 4 𝛼 − 𝑠𝑖𝑛4 𝛼)2 = 4(𝐵2 −
4 3 2
= 𝑖 + 𝑝1 𝑖 + 𝑝2 𝑖 + 𝑝3 𝑖 + 𝑝4 = 𝐶) … … . (2)
(𝑖 − 𝑎)(𝑖 − 𝑏)(𝑖 − 𝑐)(𝑖 − 𝑑)
⟹ (𝑐𝑜𝑠 2 𝛼 + 𝑠𝑖𝑛2 𝛼)(𝑐𝑜𝑠 2 𝛼 −
⟹ (1 − 𝑝2 + 𝑝4 ) + 𝑖(𝑝3 − 𝑝1 ) = 𝑠𝑖𝑛2 𝛼) = 4(𝐵2 − 𝐶).
(𝑖 − 𝑎)(𝑖 − 𝑏)(𝑖 − 𝑐)(𝑖 − 𝑑) … … … (2)
From equation (1) and (2), we get
Again putting 𝑥 = −𝑖 on equation (1), we get 4(𝑏 2 − 𝑐) = 4(𝐵2 − 𝐶)
(1 − 𝑝2 + 𝑝4 ) − 𝑖(𝑝3 − 𝑝1 ) = ⟹ 𝑏 2 − 𝐵2 = 𝑐 − 𝐶 𝑃𝑟𝑜𝑣𝑒𝑑
(−𝑖 − 𝑎)(−𝑖 − 𝑏)(−𝑖 − 𝑐)(−𝑖 −
𝑑) … … … . . (3)
221
5) Show that for any real numbers 𝐹𝑟𝑜𝑚 (𝑎1 𝑎3 𝑎5 +

𝒂𝟑 , 𝒂𝟒 , … , 𝒂𝟖𝟓 , the roots of the equation 𝑎2 𝑎4 𝑎6 )𝑤𝑒 𝑐𝑎𝑛 𝑤𝑟𝑖𝑡𝑒 𝑓(𝑥) 𝑖𝑛 𝑓𝑜𝑟𝑚 𝑜𝑓
𝒂𝟖𝟓 𝒙𝟖𝟓 + 𝒂𝟖𝟒 𝒙𝟖𝟒 + ⋯ + 𝒂𝟑 𝒙𝟑 + 𝟑𝒙𝟐 +
𝑓(𝑥) = 𝑝(𝑥 − 𝑎1 )(𝑥 − 𝑎3 )(𝑥 − 𝑎5 ) +
𝟐𝒙 + 𝟏 = 𝟎 are real.
𝑞(𝑥 − 𝑎2 )(𝑥 − 𝑎4 )(𝑥 − 𝑎6 )
Sol.: Let
⟹ 𝑓(𝑥) = (𝑥 − 𝑎1 )(𝑥 − 𝑎3 ) (𝑥 − 𝑎5 ) +
𝑃(𝑥) = 𝑎85 𝑥 85 + ⋯ + 𝑎3 𝑥 3 + 3𝑥 2 + (𝑥 − 𝑎2 )(𝑥 − 𝑎4 )(𝑥 − 𝑎6 ) … … . (1)
2𝑥 + 1 = 0 … … … . (1)
𝑓(𝑥) > 0 ∀ 𝑥 > 𝑎1 , 𝑓(𝑥) < 0 ∀𝑎2 > 𝑥 > 𝑎1
𝑠𝑖𝑛𝑐𝑒 𝑃(𝑥) = 1, then 0 is not a root of (1).
𝑓(𝑥) > 0 ∀ 𝑎4 > 𝑥 > 𝑎6 , 𝑓(𝑥) < 0 ∀ 𝑎6 > 𝑥
𝐿𝑒𝑡 𝛼1 , 𝛼2 , 𝛼3 , … , 𝛼85 be the complex root of (1)
So from properties of continuous function we
1
𝑇ℎ𝑒𝑛 𝑡ℎ𝑒 𝛽𝑖 (𝑙𝑒𝑡 𝛼 ) are the complex roots of say that equation 𝑓(𝑥) = 0 have three real
𝑖
roots.
the polynomial
7) Suppose the root of the equation
𝑄(𝑦) = 𝑦 85 + 2𝑦 85 + 3𝑦 85 + 𝑎3 𝑦 82 + ⋯ +
𝒙𝒏 − 𝒂𝟏 𝒙𝒏−𝟏 + 𝒂𝟐 𝒙𝒏−𝟐 + ⋯ +
𝑎85 .
𝒂𝒏−𝟏 𝒙 + 𝒂𝒏 = 𝟎 are real
𝐼𝑡 𝑓𝑜𝑙𝑙𝑜𝑤𝑠 𝑡ℎ𝑎𝑡 ∑85
𝑖=1 𝛽𝑖 =
85 Show that if 𝛼 is a real root, then
−2 𝑎𝑛𝑑 ∑𝑖<𝑗 𝛽𝑖 𝛽𝑗 = 3 𝟏
(𝒂𝟏 𝟐 − 𝟐𝒏𝒂𝟐 ) 𝟐
2 2 𝒂𝟏 − [ ]
𝑇ℎ𝑒𝑛 ∑85 85
𝑖=1 𝛽𝑖 = (∑𝑖=1 𝛽𝑖 ) − 2 ∑𝑖<𝑗 𝑆𝑖 𝑆𝑗 = (𝒏 − 𝟏)
−2 < 0 𝟏
(𝒂𝟏 𝟐 − 𝟐𝒏𝒂𝟐 ) 𝟐
≤ 𝒏𝜶 + 𝒂𝟏 + [ ]
Thus, the 𝛽𝑖 ′𝑠 are not real and then the 𝛼𝑖 ′𝑠 are (𝒏 − 𝟏)
not all real.
Sol.: Let 𝑓(𝑥) = 𝑥 𝑛 − 𝑎1 𝑥 𝑛−1 + 𝑎2 𝑥 𝑛−2 + ⋯ +
85 84
Conclusion: The equation 𝑎85 𝑥 + 𝑎84 𝑥 + 𝑎𝑛 = 0 … … . . (1)
⋯ + 𝑎3 𝑥 3 + 𝑎2 𝑥 2 + 𝑎1 𝑥 + 𝑎0 = 0 are not real
root, if 𝑎0 ≠ 0 𝑎𝑛𝑑 𝑎1 2 < 2𝑎0 𝑎2 . After differentiating (𝑛 − 2) times, we get
6) Suppose that 𝒂𝟏 > 𝒂𝟐 > 𝒂𝟑 > 𝒂𝟒 > 𝒂𝟓 > [𝑛(𝑛 − 1)(𝑛 − 2) … … … .3]𝑥 2 − [(𝑛 − 1)(𝑛 −
𝒂𝟔 and 𝒑 = 𝒂𝟏 + 𝒂𝟐 + 𝒂𝟑 + 𝒂𝟒 + 𝒂𝟓 + 2) … .2]
𝒂𝟔 , 𝒒 = 𝒂𝟏 𝒂𝟑 + 𝒂𝟑 𝒂𝟓 + 𝒂𝟓 𝒂𝟏 + 𝒂𝟐 𝒂𝟒 + 𝑎1 𝑥 + [(𝑛 − 2) … 1]𝑎𝑛 = 0
𝒂𝟒 𝒂𝟔 + 𝒂𝟔 𝒂𝟐 𝒂𝒏𝒅 𝒓 = 𝒂𝟏 𝒂𝟑 𝒂𝟓 + 𝒂𝟐 𝒂𝟒 𝒂𝟔 .
Then show that all the roots of the ⟹ 𝑛(𝑛 − 1)𝑥 2 − 2(𝑛 − 1)
equation 𝟐𝒙𝟑 − 𝒑𝒙𝟐 + 𝒒𝒙 − 𝒓 = 𝟎
𝑎1 𝑥 + 2𝑎2 = 0
are real
Sol.: let 𝑓(𝑥) = 2𝑥 3 − 𝑝𝑥 2 + 𝑞𝑥 − 𝑟 = 2𝑥 3 −

(𝑎1 + 𝑎2 + ⋯ + 𝑎6 )𝑥 2 + (𝑎1 𝑎3 + 𝑎3 𝑎5 +
𝑎5 𝑎1 + 𝑎2 𝑎4 + 𝑎4 𝑎6 + 𝑎6 𝑎2 )𝑥 − (𝑎1 𝑎3 𝑎5 +
𝑎2 𝑎4 𝑎6 )
222
Be whole number and if (0) and 𝒇(𝟏) be each

odd integers, then prove that the equation can
not have integral root.
Sol.: 𝑓(0) = 𝑝𝑛 = 𝑜𝑑𝑑, 𝑓(1) = 1 + 𝑝1 + 𝑝2 +

⋯ + 𝑝𝑛 = 𝑜𝑑𝑑
Case I: If x = 2m, then 𝑓(𝑥) = 𝑥⏟𝑛 + 𝑝1 𝑥 𝑛−1 +

𝑜𝑑𝑑
⋯+ 𝑝
⏟𝑛 = 𝑜𝑑𝑑 ∴ x = 2m cannot be a root of
𝑜𝑑𝑑
the odd equation 𝑓(𝑥) = 0
Case II: 𝑥 = 2𝑚 + 1, 𝑡ℎ𝑒𝑛, 𝑓(𝑥) = 𝑥⏟𝑛 +

𝑜𝑑𝑑
𝑝1 𝑥 𝑛−1 + ⋯ + 𝑝
⏟𝑛
𝑜𝑑𝑑
⟹ roots of this equation is
= 𝑥 𝑛 + 𝑝1 (𝑒𝑣𝑒𝑛 + 1) + 𝑝2 (𝑒𝑣𝑒𝑛 + 1) + ⋯
𝑎1 (𝑛 − 1) ± √(𝑛 − 1)2 𝑎1 2 − 2𝑛(𝑛 − 1)𝑎2 + 𝑝𝑛−1 (𝑒𝑣𝑒𝑛 + 1) + 𝑝𝑛
𝑥=
𝑛(𝑛 − 1)
= 𝑥 𝑛 + 𝑝𝑛 + (𝑝1 𝑒𝑣𝑒𝑛 + 𝑝2 𝑒𝑣𝑒𝑛 + ⋯ +
If 𝛼 is a root of equation (1) 𝑝𝑛−1 𝑒𝑣𝑒𝑛) + (𝑝1 + 𝑝2 + ⋯ + 𝑝𝑛−1 )
= 𝑥⏟𝑛 + ⏟
𝑝1 𝑒𝑣𝑒𝑛 + ⋯ + 𝑝𝑛−1 𝑒𝑣𝑒𝑛 +
2𝑛𝑎2
(𝑎 2 − ) 𝑜𝑑𝑑 𝑒𝑣𝑒𝑛
1 √ 1 (𝑛 − 1) 𝑝1 + ⋯ + 𝑝𝑛−1
⏟
⟹ 𝑎1 − (𝑛 − 1) ≤𝛼
𝑛 (𝑛 − 1)2 𝑒𝑣𝑒𝑛
⎣ ⎦
⟹ 𝑥 = (2𝑚 + 1) cannot be a root of the
equation 𝑓(𝑥) = 0
2𝑛𝑎2
(𝑎 2 − )
1 √ 1 (𝑛 − 1)
≤ 𝑎1 + (𝑛 − 1) Therefore equation cannot have an integral
𝑛 (𝑛 − 1)2
root.
⎣ ⎦
𝑎1 2 − 2𝑛𝑎2 9) If the equations 𝒂𝒙𝟐 + 𝟐𝒃𝒙 + 𝒄 =

⟹ 𝛼1 − √ ≤ 𝑛𝛼
(𝑛 − 1) 𝟎 𝒂𝒏𝒅 𝒙𝟐 + 𝟐𝒑𝟐 𝒙 + 𝟏 = 𝟎, has one root
commons. If a, b, c are in arithmetic
𝑎1 2 − 2𝑛𝑎2
≤ 𝛼1 + √ 𝑝𝑟𝑜𝑣𝑒𝑑. progression and 𝒑𝟐 ≠ 𝟏, then find the
(𝑛 − 1)
second root of second equation.
Sol.: Let 𝛼 is the common root of both

8) If all the coefficient of the equation 𝒇(𝒙) = equations
𝒙𝒏 + 𝒑𝟏 𝒙𝒏−𝟏 + 𝒑𝟐 𝒙𝒏−𝟐 + ⋯ + 𝒑𝒏 = ∴ 𝑎𝛼 2 + 2𝑏𝛼 + 𝑐 = 0 … … … . . (1)
𝒇(𝒙) = 𝟎
𝛼 2 + 2𝑝2 𝛼 + 1 = 0 … … … … … . (2)
223
Now by cross multiplication, we get 1 1 𝑎

∴ 𝛼𝛽 = 1 ⟹ 𝛽 = = = −
𝛼 −𝑐/𝑎 𝑐
𝛼2 𝛼
∴ =
2𝑏 − 2𝑝2 𝑐 𝑐 − 𝑎 10) If 𝛼, 𝛽 are the roots of the equation 𝒂𝒙𝟐 +
1 𝟐𝒃𝒙 + 𝒄 = 𝟎 𝒂𝒏𝒅 𝜶𝟒 𝜷𝟒 are the roots of
= … … … (3)
2𝑎𝑝2 − 2𝑏 the equation 𝒍𝒙𝟐 + 𝒎𝒙 + 𝒏 =
𝟎, 𝒕𝒉𝒆𝒏 𝒑𝒓𝒐𝒗𝒆 𝒕𝒉𝒂𝒕 𝒕𝒉𝒆 𝒓𝒐𝒐𝒕𝒔 𝒐𝒇
2𝑏 − 2𝑝2 𝑐 (𝑐 − 𝑎)2
⟹ 𝛼2 = = 𝒕𝒉𝒆 𝒆𝒒𝒖𝒂𝒕𝒊𝒐𝒏 𝒂𝟐 𝒍𝒙𝟐 − 𝟒𝒂𝒄𝒍𝒙 + 𝟐𝒄𝟐 𝒍 +
2𝑎𝑝2 − 2𝑏 (2𝑎𝑝2 − 2𝑏)2
𝒂𝟐 𝒎 = 𝟎 are always real and opposite in
∴ (2𝑏 − 2𝑝2 𝑐)(2𝑎𝑝2 − 2𝑏)2 sign (𝛼, 𝛽 are real and different).
= (𝑐 − 𝑎)2 (2𝑎𝑝2 𝑏 𝑐
− 2𝑏) Sol.: We have 𝛼 + 𝛽 = − 𝑎 ; 𝛼𝛽 𝑎 & 𝛼 4 + 𝛽 4 =
𝑚
−1;
4 2 2
⟹ 4𝑎𝑐𝑝 − 4𝑏(𝑎 + 𝑐)𝑝 + 4𝑏
+ (𝑐 − 𝑎)2 = 0 𝑛 𝑚
𝛼 4 𝛽4 = , 𝑁𝑜𝑤 𝛼 4 + 𝛽 4 = −
𝑙 𝑙
⟹ 𝑝2 = = [(𝛼 2
+𝛽 2 )2
− 2𝛼 2 𝛽 2 ]
4𝑏(𝑎+𝑐)±√16𝑏2 (𝑎+𝑐)2 −16𝑎𝑐{4𝑏2 +(𝑐−𝑎)2 }
𝑚
8𝑎𝑐 ⟹− 𝑙
= [{(𝛼 + 𝛽)2 2𝛼𝛽}2 − 2𝛼 2 𝛽 2 ] =
𝑏 2 2𝑐 2𝑐 2
Let d is the common difference of A.P. {𝑎 2 − 𝑎 } − 𝑎 2
𝑎, 𝑏, 𝑐 ⟹ 𝑎 = 𝑏 − 𝑑, 𝑐 = 𝑏 + 𝑑,
2
𝑏2 𝑐 𝑏2 𝑐2 𝑚
𝑠𝑜, 𝑝2 = ⟹ ( 2) − 4 ( ) ( 2) + 2 ( 2) + = 0
4𝑎(2𝑏)± √16𝑏2 (2𝑏)2 −16(𝑏−𝑑)(𝑏+𝑑)(4𝑏2 +4𝑑 2 )
𝑎 𝑎 𝑎 𝑎 𝑙
8(𝑏−𝑑)(𝑏+𝑑)
𝑏2
It shows (𝑎2 ) is a root of the equation 𝑥 2 −
𝑏 2 ± √𝑏 4 − (𝑏 4 − 𝑑4 ) 𝑏 2 ± 𝑑2 𝑐 𝑐2 𝑚
= = 2 4 (𝑎) 𝑥 + 2 (𝑎2 ) + = 0 … … … … (1)
𝑏2 − 𝑑2 𝑏 − 𝑑2 𝑙
𝑏2 + 𝑑2 2 𝑏2 − 𝑑2 𝑖. 𝑒. , 𝑎2 𝑙𝑥 2 − 4𝑎𝑐𝑙𝑥 + 2𝑐 2 𝑙 + 𝑚𝑎2 = 0
𝑠𝑜, 𝑝2 = (𝑝 ≠ 2 𝑎𝑠 𝑝2
𝑏2 − 𝑑2 𝑏 − 𝑑2
𝑏2
It show one of the equation (i) is (positive)
𝑎2
≠ 1)
𝑏2 4𝑐 𝑏2 −4𝑎𝑐
Now, 𝑦 + 𝑎2 = 𝑎
⟹ 𝑦 = −( 𝑎2
) <0
𝑐−𝑎
𝐹𝑟𝑜𝑚 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 (1)𝛼 =
2𝑎𝑝2 − 2𝑏 Hence roots are real and opposite in sign.
2𝑑
⟹𝛼= 11) If 𝐭𝐚𝐧 𝒙 − 𝐭𝐚𝐧 𝒚 = 𝒂 𝒂𝒏𝒅 𝒙 + 𝒚 = 𝟐𝒃,
(𝑏 2 + 𝑑2 )
2(𝑏 − 𝑑) 2 − 2ℎ prove that 𝐭𝐚𝐧 𝒛 𝒂𝒏𝒅 𝐭𝐚𝐧 𝒚 are the roots
𝑏 − 𝑑2
𝑏+𝑑 𝑐 of the equation 𝒙𝟐 − (𝟏 − 𝒂) 𝐭𝐚𝐧 𝟐𝒃 . 𝒙 +
= −( )= −
𝑏−𝑑 𝑎 𝒂=𝟎
Let second root of equation (2) be 𝛽 Sol.: Let tan 𝑥 , tan 𝑦 are the roots of the
equation 𝑥 2 − (1 − 𝑎) tan 2𝑏 . 𝑥 + 𝑎 = 0
224
tan 𝑥 + tan 𝑦 = (1 − 𝑓(𝑥) = 1 − (𝑛 + 2)𝑥 𝑛+1 + (𝑛 + 1)𝑥 𝑛+2

𝑎) tan 2𝑏 𝑎𝑛𝑑 tan 𝑥 . tan 𝑦 =
𝑎 … … … … (1) 𝑓(−𝑥) = 1 − (𝑛 + 2)(−𝑥)𝑛+1 +
(𝑛 + 1)(−𝑥)𝑛+2 .
𝑎𝑛𝑑 tan 𝑥 − tan 𝑦 =
𝑎 (𝑖𝑡 𝑖𝑠 𝑔𝑖𝑣𝑒𝑛). 𝐺𝑖𝑣𝑒𝑛 𝑥 + 𝑦 = If n is even, there is no change of sign in this
2𝑏 … … … … . . (2) expression and so there is no negative real root.
If n is odd, there is one charge of sign. So there
Taking tan on both sides of equation (2) can be one negative real root.
tan 𝑥 + tan 𝑦 tan 𝑥 + tan 𝑦
= tan 2𝑏 ⟹ In this case 𝑓(−1) = 1 − (𝑛 + 2) − (𝑛 + 1) =
1 − tan 𝑥 tan 𝑦 1 − 𝑎𝑦
−(𝑛 + 1) = −(2𝑛 + 2) < 0& 𝑓(0) > 0.
= tan 2𝑏
So we can say that when n is odd, the real root
So, equation (1) is true
lies between 0 and -1.
∴ Our assumption that tan 𝑥 , tan 𝑦 are the
13) Show that the roots of the equation 𝒙𝒏 +
roots of the equation 𝑥 2 − (1 − 𝑎). tan 2𝑏 . 𝑥 +
𝑎 = 0, 𝑖𝑠 𝑡𝑟𝑢𝑒. 𝒂𝟏 𝒙𝒏−𝟏 + 𝒂𝟐 𝒙𝒏−𝟐 + ⋯ + 𝒂𝒏−𝟏 𝒙 + 𝒂𝒏 = 𝟎
can not be real if (𝒏 − 𝟏)𝒂𝟏 𝟐 − 𝟐𝒏𝒂𝟐 < 0.
12) Let 𝒑𝒏 (𝒙) be the polynomial, 𝒑𝒏 (𝒙) =
𝟏 + 𝟐𝒙 + 𝟑𝒙𝟐 + ⋯ + (𝒏 + 𝟏)𝒙𝒏 , show Sol.: If 𝑓(𝑥) = 𝑥 𝑛 + 𝑎1 𝑥 𝑛−1 + 𝑎2 𝑥 𝑛−2 + ⋯ +
that 𝒑𝒏 (𝒙) has no real root if n is even and 𝑎𝑛 = 0 … … … … (1) has n roots, then 𝑓′(𝑥) =
exactly one real root if n is odd and root 0 ℎ𝑎𝑠 (𝑛 − 1)𝑟𝑜𝑜𝑡𝑠. 𝑓′(𝑥) has (𝑛 − 2) roots.
lies between -1 and 0.
So differential equation (1) (𝑛 − 2) times we
Sol.: 𝑝𝑛 (𝑥) = 1 + 2𝑥 + 3𝑥 2 + ⋯ + (𝑛 + 1) 𝑥𝑛 get,
(where x >0; 𝑝𝑛 (𝑥)>0) so, 𝑝𝑛 (𝑥) have no
𝑛(𝑛 − 1)(𝑛 − 2) … .3𝑥 2 + (𝑛 − 1)(𝑛 −
positive real root. 2) … .2𝑎1 𝑥 + (𝑛 − 2)(𝑛 − 3) … .1. 𝑎2 = 0 has
𝑝𝑛 (𝑥) = 1 + 2𝑥 + 3𝑥 2 + ⋯ + two roots.
(𝑛 + 1)𝑥 𝑛 ,
𝑥𝑝𝑛 (𝑥) = 𝑥 + 2𝑥 2 + ⋯ + 𝑛𝑥 4 +
(𝑛 + 1)𝑥 𝑛+1
⟹ (1 − 𝑥)𝑝𝑛 (𝑥) = 1 + 𝑥 + 𝑥 2 + 𝑥 3 +
⋯ + 𝑥 4 − (𝑛 + 1)𝑥 𝑛+1
1(1 − 𝑥 𝑛+1 ) If equation (2) not has two real roots, then
= − (𝑛 + 1)𝑥 𝑛+1
1−𝑥 equation (1) not has n (all) real roots.
1−(𝑛+2)𝑥 𝑛+1 +(𝑛+1)𝑥 𝑛+2
⟹ 𝑝𝑛 (𝑥) = (1−𝑥)2
for Equation (2) not has two real root if 𝐵2 − 4𝐴𝑐
negative values of x, 𝑝𝑛 (𝑥)will vanish (discriminant of (2) <0)
when ever
225
⟹ [(𝑛 − 1)(𝑛 − 2) … . .2]2 . 𝑎1 2 Sol.: The given equation can be written as

− 4. 𝑛(𝑛 − 1)(𝑛
− 2) … … … . .3. (𝑛 𝑥2 + 𝑥 + 2 𝑥2 + 𝑥 + 2
( 2 ) − (𝑎 − 3) ( 2 )
− 2)(𝑛 − 3) … . .2.1. 𝑎2 𝑥 +𝑥+1 𝑥 +𝑥+2
< 0. + (𝑎 + 4)
= 0 … … … (1)
⟹ (𝑛 − 1). 𝑎1 2 − 2𝑛𝑎2 < 0 Proved.
𝑥2 + 𝑥 + 2
14) a, b, c, d are four distinct real numbers and 𝐿𝑒𝑡 =𝑡 ⟹𝑡
𝑥2 + 𝑥 + 2
they are in A. P. If 𝟐(𝒂 − 𝒃) + 𝒙(𝒃 − 𝒄)𝟐 + 1
=1+
(𝒄 − 𝒂)𝟑 = 𝟐(𝒂 − 𝟏) + (𝒃 − 𝒅)𝟐 + 𝑥2 +𝑥+1
(𝒄 − 𝒅)𝟑 then prove that 𝒙 ≥ 𝟏𝟔 𝒐𝒓 𝒙 ≤
1 2 3
−𝟖. 𝑆𝑖𝑛𝑐𝑒 (𝑥 2 + 𝑥 + 1) = (𝑥 + ) +
2 4
3
Sol.: Since a, b, c, d are in A.P. ⟹ 𝑥2 + 𝑥 + 1 ≥
4
∴ (𝑏 − 𝑎) = 𝑐 − 𝑏 = 𝑑 − 𝑐 = Let d 7
⟹ 𝑡 ∊ (1, ) now equation (1)
(common difference) 3
becomes;
∴ 𝑑 = 𝑎 + 3𝐷 ⟹ 𝑎 − 𝑑 =
−3𝐷 𝑎𝑛𝑑 𝑑 = 𝑏 + 2𝐷 𝑡 2 − (𝑎 − 3)𝑡 + (𝑎 − 4) =
0 … … … . (2)
⟹ 𝑏 − 𝑑 = −2𝐷 𝑐 = 𝑎 + 2𝐷 ⟹ 𝑐 −
𝑎 = 2𝐷. At least one root of this equation must
7
lie in (1, ) from equation (2), 𝑡 = 𝑎 −
∴ 𝐺𝑖𝑣𝑒𝑛 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛, 2(𝑎 − 𝑏) + 3
𝑥(𝑏 − 𝑐)2 + (𝑐 − 𝑎)3 4, 2.
7
= 2(𝑎 − 𝑑) + (𝑏 − 𝑑)2 + (𝑐 − For one root lie in (1, 3) , 𝑤𝑒 ℎ𝑎𝑠 1 <
𝑑)3 𝑏𝑒𝑐𝑜𝑚𝑒𝑠 𝑎≤3⟹5<𝑎≤
7 19
.
3
−2𝐷 + 𝑥𝐷 2 + (2𝐷)3 = −6𝐷 + 4𝐷 2 −
16) Let 𝒇(𝒙) be a polynomial leaving
𝐷3
remainder, 𝑨𝟏 , when divided by (𝒙 − 𝒂𝟏 ).
⟹ 9𝐷 2 + (𝑥 − 4)𝐷 + 4 = The remainder 𝑨𝟐 when divided by (𝒙 −
0 𝑠𝑖𝑛𝑐𝑒 𝐷 𝑖𝑠 𝑟𝑒𝑎𝑙 𝒂𝟐 )………. And finally
𝑨𝒎 , 𝒊𝒇 𝒅𝒊𝒗𝒊𝒅𝒆 𝒃𝒚 (𝒙 − 𝒂𝒎 ). Find the
⟹ (𝑥 − 4)2 − 4.9.4 ≥ 0 ⟹ 𝑥 2 − remainder left by the polynomial, when
8𝑥 − 128 ≥ 0
divided by (𝒙 − 𝒂𝟏 )(𝒙 − 𝒂𝟐 ) … . . (𝒙 − 𝒂𝒎 )
⟹ (𝑥 − 16)(𝑥 + 8) ≥ 0 ∴ 𝑥 ≥
Sol.: 𝑓(𝑎1 ) = 𝐴1 , 𝑓(𝑎2 ) = 𝐴2 , … … … . . , 𝑓(𝑎𝑚) =
16 𝑜𝑟 𝑥 ≤ −8 𝑝𝑟𝑜𝑣𝑒𝑑.
𝐴𝑚
15) Find the value of ‘a’ for which the equation
𝑓(𝑥) = (𝑥 − 𝑎1 )(𝑥 − 𝑎2 ) … . (𝑥 −
(𝒙𝟐 + 𝒙 + 𝟐)𝟐 − (𝒂 − 𝟑)(𝒙𝟐 + 𝒙 +
𝑎𝑚 )𝑄(𝑥) + 𝑅(𝑥) … … … . (𝑦)
𝟐)(𝒙𝟐 + 𝒙 + 𝟏) + (𝒂 − 𝟒)(𝒙𝟐 + 𝒙 + 𝟏)𝟐 =
0, has at least one real root.
226
Here 𝑅(𝑥) will be a polynomial of degree 17) Given that 𝛼, 𝛾 are the roots of the
(𝑚 − 1) equation 𝑨𝒙𝟐 − 𝟒𝒙 + 𝟏 = 𝟎 and 𝛽, 𝛿 the
roots of the equation 𝑩𝒙𝟐 − 𝟔𝒙 + 𝟏 = 𝟎
𝑅(𝑎1 ) = 𝐴1 , 𝑅(𝑎2 ) = 𝐴2 , … , 𝑅(𝑎𝑚) =
find values of A and B such that 𝛼, 𝛽, 𝛾 and
𝐴𝑚
𝛿 are in H.P.
𝑅(𝑥) = 𝑝𝑚−1 − 𝑥 𝑚−1 + 𝑝𝑚−2 −
Sol.: Given equation are 𝐴𝑥 2 − 4𝑥 + 1 =
𝑥 𝑚−2 + ⋯ + 𝑝0 𝑎𝑛𝑑 , 0 … … … . (1)
𝑅(𝑥) = 𝐵1 (𝑥 − 𝑎2 )(𝑥 − 𝑎3 ) … (𝑥 −
𝐵𝑥 2 − 6𝑥 + 1 = 0 … … … … . . (2)
𝑎𝑚 ) + 𝐵2 (𝑥 − 𝑎1 )(𝑥 − 𝑎3 )(𝑥 − 𝑎𝑚 ) +
𝐵3 (𝑥 − 𝑎1 )(𝑥 − 𝑎2 )(𝑥 − 𝑎4 ) … + ⋯ + 4
𝛼+𝛾 = … … … (𝑖) 𝛽 + 𝛿
𝐵𝑚 (𝑥 − 𝑎1 )(𝑥 − 𝑎2 ) … (𝑥 − 𝐴
𝑎𝑚−1 ) … … . . (1) 6
= … . . (𝑖𝑖) 𝛼𝛾
𝐵
Putting x = 𝑎1 on both sides, we get 1
= … … … . . (𝑖𝑖𝑖) 𝛽𝛿
𝐴
𝑅(𝑎1 ) 1
= … … … (𝑖𝑣)
𝐴1 𝐵
=
(𝑎1 − 𝑎2 )(𝑎1 − 𝑎3 ) … (𝑎2 − 𝑎𝑚 )
Given 𝛼, 𝛽, 𝛾, 𝛿 are in H. p.
= 𝐵1
2𝛼𝛾 1 2𝛽𝛿 1
… … … … … …. ∴𝛽= = 𝑎𝑛𝑑 𝛾 = =
𝛼+𝛾 2 𝛽+𝛿 3
…………………
Since 𝛽 is a root of equation (2)
𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝐵2
∴ 𝐵𝛽 2 − 6𝛽 + 1 = 0
𝐴2
= 1 1
(𝑎2 − 𝑎1 )(𝑎2 − 𝑎3 ) … . (𝑎2 − 𝑎𝑚 ) ⟹ 𝐵 × − 6. + 1
4 2
=0 ⟹𝐵=8
……………………
Since 𝛾 is a root of equation (1) ∴ 𝐴𝛾 2 −
… … … … … … … .. 4 4
4𝛾 + 1 = 0, ⟹ 9 − 3 + 1 = 0 ⟹ 𝐴 = 3
𝐴𝑚
𝐵𝑚 =
(𝑎𝑚 − 𝑎1 )(𝑎𝑚 − 𝑎2 ) … . . (𝑎𝑚 − 𝑎𝑚−1 ) 18) If 𝛼, 𝛽 are the roots of the equations 𝒙𝟐 −
𝒑𝒙 + 𝒒 = 𝟎 then find the quadratic
∴ 𝑅(𝑥)
equation whose roots are
𝐴1 . (𝑥 − 𝑎2 )(𝑥 − 𝑎3 ) … (𝑥 − 𝑎𝑚 )
= (a) (𝜶𝟐 − 𝜷𝟐 )(𝜶𝟑 − 𝜷𝟑 )𝒂𝒏𝒅 𝜶𝟑 𝜷𝟐 +
(𝑎1 − 𝑎2 ) … . (𝑎1 − 𝑎𝑚 )
𝜶𝟐 𝜷𝟐
𝐴2 . − 𝑎1 )(𝑥 − 𝑎3 ) … . . (𝑥 − 𝑎𝑚 )
(𝑥
+ (b) (𝜶𝟐 + 𝜷𝟐 )(𝜶𝟑 + 𝜷𝟑 )𝒂𝒏𝒅 𝜶𝟓 𝜷𝟑 +
(𝑎2 − 𝑎1 )(𝑎2 − 𝑎3 ) … … (𝑎2 − 𝑎𝑚 )
+⋯ 𝜶𝟑 𝜷𝟓 − 𝟐𝜶𝟒 𝜷𝟒
Sol.:
𝑚 𝑚
𝑥 − 𝑎𝑘
⟹ 𝑅(𝑥) = ∑ 𝐴𝑖 (∏ ( )) (a) 𝛼, 𝛽 are roots of 𝑥 2 − 𝑝𝑥 + 𝑞 = 0
𝑎𝑖 − 𝑎𝑘
𝑖=1 𝑘=2
𝑘≠1
227
∴ 𝛼 + 𝛽 = 𝑝 & 𝛼𝛽 = 𝑞 … … … . . (1) 𝑥 2 − [{(𝛼 2 + 𝛽 2 )(𝛼 3 + 𝛽 3 )} +

{𝛼 5 𝛽3 + 𝛼 3 𝛽5 − 2𝛼 4 𝛽 4 }]
𝑁𝑜𝑤 (𝛼 2 − 𝛽 2 )(𝛼 3 − 𝛽 3 ) = {(𝛼 + 𝛽)(𝛼 −
𝑥 + {(𝛼 2 + 𝛽 2 )(𝛼 3 + 𝛽 3 ). 𝛼 5 𝛽3 +
𝛽)}{(𝛼 − 𝛽)((𝛼 2 − 𝛽 2 )(𝛼 2 + 𝛼𝛽 + 𝛽 2 )} 𝛼 3 𝛽 5 − 2𝛼 4 𝛽4 } = 0
= (𝛼 − 𝛽)2 (𝛼 + 𝛽)(𝛼 2 + 𝛽 2 + 𝛼𝛽) ⟹ 𝑥 2 — [𝑝(𝑝2 − 2𝑞)(𝑝2 + 3𝑞) +
𝑞 3 (𝑝2 − 4𝑝𝑞)]
= {(𝛼 + 𝛽)2 − 4𝛼𝛽}(𝛼 + 𝛽)2 {(𝛼 + 𝑥 + 𝑝(𝑝2 − 2𝑞)(𝑝2 + 3𝑞) +
𝛽)2 − 𝛼𝛽 2 } 𝑞 3 (𝑝2 − 49) = 0
19) Let p(x) be a polynomial of degree n>1
= (𝑝2 − 49)𝑝(𝑝2 − 𝑞) = 𝑝5 − 5𝑝3 𝑞 + with integer coefficients and let k be a
4𝑝𝑞 4 positive integer. Consider the polynomial
𝛼 3 𝛽 3 + 𝛼 2 𝛽2 = 𝛼 2 𝛽 3 (𝛼 + 𝛽) = 𝑸(𝒙) = 𝒑 (𝒑. (𝒑(𝒑(𝒙) ))), where p occurs k
(𝑞)2 . 𝑝 = 𝑝𝑞 2 times. Prove that there are at most n
∴ Quadratic equation whose roots are integer t such that Q(t)= t.
(𝛼 2 − 𝛽 2 )(𝛼 3 − 𝛽 3 ) & 𝛼 3 𝛽2 + 𝛼 2 𝛽3 is Sol.: The claim is obvious of every integer

fixed point of Q is a fixed point of p itself. For
𝑥 2 − [{(𝛼 2 − 𝛽 2 )(𝛼 3 − 𝛽 3 )} the sequel assume that this is not the case.
+ {𝛼 3 𝛽 2 + 𝛼 2 𝛽3 }]𝑥 Take any integer 𝑥0 such that Q(𝑥0 ) =
+ (𝛼 2 − 𝛽 2 )(𝛼 3 − 𝛽 3 ){𝛼 3 𝛽2 𝑥0 , 𝑃(𝑥0 ) ≠ 𝑥0 and define inductively 𝑥𝑖+1 =
+ 𝛼 2 𝛽3 } = 0 𝑝(𝑥0 ) 𝑓𝑜𝑟 𝑖 = 0, 1, 2, … … … ., then 𝑥𝑘 = 𝑥0 . it
is evident that 𝑝(𝑢) − 𝑝(𝑣) is divisible 𝑢 − 𝑣 for
⟹ 𝑥 2 − [(𝑝5 − 5𝑝3 𝑞 + 4𝑝𝑞 4 ) + 𝑝𝑞 2 ]𝑥 −
distinct integer u, v ……..(i)
(𝑝5 − 5𝑝3 𝑞 + 4𝑝𝑞 4 )
[Indeed, if 𝑝(𝑥) = ∑ 𝑎𝑖 𝑥𝑖 then each 𝑞𝑖 (𝑢𝑖 −
𝑝𝑞 2 = 0 ⟹ 𝑥 2 − (𝑝5 − 5𝑝3 𝑞 + 4𝑝𝑞 4 + 𝑣𝑖 ) is divisible by 𝑢 − 𝑣].
𝑝𝑞 2 )𝑥 − (𝑝6 𝑞2 − 5𝑝4 𝑞3 + 4𝑝2 𝑞6 ) = 0
Therefore each term in the claim of (non-
(b) (𝛼 2 + 𝛽 2 )(𝛼 3 + 𝛽 3 ) = {(𝛼 + 𝛽)2 − zero) differences.
2𝛼𝛽}{(𝛼 + 𝛽)(𝛼 2 − 𝛼𝛽 + 𝛽 2 )}
= {(𝛼 + 𝛽)2 − 2𝛼𝛽}{(𝛼 + 𝑥0 − 𝑥1 , 𝑥1 − 𝑥2 , … . , 𝑥𝑘−1 − 𝑥𝑘 , 𝑥𝑘 −
2
𝛽){(𝛼 + 𝛽) − 2𝛼𝛽 − 𝛼𝛽}} 𝑥𝑘+1 … … . (𝑖𝑖) is a divisor of the next one; and
= (𝑝2 − 2𝑞)(𝑝3 − 3𝑝𝑞) = since 𝑥𝑘 − 𝑥𝑘+1 = 𝑥0 − 𝑥1 ; all these
𝑝(𝑝2 − 2𝑞)(𝑝2 − 3𝑞) difference have equal absolute values. For
𝑥𝑚 = min(𝑥1 , … . , 𝑥𝑘 ) this means that 𝑥𝑚−1 −
𝛼 5 𝛽 3 + 𝛼 3 𝛽5 − 2𝛼 4 𝛽4 =
𝑥𝑚 = −(𝑥𝑚 − 𝑥𝑚+1 ). Thus 𝑥𝑚+1 (≠ 𝑥𝑚 ) It
𝛼 3 𝛽3 (𝛼 2 + 𝛽 2 − 2𝛼𝛽)
follows that consecutive difference in the
= 𝛼 3 𝛽 3 {(𝛼 + 𝛽)2 − 4𝛼𝛽} =
sequence (ii) have opposite signs.
𝑞 3 (𝜋 2 − 49)
Consequently 𝑥0 , 𝑥1 , 𝑥2 … …. is an alternating
∴ Quadratic equation whose roots are sequence of two distinct values. In other
(𝛼 2 + 𝛽 2 )(𝛼 3 + 𝛽 3 ) & 𝛼 5 𝛽2 + 𝛼 3 𝛽5 − words, every integer fixed point of Q is a fixed
2𝛼 5 𝛽4 𝑖𝑠 point of the polynomial 𝑃(𝑝(𝑥) ). Out task is to
prove that there are at most n such points.
228
Let a be one of them so that b= p(a) ≠ a (we 𝑥 3 (𝑥 2 − 1) + 𝑥 − 1 − 1 =

have assumed that such an a exists); then a = −[1 + (1 − 𝑥) + 𝑥 3 (1 − 𝑥)2 ]
𝑝(𝑏) . Take any other integer fixed point 𝛼 of
∴ 𝛼 < 1. 𝐴𝑔𝑎𝑖𝑛 𝛼 is a solution of the
𝑃(𝑝(𝑥) )𝑎𝑛𝑑 𝑙𝑒𝑡 𝑝(𝛼) = 𝛽, 𝑠𝑜 𝑡ℎ𝑎𝑡 𝑝(𝛽) = 𝛼;
given equation implies that 𝛼 5 − 𝛼 3 +
the numbers 𝛼 and 𝛽 need not be distinct (𝛼
𝛼 − 2 = (𝛼 − 1)(𝛼 4 + 𝛼 3 + 1) − 1 =
can be a fixed point of p), but each of 𝛼, 𝛽 is
0
different from each of a, b. Applying property
(1) to the four pairs of integers (𝛼, a) (𝛽, b), 𝐼𝑓 𝛼 ≥ 2, 𝑡ℎ𝑒𝑛 (𝛼 − 1)(𝛼 4 + 𝛼 3 +
(a, b), (𝛽, a) we get that the members 𝛼 − 1) − 1 ≥ 24
𝑎 𝑎𝑛𝑑 𝛽 − 𝑏 divide each other, and also 𝛼 −
𝛽 𝑎𝑛𝑑 𝛽 − 𝑎 divide each other. ∴ 𝛼 < 2 𝑤𝑒 ℎ𝑎𝑣𝑒 1 < 𝛼 < 2, 𝛼 6 =
𝛼 4 − 𝛼 2 + 2𝛼.
Consequently, 𝛼 − 𝑏 ± (𝛽 − 𝑎), 𝛼𝑎 =
±(𝛽 − 𝑏) … … … … … (𝑖𝑖𝑖) We want to prove that [𝛼 6 ] =
3 𝑜𝑟 3 ≤ 𝛼 6 < 4
Suppose we have a plus in both in stances :
𝛼 − 𝑏 = 𝛽 − 𝑎 𝑎𝑛𝑑 𝛼 − 𝑎 = 𝛽 − 𝑏. 𝑜𝑟 𝛼 4 − 𝛼 2 + 2𝛼 − 3 ≥ 0 𝑎𝑛𝑑 𝛼 4 −
𝛼 2 + 2𝛼 − 4 < 0
Subtraction yields 𝑎 − 𝑏 = 𝑏 − 𝑎, a
contradiction, as a ≠ b therefore at least one 𝐵𝑢𝑡 𝛼 5 − 𝛼 3 = 2 − 𝛼.
equality in (iii) holds with a minus sign. For
each of them this means that 𝛼+𝛽 = a +b; 𝑆𝑜 𝑡ℎ𝑎𝑡 𝑤𝑎𝑛𝑡 𝑡𝑜 𝑝𝑟𝑜𝑣𝑒 𝑡ℎ𝑎𝑡 2𝛼 2 −
equivalently a+ b –𝛼 = 𝑝(𝛼) = 0. 5𝛼 + 2 < 0
𝑁𝑜𝑤, 2𝛼 2 − 5𝛼 + 2 = (𝑎 + 2)(2𝛼 −
Denote a +b by c. We have shown that every
1) < 0 𝑓𝑜𝑟
integer fixed point of Q other that a and b is a
root of the polynomial. 𝐹(𝑥) = 𝑐 − 𝑥 − 𝑝(𝑥) . 1
2
< 𝛼 < 2. We have already seen that
This is of course true for a and b as well. And
1 < 𝛼 < 2.
since p has degree n >1, the polynomial F has
the same degree. S, it cannot have more than 𝐻𝑒𝑛𝑐𝑒 𝛼 6 < 4.
n roots. Hence the result.
𝐴𝑔𝑎𝑖𝑛 𝛼 4 − 𝛼 2 + 2𝛼 − 3 ≥ 0 is
𝟓 𝟑
20) If 𝛼 areal root of 𝒙 − 𝒙 + 𝒙 − 𝟐 = 𝟎, equivalent to
then show that [𝜶𝟔 ] = 𝟑 (for any real
number we denote by [x] the greatest 𝛼 5 − 𝛼 3 + 2𝛼 2 − 3𝛼 ≥ 0 is equivalent
integer not exceeding x) to
Sol.: If 𝛼 is solution of 𝑥 5 − 𝑥 3 + 𝑥 − 2 = 0, 2𝛼 3 − 4𝛼 + 2 = 2(𝛼 − 1)2 ≥ 0

then we have 𝛼(𝛼 4 − 𝛼 2 + 2) = 2. Now,
∴ 𝑤𝑒 𝑝𝑟𝑜𝑣𝑒𝑑 3 ≤ 𝛼 6
1 2 3
𝛼 4 − 𝛼 2 + 1 = (𝛼 2 − 2) + 4 > 0. So, 21) Let 𝛼 and 𝛽 be the roots of the equation
we must have 𝛼> 0. Also 0 ≤ 𝑥 ≤ 𝒙𝟐 − 𝒎𝒙 − 𝟏 = 𝟎 where m is an odd
1 ⟹ 𝑥5 − 𝑥3 − 𝑥 + 2 integer. Let 𝝀𝒏 = 𝜶𝒏 + 𝜷𝒏 𝒇𝒐𝒓 𝒏 ≥
𝟎. 𝑺𝒉𝒐𝒘 𝒕𝒉𝒂𝒕 𝒇𝒐𝒓 𝒏 ≥ 𝟎
229
(a) 𝜆n is an integer (a) 𝛼 is real and negative ,

(b) 𝐠𝐜𝐝(𝝀𝒏, 𝝀𝒏+𝟏 ) = 𝟏 (b) The third equation has non –
real roots.
Sol.: 𝛼 and 𝛽 are the root of the equation 𝑥 2 −
𝑚𝑥 − 1 𝑤𝑒 ℎ𝑎𝑣𝑒 𝛼 2 + 𝑚𝛼 − 1 = Sol.: Consider the discriminantes of three
0 … … … . (1)𝛽 2 + 𝑚𝛽 − 1 = 0 … … … . (2) equations.
𝑀𝑢𝑙𝑡𝑖𝑝𝑙𝑦 𝐸𝑞. (1)𝑏𝑦 𝛼 𝑛−2 , 𝛼 𝑛 + 𝑚𝛼 𝑛−1 − 𝑝𝑥 2 + 2𝑞𝑟 + 𝑟 = 0 … … … . (1)

𝛼 𝑛−2 = 0 … … … . (3)
𝑞𝑥 2 + 2𝑟𝑥 + 𝑝 = 0 … … … . . (2)
Multiply Eq. (2) by 𝛽 𝑛−2 , 𝛽 𝑛 + 𝑚𝛽 𝑛−1 −
𝑟𝑥 2 + 2𝑝𝑥 + 𝑞 = 0 … … . . (3)
𝛽 𝑛−2 = 0 … … … … … (4)
Let us denote by 𝐷1 , 𝐷2 , 𝐷3
Adding Equations. (3) and (4), we get
respectively.
𝛼 𝑛 + 𝛽 𝑛 = −𝑚(𝛼 𝑛−1 + 𝛽 𝑛−1 ) +
So, we have
(𝛼 𝑛−2 + 𝛽 𝑛−2 ) Which gives a recurrence
relation for 𝑛 ≥ 2 𝑖. 𝑒., 𝐷1 = 4(𝑞 2 − 𝑟𝑝), 𝐷2 =
𝑟(𝑟 2 − 𝑝𝑞), 𝐷3 = 4(𝑝2 − 𝑞 𝑟 )
𝜆𝑛 = −𝑚 𝜆𝑛−1 + 𝜆𝑛−2 𝑓𝑜𝑟 𝑛 ≥
2 … … … . (𝐴) Adding we get
(a) 𝜆0 = 1 + 1 = 2, 𝜆1 = 𝛼 + 𝛽 = −𝑚. 𝐷1 + 𝐷2 + 𝐷3 = 4(𝑝2 + 𝑞 2 + 𝑟 2 −
Thus 𝜆0 𝑎𝑛𝑑 𝜆1 are integers. By 𝑝𝑞 − 𝑞𝑟 − 𝑟𝑝)
induction, it follows from (A) that 𝜆𝑛 is
an integer for each 𝑛 ≥ 0. = 2{(𝑝 − 𝑞)2 + (𝑞 − 𝑟)2 +
(b) We again use (A) to prove by production (𝑟 − 𝑝)2 } > 0
that gcd(𝜆𝑛, 𝜆𝑛+1 ) = 1. This is clearly
true for n = 0 as gcd(−2, −𝑚) = ∴, q, r are not all equal.
1 𝐿𝑒𝑡 gcd(𝜆𝑛−2 , 𝜆𝑛−1 ) = 1, 𝑛 ≥ 2. Hence at least one of 𝐷1 . 𝐷2 . 𝐷3 must be
It were to happen that gcd(𝜆𝑛−1 , 𝜆𝑛 ) > 1 positive we may assume 𝐷1 > 0.
Take a prime p, that divides both Let us suppose 𝐷2 < 0 and 𝐷3 < 0. In this
𝜆𝑛−1 𝑎𝑛𝑑 𝜆𝑛 . Then from A, we find that p case both the equation (2) and (3) have only
divides 𝜆𝑛−2 also. non –real roots but equation (1) has only real
roots. Hence, the common roots 𝛼 must be
Thus 𝜙 is a factor of gcd(𝜆𝑛−2 , 𝜆𝑛−1 ) a between (2) and (3).
contradiction, so gcd(𝜆𝑛−2 , 𝜆𝑛 ) is equal to 1.
But then the conjugate 𝛼 of 𝛼 is the other root
Hence we have gcd(𝜆, 𝜆𝑛+1 ) = 1 ∀ 𝑛 ≥ 0. of both (2) and (3).
22) If p, q, r be positive real numbers, but not Hence it follows that (2) and (3) have same
all equal such that two of the equations. set of roots
𝒑𝒙𝟐 + 𝟐𝒒𝒙 + 𝒓 = 𝟎, 𝒒𝒙𝟐 + 𝟐𝒓𝒙 +
𝒑 = 𝟎, 𝒓𝒙𝟐 + 𝟐𝒑𝒙 + 𝒒 = 𝟎 have a
common root say 𝛼. Show that
230
𝑞 𝑟 𝑝 1 1
⟹
𝑟
=
𝑝
= . This p= q= r contradicting the
𝑞
𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 16
< 𝑏 2 (1 − 𝑐)(1 − 𝑎)𝑎𝑛𝑑 16 <
given condition. Hence 𝐷2 𝑎𝑛𝑑 𝐷3 cannot be 𝑐 2 (1 − 𝑎)(1 − 𝑏) Multiplying these we get,
negative we may assume 𝐷2 ≥ 0. 1
𝑎2 𝑏 2 𝑐 2 (1 − 𝑎)2 (1 − 𝑏)2 (1 − 𝑐)2 > 163
So we have 𝑞 2 − 𝑟𝑝 > 0, 𝑟 2 − 𝑝𝑞 ≥ 0. which 1

give 𝑞 2 𝑟 2 > 𝑝2 𝑞𝑟 𝐻𝑜𝑤𝑒𝑣𝑒𝑟, 0 < 𝑎 < 1 ⟹ 𝑎(1 − 𝑎) ≤
4
∴p, q, r are all positive 𝐻𝑒𝑛𝑐𝑒, 𝑎2 𝑏 2 𝑐 2 (1 − 𝑎)2 (1 − 𝑏)2 (1 − 𝑐)2 =
2 2 2 1
Hence, we get 𝑞𝑟 > 𝑝2 . 𝑜𝑟 𝐷3 > 0 (𝑎(1 − 𝑎)) (𝑏(1 − 𝑏)) (𝑐(1 − 𝑐)) < 163 a
contradiction.
We conclude that the common root must be
between eqs. (1) and (2),. Thus 𝑝𝛼 2 + 2𝑞𝛼 + So, we conclude that the given equation has
𝑟 = 0, 𝑞𝛼 2 + 2𝑟𝛼 + 𝑝 = 0. Eliminating 𝛼 2 , we real roots.
get
24) Let 𝒇(𝒙) , 𝒈(𝒙) 𝒂𝒏𝒅 𝒉(𝒙) be three
2 2 2 2 polynomials such that
2(𝑞 − 𝑝𝑟)𝛼 = 𝑝 − 𝑞𝑟 ∴ 𝑞 − 𝑝𝑟 > 0, 𝑝 −
𝑞𝑟 < 0. 𝒇(𝒙) 𝒈(𝒙)
,
𝒉(𝒙) 𝒉(𝒙)
, (𝒇(𝒙) , 𝒈(𝒙) ) = 𝟏, show that
𝒈(𝒙)
So we conclude 𝛼 < 0. 𝒇(𝒙) , 𝒉
(𝒙)
⟹ (B) as only non-real roots. 𝑓(𝑥)

Sol.: Since ℎ is a polynomial 𝑝(𝑥) such that
(𝑥)
23) If a, b, c are three positive real numbers
ℎ(𝑥) = 𝑔(𝑥) . 𝑝(𝑥) … … … … (1)
such that 𝒂 + 𝒃 + 𝒄 = 𝟏 and Let
𝑔(𝑥)
𝝀 = 𝐦𝐢𝐧{𝒂𝟑 + 𝒂𝟐 𝒃𝒄, −𝒃𝟑 + Again ℎ is a polynomial 𝑞(𝑥) such that
(𝑥)
𝒂𝒃𝟐 𝒄, 𝒄𝟑 + 𝒂𝒃𝒄𝟐 } ℎ(𝑥) = 𝑞(𝑥) . 𝑔(𝑥) … … … (2)
Show that the roots of the equations 𝒙𝟐 + 𝒙 + Further ∵(𝑓(𝑥) , 𝑔(𝑥) ) = 1.

𝟒𝝀 = 𝟎 are real.
∴ ∃ polynomial 𝑎(𝑥) 𝑎𝑛𝑑 𝑏(𝑥)
2
Sol.: Suppose the equation 𝑥 + 𝑥 + 4𝜆 = 0
has no real roots. Then 1 − 16𝜆 < 0 ⟹ 1 − Such that 𝑓(𝑥) 𝑎(𝑥) + 𝑔(𝑥) 𝑏(𝑥) = 1 … … . (3)
16(𝑎3 + 𝑎2 𝑏𝑐) < 0,
Multiplying by ℎ(𝑥) on both sides, we get
3 2 3
1 − 16(𝑏 + 𝑎𝑏 𝑐) < 0 𝑎𝑛𝑑 1 − 16(𝑐 +
𝑎𝑏𝑐 2 ) < 0. 𝑓(𝑥) ℎ(𝑥) 𝑎(𝑥) + 𝑔(𝑥) ℎ(𝑥) 𝑏(𝑥) = ℎ(𝑥) using (2)
and (1), we get
𝑁𝑜𝑤 1 − 16(𝑎3 + 𝑎2 𝑏𝑐) < 0 ⟹ 1 −
16𝑎2 (𝑎 + 𝑏𝑐) < 0 ⟹ 𝑓(𝑥) [𝑔(𝑥) 𝑞(𝑥) ]𝑎(𝑥) + 𝑔(𝑥) [𝑓(𝑥) 𝑝(𝑥) ]𝑏(𝑥) =
ℎ(𝑥) ⟹ 𝑓(𝑥) 𝑔(𝑥) [𝑞(𝑥) 𝑎(𝑥) + 𝑝(𝑥) 𝑏(𝑥) ] =
⟹ 1 − 16𝑎2 (1 − 𝑏 − 𝑐 + 𝑏𝑐) < 0 𝑔(𝑥)
ℎ(𝑥) ⟹ 𝑓(𝑥)
ℎ(𝑥)
1
⟹ 1 − 16𝑎2 (1 − 𝑏)(1 − 𝑐) < 0 ⟹ 16 <
𝑎2 (1 − 𝑏)(1 − 𝑐)
231
25) If m, n integers ≥ 𝟎 𝒂𝒏𝒅 𝒇(𝒙) , 𝒈(𝒙) are Roots of this equation are the reciprocals of
polynomial such that (𝒙 − 𝒂)𝒎 𝒇(𝒙) = the roots of (2), ∴ Roots of (3) are
(𝒙 − 𝜶)𝒏 𝒈(𝒙) 𝒘𝒊𝒕𝒉 𝒇(𝒙) ≠ 𝟎, 𝒈(𝒙) ≠ 𝟎.
1 1 1
Show that 𝒎 = 𝒏 𝒂𝒏𝒅 𝒇(𝒙) = 𝒈(𝒙) . , ,
𝛼+𝛽 𝛽+𝛾 𝛾+𝛼
Sol.: Given (𝑥 − 𝑎)𝑚 𝑓(𝑥) = (𝑥 − 1 1 1
Now, 𝛼+𝛽 + 𝛽+𝛾 + 𝛾+𝛼= sum of roots of (3)
𝛼)𝑛 𝑔(𝑥) , 𝑓(𝛼) ≠ 0, 𝑔(𝛼) ≠ 0. We want to prove
that m=n and 𝑓(𝑥) = 𝑔(𝑥) . If possible let m≠n, −𝑎2 + 𝑏 𝑎2 + 𝑏
without loss of any generality. Let m>n. = =
𝑐 − 𝑎𝑏 𝑎𝑏 − 𝑐
∴ 𝑛 − 𝑚 is a +ve integer, so that 27) If 𝛼, 𝛽, 𝛾 are the roots of the cubic equation
𝒙𝟑 + 𝟑𝒙 + 𝟐 = 𝟎 from an equation whose
(𝑥 − 𝛼)𝑚 𝑓(𝑥) = (𝑥 − 𝛼)𝑛−𝑚 𝑔(𝑥)
roots are (𝜷 − 𝜸)𝟐 , (𝜸 − 𝜶)𝟐 , (𝜶 − 𝜷)𝟐 and
(𝑥 − 𝛼) hence show that 𝒙𝟑 + 𝟑𝒙 + 𝟐 = 𝟎 has
𝑖. 𝑒. ⟹ 𝛼 𝑖𝑠 𝑎 𝑟𝑜𝑜𝑡 𝑜𝑓 𝑓(𝑥) = 0 imaginary roots.
𝑓(𝑥)
⟹ 𝑓(𝛼) = 0 which is contrary to the given Sol.: 𝑥 3 + 3𝑥 + 2 = 0 … … … … . (1)

hypothesis.
∴ It roots are 𝛼, 𝛽, 𝛾
∴ Our supposition is wrong, Hence m = n and ∴ 𝛼 + 𝛽 + 𝛾 = 0, 𝛼𝛽 + 𝛽𝛾 + 𝛾𝛼 =
(𝑥 − 𝑎)𝑚 𝑓(𝑥) = (𝑥 − 𝛼)𝑛 𝑔(𝑥) ⟹ 𝑓(𝑥) = 𝑔(𝑥)
3, 𝛼𝛽𝛾 = −2.
26) The root of the equation 𝒙𝟑 − 𝒂𝒙𝟐 + 𝒃𝒙 − Let 𝛾 be a root of the transformed equation
𝒄 = 𝟎 are 𝛼, 𝛽, 𝛾 from the equation whose
roots are 𝜶 + 𝜷, 𝜷 + 𝜸, 𝜸 + 𝜶. Also express ∴ 𝛾 = (𝛽 − 𝛾)2 = (𝛽 + 𝛾)2 − 4𝛽𝛾
𝟏 𝟏 𝟏
+ 𝜷+𝜸 + 𝜸+𝜶 in terms of a, b, c. 4𝛼𝛽𝛾
𝜶+𝜷 = (−𝛼)2 −
𝛼
Sol.: Roots of the equation 𝑥 3 − 𝑎𝑥 2 + 𝑏𝑥 − [∵ 𝛼 + 𝛽 + 𝛾 = 0]
𝑐 = 0 … … … … (1) are 𝛼, 𝛽, 𝛾, if 𝛾 = 𝛼 + 𝛽 = = 𝛼2
(𝛼 + 𝛽 + 𝛾) − 𝛾 = 𝑎 − 𝛾 8
+ [∵ 𝛼𝛽𝛾 = −2]
𝛼
[∵ 𝛼 + 𝛽 + 𝛾 = 𝑎]
𝑅𝑒𝑝𝑙𝑎𝑐𝑖𝑛𝑔 𝛼 𝑏𝑦 𝑥, ∴ 𝑦
∴ 𝑦 = 𝑎 − 𝑥 𝑜𝑟 𝑥 = 𝑎 − 𝑦. Putting this value 8
of x in (1) we have (𝑎 − 𝑦)3 − 𝑎(𝑎 − 𝑦)2 + = 𝑥 2 + 𝑜𝑟 𝑥 3 − 𝑥𝑦
𝑥
𝑏(𝑎 − 𝑦) − 𝑐 = 0 + 8 = 0 … … . . (2)
𝑜𝑟, 𝑦 3 − 2𝑎𝑦 2 + (𝑎2 + 𝑏)𝑦 + (𝑐 − 𝑎𝑏) = Subtracting (2) from (1) (3 + 𝑦)𝑥 − 6 = 0
0 … … … . (2)
6
∴ 𝑥 = 3+𝑦. Putting this value of x in (1), we
Which is required equation. Its roots are 𝛼 +
1 get
𝛽, 𝛽 + 𝛾, 𝛾 + 𝛼. Changing into 𝑦 and
Multiplying by 𝑦 3 , we get (𝑐 − 𝑎𝑏)𝑦 3 + 6 3 6
( ) + 3. +2=0
(𝑎2 + 𝑏)𝑦 2 − 2𝑎𝑦 + 1 = 0 … … . . (3). 3+𝑦 3+𝑦
232
216 + 18(3 + 𝑦)2 + 2(3 + 𝑦)2 = 0. 𝑦 3 + 29) If a, b, c ∊ R, a ≠ 0, then solve the system of
18𝑦 2 + 82𝑦 + 216 = 0. Which is the required equation: 𝒂𝒙𝟏 𝟐 + 𝒃𝒙𝟏 + 𝒄 = 𝒙𝟐 ; 𝒂 𝒙𝟐 𝟐 +
equation product of all its roots = −216 𝒃𝒙𝟐 + 𝒄 = 𝒙𝟑 ; … … 𝒂𝒙𝒏−𝟏 𝟐 + 𝒃𝒙𝒏−𝟏 + 𝒄 =
𝒙𝒏 𝒂𝒏𝒅 𝒂𝒙𝒏 𝟐 + 𝒃𝒙𝒏 + 𝒄 =
∴ (𝛼 − 𝛽)2 (𝛽 − 𝛾)2 (𝛾 − 𝛼)2 = −216
𝒙𝟏 𝒊𝒔 𝒏 𝒖𝒏𝒌𝒏𝒐𝒘𝒏𝒔 𝒙𝟏 , 𝒙𝟐 , 𝒙𝒏 𝒕𝒉𝒆𝒏
R H S being – 𝑣𝑒, one of the factors. (i) (𝒃 − 𝟏)𝟐 < 4𝒂𝒄;
(ii) (𝒃 − 𝟏)𝟐 = 𝟒𝒂𝒄;
∴ that will make all the three roots imaginary (iii) (𝒃 − 𝟏)𝟐 > 4𝒂𝒄
which is not possible. Every odd integer
equation with real coefficients has at least Sol.: Given system of equation can be written
one real root on the L H S (𝛼 − 𝛽)2 𝑖𝑠 − 𝑣𝑒. as
∴ 𝛼 − 𝛽 is purely imaginary. 𝑎𝑥1 2 + (𝑏 − 1)𝑥1 + 𝑐 = 𝑥2 − 𝑥1 =

𝑓(𝑥1 ) 𝑠𝑎𝑦
∴ 𝛼 and 𝛽 are conjugate complex roots. Hence
two roots of (1) are imaginary. 𝑎 𝑥2 2 + (𝑏 − 1)𝑥2 + 𝑐 = 𝑥3 − 𝑥2 =
𝑓(𝑥2 ) 𝑠𝑎𝑦
28) The roots 𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 of the equation 𝒙𝟑 +
𝒂𝒙 + 𝒂 = 𝟎, where a is a non zero real, 𝑎𝑥𝑛−1 2 + (𝑏 − 1)𝑥𝑛−1 + 𝑐 = 𝑥𝑛 −
𝒙𝟏 𝟐 𝒙𝟐 𝟐 𝒙𝟑 𝟐 𝑥𝑛−1 = 𝑓(𝑥(𝑛−1) ) 𝑠𝑎𝑦
satisfy 𝒙𝟐
+ 𝒙𝟑
+ 𝒙𝟏
= −𝟖. Find
𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 𝑎𝑥𝑛 2 + (𝑏 − 1)𝑥𝑛 + 𝑐 = 𝑥1 − 𝑥𝑛 =
𝑓(𝑥(𝑛) ) 𝑠𝑎𝑦
Sol.: We are given 𝑥1 3 𝑥3 + 𝑥2 3 𝑥1 + 𝑥3 3 𝑥2 =
8𝑥1 𝑥2 𝑥3
𝑓(𝑥1 ) + 𝑓(𝑥2 ) + ⋯ + 𝑓(𝑥𝑛 ) = 0 … . . (1)
𝑥1 + 𝑥2 + 𝑥3 = 0; 𝑥1 𝑥2 + 𝑥2 𝑥3 + 𝑥3 𝑥1 = 𝑎;
Case 1: When (𝑏 − 1)2 < 4𝑎𝑐. Each roots of
𝑥1 𝑥2 𝑥3 = −𝑎 𝑎𝑛𝑑 𝑓𝑜𝑟 𝑖 = 1, 2, 3. 𝑎𝑥1 2 + (𝑏 − 1)𝑥1 + 𝑐 = 0 are imaginary. If a
> 0, then
𝑥𝑖 3 + 𝑎𝑥𝑖 + 𝑎 = 0, 𝑥1 3 + 𝑎𝑥1 + 𝑎 = 0
𝑓(𝑥1 ) + 𝑓(𝑥2 ) + ⋯ + 𝑓(𝑥𝑛 ) > 0. 𝐼𝑓 𝑎 <
𝑁𝑜𝑤, 𝑥2 3 + 𝑎𝑥2 + 𝑎 = 0, 𝑥3 3 + 𝑎𝑥3 + 0, 𝑡ℎ𝑒𝑛
𝑎 = 0.
𝑓(𝑥1 ) + 𝑓(𝑥2 ) + ⋯ + 𝑓(𝑥𝑛 ) ≠ 0
⟹ (𝑥1 3 𝑥3 + 𝑥2 3 𝑥1 + 𝑥3 3 𝑥2 )
+ 𝑎(𝑥1 𝑥3 + 𝑥1 𝑥3 ∴No solution.
+ 𝑥2 𝑥1 + 𝑥3 𝑥2 )
+ 𝑎(𝑥3 + 𝑥1 + 𝑥2 ) = 0. Case 2: When (𝑏 − 1)2 = 4𝑎𝑐. In case 1 and 2
all of
𝑖. 𝑒. , 8𝑎 + 𝑎2 = 0 ⟹ 𝑎 = −8
𝑓(𝑥1 ) , 𝑓(𝑥2 ) , … , 𝑓(𝑥𝑛 ) ≥
3
So, given equation is 𝑥 − 8𝑥 − 8 = 0, 𝑓(𝑥1 ) , 𝑓(𝑥2 ) , … , 𝑓(𝑥𝑛 ) ≤ 0
0, 𝑜𝑛𝑒 𝑟𝑜𝑜𝑡 𝑖𝑠 − 2, other roots are given by From equation (1),
𝑥 2 − 2𝑥 − 4 = 0 𝑖. 𝑒. 𝑥 = 1 ± √5
𝑓(𝑥1 ) + 𝑓(𝑥2 ) + ⋯ + 𝑓(𝑥𝑛 ) = 0,
𝑆𝑜, {𝑥1 , 𝑥2 , 𝑥3 } = {−2, 1 − √5, 1 + √5}
233
𝑓(𝑥1 ) = 𝑓(𝑥2 ) = ⋯ = 𝑓(𝑥𝑛 ) = 0 ∴ 𝑥1 = 𝑥2 = ⋯ =

𝑥𝑛 𝑡ℎ𝑒𝑛 𝑒𝑎𝑐ℎ 𝑎𝑥𝑖 2 + (𝑏 − 1)𝑥𝑖 + 𝑐 =
𝐵𝑢𝑡 𝑓(𝑥𝑖) = 0 ⟹ 𝑎𝑥𝑖 2 + (𝑏 − 1)𝑥𝑖 + 𝑐 = 0 0
−(𝑏 − 1) ± 0 𝑠𝑜 𝑥1 = 𝑥2 = ⋯ = 𝑥𝑛
𝑥𝑖 =
2𝑎 (1 − 𝑏) ± √(𝑏 − 1)2 − 4𝑎𝑐
1−𝑏 =
= [∵ (𝑏 − 1)2 2𝑎
2𝑎
= 4𝑎𝑐] 𝑤ℎ𝑒𝑛 𝑎 > 0 𝑤𝑒 𝑔𝑒𝑡
1−𝑏 𝑥1 = 𝑥2 = ⋯ = 𝑥𝑛
𝐻𝑒𝑛𝑐𝑒 𝑥1 = 𝑥2 = ⋯ = 𝑥𝑛 =
2𝑎 (1 − 𝑏) ± √(𝑏 − 1)2 − 4𝑎𝑐
=
Case 3: When (𝑏 − 1)2 > 4𝑎𝑐. Roots of 𝑎𝑥𝑖 2 + 2𝑎
(𝑏 − 1)𝑥𝑖 + 𝑐 = 0, are real and unequal. Let 𝛼
30) Let 𝑷(𝒙) = 𝟎 be a fifth degree polynomial
and 𝛽 be roots.
equation with integer coefficients that has
If 𝑎 < 0 ∀𝑥1 ∊ [𝛼, 𝛽] 𝑎 𝑥1 2 + (𝑏 − 1)𝑥1 + 𝑐 ≥ at least one integer root. If 𝑷(𝟐) =
0 𝟏𝟑 𝒂𝒏𝒅 𝑷(𝟏𝟎) = 𝟓. Compute a value of x
that must satisfy 𝑷(𝒙) = 𝟎.
𝑖. 𝑒. 𝑓(𝑥1 ) ≥ 0
Sol.: Let 𝑃(𝑥) ≡ (𝑥 − 2) 𝑞(𝑥) + 𝑃(2) , 𝑞(𝑥) would
𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥𝑖 ∊ [𝛼, 𝛽],
have integer coefficients.
(𝑖 = 1, 2, 3 … 𝑛)𝑖. 𝑒. 𝑓(𝑥1 ) ≥ 0
Let r be an integer such that 𝑃(𝑟) = 0
𝐵𝑢𝑡 𝑓(𝑥1 ) + 𝑓(𝑥2 ) + ⋯ + 𝑓(𝑥𝑛 ) = 0, 2
Then 𝑃(𝑟) = (𝑟 − 2). 𝑞(𝑟) + 13 = 0, 𝑆𝑜 𝑟 −
13
𝑓(𝑥1 ) = 𝑓(𝑥2 ) = ⋯ = 𝑓(𝑥𝑛 ) = 0
𝑇ℎ𝑢𝑠, 𝑟 − 2 can only equal ± 𝑜𝑟 ± 13. Leading
∴ 𝑥1 = 𝑥2 = ⋯ = 𝑥𝑛 to r = 3, 1, 15, or −11.
𝑡ℎ𝑒𝑛 𝑒𝑎𝑐ℎ 𝑎𝑥𝑖 2 + (𝑏 − 1)𝑥𝑖 + 𝑐 = 0 𝐿𝑒𝑡 𝑃(𝑥) ≡ (𝑥 = 10), 𝐹(𝑥) + 𝑃(10) . Leads to 𝑟 −
10
.
𝑆𝑜, 𝑥1 = 𝑥2 = ⋯ = 𝑥𝑛 5
= −(𝑏 − 1)
So r can only be 11, 9, 15 or 5. Thus, r = 15.
√(𝑏 − 1)2 − 4𝑎𝑐
±
2𝑎 31) If 𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 are the roots of 𝒙𝟑 − 𝒙𝟐 + 𝟒 =
𝟎, from the equation whose roots are 𝒙𝟏 +
𝐴𝑙𝑠𝑜, ∀ 𝑥1 ∉ (𝛼, 𝛽)(𝑖 = 1, 2, 3, … 𝑛)𝑖. 𝑒. 𝑓(𝑥𝑖 )
𝒙𝟐 𝟐 + 𝒙𝟑 𝟐 ; 𝒙𝟐 + 𝒙𝟑 𝟐 + 𝒙𝟏 𝟐 ; 𝒙𝟑 + 𝒙𝟏 𝟐 +
≤0
𝒙𝟐 𝟐
𝑏𝑢𝑡 𝑓(𝑥1 ) + 𝑓(𝑥2 ) + ⋯ + 𝑓(𝑥𝑛 ) = 0,
Sol.: 𝑥1 , 𝑥2 , 𝑥3 are the roots of equation
𝑠𝑜 𝑓(𝑥1 ) = 𝑓(𝑥2 ) = ⋯ = 𝑓(𝑥𝑛 ) = 0
𝑥 3 − 𝑥 2 + 4 = 0 … … … … (1)
∴ 𝑥1 + 𝑥2 + 𝑥3 = 1; 𝑥1 𝑥2 + 𝑥2 𝑥3 +
𝑥3 𝑥1 = 0;
234
If the transformed equation is in terms of y, 𝛼𝑧 = −6𝛼 − 6 𝑜𝑟 𝛼(𝑧 + 6) = −6, 𝛼

then 6
= −
𝑧+6
𝑦 = 𝑥1 + 𝑥2 2 + 𝑥3 2 = 𝑥1 +
(𝑥2 + 𝑥3 )2 − 2𝑥2 𝑥3 But 𝛼 is a root of 𝑥 3 + 3𝑥 + 2 = 0
2𝑥1 𝑥2 𝑥3 6 3 6
= 𝑥1 + (1 − 𝑥1 )2 − ∴ [− ] + 3 [− ]+2=0
𝑥1 𝑧+6 𝑧+6
8
= 𝑥1 + (1 − 𝑥1 )2 + (𝑧 + 6)3 − 9(𝑧 + 6)2 − 108
𝑥1
= 0, 𝑧 3 + 9𝑧 2 − 216 = 0
8
∴ 𝑦 = 𝑥 + (1 − 𝑥)2 + 𝑙𝑒𝑡 𝑧1 , 𝑧2 , 𝑧3 be the roots of above equation
𝑥
8 then;
= 𝑥2 − 𝑥 + 1 +
𝑥
𝑧1 , 𝑧2 , 𝑧3 = (𝛼 − 𝛽)(𝛼 − 𝛾) (𝛽 − 𝛾)(𝛽 −
3 2 𝛼) (𝛾 − 𝑎)(𝛾 − 𝛽) = 216
𝑜𝑟 𝑥 − 𝑥 + 𝑥 − 𝑥𝑦 + 8 = 0 … … (2)
Subtracting (2) from (1), we get 𝑥𝑦 − 𝑥 − 𝑜𝑟 − (𝛼 − 𝛽)2 (𝛽 − 𝛾)2 (𝛾 − 𝑎)2 = 216,

4
4=0⟹𝑥=
𝑦−1 (𝛼 − 𝛽)2 (𝛽 − 𝛾)2 (𝛾 − 𝑎)2 = 216
Putting this value of x in (1), we get Hence, one of the factors in R H S must be
64 16 −𝑣𝑒 say (𝛼 − 𝛽)2 𝑖𝑠 − 𝑣𝑒 𝑖. 𝑒. 𝛼 − 𝛽 =pure
3
− +4=0 imaginary showing that 𝛼 and 𝛽 are conjugate
(𝑦 − 1) (𝑦 − 1)2
complex. Hence, the given equation has two
⟹ (𝑦 − 1)3 − 4(𝑦 − 1) + 16 = 0 imaginary roots.
32) If 𝛼, 𝛽, 𝛾 be the roots of the equation 𝒙𝟑 + 33) If 𝛼, 𝛽, 𝛾 be the roots of 𝒙𝟑 − 𝒙𝟐 + 𝟒 = 𝟎,

𝟑𝒙 + 𝟐 = 𝟎, find the equation whose roots find that the equation whose roots are 𝜶 −
are (𝜶 − 𝜷)(𝜶 − 𝜸), (𝜷 − 𝜸)(𝜷 − 𝜶), (𝜸 − 𝜶𝟐 + (∑ 𝜶𝟐 ), 𝜷 − 𝜷𝟐 + (∑ 𝜶𝟐 ), 𝜸 − 𝜸𝟐 +
𝒂)(𝜸 − 𝜷). (∑ 𝜶𝟐 )
Hence show that the above equation has two Sol.: ∑ 𝛼 = 1, ∑ 𝛼𝛽 = 0 ∴ ∑ 𝛼 2 = ∑ 𝛼 2 −

imaginary roots. 2 ∑ 𝛼𝛽 = 1 … . . (1)
Sol.: Let 𝑧 = (𝛼 − 𝛽)(𝛼 − 𝛾) = 𝛼 2 − 𝛼𝛽 − 𝐴𝑙𝑠𝑜 𝛼 3 − 𝛼 2 + 4 = 0 [∴𝛼 is a root of the

𝛼𝛾 + 𝛽𝛾 given equation]
2𝛼𝛽𝛾
= 𝛼 2 − ∑ 𝛼𝛽 + 𝑜𝑟 𝛼𝑧 = 𝛼 3 − 3𝛼 + 4
𝛼 ∴ 𝛼 2 − 𝛼 = − 𝑜𝑟 𝛼 − 𝛼 2
2(−2) … … … . (1) 𝛼
4
= … … (2)
[∵ ∑ 𝛼𝛽 = 3; 𝛼𝛽𝛾 = −2]𝑎𝑙𝑠𝑜 𝛼 3 + 3𝛼 + 2 = 𝛼
0, 𝑤𝑒 𝑔𝑒𝑡 Let 𝛾 be a root of the new equation
𝛼 2 − 3𝛼 = −6𝛼 − 2 on putting this value ∴ 𝛾 = 𝛼 − 𝛼 2 + (𝛼 2 + 𝛽 2 + 𝛾) =
in(1) 4
+ 1[𝑏𝑦 (1)𝑎𝑛𝑑 (2)]
𝛼
235
4 4 (2𝑎 + 𝑏)(𝑥 − 1) + (𝑎 + 𝑏 + 𝑐) = 2𝑥 +
∴𝛾−1= 𝑜𝑟 𝛼 =
𝛼 𝛾−1 1
Since 𝛼 is a root of 𝑥 3 − 𝑥 2 + 4 = 0, we get Putting x = 1, we get 𝑎 + 𝑏𝑐 = 3 … … … … (3)
64 16 Putting x = 0, throughout, we get – 𝑎 + 𝑐 =

3
− +4
(𝛾 − 1) (𝛾 − 1)2 1 … … … (4)
= 0, (𝛾 − 1)3
− 4(𝛾 − 1) + 16 From (2), (3) and (4), we get 𝑎 = 2, 𝑏 =
=0 −2, 𝑐 = 3
3 2
𝑜𝑟, 𝑦 − 3𝑦 − 𝑦 + 19 = 0
Remainder = 𝑎𝑥 2 + 𝑏𝑥 + 𝑐 = 2𝑥 2 − 2𝑥 + 3.
34) A polynomial 𝒇(𝒙) with rational 35) If 𝒑(𝒙) = 𝒙𝟐 + 𝒂𝒙 + 𝒃 be a quadratic
coefficients leaves remainder 15. When polynomial in which a, b are inters. Given
divided by 𝒙 − 𝟑 and remainder 𝟐𝒙 + 𝟏, any integer n, show that there is an integer
when divided by (𝒙 − 𝟏)𝟐 . Find the M such that 𝒑(𝒏) 𝒑(𝒏+𝟏) = 𝒑(𝑴)
remainder when 𝒇(𝒙) is divided by (𝒙 −
𝟑)(𝒙 − 𝟏)𝟐 . Sol.: Let the zero’s of 𝑝(𝑥) be 𝛼, 𝛽 so that
𝑝(𝑥) = (𝑥 − 𝛼)(𝑥 − 𝛽). 𝑇ℎ𝑒𝑛 𝑝(𝑛) =
Sol.: Let quotient be 𝑞(𝑥) and remainder be (𝑛 − 𝛼)(𝑛 − 𝛽. )
𝑟(𝑥) when 𝑓(𝑥) 𝑖𝑠 𝑑𝑖𝑣𝑖𝑑𝑒𝑑 𝑏𝑦 (𝑥 − 3)(𝑥 − 1)2 .
𝑝(𝑛+1) = (𝑛 + 1 − 𝛼)(𝑛 + 1 − 𝛽) we have to
Now as divisor is a polynomial of degree 3 the show that 𝑝(𝑛) 𝑝(𝑛+1) can be written as
remainder must be polynomial of degree at (𝑡 − 𝛼)(𝑡 − 𝛽) for some integer t (which will
most 2. i.e., it must be of the form 𝑎𝑥 2 + 𝑏𝑥 + depend upon)
𝑐; a, b, c are some rational numbers.
𝑝(𝑛) 𝑝(𝑛+1) = (𝑛 − 𝛼)(𝑛 − 𝛽. )(𝑛 + 1 −
𝑎𝑥 2 + 𝑏𝑥 + 𝑐 = 𝑎[(𝑥 − 1) + 1]2 + 𝛼)(𝑛 + 1 − 𝛽)
𝑏[(𝑥 − 1) + 1] + 𝑐
= {(𝑛 − 𝛼)(𝑛 + 1 − 𝛽)}{(𝑛 − 𝛽)(𝑛 +
= 𝑎(𝑥 − 1)2 + (2𝑎 + 𝑏)(𝑥 − 1) + 𝑎 + 1 − 𝛼)}
𝑏+𝑐
= {𝑛(𝑛 + 1) − 𝑛(𝛼 + 𝛽) − 𝛼 + 𝛼𝛽} ×
𝐵𝑦 𝑑𝑖𝑣𝑖𝑠𝑖𝑜𝑛 𝑎𝑙𝑔𝑜𝑟𝑖𝑡ℎ𝑚, {𝑛(𝑛 + 1) − 𝑛(𝛼 + 𝛽) − 𝛽 + 𝛼𝛽}
𝑓(𝑥) ≡ 𝑞(𝑥) (𝑥 − 3)(𝑥 − 1)2 + = {𝑛(𝑛 + 1) + 𝑛𝛼 + 𝑏 − 𝛼}{{𝑛(𝑛 +
𝑎(𝑥 − 1)2 + (2𝑎 + 𝑏)(𝑥 − 1) + 𝑎 +
1)} + 𝑛𝑎 + 𝑏 − 𝛽}
𝑏 + 𝑐 … … . (1)
= (𝑡 − 𝛼)(𝑡 − 𝛽); 𝑡 = 𝑛(𝑛 + 1) + 𝑎𝑛 +
Now according to given condition 𝑓(𝑥) leaves a
𝑏 = 𝑝(𝑡)
remainder 15 when divided by 𝑥 − 3
𝑇ℎ𝑢𝑠, 𝑝(𝑛) 𝑝(𝑛+1) can be written as 𝑝(𝑀) for
∴𝑓(3) = 15
𝑝(𝑛) 𝑀 = 𝑛(𝑛 + 1) + 𝑎𝑛 + 𝑏
Now putting x = 3 in (1), we have
236
36) If n is an odd integers no divisible by 3, 𝑥𝑛 − 1

1 + 𝑥 + 𝑥 2 + ⋯ + 𝑥 𝑛−1 =
show that 𝒙𝒚(𝒙 + 𝒚)(𝒙𝟐 + 𝒙𝒚 + 𝒚𝟐 ) is a 𝑥−1
factor of (𝒙 + 𝒚)𝒏 − 𝒙𝒏 − 𝒚𝒏
It is required to find out at what n.
Sol.: We have 𝑥2𝑛 −1
[ 2 ]
𝑥 −1
will be a polynomial in x,
𝑥𝑦(𝑥 + 𝑦)(𝑥 2 + 𝑦 2 + 𝑥𝑦) = 𝑥𝑦(𝑥 + 𝑦)(𝑥 − [
𝑥𝑛 −1
]
𝑥−1
𝑤𝑦)(𝑥 − 𝑤 2 𝑦) 𝑥2𝑛 −1
[ 2 ] 𝑥 𝑛 +1
𝑥 −1
𝑤𝑒 𝑓𝑖𝑛𝑑, 𝑥𝑛 −1
=
[𝑤, 𝑤 2 are non real cube roots of unity] [
𝑥−1
] 𝑥+1
It is enough to show that (𝑥 + 𝑦)𝑛 − 𝑥 𝑛 − 𝑦 𝑛 For 𝑥 𝑛 + 1 to be divisible by x +1, it is

vanishes for x = 0; y = 0. Now, 𝑥 = −𝑦; 𝑥 = necessary and sufficient that (−1)𝑛 + 1 = 0
𝑤𝑦 𝑎𝑛𝑑 𝑥 = 𝜔2 𝑦 i.e. n is odd.
The polynomial obviously vanishes for x = Thus, 1 + 𝑥 + 𝑥 𝑛 + ⋯ + 𝑥 2𝑛−2 is divisible by

𝑤𝑦 1 + 𝑥 + 𝑥 2 + ⋯ + 𝑥 𝑛−1 , if n is odd.
(𝑤𝑦 + 𝑦)𝑛 − (𝑤𝑦)𝑛 − 𝑦 𝑛 = 𝑦 𝑛 [(𝑤 + 1)𝑛 − 38) Find out at what values of p and q where
𝑤 𝑛 − 1] 𝒙𝟒 + 𝟏 is divisible by 𝒑𝟐 + 𝒑𝒙 + 𝒒?
= 𝑦 𝑛 [(−𝑤 2 )𝑛 − 𝑤 𝑛 − 1] = −𝑦 𝑛 [(𝑤 + 1)𝑛 − Sol.: Let us suppose

𝑤 𝑛 − 1]
𝑥 4 + 1 = (𝑥 2 + 𝑝𝑥 + 𝑞)(𝑥 2 + 𝑝′ 𝑥 + 𝑞 ′ )
= 𝑦 𝑛 [(−𝑤 2 )𝑛 − 𝑤 𝑛 − 1] = −𝑦 𝑛 [𝑤 2𝑛 + 𝑤 𝑛 + = 𝑥 4 (𝑝 + 𝑝′ )𝑥 3 (𝑞
1] + 𝑞 ′ 𝑝𝑝′ )𝑥 2 . (𝑝𝑞 ′ + 𝑞𝑝′ )𝑥
+ 𝑞𝑞′
(∵ n is odd)
For determining p, q, p’ and q’ we have four
Let 𝑛 = 3𝑝 + 2, 𝑡ℎ𝑒𝑛 𝑤 𝑛 = 𝑤 3𝑝+1 , 𝑤 2𝑛 =
equations.
𝑤 6𝑝+2 = 𝑤 2
p +p’ = 0, 𝑝𝑝′ + 𝑞 + 𝑞 ′ = 0, 𝑝𝑞 ′ +
∴ Above expression = −𝑦 𝑛 [𝑤 2 + 𝑤 + 1] = 0 𝑞𝑝′ = 0, 𝑞𝑞 ′ = 1
If n =3p+2, then 𝜔𝑛 = 𝜔2 , 𝜔2𝑛 = 𝜔 and the From(1) and (3), we find 𝑝′ = −𝑝(𝑞 ′ − 𝑞) =
above expression is zero. We can similarly 0 assume
prove that the given polynomial vanishes for
𝑥 = 𝜔2 𝑦. If n is an odd positive integer not Case 1: 𝑝 = 0, 𝑝′ = 0, 𝑞 + 𝑞 ′ = 0, 𝑞𝑞 ′ =
divisible by 3, then (𝑥 + 𝑦)𝑛 − 𝑥 𝑛 − 𝑦 2 is 1, 𝑞 2 = −1
divisible by 𝑥𝑦(𝑥 2 + 𝑦 2 + 𝑥𝑦).
𝑞 = ±𝑖; 𝑞 ′ = ±𝑖.
37) Find out at what n the polynomial 𝟏 +
The corresponding factorization has the from
𝒙𝟐 + 𝒙𝟒 + ⋯ + 𝒙𝟐𝒏−𝟐 is divisible by the
𝑥 4 + 1 = (𝑥 2 + 𝑖)(𝑥 2 − 𝑖)
polynomial 𝟏 + 𝒙 + 𝒙𝟐 + 𝒙𝒏−𝟏
𝑥 2𝑛−1 Case 2: 𝑞 ′ = 𝑞, 𝑞 2 = 1, 𝑞 = ±1, suppose first

Sol.: 1+𝑥 2 + 𝑥 4 + ⋯ + 𝑥 2𝑛−2 = 𝑥 2 −1
, 𝑞 ′ = 𝑞 = 1 𝑡ℎ𝑒𝑛 𝑝𝑝′ = −2, 𝑝 + 𝑝′ = 0, 𝑝2 =
2, 𝑝 = ±√2, 𝑝′ = ±√2
237
The corresponding factorization is 𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝑔(𝑎1 ) = 𝑔(𝑎2 ) = ⋯ = 𝑔(𝑎𝑛 ) = 1
𝑥 4 + 1 = (𝑥 2 − √2𝑥 + 1)(𝑥 2 − √2𝑥 + 1) ∵ 𝑓(𝑥) − 1, 𝑔(𝑥) − 1 vanish when 𝑥 =

𝑎1 , 𝑎2 , … , 𝑎𝑛
Assume then,
∴ 𝑓(𝑥) − 1 = 𝑝(𝑥) (𝑥 − 𝑎1 )(𝑥 − 𝑎2 ) … . (𝑥 − 𝑎𝑛 )
𝑞 = 𝑞 ′ = 1, 𝑝 + 𝑝′ = 0, 𝑝𝑝′ = 2; 𝑝 =
±√2𝑖, 𝑝′ = √2𝑖 By factor theorem,
Factorization will be 𝑔(𝑥) − 1 = 𝑞(𝑥) (𝑥 − 𝑎1 )(𝑥 − 𝑎2 ) … . (𝑥 − 𝑎𝑛 )
𝑥 4 + 1 = (𝑥 2 + √2𝑥𝑖 − 1)(𝑥 2 − 𝑝(𝑥) , 𝑞(𝑥) are polynomial with integer

√2𝑥1 − 1 coefficients.
39) Show that if 𝒂𝟏 , 𝒂𝟐 , … , 𝒂𝒏 are all distinct, ∵ 𝑓(𝑥) . 𝑔(𝑥) 𝑖𝑠 𝑎 𝑑𝑒𝑔𝑟𝑒𝑒 𝑜𝑓 2𝑛, 𝑝(𝑥) . 𝑞(𝑥) must
then the polynomial (𝒙 − 𝒂𝟏 )𝟐 (𝒙 − be both constants. Suppose 𝑝(𝑥) = 𝑎, 𝑞(𝑥) = 𝑏
𝒂𝟐 )𝟐 … . (𝒙 − 𝒂𝒏 )𝟐 + 𝟏 can never be
𝑇ℎ𝑒𝑛 𝑓(𝑥) = 𝑎(𝑥 − 𝑎1 )(𝑥 − 𝑎2 ) … . (𝑥 − 𝑎𝑛 ) +
written as the product of two polynomials
1
with integer coefficients.
𝑔(𝑥) = 𝑏(𝑥 − 𝑎1 )(𝑥 − 𝑎2 ) … . (𝑥 − 𝑎𝑛 ) + 1
Sol.: Suppose that there exists polynomial
𝑓(𝑥) . 𝑔(𝑥) with integer coefficients such that (substituting these conditions these
conditions imply 𝑎2 = −1, 𝑏 2 = −1)
𝑓(𝑥) . 𝑔(𝑥) = (𝑥 − 𝑎1 )2 (𝑥 −
𝑎2 )2 … . (𝑥 − 𝑎𝑛 )2 + 1 … … … . (1) ∴ There is a contradiction and given
polynomial cannot be expressed as the
∴ R H S is always +ve.
product of two polynomials with integer
∴ 𝑓(𝑥) can never vanish. coefficients.
So its sign never changes. 40) If 𝜶𝟏𝟑 = 𝟏, 𝒂𝒏𝒅 𝜶 ≠ 𝟏, find an equation,

whose roots are 𝜶 + 𝜶𝟑 + 𝜶𝟒 + 𝜶−𝟒 +
Similarly 𝑔(𝑥) can never vanish and its sign 𝜶−𝟑 + 𝜶−𝟏 𝒂𝒏𝒅 𝜶𝟐 + 𝜶𝟓 + 𝜶𝟔 + 𝜶−𝟔 +
never changes. 𝜶−𝟓 + 𝜶−𝟐
∴𝑓(𝑥) , 𝑔(𝑥) are always +ve, so 𝑓(𝑥) 𝑎𝑛𝑑 𝑔(𝑥) are Sol.: Let A = 𝛼 + 𝛼 3 + 𝛼 4 + 𝛼 −4 + 𝛼 −3 + 𝛼 −1
both always +ve.
= 𝛼 + 𝛼 3 + 𝛼 4 + 𝛼 9 + 𝛼 10 +
Substituting 𝑥 = 𝑎1 , 𝑎2 , … , 𝑎𝑛 in (1) we get 𝛼 12 (∵ 𝛼 13 = 1)
𝑓(𝑎1 ) 𝑔(𝑎1 ) = 1, 𝑓(𝑎2 ) 𝑔(𝑎2 ) = 𝐵 = 𝛼 2 + 𝛼 5 + 𝛼 6 + 𝛼 −6 + 𝛼 −5 + 𝛼 −2 =

1, … . . , 𝑓(𝑎𝑛 ) 𝑔(𝑎𝑛 ) = 1 𝛼 2 + 𝛼 5 + 𝛼 6 + 𝛼 7 + 𝛼 8 + 𝛼 11
∵ 𝑓(𝑎1 ) , … … , 𝑓(𝑎𝑛 ) are all +ve integers. 𝐴 + 𝐵 = 𝛼 + 𝛼2 + 𝛼3 + 𝛼4 + 𝛼5 + 𝛼6 + 𝛼7 +

𝛼 8 + 𝛼 9 + 𝛼 10 + 𝛼 11 + 𝛼 12 = (1 + 𝛼 + 𝛼 2 +
It follows that (𝛼 13 −1)
𝛼 3 + ⋯ + 𝛼 12 ) − 1 = (𝛼−1)
− 1=1
𝑓(𝑎1 ) = 𝑓(𝑎2 ) = ⋯ = 𝑓(𝑎𝑛 ) = 1
238
𝐴 × 𝐵 = (𝛼 + 𝛼 3 + 𝛼 4 + 𝛼 9 + 𝛼 10 + 𝛼 12 ) × = 𝑎 + 𝑏 + 𝑐 + 𝑑 = (𝑎 + 𝑏 + 𝑐 + 𝑑) −
(𝛼 2 + 𝛼 5 + 𝛼 6 + 𝛼 7 + 𝛼 8 + 𝛼 11 ) 2𝑑 = 𝑝(1) − 2𝑝(0) ≤ 1 + 2 = 3 < 7
= 3(𝛼 + 𝛼 2 + 𝛼 3 + ⋯ + 𝛼 12 ) ≤ Case 3: 𝑑 ≥ 0, 𝑐 > 0 𝑡ℎ𝑒𝑛 |𝑎| + |𝑏| + |𝑐| + |𝑑|

3(−1) = −3
=𝑎+𝑏+𝑐+𝑑
Required equation is 𝑥 2 + 𝑥 − 3 = 0 4 1
= 𝑝(1) − 𝑝(−1)
3 3
41) Show that 𝒇(𝒙) = 𝒙𝟏𝟎𝟎 − 𝒙𝟓𝟎𝟎 + 𝒙𝟏𝟎𝟎 + 8 8
− 𝑝1 +
𝒙 + 𝟏 = 𝟎 has no rational roots. 3 2
( ) 3
𝑝 4 1 8 8 21
Sol.: If there a rational root. Let it be 𝑞 , where 𝑝 1 ≤ + + + = =7
(− )
2 3 3 3 3 3
(𝑝, 𝑞) = 1, 𝑞 ≠ 0. Then q should divide the
coefficient of the leading term and p should Case 4: If d< 0, c< 0 then |a|+|b|+|c|+|d| =
divide the constant term. 𝑎+𝑏−𝑐−𝑑
𝑞 𝑝
Thus, 1 ⟹ 𝑞 = ±1 𝑎𝑛𝑑 1 = 𝑝 = ±1 5 1 4 1
= 𝑝(1) − 4𝑝 ( ) + 𝑝 (− )
3 2 3 2
𝑝 𝑝 5 4 21
𝑇ℎ𝑢𝑠, = ±1. 𝐼𝑓 𝑡ℎ𝑒 𝑟𝑜𝑜𝑡 = 1, 𝑡ℎ𝑒𝑛 ≤ +4+ = =7
𝑞 𝑞 3 3 3
𝑓(1) = 1 − 1 + 1 + 1 + 1 = 3 ≠ 0. 43) If all the coefficients in the equation 𝒇(𝒏) =
𝒙𝒏 + 𝒑𝟏 𝒙𝒏−𝟏 + 𝒑𝟐 𝒙𝒏−𝟐 + ⋯ + 𝒑𝒏 = 𝟎 be
So 1 is not a root.
whole numbers and if 𝒇(𝟎) 𝒂𝒎𝒅 𝒇(𝟏) be
𝑝 each odd integers. Show that the equation
If 𝑞
= −1, 𝑡ℎ𝑒𝑛 𝑓(−1) = 1 ≠ 0
cannot have a common measurable root.
Hence, -1 is not a root. Thus, there exists no
Sol.: Given 𝑥 𝑛 + 𝑝1 𝑥 𝑛−1 + 𝑝2 𝑥 𝑛−2 + ⋯ +
rational roots for given polynomial.
𝑝𝑛 = 𝑓(𝑥) = 0 … … … … . . (1)
42) If 𝒑(𝒙) be a real polynomial function 𝒑(𝒙) =
Cannot have fractional root as all coefficients
𝒂𝒙𝟑 + 𝒃𝒙𝟐 + 𝒄𝒙 + 𝒅. Show that if |𝒑(𝒙) | ≤
are integers and coefficients of 𝑥 𝑛 is 1.
𝟏 for all x such that |𝒙| ≤ 𝟏, 𝒕𝒉𝒆𝒏 |𝒂| +
|𝒃| + |𝒄| + |𝒅| ≤ 𝟕. It cannot have even roots as of 𝑓(0) 𝑖. 𝑒. , 𝑝𝑛 is
odd.
Sol.: Considering the polynomials ±𝑝(±𝑥) . We
may assume without loss of generality that a, Hence 𝑓(2𝑚) will be odd
b>0
∵ all the terms expect the last term are even.
Case 1: If c, d > 0, then 𝑝(1) = 𝑎 + 𝑏 + 𝑐 + 𝑑 ≤ In the given equation it cannot have odd
1<7 roots, for it x is odd. Then 𝑥 𝑛 = an odd
number = an even number +𝑓(𝑥) = an odd
Case 2: If 𝑑 ≤ 0 𝑎𝑛𝑑 𝑐 ≤ 0, 𝑡ℎ𝑒𝑛 |𝑎| + |𝑏| +
number, as so it cannot vanishes. Thus
|𝑐| + |𝑑|
equation (1) cannot have common surable
roots.
239
44) Find all polynomials 𝒇(𝒙) with real 𝑓(2𝑢−1) 𝑣 − (2𝑢 − 1)2𝑛 𝑣 2𝑛 + (2𝑢 −
coefficients which satisfy the equality 1)2𝑛−2 𝑣 2𝑛−2 … ….
𝒇(𝒂−𝒃) + 𝒇(𝒃−𝒄) + 𝒇(𝒄−𝒂) = 𝒇(𝒂 + 𝒃𝒄)∀
real numbers a, b, c such that 𝒂𝒃 + 𝒃𝒄 + 𝑓(1−𝑢2 ) 𝑣 = (1 − 𝑢2 )2𝑛 𝑣 2𝑛 + (1 −
𝒄𝒂 = 𝟎 𝑢2 )2𝑛−2 𝑣 2𝑛−2 … …
Sol.: Let 𝑓(𝑥) be a polynomial which satisfy the 𝑓(𝑢2 −2𝑢) 𝑣 = (𝑢2 − 2𝑢)2𝑛 + 𝑣 2𝑛 + ⋯
equation if a = b = 0
𝑓(𝑢2 −𝑢+1) 𝑣 = (𝑢2 − 𝑢 + 1)2𝑛 𝑣 2𝑛 + ⋯
Then 𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎 = 0 𝑓𝑜𝑟 𝑒𝑎𝑐ℎ 𝑐 ∊
𝑅 𝑠𝑜 𝑤𝑒 𝑔𝑒𝑡 𝑓(0−0) + 𝑓(0−𝑐) + 𝑓(𝑐−0) = How equality the leading coefficients of both
27(0 + 0 + 𝑐), ∀ 𝑐 ∊ 𝑅 sides of (1), we get (2𝑢 − 1)2𝑛 +
(1 − 𝑢2 )2𝑛 + (𝑢2 − 2𝑢)2𝑛 = 2(𝑢2 − 𝑢 +
⟹ 𝑓(0) + 𝑓(−𝑐) + 𝑓(𝑐) = 27(𝑐) , ∀ 𝐶 ∊ 𝑅 1)2𝑛 ∀ 𝑢 ∈ 𝑅
⟹ 𝑓(0) + 𝑓(−𝑐) = 𝑓(𝑐) ∀ 𝐶 ∊ 𝑅 𝐿𝑒𝑡 𝑐 = 𝐿𝑒𝑡 𝑢 = −2, 𝑡ℎ𝑒𝑛 (−5)2𝑛 + (−3)2𝑛 + (8)2𝑛 =
0 𝑤𝑒 𝑔𝑒𝑡 𝑓(0) = 0 2(7)2𝑛
𝑠𝑜 𝑡ℎ𝑎𝑡 𝑓(𝑐) = 𝑓(𝑐) ∀ 𝐶 ∊ 𝑅. 5𝑛 + 32𝑛 + 82𝑛 = 2(7)2𝑛 .
Hence, f is even which must be of the from Now above result is true only for x = 1 and x
=2
𝑓(𝑥) = 𝑎𝑛 𝑥 2𝑛 + 𝑎𝑛−1 𝑥 2𝑛−2 + ⋯ +
𝑎1 𝑥 2 𝑤𝑖𝑡ℎ 𝑎1 , 𝑎2 , 𝑎3 , … … . , 𝑎𝑛 ∊ 𝑅 ∴𝑓(𝑥) is either 𝛼𝑛2 𝑓𝑜𝑟 𝑛 = 1. 𝑜𝑟 𝛽𝑥 2 𝑓𝑜𝑟 𝑛 =
2
For any real number u and v the triplet (a, b,
c) will satisfy 𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎. Hence 𝑓(𝑥) can be written as a linear
combination i.e. 𝑓(𝑥) = 𝛼𝑥 2 + 𝛽𝑥 4
𝐿𝑒𝑡 𝑎 = 𝑢𝑣, 𝑏 = (1 − 𝑢)𝑣, 𝑐 = (𝑢2 − 𝑢)𝑣
Hence, 𝑓(𝑥) = 𝛼𝑥 2 + 𝛽𝑥 4 is a polynomial
∴ 𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎 𝑤𝑖𝑙𝑙 𝑏𝑒𝑐𝑚𝑒 (𝑎 + 𝑏)𝑐 + 𝑎𝑏
which satisfies the given equation for 𝛼, 𝛽 ∊ R
= 𝑣 + (𝑢2 − 𝑢)𝑣 + 𝑢𝑣(1 − 𝑢)𝑣 = 𝑣 2 +
45) If 𝛼+ 𝛽+ 𝛾= 0, then show that𝜶𝒏+𝟑 +
(𝑢2 − 𝑢) + 𝑣 2 (𝑢 − 𝑢2 ) = 𝑣 2 + (𝑢2 − 𝑢) +
𝜷𝒏+𝟑 + 𝜸𝒏+𝟑 = 𝜶𝜷𝜸(𝜶𝒏 + 𝜷𝒏 + 𝜸𝒏 ) +
𝑣 2 (𝑢2 − 𝑢) = 0 𝟏
𝟐
(𝜶𝟐 + 𝜷𝟐 + 𝜸𝟐 )(𝜶𝒏+𝟏 + 𝜷𝒏+𝟏 + 𝜸𝒏+𝟏 )
∴The given equation results
Sol.: 𝛼+ 𝛽+ 𝛾 = 0 i.e., Let 𝛼, 𝛽, 𝛾 denote the
𝑓[(2𝑢 − 1)𝑣] + 𝑓[(1 − 𝑢2 )𝑣] + 𝑓[(𝑢2 − 2𝑢)𝑣] roots of equation 𝑥 3 + 𝑞𝑦 + 𝑟 = 0 𝑖. 𝑒. 𝑥 =
= 27(𝑣 2 − 𝑢 + 1)𝑢∀ 𝑢, 𝑣 ∊ 𝑅 … … … . . (1) 𝛼 𝑜𝑟 𝛽 𝑜𝑟 𝛾
[∵ (𝑎 − 𝑏) = (2𝑢 − 1)𝑣, (𝑏 − 𝑐) = Multiplying this equation by 𝑥 𝑛 . We have

(1 − 𝑢2 )𝑣, (𝑐 − 𝑎) = (𝑢2 − 2𝑢)𝑣] 𝑥 𝑛+3 + 𝑞𝑥 𝑛+1 + 𝑟𝑥 𝑛 = 0
Let us fix u regard this is as a polynomial with Substituting in succession x = 𝛼, 𝛽 𝛾
variable v.
240
We have 𝛼 𝑛+3 + 𝑞𝛼 𝑛+1 + 𝑟𝛼 𝑛 = 𝑥

Sol.: Let (𝑥−1) 𝑎𝑛𝑑 𝑏 = 𝑥 ∴ 𝑎 + 𝑏 = (𝑥−1)
𝑥2
0 … … … … (1),
The given equation becomes |𝑎| + |𝑏| =
𝛽 𝑛+3 + 𝑞𝛽 𝑛+1 + 𝑟𝛽 𝑛 =
|𝑎 + 𝑏|.
0 … … … … (2),
But his equality holds if 𝑎𝑏 ≥ 0
𝛾 𝑛+3 + 𝑞𝛾 𝑛+1 + 𝑟𝛾 𝑛 =
0 … … … … (3) 𝑥2
∴ (𝑥−1) ≥ 0 critical points are 0, 1
Adding (1), (2) and (3)
∴ 𝑥 ∊ {0} ∪ (1, ∞)
𝛼 𝑛+3 + 𝛽 𝑛+3 + 𝛾 𝑛+3
+ 𝑞(𝛼 𝑛+1 + 𝛽 𝑛+1 + 𝛾 𝑛+1 ) 2) The number of solutions of the equations
+ 𝑟(𝛼 𝑛 + 𝛽 𝑛 + 𝛾 𝑛 ) 𝟏! + 𝟐! + 𝟑! + ⋯ + (𝒙 − 𝟏)! + 𝒙! =
= 0 … … . (4) 𝒌𝟐 𝒂𝒏𝒅 𝒌 ∊ 𝑰are
(a) 2; (b) 3; (c) 4; (d) none
But by 𝑥 3 + 𝑞𝑥 + 𝑟 = 0, we have𝛼𝛽 + 𝛽𝛾 +
𝛾𝛼 = 𝑞, 𝛼𝛽𝛾 = −𝑟. Sol.: The given equation is 1! +2! +3!
+…+(𝑥 − 1)! 𝑥! = 𝑘 2
𝑖. 𝑒., ∑ 𝛼𝛽 = 𝛼𝛽 + 𝛽𝛾 + 𝛾𝛼
We can readily check that for x < 4 the given
1 equation has the only solutions = 1, 𝑘 =
= (2𝛼𝛽 + 2𝛽𝛾 + 2𝛾𝛼)
2 ±1 𝑎𝑛𝑑 𝑥 = 3, 𝑘 ± 3.
1
= [(𝛼 + 𝛽 + 𝛾)2 − (𝛼 2 + 𝛽 2 + 𝛾 2 )] Now let us prove that there are no solutions
2
1 for 𝑥 ≥ 4.
= − (𝛼 2 + 𝛽 2 + 𝛾 2 )[∵ 𝛼 + 𝛽
2 1! + 2! + 3! + 4! = 33
+ 𝛾 = 0] 1! + 2! + 3! … + 5! = 153
The expressions }
1! + 2! + ⋯ + 6! = 873
∴ (4)𝑔𝑖𝑣𝑒𝑠 𝛼 𝑛+3 + 𝛽 𝑛+3 + 𝛾 𝑛+3 1! + 2! + ⋯ + 7! = 5913
= −𝑞(𝛼 𝑛+1 + 𝛽 𝑛+1 + 𝛾 𝑛+1 )
− 𝑟(𝛼 𝑛 + 𝛽 𝑛 + 𝛾 𝑛 ) End with the digit 3.
1 Now for 𝑥 ≥ 4 the last digit of the sum 1! +2!

= (𝛼 2 + 𝛽 2 + 𝛾 2 )(𝛼 𝑛+1 + 𝛽 𝑛+1 + 𝛾 𝑛+1 )
2 +…+x! is equal to 3 and therefore this sum
+ 𝛼𝛽𝛾(𝛼 2 + 𝛽 2 + 𝛾 2 can not be equal to a square of a whole
number k (because a square of a whole
number cannot end with 3)
MISCELLANEOUS EQUATIONS 𝟑 𝒙
3) The solution set of ( ) = 𝒙 − 𝒙𝟐 − 𝟗 is
AND INEQUATIONS 𝟓
(a) 𝜙; (b) all real; (c) all x ∊ N; (d) none
(OBJECTIVE TYPE)
Sol.: We have 𝑥 − 𝑥 2 − 9 = −(𝑥 3 − 𝑥 + 9) =
𝒙 𝒙𝟐 1 2 35
1) The solution |𝒙−𝟏| + |𝒙| = |𝒙−𝟏| is − {(𝑥 − 2) + } < 0∀ 𝑥 ∊ 𝑅
4
(a) 𝒙 ≥ 𝟎; (b) 𝒙 > 0; (c) 𝒙 ∊ (𝟏, ∞); (d)
none
241
3 𝑥 3 𝑥 6) Let f(x) = (𝟏 + 𝒃𝟐 )𝒙𝟐 + 𝟐𝒃𝒙 + 𝟏 𝒂𝒏𝒅 let

𝐵𝑢𝑡 (5) > 0 for each x ∊ R. Thus (5) = 𝑥 −
m(b) be the minimum value of f(x). As b
𝑥 2 − 9 has no solution.
varies, the range of m(b) is
𝟏 𝟏
4) If 𝟎 ≤ 𝒑 ≤ 𝝅, then the quadratic equation (a) [0, 1]; (b) [𝟎, 𝟐]; (c) [𝟐 , 𝟏]; (d) none
(𝐜𝐨𝐬 𝒑 − 𝟏)𝒙𝟐 + (𝐜𝐨𝐬 𝒑)𝒙 + 𝐬𝐢𝐧 𝒑 = 𝟎, Sol.: 𝑓(𝑥) = (1 + 𝑏 2 )𝑥 2 + 2𝑏𝑥 +

(a) Real roots; (b) imaginary roots; (c) 1 … … … … (1)
nothing can be said, (d) none. 𝑓 ′ (𝑥) = 2(1 + 𝑏 2 )𝑥 + 2𝑏 = 0 ⟹ 𝑥
Sol.: The discriminant D of the quadratic 𝑏
= − .
equation (1) is given by D= 𝑐𝑜𝑠 2 𝑝 − 1 + 𝑏2
4(cos 𝑝 − 1) sin 𝑝 𝑓 ′′ (𝑥) = 2(1 + 𝑏 2 ) > 0
= 𝑐𝑜𝑠 2 𝑝 − 4 cos 𝑝 sin 𝑝 + 4 sin 𝑝 =
∴ 𝑓(𝑥) has min. value at
(cos 𝑝 − 2 sin 𝑝)2 + 4 sin 𝑝 − 4𝑠𝑖𝑛2 𝑝 =
(cos 𝑝 − 2 sin 𝑝)2 + 4 sin 𝑝 (1 − sin 𝑝) 𝑏
𝑥 = − 1+𝑏2 min. value of 𝑓(𝑥) 𝑖. 𝑒.,
𝐴𝑠 0 ≤ 𝑝 ≤ 𝜋, sin 𝑝 ≤ 0. 𝐴𝑙𝑠𝑜 1 − sin 𝑝 ≥
0 ∀ 𝑝 ∊ 𝑅. 𝑏2 2𝑏 2
𝑚(𝑏) = − +1
1 + 𝑏2 1 + 𝑏2
Therefore, 𝐷 ≥ 0. Hence (1) has real roots.
𝑏2 1
𝑜𝑟 𝑚(𝑏) = 1 − =
1 + 𝑏2 1 + 𝑏2
5) The range of values of a for which all the 𝑐𝑙𝑒𝑎𝑟𝑙𝑦, 0 < 𝑚(𝑏) ≤ 1. [∵ 𝑏 2
roots of the equation ≥ 0 𝑚𝑎𝑥. 𝑣𝑎𝑙𝑢𝑒 𝑜𝑓 𝑚(𝑏) = 1]
𝟐 𝟐
(𝒂 − 𝟏)(𝟏 + 𝒙 + 𝒙 ) = (𝒂 + 𝟏)(𝟏 +
𝒙𝟐 + 𝒙𝟒 ) are imaginary is
(a) (𝟐, ∞) ; (b) (−∞, −𝟐]; (c) −𝟐 < 7) If 𝒚 = 𝟐[𝒙] + 𝟑 = 𝟑[𝒙 − 𝟐] +
𝑎 < 2; (d) none 𝟓, 𝒕𝒉𝒆𝒏 [𝒚 + 𝒚] 𝒊𝒔 [𝒙] denotes the integral
part of x
Sol.: (1 + 𝑥 + 𝑥 2 )[(𝑎 − 1)(1 + 𝑥 + 𝑥 2 ) −
(a) 10; (b) 11; (c) 12; (d)none
(𝑎 + 1)(1 − 𝑥 + 𝑥 2 )] = 0
Sol.: ∵ 𝑦 = 2[𝑥] + 3 = 3[𝑥 − 2] + 5 … … … . (1)
(1 + 𝑥 + 𝑥 2 ) = 0 has imaginary roots
𝑜𝑟, 2[𝑥] + 3 = 3[𝑥 − 2] + 5 ⟹ 2[𝑥] +
⟹ −2(1 + 𝑥 2 ) + 2𝑎𝑥 = 0, must have 3 = 3{[𝑥] − 2} + 5
imaginary roots
⟹ 2[𝑥]3 = 3[𝑥] − 6 + 5 ⟹ [𝑥] =
⟹ 𝑥 2 − 𝑎𝑥 + 1 = 0, must have 4 𝑓𝑟𝑜𝑚 (1)
imaginary root.
𝑦 = 2, 4 + 3, 𝑦 = 11
⟹ 𝑎2 − 4 < 0, ⟹ −2 < 𝑎 < 2.
∴4≤𝑥<5
242
⟹ 4 + 𝑦 ≤ 𝑥 + 𝑦 < 5 + 𝑦 ⟹ 15 ≤ 𝑥 + 10) The number of real roots of (𝟔 − 𝒙)𝟒 +

𝑦 < 16 (𝟖 − 𝒙)𝟒 = 𝟏𝟔 is
(a) 0; (b) 2; (c) 4; (d) none
(∵ 𝑦 = 11)
[(6−𝑥)+(8−𝑥)]
∴ (𝑥 + 𝑦) = 15 Sol.: Consider 𝑦 = 2
Let 𝑦 = 𝑓(−𝑥). Then the given equation

becomes
8) The solution set of the following equation
𝟒 𝐥𝐨𝐠 𝟐 𝟐 𝒙 + 𝟏 = 𝟐 𝐥𝐨𝐠 𝟐 𝒚 (𝑦 + 1)4 + (𝑦 − 1)4 = 16 ⟹ 𝑦 4 + 6𝑦 2 −
is { 7=0
𝐥𝐨𝐠 𝟐 𝒙𝟐 ≥ 𝐥𝐨𝐠 𝟐 𝒚
(a) (√𝟐, 𝟐); (b) (2, 2); (c) (√𝟐, 𝟏); (d) ⟹ (𝑦 2 − 1)(𝑦 2 + 7) = 0 ⟹ 𝑦 2 − 1 = 0
none
∵ 𝑦2 + 7 ≠ 0
2
Sol.: The system of equation is 4 log 2 𝑥 + 1 =
2 log 2 𝑦 … … … … . (1) ⟹ 𝑦 = ±1 ⟹ 7 − 𝑥 = ±1 ⟹ 𝑥 = 6, 8
log 2 𝑥 2 ≥ log 2 𝑦 0 … … … … (2)
Substituting log 2 𝑦 from (1)in (2) 11) All solutions of equations 𝒙𝟐 + 𝒚𝟐 − 𝟖𝒙 −

𝟖𝒚 = 𝟐𝟎 𝒂𝒏𝒅 𝒙𝒚 + 𝟒𝒙 + 𝟒𝒚 = 𝟒𝟎 satisfy
1
2 log 2 𝑥 ≥ (2) (4 log 2 2 𝑥 + 1) the following equations (s).
(a) 𝒙 + 𝒚 = 𝟏𝟎; (b) |𝒙 + 𝒚| = 𝟎; (c)
⟹ 4 log 2 𝑥 ≥ 4(log 2 𝑥)2 + 1 ⟹ |𝒙 − 𝒚| = 𝟏𝟎; (d) none
(2 log 2 𝑥 − 1)2 ≤ 0
Sol.: Given, 𝑥 2 + 𝑦 2 − 8𝑥 − 8𝑦 =
𝐻𝑒𝑛𝑐𝑒 2 log 2 𝑥 − 1 = 0, ∴ 𝑥 = 20 … … … . . (1)
√2 𝑓𝑟𝑜𝑚 (1)𝑦 = 2
𝑥𝑦 + 4𝑥 + 4𝑦 = 40 … . . (2)
Hence solutions set of system is (√2, 2)
(1) + 2. (2) ⟹ (𝑥 + 𝑦)2 = 100 ⟹ 𝑥 +
9) Values of a for which exactly one root of 𝑦 = ±10 ∴ (𝑥 + 𝑦) = 10.
𝟓𝒙𝟐 + (𝒂 + 𝟏)𝒏 + 𝒂 = 𝟎 lies in the
interval 𝟏 < 𝑥 < 3 is
(a) 𝒂 > 0; (b) 𝒂 > 2; (c) −𝟏𝟐 < 𝑎 < −3; 12) If 𝟓{𝒙} = 𝒙 + [𝒙] − {𝒙} =
(d) none 𝟏
, 𝒘𝒉𝒆𝒓𝒆 {𝒙}𝒂𝒏𝒅 [𝒙] are fractional and
𝟐
Sol.: 𝑓(1) = 5 + 𝑎 + 1 + 𝑎 = 6 + 2𝑎, integral part of x then the number of
solutions f the equation is
𝑓(3) = 45 + 3(𝑎 + 1) + 𝑎 = 4𝑎 = 48 (a) 1 ; (b) 2; (c) 3; (d) none
∴ 𝑓(1) . 𝑓(3) < 0, (6 + 2𝑎)(4𝑎 + 48) < 0, Sol.: 5{𝑥} = 𝑥 + [𝑥] … … … . . (1)
1
(𝑎 + 3)(𝑎 + 12) < 0 [𝑥] − {𝑥} = … … … . (2)
2
∴ −12 < 𝑎 < −3
243
∴ 𝑥 = [𝑥] + {𝑥} … … … . . (3) from (1) & (3) 14) Number of solutions of 𝟑|𝒙| = |𝟐 − |𝒙|| is
we get (a) 0; (b) 2; (c) 4; (d) none
[𝑥] + 2{𝑥} … … … . . (4). Solving (2) & (4) 1 𝑥

1 3
Sol.: Given equation is (3) = −2 − 𝑥,
we get [x] = 1, {x} 2 ∴ 𝑓𝑟𝑜𝑚 (3) 𝑥 = 2.
−∞ < 𝑥 ≤ −2 + 𝑥, −2 ≤ 𝑥 ≤ 0
3𝑥 = 2 − 𝑥, 0 ≤ 𝑥 ≤ 2 = 𝑥 − 2,
13) Let F(x) be a function defined by 𝑭(𝒙) =
𝒙 − [𝒙], 𝑹 where [x] is the greatest integer 2 ≤ 𝑥 < ∞ 𝑎𝑡 𝑥 = 2, 3𝑥 − 𝑥 + 2 = 9
less than or equal to x. Then the number of
𝟏 (as 3𝑥 − 𝑥 + 2 is an increasing function for
solutions of F(𝒙) + 𝑭 ( 𝒙) = 𝟏 is
x>2)
(a) 0; (b) 1; (c) 2; (d) none
Sol.: 𝐹(𝑥) = 𝑥 − [𝑥] 0 ≠ 𝑥 ∊ 𝑅 ∴ 𝑝(𝑥) +

𝐹(1) = 1
𝑥
1 1
⟹ 𝑥 − [𝑥] + −[ ]= 1
𝑥 𝑥
𝑥+1 1
⟹( ) − ([𝑥] + [ ]) = 1 … … . . (1)
𝑥 𝑥
1 1
⟹𝑥+ = [𝑥] + [ ] ≠ 1
𝑥 𝑥
∴ R H S is an integer. Hence LHS is also

integer
1
𝐿𝑒𝑡 [𝑥] + [𝑥] + 1 = 𝐴 (Integer)
1 𝑥
The equation (1) becomes 𝑥 + = 𝐴
1 For 𝑥 = −2, (3) + 2 + 𝑥 = 9 𝑓𝑜𝑟 𝑥 <
𝑥
1 𝑥 1 𝑥
−2, (3) + 2 + 𝑥 = 9 (𝑎𝑠 (3) + 2 +
𝐴 ± √𝐴2 − 4
⟹ 𝑥 2 − 𝐴𝑥 + 1 = 0 ∴ 𝑥 = 𝑥 𝑖𝑠 𝑑𝑒𝑐𝑟𝑒𝑎𝑠𝑖𝑛𝑔)
2
𝐹𝑜𝑟 𝑟𝑒𝑎𝑙 𝑥, 𝐴2 − 4 ≥ 0 Hence given equation has only two solution –

2 and 2.
∴ 𝐴 ≥ 2 & 𝐴 ≤ −2, 𝐴 = 2 & 𝐴 = −2 does
not satisfy of (1)
∴ 𝐴 > 2 & 𝐴 < −2 & 𝐴 ∊ 𝐼. 15) The system of equation |𝒙 − 𝟏| + 𝟑𝒚 =

𝟒, 𝒙 − |𝒚 − 𝟏| = 𝟐 has
Then equation (1) has infinite many (a) 1; (b) 2; (c) 3; (d) none
solutions.
Sol.: The given equations are |𝑥 − 1| + 3𝑦 = 4
244
𝑥 + 3𝑦 = 5 𝑥 ≥ 1 … . . (1) 17) If 𝛼, 𝛽, 𝛾 be the roots of 𝒇(𝒙) =

⟹{ 𝑎𝑛𝑑 𝑥
−𝑥 + 3𝑦 = 3, 𝑥 < 1 … … … (2) 𝟎. 𝒘𝒉𝒆𝒓𝒆 𝒇(𝒙) = 𝒙𝟑 + 𝒙𝟐 − 𝟓𝒙 − 𝟏 =
− |𝑦 − 1| = 2 𝟎, 𝒕𝒉𝒆𝒏 [𝜶] + [𝜷] + [𝜸], where |.| denotes,
𝑥 − 𝑦 = 1 𝑦 ≥ 1 … … … … . (3) the greatest integer is equal to
⟹{ (a) 1; (b) –2; (c) –c ; (d) none
𝑥 + 𝑦 = 3, 𝑥 < 1 … … . (4)
Solving (1) & (3) we get x = 2, y = 1 Sol.: Let 𝑓(𝑥) = 𝑥 3 + 𝑥 2 − 5𝑥 − 1
Solving (1) & (4) we get x = 2, y = 1 no ∴𝑓′(𝑥) = 3𝑥 2 + 2𝑥 − 5

solution
Now the sign scheme for 3𝑥 2 + 2𝑥 − 5 is
(∵ 𝑥 ≥ 1, 𝑦 < 1)
Also 𝑓(∞) = −∞ < 0; 𝑓∞ = ∞ > 0; 𝑓(1) =
Solving (2) & (3) we get x = 3, y = 2 no −4
solving
5 148
𝑓 (− ) =
(∵ 𝑥 ≥ 1, 𝑦 ≥ 1) 3 27
5
Solving (2) & (4) we get 𝑥 = 2 , 𝑦 = 2
3 ∴ 𝑓(−3) = −27 + 9 + 15 − 1
= −4 < 0 ∴ 𝑓(−2) = −8 + 4 + 10 − 1 >

No solving (∵x<1, y<1)
0;
Here solution is x = 2, y = 1 (a unique
𝑓(−1) = 4 > 0, 𝑓(0) = −1 < 0; 𝑓(2) = −1 > 0
solution)
∴ −3 < 𝛼 < −2; −1 < 𝛽 < 0; 1 < 𝛾 < 2
16) The number of integral roots of the ∴ [𝛼] + [𝛽] + [𝛾] = −3 − 1 + 1 = −3.
equation 18) If S be the solution of the equation (𝒙)𝟐 +
[𝒙]𝟐 = (𝒙 − 𝟏)𝟐 [𝒙 + 𝟏], where (x) = least
√(𝒙 + 𝟑) − 𝟒√𝒙 − 𝟏 + integer, [x] = greatest integer, R= real
numbers, Z = integer, N = natural
√(𝒙 + 𝟖) − 𝟔√𝒙 − 𝟏 = 𝟏 is numbers, then
(a) 𝑺 = 𝑹; (b) 𝑺 = 𝑹 = −𝒁; (c) 𝑺 = 𝑹 =
(a) 1; (b) 2; (c) 3; (d) none −𝑵; (d) none
Sol.: Taking √𝑥 − 1 = 𝑡(𝑡 ≥ 0) the equation Sol.: Here (x)= least integer ≥ 𝑥 𝑎𝑛𝑑 [𝑥] =
reduces to √𝑡 2 + 4 − 4𝑡 + √𝑡 2 − 6𝑡 + 9 = 1 greatest integer ≤ 𝑥, so (𝑥) − [𝑥] = 1, if x is
not integer and [x] = (x) if x ∊z.
⟹ |𝑡 − 2| + |𝑡 − 3| = 1
Now, (𝑥 − 1) = (𝑥) − 1, [𝑥 + 1] = [𝑥] + 1, 𝑠𝑜,
It is necessary for t to satisfy 2 ≤ 𝑡 ≤ 3.
(𝑥)2 + [𝑥]2 = (𝑥 − 1)2 (𝑥 + 1)2 ,
∴ 2 ≤ −√𝑥 − 1 ≤ 3 ⟹ 4 ≤ (𝑥 − 1) ≤ 9 ⟹
5 ≤ 𝑥 ≤ 10 ⟹ (𝑥)2 + [𝑥]2 = (𝑥)2 − 2(𝑥) + 1 + [𝑥]2 +
2[𝑥] + 1
245
⟹ [𝑥] − (𝑥) + 1 = 0, ⟹ −1 + 1 = 0 𝑖𝑓 𝑥 three different values of 𝛼 namely at 𝛼= a, 𝛼=

∉ 𝑧, 𝑎𝑛𝑑 0 + 1 ≠ 0 𝑖𝑓 𝑥 ∊ 𝑧, b and at 𝛼 = c (assuming that a, b, c are not
equal to one another)
Hence the solution set S= R –Z.
Set up different 𝛼 3 + 𝑥𝛼 2 + 𝑦𝛼 + 𝑧 −
(𝛼 − 𝑎)(𝛼 − 𝑏)(𝛼 − 𝑐)
19) The number of triplets (x, y, z) satisfying This differences also becomes zero at 𝛼 equal
the equation 𝒙𝟒 + 𝒚𝟒 + 𝒛𝟒 − 𝟐𝒙𝟐 𝒚𝟐 − to a, b, c. Expanding this expression in powers
𝟐𝒚𝟐 𝒛𝟐 − 𝟐𝒛𝟐 𝒙𝟐 = 𝟐𝟒 is (where x, y, z are of 𝛼, we get (𝑥 + 𝑎 + 𝑏 + 𝑐)𝛼 2 + (𝑦 − 𝑎𝑏 −
integer) 𝑎𝑐 − 𝑏𝑐)𝛼 + 𝑧 + 𝑎𝑏𝑐 this second degree
(a) 0; (b) 1; (c) 2; (d) none thrinomial vanishes at three different values
at 𝛼 and therefore it equals zero identically
Sol.: Since 24 is even number 𝑥 4 + 𝑦 4 + 𝑧 4
and consequently, all its coefficients are equal
has to be even
to zero. i.e. x +a +b +c = 0; 𝑦 = 𝑎𝑏 − 𝑎𝑐 −
Two cases arise: 𝑏𝑐 = 0; 𝑧 + 𝑎𝑏𝑐 = 0
(i) All of x, y and z are even which is 𝐻𝑒𝑛𝑐𝑒, 𝑥 = −(𝑎 + 𝑏 + 𝑐), 𝑦 = 𝑎𝑏 + 𝑎𝑐 + 𝑏𝑐,
not possible since in that case 16
𝑧 = −𝑎𝑏𝑐 is solution of our system.
divides each term of (and hence
the whole of) the left hand side
while 16 does not divide 24.
(ii) Two of x, y and z are odd and one 2) Solve: 𝒙𝟏 + 𝒙𝟐 = 𝒂𝟏 ; 𝒙𝟐 + 𝒙𝟑 = 𝒂𝟐 ; 𝒙𝟑 +
of them is even say, x is even. 𝒙𝟒 = 𝒂𝟑 ; … . 𝒙𝒏−𝟏 + 𝒙𝒏 = 𝒂𝒏−𝟏 𝒙𝒏 +
𝒙𝟏 = 𝒂𝒏
We have that: 𝑥 4 + 𝑦 4 + 𝑧 4 − 2𝑥 2 𝑦 2 −
2𝑦 2 𝑧 2 − 2𝑧 2 𝑥 2 = 𝑥 4 − 2𝑥 2 (𝑦 2 + 𝑧 2 ) + Sol.: we have 𝑥2 = 𝑎1 − 𝑥1 , 𝑥3 = 𝑎2 − 𝑥2 =
(𝑧 2 − 𝑦 2 )2 𝑎2 − 𝑎1 + 𝑥1 𝑥4 = 𝑎3 − 𝑥3 = 𝑎3 − 𝑎2 +
𝑎1 = 𝑥1 … ..
= 𝑥 4 − 2𝑥 2 (𝑦 2 + 𝑧 2 ) +
(𝑧 − 𝑦)2 (𝑧 + 𝑦)2 𝑥𝑛 = 𝑎𝑛−1 − 𝑎𝑛−2 + ⋯ ± 𝑎2 ± 𝑎1 ± 𝑥1
Here again 16 divides each term since y and z It should be noted that in the last quality the
are odd. upper signs will occur when n is odd and let
the lower signs when n is even.
Thus in either case the equation has no
solutions in integers. Consider the two cases separately.
1. Let n be odd, then 𝑥𝑛 = 𝑎𝑛−1 − 𝑎𝑛−2 +

⋯ + 𝑎2 − 𝑎1 + 𝑥1 on other hand 𝑥𝑛 +
(SUBJECTIVE TYPE) 𝑥1 = 𝑎𝑛 from these two equalities we get
𝑎𝑛 −𝑎𝑛+1 +𝑎𝑛−2 ….−𝑎2 +𝑎1
𝑥1 =
1) Solve 𝒛 + 𝒂𝒚 + 𝒂𝟐 𝒙 + 𝒂𝟑 = 𝟎; 𝒛 + 𝒃𝒚 + 2
𝒃𝟐 𝒙 + 𝒃𝟑 = 𝟎; 𝒛 + 𝒄𝒚 + 𝒄𝟐 𝒙 + 𝒄𝟑 = 𝟎. 𝑎1 − 𝑎𝑛 + 𝑎𝑛−1 … . −𝑎3 + 𝑎2
𝑥2 =
2
Sol.: The given equation show that the 𝑎2 − 𝑎1 + 𝑎𝑛 … . −𝑎4 + 𝑎3
𝑥3 =
polynomial 𝛼 3 + 𝑥𝛼 3 + 𝑦𝛼 + 𝑧 vanishes at 2
246
2. Let now n be even, then 𝑥𝑛 = 𝑎𝑛−1 − Our system of equations is equivalent to

𝑎𝑛−2 + ⋯ − 𝑎2 + 𝑎1 − 𝑥1 on the other the statement that the equation has three
hand 𝑥𝑛 = 𝑎𝑛 − 𝑥1 consequently for the roots:
given system of equations to be
compatible the following equality must be 𝑡 = cos 𝑎 ; 𝑡 = cos 𝑏 ; 𝑎𝑛𝑑 𝑡 =
satisfied. cos 𝑐 , 𝑤ℎ𝑖𝑐ℎ 𝑓𝑜𝑙𝑙𝑜𝑤𝑠:
𝑎𝑛−1 − 𝑎𝑛−2 + ⋯ − 𝑎2 + 𝑎1 = 𝑎𝑛 𝑧
𝑖. 𝑒. 𝑎𝑛 + 𝑎𝑛−2 + ⋯ + 𝑎2 = 𝑎𝑛−1 + = cos 𝑎 + cos 𝑏 + cos 𝑐
2
𝑎𝑛−3 + ⋯ + 𝑎1
𝑦+2
(The sum of coefficients with even = −(cos 𝑎 cos 𝑏 + cos 𝑎 cos 𝑐
subscript must equal the sum of 4
+ cos 𝑏 cos 𝑐)
coefficients with odd subscript) It is
apparent that in this case the system 𝑥−𝑧
= cos 𝑎 cos 𝑏 cos 𝑐
will be indeterminate. i.e. will allow 4
an infinite number of solutions
∴The solution of our system will be
namely.
𝑥1 = 𝜆; 𝑥2 = 𝑎1 − 𝜆; 𝑥3 = 𝑎2 − 𝑎1 + 𝑥 = 2(cos 𝑎 + cos 𝑏 + cos 𝑐) +
𝜆; 𝑥4 = 𝑎3 − 𝑎2 + 𝑎1 − 𝜆; 𝑥𝑛 = 8(cos 𝑎 + cos 𝑏 + cos 𝑐)
𝑎𝑛−1 − 𝑎𝑛−2 + ⋯ + 𝑎3 − 𝑎2 + 𝑎1 − 𝜆
Where 𝜆 is an arbitrary quantity 𝑦 = −2 − 4 (cos 𝑎 cos 𝑏 + cos 𝑎 cos 𝑐 +
cos 𝑏 cos 𝑐)
3) Solve: 𝒙 𝐬𝐢𝐧 𝒂 + 𝒚 𝐬𝐢𝐧 𝟐𝒂 + 𝒛 𝐬𝐢𝐧 𝟑𝒂 =
𝑧 = 2(cos 𝑎 + cos 𝑏 + cos 𝑐)
𝐬𝐢𝐧 𝟒𝒂 𝒙 𝐬𝐢𝐧 𝒃 + 𝒚 𝐬𝐢𝐧 𝟐𝒃 + 𝒛 𝐬𝐢𝐧 𝟑𝒃 =
𝐬𝐢𝐧 𝟒𝒃 , 𝒙 𝐬𝐢𝐧 𝒄 + 𝒚 𝐬𝐢𝐧 𝟐𝒄 + 𝒛 𝐬𝐢𝐧 𝟑𝒄 =
𝐬𝐢𝐧 𝟒𝒄
4) Solve : x+ y+ z= 14 ; 𝒙𝟐 + 𝒚𝟐 + 𝒛𝟐 =
Sol.: We have sin 2𝑎 = 2 sin 𝑎 cos 𝑎 , sin 3𝑎 = 𝟗𝟏 ; 𝒚𝟐 = 𝒛𝒙
sin 𝑎 (4 𝑐𝑜𝑠 2 𝑎 − 1) sin 4𝑎 =
4 sin 𝑎 (2 𝑐𝑜𝑠 3 𝑎 − cos 𝑎). Sol.: We have 𝑥 + 𝑦 + 𝑧 = 14 … … . . (1)
The first equation of our system is rewritten 𝑥 2 + 𝑦 2 + 𝑧 2 = 91 … … . . (2)

in following way. 𝑥 + 2𝑦 cos 𝑎 + 𝑧(4𝑐𝑜𝑠 2 𝑎 −
𝑦 2 = 𝑧𝑥 … … . (3)
1) = 4
Squaring the 1st we get 𝑥 2 + 𝑦 2 + 𝑧 2 + 2𝑥𝑦 +
(2 𝑐𝑜𝑠 3 𝑎 − cos 𝑎) The remaining two are
2𝑦𝑧 + 2𝑧𝑥 = 196 Putting the values of 𝑥 2 +
similar. Expand this equation in powers of
𝑦 2 + 𝑧 2 from (2)
cos 𝑎 , 𝑤𝑒 ℎ𝑎𝑣𝑒
And of 𝑧𝑥 from (3), we get 91 + 2𝑥𝑦 + 2𝑦𝑧 +
8 𝑐𝑜𝑠 3 𝑎 − 4𝑧 𝑐𝑜𝑠 2 𝑎 − (2𝑦 + 4) cos 𝑎 +
2𝑦 2 = 196.2𝑥𝑦 + 2𝑦𝑧 + 2𝑦 2 = 105, 2𝑥(𝑥 +
𝑧−𝑥 =0
𝑦 + 𝑧) = 105
Putting cos 𝑎 = 𝑡 and dividing both
𝑧 𝑦+2 105 15
members by 8, we get 𝑡 3 − 𝑡 2 − 𝑡 + 2𝑦(14) = 105 𝑜𝑟 𝑣 = =
2 4 28 4
𝑧−𝑥
8
=0
247
15 So by remainder theorem (5) is

𝐻𝑒𝑛𝑐𝑒, 𝑥 + 𝑧 = 14 − 𝑓𝑟𝑜𝑚 (1)𝑜𝑟 𝑥
4
41 𝑡 2 (𝑡 − 𝑎) + 𝑎𝑡(𝑡 − 𝑎) + 𝑎2 (𝑡 − 𝑎) −
+𝑧 =
4 𝑎𝑏𝑡(𝑡 − 𝑎) = 0
15 2 225 𝑜𝑟 (𝑡 − 𝑎)(𝑡 2 − 𝑎𝑡 + 𝑎2 − 𝑎𝑏𝑡) =

𝐴𝑙𝑠𝑜, 𝑧𝑥 = ( ) 𝑜𝑟 𝑧𝑥 = 𝑓𝑟𝑜𝑚 (2)
4 116 0 𝑜𝑟 (𝑡 − 𝑎)
Hence, x and z are the roots of the {𝑡 2 + 𝑡(𝑎 − 𝑎𝑏) + 𝑎2 } = 0 𝑖. 𝑒. , 𝑒𝑖𝑡ℎ𝑒𝑟 𝑡 =

equation 𝑎.
𝑡 2 − (𝑥 + 𝑧)𝑡 + (𝑥𝑧) 𝑜𝑟,

41 225 −(𝑎 − 𝑎𝑏) ± √[(𝑎 − 𝑎𝑏)2 − 4𝑎2 ]
= 0 𝑜𝑟 𝑡 2 − 𝑡 + 𝑡=
4 16 2
=0
1
𝑜𝑟 16𝑡 2 − 164𝑡 + 225 = 0 𝑖. 𝑒. , 𝑥, 𝑦, 𝑧 𝑎𝑟𝑒 𝑎, 𝑎 [𝑏 − 1
2
√
+ 𝑏 2 − 2𝑏 − 3]
164 ± √(164)2 − 4 × 16 × 225
⟹𝑡=
32 1
𝑎 [𝑏 − 1 − √𝑏 2 − 2𝑏 − 3] 𝑟𝑒𝑠𝑝𝑒𝑐𝑡𝑖𝑣𝑒𝑙𝑦.
41 ± √412 − 900 2
⟹𝑡=
8 6) Examine x, y, z from the equations
(𝒙 + 𝒚 − 𝒛)(𝒙 − 𝒚 + 𝒛) = 𝒂𝒚𝒛; (𝒚 + 𝒛 −
41 ± √(41 + 30)(41 − 30)
= 𝒙)(𝒚 − 𝒛 + 𝒙) = 𝒃𝒛𝒙; (𝒛 + 𝒙 − 𝒚)(𝒛 − 𝒙 +
8
𝒚) = 𝒄𝒙𝒚
41 ± √71 × 11
= 0
8 Sol.: Given equation are (𝑥 + 𝑦 − 𝑧)(𝑥 − 𝑦 +
41 ± √781 𝑧) = 𝑎𝑦𝑧 … … … … . (1)
=
8
(𝑦 + 𝑧 − 𝑥)(𝑦 − 𝑧 + 𝑥)
41 ± √781 15 = 𝑏𝑧𝑥 … … … … … . . (2)
𝐻𝑒𝑛𝑐𝑒, 𝑥 = ,𝑦 = ± ,𝑧
8 4
41 ± √781 (𝑧 + 𝑥 − 𝑦)(𝑧 − 𝑥 + 𝑦) = 𝑐𝑥𝑦 … … … … (3)
=
8 Multiplying (1), (2), (3) we get
5) Solve: x+ y +z = 𝒂𝒃; 𝒙−𝟏 + 𝒚−𝟏 + 𝒛−𝟏 =
(𝑥 + 𝑦 − 𝑧)2 (𝑥 − 𝑦 + 𝑧)2 (𝑦 + 𝑧 − 𝑥)2
𝒂−𝟏 𝒃; 𝒙𝒚𝒛 = 𝒂𝟑
= 𝑎𝑏𝑐𝑥 2 𝑦 2 𝑧 2
1 1 1 𝑏
Sol.: 𝑥 + 𝑦 + 𝑧 = 𝑎𝑏, 𝑥 + 𝑦 + 𝑧 = 𝑎 , 𝑥𝑦𝑧 = 𝑎3 𝑜𝑟, (−𝑥 3 − 𝑦 3 − 𝑧 3 + 𝑦 2 𝑧 + 𝑦𝑧 2 + 𝑧 2 𝑥
+ 𝑧𝑥 2 + 𝑥 2 𝑦 + 𝑥𝑦 2 − 2𝑥𝑦𝑧)2
By (2) and (3), we have 𝑥𝑦 + 𝑦𝑧 + 𝑧𝑥 = 𝑎2 𝑏 = 𝑎𝑏𝑐𝑥 2 𝑦 2 𝑧 2 … … … . . (4)
Now by (1), (3) and (4), it is clear that x, y, z Or, dividing both sides of equation (4) by
are roots of 𝑡 3 − 𝑎𝑏𝑡 2 + 𝑎2 𝑏𝑡 − 𝑎3 = 0 we 𝑥 2 𝑦 2𝑧 2
see that the above equations vanishes for t =
a, i.e. (𝑡 − 𝑎) is a factor of (5).
248
𝑥2 𝑦2 𝑧2 𝑦 𝑧 ∴ 𝑥𝑦(𝑎 + 𝑏) + 𝑦𝑧(𝑏 + 𝑐) + 𝑧𝑥(𝑐 + 𝑎) = 0

𝑜𝑟, 𝑎𝑏𝑐 = (− − − + +
𝑦𝑧 𝑧𝑥 𝑥𝑦 𝑥 𝑥
𝑥 𝑥 𝑦 𝐴𝑙𝑠𝑜 𝑥𝑦 + 𝑦𝑧 + 𝑧𝑥 = 0
+ + +
𝑦 𝑧 𝑧 𝑥𝑦 𝑦𝑧 𝑧𝑥 1
𝐻𝑒𝑛𝑐𝑒 = = = (𝑠𝑎𝑦)
− 2) … … … … … . (5) 𝑏−𝑎 𝑐−𝑏 𝑎−𝑐 𝑘
Dividing each ratio by xyz,

By equation (1) may be written as
1 1 1 1
= = =
𝑥 2 − 𝑦 2 − 𝑧 2 + 2𝑦𝑧 𝑥 2 𝑦 𝑧 𝑧(𝑏 − 𝑎) 𝑥(𝑐 − 𝑏) 𝑦(𝑎 − 𝑐) 𝑘
𝑎= = − − +2
𝑦𝑧 𝑦𝑧 𝑧 𝑦
𝑘 𝑘 𝑘
∴𝑥= ,𝑦 = ,𝑧 =
𝑥2 𝑦 𝑧 (𝑐 − 𝑏) (𝑎 − 𝑐) (𝑏 − 𝑎)
𝑜𝑟 𝑎 − 2 = − −
𝑦𝑧 𝑧 𝑦
Substituting these values in (2)
2
𝑦 𝑧 𝑥
𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦, 𝑏 − 2 = − − 𝑎𝑛𝑑 𝑐 − 2 𝑘 𝑘 𝑘
𝑧𝑥 𝑥 𝑧 𝑎 +𝑏 + 𝑐 =0
𝑐−𝑏 𝑎−𝑐 𝑏−𝑎
𝑧2 𝑥 𝑦
= − −
𝑥𝑦 𝑦 𝑥 𝑎(𝑏 − 𝑎)(𝑎 − 𝑐) + 𝑏(𝑐 − 𝑏)(𝑏 − 𝑎) +
𝑐(𝑐 − 𝑏)(𝑎 − 𝑐) = 0
Now from equation (5)
𝑜𝑟 𝑎3 + 𝑏 3 + 𝑐 3 − (𝑎 + 𝑏)(𝑏 + 𝑐)(𝑐 +
𝑎𝑏𝑐 = [(2 − 𝑎) + (2 − 𝑏) + (2 − 𝑐) − 2]2
𝑎) + 5𝑎𝑏𝑐 = 0
𝑎𝑏𝑐 = (4 − 𝑎 − 𝑏 − 𝑐)2
𝑜𝑟 𝑎3 + 𝑏 3 + 𝑐 3 − 3(𝑎 + 𝑏)(𝑏 + 𝑐)(𝑐 +
𝑎) − 4(𝑎 + 𝑏)(𝑏 + 𝑐)(𝑐 + 𝑎) + 5𝑎𝑏𝑐 = 0
7) Eliminate x, y, z from the equations 𝒂𝒙𝟐 + 𝑜𝑟 (𝑎 + 𝑏 + 𝑐)3 − 4(𝑎 + 𝑏)(𝑏 + 𝑐)(𝑐 +

𝒃𝒚𝟐 + 𝒄𝒛𝟐 = 𝒂𝒙 + 𝒃𝒚 + 𝒄𝒛 = 𝒚𝒛 + 𝒛𝒙 + 𝑎) + 5𝑎𝑏𝑐 = 0
𝒙𝒚 = 𝟎
Sol.: Given equation are 𝑎𝑥 2 + 𝑏𝑦 2 + 𝑐𝑧 2 = 8) Solve: (𝟏𝟐𝒙 − 𝟏)(𝟔𝒙 − 𝟏)(𝟒𝒙 − 𝟏)(𝟑𝒙 −

0 … … … . . (1) 𝟏) = 𝟓
𝑎𝑥 + 𝑏𝑦 + 𝑐𝑧 = 0 … … … … … (2) Sol.: We can write the equation in the
𝑦𝑧 + 𝑧𝑥 + 𝑥𝑦 = 0 … … … … . . (3) from
1 1 1 1
Multiplying (2) by (x+ y+ z), we have (𝑥 − 12) (𝑥 − 6) (𝑥 − 4) (𝑥 − 3) =
5
… … … … (1)
(𝑎𝑥 + 𝑏𝑦 + 𝑐𝑧)(𝑥 + 𝑦 + 𝑧) = 0 𝑜𝑟, 𝑎𝑥 2 + 1.2.6.
𝑏𝑦 2 + 𝑐𝑧 2 + 𝑥𝑦 1 1 1 1 1 1 1 1
∴ 12 < 6 < 4 < 3 𝑎𝑛𝑑 6 − 12 = 3 − 4
(𝑎 + 𝑏)𝑦𝑧(𝑏 + 𝑐) + 𝑧𝑥(𝑐 + 𝑎) = 0
We can introduce a new variable
𝐵𝑢𝑡 𝑎𝑥 2 + 𝑏𝑦 2 + 𝑐𝑧 2 = 0
249
1 1 1 1 Therefore x, must be 1 < x < 2.

𝑦 = 4 [(𝑥 − 12) + (𝑥 − 6) + (𝑥 − 4) +
1 5
(𝑥 − 3)] = 𝑥 − 24 10) Solve:
5
𝑆𝑢𝑏𝑠𝑡𝑖𝑡𝑢𝑡𝑒 𝑥 = 𝑦 + 𝑖𝑛(1), we get √𝒙 + 𝟐√𝒙 + 𝟐√𝒙 + ⋯ + 𝟐√𝒙 + 𝟐√𝟑𝒙
24
3 1 1 3
(𝑦 + ) (𝑦 + ) (𝑦 − ) (𝑦 − ) =𝒙
24 24 24 24
5
= Sol.: The given equation
12.6.4.3
2
1 2 2
3 2 5 √𝑥 + 2√𝑥 + 2√𝑥 + ⋯ + 2√𝑥 + 2√𝑥 + 2 =
(𝑦 − ( ) ) (𝑦 − ( ) ) =
24 24 12.6.4.3
49 7 7 𝑥 … . . (1)
𝑆𝑜, 𝑦 2 = 𝑖. 𝑒. 𝑦1 = 𝑎𝑛𝑑 𝑦 2
= − ,
242 24 24
On replacing the last letter x on the L H S of
1 1 equation (1) by the value of x, expressed by
𝑐𝑜𝑟𝑟𝑒𝑠𝑝𝑜𝑛𝑑𝑖𝑛𝑔 𝑟𝑜𝑜𝑡𝑠 𝑎𝑟𝑒 − 𝑎𝑛𝑑 .
12 2 (1)we obtain
Note: An equation of the from (𝑥 − 𝑎)(𝑥 −

𝑏)(𝑥 − 𝑐)(𝑥 − 𝑑) = 𝐴𝑥 2 where 𝑎𝑏 = 𝑐𝑑 can
be reduced to a collection of two quadratic 𝑥 = √𝑥 + 2√𝑥 + 2√𝑥 + ⋯ + 2√𝑥 + 2𝑥
𝑎𝑏
equations by a change of variable 𝑦 = 𝑥 + 𝑥
.
(2𝑛 𝑟𝑎𝑑𝑖𝑐𝑎𝑙 𝑠𝑖𝑔𝑛𝑠)
Further, let us replace the last letter x by the

9) Solve the equation 𝒙𝟑 − [𝒙] = same expression, again and again yields
𝟑 𝒘𝒉𝒆𝒓𝒆 [𝒙]𝒅𝒆𝒏𝒐𝒕𝒆𝒔 the greatest
integer.
∴ 𝑥 = √𝑥 + 2√𝑥 + 2√𝑥 + ⋯ + 2√𝑥 + 2𝑥
Sol.: ∵ 𝑥 = [𝑥] + 𝑓, 0 ≤ 𝑓 < 1. And given
equation is 𝑥 3 − [𝑥] = 3 ⟹ 𝑥 3 − (𝑥 − 𝑓) =
(3𝑥 𝑟𝑎𝑑𝑖𝑐𝑎𝑙 𝑠𝑖𝑔𝑛𝑠)
3 ⟹ 𝑥 3 − 𝑥 = 3 − 𝑓,
Hence it follows that 2 < 𝑥 3 − 𝑥 ≤

3 𝑓𝑢𝑟𝑡ℎ𝑒𝑟 𝑓𝑜𝑟 𝑥 ≥ 2. √𝑥 + 2√𝑥 + 2√𝑥 + ⋯ + 2√𝑥 + 2𝑥 = ⋯
We have 𝑥 3 − 𝑥 = 𝑥(𝑥 2 − 1) ≥ 2(4 − 1) =

6>3 𝑤𝑒 𝑐𝑎𝑛 𝑤𝑟𝑖𝑡𝑒 = 𝑥
𝑓𝑜𝑟 𝑥 < −1 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑥 3 − 𝑥 = 0 < 2;

= √𝑥 + 2√𝑥 + 2√𝑥 + ⋯
For −1 < 𝑥 ≤ 0 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑥 3 − 𝑥 ≤ −𝑥 <
1 𝑎𝑛𝑑
𝑓𝑜𝑟 0 < 𝑥 ≤ 1 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑥 3 − 𝑥 < 𝑥 < 𝑥 3 ≤ 1
250
12) Find the number of roots in the equations

𝐬𝐢𝐧 𝒙 = 𝐥𝐨𝐠 𝒙
= lim √𝑥 + 2√𝑥 + 2√𝑥 + ⋯ + 2√𝑥 + 2𝑥
𝑁→∞
Sol.: sin 𝑥 = log 𝑥 𝑡ℎ𝑒𝑛 𝑥 ≤ 10 (because if
otherwise the L H S ≤ 1 and RHS >1). Since
(𝑁 𝑟𝑎𝑑𝑖𝑐𝑎𝑙 𝑠𝑖𝑔𝑛𝑠)
2.2𝜋 > 10, the interval of the axis on the from
It follows that x = 0 to x = 10 contains only one wave of the
since curve 𝑦 = sin 𝑥 and a part of the next
wave (see the figure). The graph of the
𝑥 = √𝑥 + 2√𝑥 + 2√𝑥 + ⋯ = function y = log 𝑥 obviously intersects the
first wave of the since curve at one point.
√𝑥 + 2 (√𝑥 + 2√𝑥 + ⋯ ) = √𝑥 + 2𝑥
𝜋 5𝜋
2 2
Further, 2𝜋 + 2 < 10, 𝑓𝑜𝑟 𝑡ℎ𝑒 𝑝𝑜𝑖𝑛𝑡 𝑥 = 2
Hence 𝑥 = 𝑥 + 2𝑥 ⟹ 𝑥 − 3𝑥 = 0
we have sin 𝑥 = 1 > log 𝑥 , 𝑡ℎ𝑒 𝑔𝑟𝑎𝑝ℎ 𝑜𝑓 𝑦 =
Therefore x = 0, 3. log 𝑥 also intersects the first half of the
second positive half wave of the since curve;
further since at the point x = 10. We have
𝒙 𝒙(𝒙−𝟏) 𝒙(𝒙−𝟏)(𝒙−𝟐) log 𝑥 = 1 > sin 𝑥, the graph of 𝑦 = log 𝑥 must
11) Solve: 𝟏 − 𝟏! + 𝟐!
− 𝟑!
+ ⋯+ intersect the second half wave as well. We see
𝒙(𝒙−𝟏)(𝒙−𝟐)−(𝒙−𝒙+𝟏)
(−𝟏)𝒏 . =𝟎 that the total number of the roots of the
𝒏!
equation sin 𝑥 = log 𝑥 is equal to three.
Sol.: The given equation is
𝑥 𝑥(𝑥 − 1) 𝑥(𝑥 − 1)(𝑥 − 2)

1− + − +⋯ 𝟐 𝟕
13) Solve: 𝟒|𝒙 −𝟖𝒙+𝟏𝟐|−𝐥𝐨𝐠 𝟒 = 𝟕𝟐𝒚−𝟏
1! 2! 3!
𝑥(𝑥 − 1)(𝑥 − 2) − (𝑥 − 𝑥 + 1) 𝒂𝒏𝒅 |𝒚 − 𝟑| − 𝟑|𝒚| − 𝟐(𝒚 + 𝟏)𝟐 ≥ 𝟏
+ (−1)𝑛 . =0
𝑛!
Sol.: The equation of the system is equivalent
𝑛 𝑛(𝑛 − 1) to the equation 4|𝑥
2 −8𝑥+12|
= 72𝑦
𝑃𝑢𝑡 𝑥 = 𝑛 ∊ 𝑁 ∴ 1 − +
1! 2!
𝑛(𝑛 − 1)(𝑛 − 2) Its both sides are positive, and therefore it is
− +⋯
3! equivalent to the equation |𝑥 2 − 8𝑥 + 12| =
+ (−1)𝑛 . (2𝑦) log 4 7
∴𝑛𝐶0 ± 𝑛𝐶1 + 𝑛𝐶2 − 𝑛𝐶3 + ⋯ + (−1)𝑛 𝑛𝐶𝑛 = 0 𝑆𝑖𝑛𝑐𝑒 log 4 7 > 0 𝑎𝑛𝑑 𝑥 2 − 8𝑥 + 12 = 0 for
any x, it follows that y≥ 0. Therefore we
𝑛(𝑛 − 1)(𝑛 − 2)
=0 should solve the inequality of given system
𝑛!
only for two cases, 0 ≤ 𝑦 ≤ 3 𝑎𝑛𝑑 𝑦 <
∴ (1 − 1)𝑛 = 0 𝑜𝑟 0𝑛 = 0 it is true for all 3. 𝐹𝑜𝑟 0 ≤ 𝑦 ≤ 3 the equality of given system
natural numbers assumes the from 3 − 𝑦 − 3𝑦 − 2𝑦 2 − 4𝑦 −
2 − 1 ≥ 0 𝑖. 𝑒. 𝑦 2 + 4𝑦 ≥
Hence solution x ∊ N 0, 𝑤ℎ𝑒𝑛𝑐𝑒 𝑤𝑒 𝑓𝑖𝑛𝑑 − 4 ≤ 𝑦 ≤ 0.
𝑁𝑜𝑡ℎ𝑖𝑛𝑔 𝑡ℎ𝑎𝑡 0 ≤ 𝑦 ≤ 3, we find that y = 0

for y > 3 the inequality of the given system
251
assumes the from 𝑦 − 3 − 3𝑦 − 2𝑦 2 − 4𝑦 − Thus we have to find all values of a for which
2 − 1 ≥ 0 𝑖. 𝑒. −2𝑦 2 − 6𝑦 − 6 > = 0. system (3) has no less than four different
integer solutions.
This inequality has no solutions. Substituting
1
the value y = 0 into the equation of given Let us compare the numbers – 𝑎 𝑎𝑛𝑑 − 𝑎2, we
system, we obtain 1 1
find their difference, − 𝑎2 − (−𝑎) = − − 𝑎2 +
𝑦=0 𝑎 3 −1
⟹{ 2 𝑎= 𝑎2
𝑥 − 8𝑥 + 12 = 0
𝑦=0
⟹{ (𝑎−1)𝑎2 +𝑎+1
(𝑥 − 2)(𝑥 − 6) = 0 = 𝑎2
𝑠𝑖𝑛𝑐𝑒 𝑎2 + 𝑎 + 1 > 0 for any a,
𝑥 = 2, 𝑥 = 6 it follows that 𝑎2 + 𝑎 + 1 𝑑𝑜𝑒𝑠 𝑛𝑜𝑡 𝑒𝑓𝑒𝑐𝑡

⟹ [{ {
𝑦 = 0, 𝑦 = 0
𝑡ℎ𝑒 𝑠𝑖𝑔𝑛 𝑜𝑓 𝑡ℎ𝑒 𝑑𝑖𝑓𝑓𝑒𝑟𝑒𝑛𝑐𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟𝑠
Thus two pairs of numbers (2, 0) and (6, 0)
𝑏𝑒𝑖𝑛𝑔 𝑐𝑜𝑚𝑝𝑎𝑟𝑒𝑑. In accordance with the
are the solutions of given system.
method of intervals, we have −𝑎−2 <
−𝑎 𝑖𝑓 𝑎 < 1, 𝑎 ≠ 0, −𝑎−2 = −𝑎 = −1 𝑖𝑓 𝑎 =
1, −𝑎−2 < −𝑎 𝑖𝑓 𝑎 > 1. Consequently; (a) if a
14) Find a, where the equation 𝒂𝟑 + > 1, then system (3) has no solutions. (b) If a
𝒂𝟐 |𝒂 + 𝒙| + |𝒂𝟐 𝒙 + 𝟏| = 𝟏 has no less = 1 then (3) ⟹ x = -1, there is a unique
than four different integers solutions. solution and the condition of the problem are
not satisfied, (c) if 0 < 𝑎 < 1, then −1 <
Sol.: Given equation is 𝑎3 + 𝑎2 |𝑎 + 𝑥| + −𝑎 <
|𝑎2 𝑥 + 1| = 1 … … … . . (1) 0, 𝑎𝑛𝑑 𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 𝑡ℎ𝑒 𝑖𝑛𝑡𝑒𝑟𝑣𝑎𝑙[−𝑎−2 , −𝑎]
contains no less than four integers provided
We can write equation (1) as |𝑎2 𝑥 + 1| +
that the inequality −𝑎−2 ≤ −4 holds true.
|𝑎3 + 𝑎2 𝑥| = (𝑎2 𝑥 + 1) − (𝑎3 + 𝑎2 𝑥)
0<𝑎<1
It follows from the properties of modulus that Let us solve the system {− 1 ≤ −4 ⟹
the inequality |𝐴| + |𝐵| = 𝐴 − 𝐵 holds true if 𝑎2
𝐴 ≥ 0 𝑎𝑛𝑑 𝐵 ≤ 0, equation (1) is equivalent 0<𝑎<1

{
1 − 4𝑎2 ≥ 0
to the system
0<𝑎<1 0<𝑎<1
𝑎2 𝑥 + 1 ≥ 0 … … … … … … … . (2) ⟹{ 1 1 ⟹{ 1
{ 3 ( − 𝑎) ( + 𝑎) ≥ 0 𝑎≤
𝑎 + 𝑎2 𝑥 ≤ 0 2 2 2
1
The values a = 0 satisfies the hypothesis since ⟹ {0 < 𝑎 ≤
2
in this case system (2) and consequently
1
equation (1) have all x ∊ R as their solutions. Thus if 0 < 𝑎 ≤ 2, then the given equation has
Let a ≠ 0. Then system (2) is equivalent to
no less than four different integer
−2 solutions.(d) if −1 < 𝑎 < 0, 𝑡ℎ𝑒𝑛 0 < −𝑎 < 1
{𝑥 ≥ −𝑎 … … … . (3) and the interval.
𝑥 ≤ −𝑎
[−𝑎−2 , −𝑎] contains at least four integers.
Provided that the inequality – 𝑎−2 ≤ −3 holds
252
−1 < 𝑎 < 0 1<𝑥<2

true Let us solve the system { −2 = 3
−𝑎 ≤ −3 𝑦<2 <𝑥<2
−1 < 𝑎 < 0 −1 < 𝑎 < 0 { ⟹ {2
{ ⟹{ 2 0< 2−𝑦 < 1 1<𝑦<2
−1 ≤ −3𝑎2 3𝑎 − 1 ≤ 0 2𝑥 − 2 > 1
−1 < 𝑎 < 0 Consequently, the set of all solutions of
⟹ {(𝑎 − 1 ) (𝑎 + 1 ) ≤ 0 the original system is the set of pairs (x,
√3 √3 3
−1 < 𝑎 < 0 y) where x belongs to the interval (2 , 2)
⟹ {− 1 ≤ 𝑎 ≤ 1 and y belongs to the interval (1, 2).
√3 √3
√3
⟹ <𝑎<0 16) Find out whether the system of equations
3
𝒙 + 𝒚 = 𝟎 𝒙𝟐 + 𝒚𝟐 = 𝟎 𝒂𝒏𝒅 𝐬𝐢𝐧(𝒙 + 𝒚) =
−√3
𝑖𝑓 ≤ 𝑎 < 0, then the equation has no less 𝟎, 𝒙𝟐 + 𝒚𝟐 = 𝒃 are equivalent for (i) b = 2
3
than four integer solutions. (e) if a = -1, then and (ii) b = 5.
the interval [-1, 1] contains only three Sol.: It is clear that both for b = 2 and for b =
integers i.e. conditions of the problem are not 5 the second system is a consequence of the
satisfied. (f) if a <-1, then −1 < −𝑎−2 < 0, first. Since the equation sin(𝑥 + 𝑦) = 0 is a
and for the interval [−𝑎−2 , −𝑎] to contain no consequence of the equation 𝑥 + 𝑦 = 0
less then four, it is necessary that the
inequality −𝑎 ≥ 3 hold true, i.e. the inequality The first system has solutions
𝑎 ≤ −3 be valid. Thus, for 𝑎 ≤ −3, the given (1, −1), (−1, 1)𝑤ℎ𝑒𝑛 𝑏 =
equation has no less than four integer 5 5 5 5
2 𝑎𝑛𝑑 [√ , −√ ] , [√ , √ ] 𝑤ℎ𝑒𝑛 𝑏 = 5
solutions. 2 2 2 2
Combining all the results, we get the set of Let us find the set of solutions of the second
required values of the number a namely the system.
√3 1
interval (−∞, −3)𝑎𝑛𝑑 𝑡ℎ𝑒 𝑖𝑛𝑡𝑒𝑟𝑣𝑎𝑙 [− , ].
2 2 From its first equation we have 𝑥 + 𝑦 =
𝑛𝜋(𝑛 ∊ 𝐼)𝑎𝑛𝑑, consequently, it is equivalent
to the collection of system
15) Solve: 𝐥𝐨𝐠 (𝟐−𝒙) (𝟐 − 𝒚) > 0 𝑥 + 𝑦 = 𝑛𝜋
{ 2 … … … … (1)
𝑎𝑛𝑑 𝐥𝐨𝐠 (𝟒−𝒚)(𝟐𝒙 − 𝟐) > 0 𝑥 + 𝑦 2 = 𝑏, 𝑛 ∊ 𝐼
Consequently, the collection of system (1) is

Sol.: If the numbers x and y satisfy this
equivalent to the collection of systems
systems them they also satisfy the conditions.
2 − 𝑥 > 0.2 − 𝑥 ≠ 1, 2𝑥 − 2 > 0.4 − 𝑦 > 𝑥 + 𝑦 = 𝑛𝜋
0, 4 − 𝑦 ≠ 1.2 − 𝑦 > 0. i.e. the system of { 1 1 … … … … … (2)
𝑥𝑦 = 𝑛2 𝜋 2 − , 𝑛 ∊𝐼
inequality 1 < 𝑥 < 2, 𝑦 < 2. On this domain 2 2𝑏
for the bases of the logarithms of the initial
To find the set of solutions of (2), x and y are
system we have 0 < 2 − 𝑥 < 1, 4 − 𝑦 > 2.
the roots of the quadratic equation.
Thus the original system is equivalent to the
system
253
1
𝑡 2 + 𝑛𝜋𝑡 + 2 (𝑛2 𝜋 2 − 𝑏) = 0, 𝑛 ∊ 𝐼. ⟹ |𝑥| = log12(1 + √1 − 𝑎) ⟹ 𝑥 =
Discriminant 𝐷 ≥ 0 𝑖. 𝑒. , 𝑛2 𝜋 2 − ± log12(1 + √1 − 𝑎)
2𝑏
2(𝑛2 𝜋 2 − 𝑏) ≥ 0 i.e. when 𝑥 2 ≤ .
𝜋2 Whenever a < 1.
It follows that for b = 2 the collection of 18) Solve: 𝒙𝟐 𝟐𝒙+𝟏 + 𝟐|𝒙−𝟑|+𝟐 = 𝒙𝟐 . 𝟐|𝒙−𝟑|+𝟒 +
system (2) has a solutions only for n = 0 and 𝟐𝒙−𝟏
for b = 5 it has a solution for n = -1, n = 0, n
= 1. Thus, for b = 2 these systems are Sol.: We consider two cases according as 𝑥 ≥
equivalent. 3 𝑜𝑟 𝑥 < 3. As we know, if 𝑥 ≥ 3, 𝑡ℎ𝑒𝑛 [𝑥 −
3] = 𝑥 − 3
Comparing the sets of solutions for b = 5, we
find that the initial system are not equivalent. Case I : 𝐿𝑒𝑡 𝑥 ≥ 3. 𝑇ℎ𝑒𝑛 |𝑥 − 3| = (𝑥 − 3).
17) Solve the equation (𝟏𝟒𝟒)|𝒙| − 𝟐(𝟏𝟐)|𝒙| + Hence the given equations becomes
𝒂 = 𝟎 for every value of the parameter a.
𝑥 2 . 2𝑥+1 + 2𝑥−3+2 = 𝑥 2 . 2𝑥−3+4 + 2𝑥−1
Sol.: The given equation can be written as
⟹ 𝑥 2 . 2𝑥+1 + 2𝑥−1 = 𝑥 2 . 2𝑥+1 + 2𝑥−1 which
(12)2|𝑥| − 2(12)|𝑥| + 𝑎 = 0. Let us write 𝑦 =
is satisfied for every x.
(12)2|𝑥| .
Hence the given equations is satisfied for
Then the above equations becomes 𝑦 2 − 2𝑦 +
every 𝑥 ≥ 3
𝑎=0
Case II : 𝐿𝑒𝑡 𝑥 < 3, 𝑡ℎ𝑒𝑛 |𝑥 − 3| = −(𝑥 − 3).
2 ± √4 − 4𝑎
⟹𝑦= ⟹𝑦
2 Hence the given equations becomes,
= 1 ± √1 − 𝑎 … … . (1)
𝑥 2 . 2𝑥+1 + 2−(𝑥−3)+2 = 𝑥 2 . 2−(𝑥−3)+4 + 2𝑥−1
The equation (1) is valid if 1 − 𝑎 > 0 𝑖. 𝑒. 𝑎 <
1. ⟹ 𝑥 2 . 2𝑥+1 + 25−𝑥 = 𝑥 2 . 27−𝑥 + 2𝑥−1
No solution is possible if 𝑎 > 1. 𝐼𝑓 𝑎 = ⟹ 𝑥 2 . 2𝑥+1 − 2𝑥+1 = 𝑥 2 . 27−𝑥 + 25−𝑥

1, 𝑡ℎ𝑒𝑛 𝑦 = 1.
⟹ 𝑥 2 . 2𝑥−1 − 2𝑥−1 = 𝑥 2 . 22 . 25−𝑥 − 25−𝑥
⟹ 12|𝑥| = 1 ⟹ |𝑥| = 0 ⟹ 𝑥 = 0
⟹ 2𝑥−1 (4𝑥 2 − 1) = 25−𝑥 (4𝑥 2 − 1)
𝑙𝑒𝑡 𝑢𝑠 𝑐𝑜𝑛𝑠𝑖𝑑𝑒𝑟 𝑡ℎ𝑒 𝑐𝑎𝑠𝑒 𝑤ℎ𝑒𝑛 𝑎 <
⟹ 2𝑥−1 (4𝑥 2 − 1) − 25−𝑥 (4𝑥 2 − 1) = 0
1. 𝐹𝑟𝑜𝑚 (1)𝑤𝑒 ℎ𝑎𝑣𝑒 12|𝑥| = 1 +
√1 − 𝑎 … … (2)𝑎𝑛𝑑 12|𝑥| = 1 − ⟹ (4𝑥 2 − 1)(2𝑥−1 − 25−𝑥 ) = 0 ⟹ 4𝑥 2 − 1 =
√1 − 𝑎 … … … . (3) 0 … … … (1)
But the equation (3) is unacceptable, since 𝑎𝑛𝑑 2𝑥−1 − 25−𝑥 = 0 … … … … . (2)
12|𝑥| > 1.
1 1
(1) ⟹ 4𝑥 2 = 1 ⟹ 𝑥 2 = ⟹ 𝑥 = 1
4 2
Hence, we have 12|𝑥| = 1 + √1 − 𝑎
(2) ⟹ 2𝑥−1 = 25−𝑥 ⟹ 𝑥 − 1 = 5 − 𝑥 ⟹
2𝑥 = 6 ⟹ 𝑥 = 3
254
But x is < 3. 25−𝑥 2

Case 2 : Let 0 < 16
< 1. In this case, the
Hence the x = 3 does not give the solution of original inequality is equivalent to the double
the equations. Hence the solutions of the inequality.
original solutions are 𝑥 ≥ 3. (from case 1)
1 24 − 2𝑥 − 𝑥 2 25 − 𝑥 2
and 𝑥 = ± 2(from case 2) 0< <
14 16
Thus in this case, we have to solve the

following system of double inequalities:
19) Solve the inequality
25−𝑥 2
𝟐
𝟐𝟓 − 𝒙 𝟏𝟒 − 𝟐𝒙 − 𝒙 𝟐 (i) 0< 16
<1
𝐥𝐨𝐠 ( )>1 24−2𝑥−𝑥 2 25−𝑥 2
𝟏𝟔 𝟏𝟒 (ii) 0< <
14 16
Sol.: As we know, if the log function log 𝑎 𝑥 is The first inequality is reduced to 0 < 25 −
meaning ful then its base a should be > 0 and 𝑥 2 𝑎𝑛𝑑 25 − 𝑥 2 < 16 𝑖. 𝑒. 9 < 𝑥 2 < 25. But
a ≠ 1.Also x > 0 therefore we shall discuss 9 < 𝑥 2 ⟹ 𝑥 2 − 9 > 0 ⟹ (𝑥 − 3)(𝑥 + 3) > 0
25−𝑥 2
two cases according as the 0 < 16
<
⟹ 𝑥 < −3 𝑜𝑟 𝑥 > 3 𝑎𝑛𝑑 𝑥 2 < 25 ⟹
25−𝑥 2
1 𝑎𝑛𝑑 > 1. 𝑥 2 − 25 < 0 ⟹ (𝑥 − 5)(𝑥 + 5) < 0
16
25−𝑥 2 ⟹ −5 < 𝑥 < 5.

Case 1 : Let > 1.
16
Hence taking together 9 < 𝑥 2 < 25 ⟹ −5 <
This ⟹ 25 − 𝑥 2 > 16 ⟹ 𝑥 2 < 9, ⟹
𝑥 < −3 𝑎𝑛𝑑 3 < 𝑥 < 5 … … … . . (4)
(𝑥 2 − 9) < 0
The second double inequality is equivalent to
⟹ (𝑥 + 3)(𝑥 − 3) < 0 ⟹ 25 − 𝑥 2 > 16 ⟹
the system of inequalities (iii) 24 − 2𝑥 −
−3 < 𝑥 < 3 … … . (1)
𝑥 2 > 0 ⟹ 𝑥 2 + 2𝑥 − 24 < 0 𝑎𝑛𝑑 (𝑖𝑣)𝑥 2 +
In this case, the given inequality is equivalent 16𝑥 − 17 > 0
to
(iii) ⟹ (𝑥 + 6)(𝑥 − 4) < 0 ⟹ −6 <
24 − 2𝑥 − 𝑥 2 25 − 𝑥 2 24 − 2𝑥 − 𝑥 2 𝑥<4
> ,⟹ (iv) (𝑥 + 17)(𝑥 − 1) > 0 ⟹ 𝑥 <
14 16 7
25 − 𝑥 2 −17 𝑜𝑟 𝑥 > 1.
>
8
Thus (iii)+ (iv) ⟹ 1 < 𝑥 < 4 ………….(5)
2
⟹ 192 − 16𝑥 − 8𝑥 > 175 − 7𝑥 ⟹ 2 Finally (4) +(5) i.e. , (3 < 𝑥 < 5 𝑎𝑛𝑑 1 < 𝑥 <
𝑥 2 + 16𝑥 − 17 < 0 4) 𝑡𝑜𝑔𝑒𝑡ℎ𝑒𝑟 ⟹ 3 < 𝑥 < 4.
⟹ (𝑥 + 17)(𝑥 − 1) < 0 ⟹ −17 < 𝑥 < Hence combining the two cases we have the
1 … … … (2) solution of the original inequality which
consists of two intervals : −3 < 𝑥 <
∴ Taking (1) and (2) together we find that 1 𝑎𝑛𝑑 3 < 𝑥 < 4.
−3 < 𝑥 < 1 ………….(3)
255
√ 𝟐 𝟑 𝑛+1 4 1 4
𝟏 𝐱 −𝟐𝐱 +𝟏 𝟏 𝟏−𝐱 Sol.: we have ( ) = (1 + ) ≤
20) Solve : (𝟐) < (𝟐) 𝑛 𝑛
1 4 3 4
(1 + 2) = (2) < 10
Sol.: Since the base of the exponential
1
inequality (i.e. 2) is less than 1, hence the [∵ 𝑛 ≥ 2] ⟹ (𝑛 + 1)4 ≤ 𝑛4 . 10 <
original inequality is equivalent to the 10𝑛 . 10 = 10𝑛+1
inequality. √𝑥 6 − 2𝑥 3 + 1 > 1 − 𝑥
𝑆𝑖𝑛𝑐𝑒 √𝑥 6 − 2𝑥 3 + 1 = √(𝑥 3 − 1)2 |𝑥 3 − 1|, 2) If a, b, c are the sides of a triangle, then

𝟏 𝟏 𝟏
∴ the above inequality can be written as , ,
𝒃+𝒄 𝒄+𝒂 𝒂+𝒃
is also the sides of the
|𝑥 3 − 1| > 1 − 𝑥 … … … … … . (1) triangle is,
(a) Always false; (b) always true; (c)
𝐼𝑓 1 − 𝑥 < 0 𝑖. 𝑒. 𝑥 > 1, then the inequality
Sometimes; (d) none
(1) is automatically satisfied since the left
member is non negative. Sol.: Assume that 𝑎 ≥ 𝑏 ≥ 𝑐. We must have
𝑏 + 𝑐 > 𝑎.
∴ The solution of the inequality (1) is the set
of all x >1 we now consider 𝑥 ≤ 1. In this case Also, note that 𝑏 + 𝑐 ≤ 𝑐 + 𝑎 ≤ 𝑎 + 𝑏
𝑥 3 ≤ 1. 𝑖. 𝑒. 𝑥 3 − 1 ≤ 0 𝑎𝑛𝑑 𝑠𝑜 |𝑥 3 − 1| =
1 1 1
(𝑥 3 − 1) and then we can write the inequality ⟹ ≥ ≥
(1) as −(𝑥 3 − 1) > 1 − 𝑥 ⟹ −𝑥 3 + 1 > 1 − 𝑏+𝑐 𝑐+𝑎 𝑎+𝑏
𝑥 ⟹ 𝑥 3 − 𝑥 > 0, ⟹ 𝑥(𝑥 2 − 1) > 0 ⟹ 1 1 1
To show that 𝑏+𝑐 , 𝑐+𝑎 , 𝑎+𝑏 are sides of a
𝑥(𝑥 − 1)(𝑥 + 1) < 0 Solving this inequality 1
by the method of intervals we find that it is triangle, it is sufficient to show that 𝑐+𝑎 =
1 1
true for 𝑥 < −1 and for x located in the >
𝑎+𝑏 𝑏+𝑐
interval 0 < 𝑥 < 1 … … . (3) Hence combining
(2) and (3), we concluded that the original 𝐴𝑠 𝑎 ≥ 𝑏 ≥ 𝑐, 𝑤𝑒 𝑔𝑒𝑡 2𝑎 ≥ 𝑎 + 𝑏, 𝑎𝑛𝑑 2𝑎 ≥
inequality is valid for 𝑥 < 1, 0 < 𝑥 < 1 and 𝑎+𝑐
also 𝑥 < 1.
1 1 1 1
⟹ ≤ , ≤
2𝑎 𝑎 + 𝑏 2𝑎 𝑎 + 𝑐
INEQUALITIES 1 1 1 1 1 1
⟹ + ≥ + = >
𝑎 + 𝑏 𝑎 + 𝑐 2𝑎 2𝑎 𝑑 𝑏 + 𝑐
(OBJECTIVE TYPE)
[∵ 𝑎 < 𝑏 < 𝑐] ∴ it represents a triangle.
1) If 𝒏𝟒 < 𝟏𝟎𝒏 for a fixed positive integer
3) The product of three positive reals is 1 and
𝒏 ≥ 𝟐, 𝒕𝒉𝒆𝒏
their sum is greater then sum of their
(a) (𝒏 + 𝟏) < 𝟏𝟎𝒏+𝟏 ; (b) (𝒏 + 𝟏)𝒏 ≥ reciprocals. Exactly one of them is greater
𝟏𝟎𝒏+𝟏 ; (c) 𝒏𝟒 + 𝟏 < 𝟏𝟎𝒏+𝟏 ; (d) than
none (a) -1; (b) 0; (c) 1; (d) none
1
Sol.: Let three positive reals be a, b and ,
𝑎𝑏
256
1 1 1 (d) 𝒏𝒐𝒏𝒆
We are given 𝑎 + 𝑏 + 𝑎𝑏 > 𝑎 + 𝑏 +
𝑎𝑏 … … . . (1) Sol.: We have, 𝑎2 + 𝑏 2 + 𝑐 2 − 𝑏𝑐 − 𝑐𝑎 − 𝑎𝑏 =
1
1 2
𝑁𝑜𝑤 (𝑎 − 1)(𝑏 − 1) ( − 1)
𝑎𝑏
1 [(𝑏 2 + 𝑐 2 − 2𝑏𝑐) + (𝑐 2 + 𝑎2 − 2𝑐𝑎) +
= 1 + (𝑎 + 𝑏 + ) 1
𝑎𝑏 (𝑎2 + 𝑏 2 − 2𝑎𝑏) = [(𝑏 − 𝑐)2 +
2
1 1
− (𝑎𝑏 + + )−1 (𝑐 − 𝑎)2 + (𝑎 − 𝑏)2 ] ≥ 0
𝑎 𝑏
1
= (𝑎 + 𝑏 + ) 𝐴𝑙𝑠𝑜, 𝑎2 + 𝑏 2 + 𝑐 2 − 𝑏𝑐 − 𝑐𝑎 − 𝑎𝑏
𝑎𝑏 3
1 1 − (𝑏 − 𝑐)2
− (𝑎𝑏 + + ) > 0 4
𝑎 𝑏
1
Using (1)⟹ either all these 𝑎 − 1, 𝑏 − = [4𝑎2 + 4𝑏 2 + 4𝑐 2 − 4𝑏𝑐 − 4𝑐𝑎 − 4𝑎𝑏
1
4
1 𝑎𝑛𝑑 𝑎𝑏 − 1 are positive or exactly one of − 3(𝑏 2 + 𝑐 2 − 2𝑏𝑐)]
them is positive. 1
= [4𝑎2 + 𝑏 2 + 𝑐 2 + 2𝑏𝑐
4
1
But 𝑎 > 1, 𝑏 > 1 𝑎𝑛𝑑 𝑎𝑏 > 1. Thus exactly one − 4𝑎(𝑐 + 𝑏)]
1
of 𝑎, 𝑏, 𝑎𝑏 exceed 1. 1
= 4 [4𝑎2 + (𝑏 + 𝑐)2 − 4𝑎(𝑏 + 𝑐)] =
1
[2𝑎 − (𝑏 + 𝑐)]2 ≥ 0
4
4) If 𝒂 + 𝒃 + 𝒄 = 𝟔, 𝒕𝒉𝒆𝒏 √𝟒𝒂 + 𝟏 +
𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦, 𝑎2 + 𝑏 2 + 𝑐 2 − 𝑏𝑐 − 𝑐𝑎 − 𝑎𝑏
√𝟒𝒃 + 𝟏 + √𝟒𝒄 + 𝟏 is
√3
(a) ≤ 𝟗; (b) > 9; (c) < 9; (d) none ≥ |𝑐 − 𝑎|𝑎𝑛𝑑 𝑎2 + 𝑏 2 + 𝑐 2
2
Sol.: By the Cauchy Schwarz inequality, √3
− 𝑏𝑐 − 𝑐𝑎 − 𝑎𝑏 ≥ |𝑎 − 𝑏|
2
2
(√4𝑎 + 1 + √4𝑏 + 1 + √4𝑐 + 1) ≤
⟹ 𝑎2 + 𝑏 2 + 𝑐 2 − 𝑎𝑏 − 𝑏𝑐 − 𝑐𝑎
(1 + 1 + 1)
√3
≥ max{|𝑏 − 𝑐|, |𝑐
(4𝑎 + 1 + 4𝑏 + 1 + 4𝑐 + 1) = 2
3[4(𝑎 + 𝑏 + 𝑐) + 3] − 𝑎|, |𝑎 − 𝑏|}
= (3)(27) ⟹ √4𝑎 + 1 + √4𝑏 + 1 +

√4𝑐 + 1 ≤ 9 𝟏
6) If x >0, 𝜆 > 0 and 𝝀𝒙 + 𝒙 − 𝟏 is always
non-negative, then the least value of 𝜆 is:
𝟏 𝟏 𝟏
(a) 𝟒; (b) 𝟐; (c) 𝟑; (d) none
5) If a, b, c ∊ R, then
√𝒂𝟐 + 𝒃𝟐 + 𝒄𝟐 − 𝒃𝒄 − 𝒄𝒂 − 𝒂𝒃 ≥ 1
Sol.: 𝜆𝑥 + − 1 ≥ 0 ⟹ 𝜆𝑥 2 − 𝑥 + 1 ≥ 0
√𝟑 𝑥
(a) 𝟒
𝐦𝐚𝐱{|𝒃 − 𝒄|, |𝒄 − 𝒂|, |𝒂 − 𝒃|} ;
1
(b) 𝐦𝐚𝐱{|𝒃 − 𝒄|, |𝒄 − 𝒂|, |𝒂 − 𝒃|} ⟹ (−1)2 − 4. 𝜆. 1 ≤ 0 ⟹ 𝜆 ≥
√𝟑 4
(c) 𝟐
{𝐦𝐚𝐱|𝒃 − 𝒄|, |𝒄 − 𝒂|, |𝒂 − 𝒃|}
257
1 ∴ (𝑦 + 𝑧)(𝑧 + 𝑥)(𝑥 + 𝑦) ≥ 8𝑥𝑦𝑧

∴ least value of 𝜆 is 4.
𝑥 −1 + 𝑦 −1 + 𝑧 −1
𝐴𝑙𝑠𝑜, ( )
3
𝒙𝟐 𝑥 + 𝑦 + 𝑧 −1
7) If x ∊ R and y = then ≥ ( )
(𝟏+𝒙𝟒 )
𝟏 3
(a) 𝟎 ≤ 𝒚 ≤ 𝟐; (b) 𝟎 ≤ 𝒚 ≤ 𝟏; (c) 𝟎 ≤
𝒚 ≤ 𝟐; (d) none 2 −1
⟹ 𝑥 −1 + 𝑦 −1 + 𝑧 −1 ≥ 3. ( )
3
Sol.: 𝑦 + 𝑦𝑥 4 = 𝑥 2 , 𝑤ℎ𝑒𝑟𝑒 𝑦 ≥ 0, 𝑦𝑥 4 − 𝑥 2 +
9
𝑦=0 ⟹ 𝑥 −1 + 𝑦 −1 + 𝑧 −1 ≥
2
1±√1−4𝑦 2
𝑥2 = 2
, for this exists. 1 − 4𝑦 2 = 0
1 1 1 10) If the product of n positive numbers is 𝒏𝒏,

⟹ − ≤ 𝑦 ≤ 𝑏𝑢𝑡 𝑦 = 0 ⟹ 0 ≤ 𝑦 ≤ . them their sum is
2 2 2
𝟏
(a) & 𝒏𝟐 ; (b) = 𝒏 + 𝒏; (c) > 𝑛; (d) none
1
8) If 𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏 are any real numbers and n Sol.: Let 𝑎1 , 𝑎2 , … … … , 𝑎𝑛 be n positive

is position integer, then integers such that 𝑎1 𝑎2 , … , 𝑎𝑛 = 𝑛𝑛 . Since
(a) ∑𝒏𝒊=𝟏 𝒙𝒊 𝟐 ≥ 𝒏(∑ 𝒙𝒊 )𝟐 ; (b) 𝒏 ∑ 𝒙𝒊 𝟐 < 𝐴. 𝑀 ≥ 𝐺. 𝑀
(∑𝒏𝟏 𝒙𝒊 )𝟐 ; (c) 𝒏 ∑𝒏𝒊=𝟏 𝒙𝒊 𝟐 ≥ (∑𝒏𝟏 𝒙𝒊 )𝟐 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑛 1
(d) none ∴ ≥ (𝑎1 𝑎2 , … 𝑎𝑛 )𝑛
𝑛
𝑥1 2 +𝑥2 2 +⋯+𝑥𝑛 2 𝑥1 +𝑥2 +⋯+𝑥𝑛 2 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑛
Sol.: Here, 𝑛
≥ ( 𝑛
) ⟹ ≥𝑛
𝑛
𝑛 𝑛 2 ⟹ 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑛
≥ 𝑛2
⟹ 𝑛 ∑ 𝑥𝑖 2 ≥ (∑ 𝑥𝑖 )
𝑖=1 1
11) For positive real number a, b, c such that a
+b +c = p which one holds?
𝒃𝒄 𝒄𝒂 𝒂𝒃
(a) 𝒂
+ 𝒃 + 𝒄
≥ 𝒑;
9) If x, y, z are positive real number, such that
(b) (𝑷 − 𝒂)(𝑷 − 𝒃)(𝑷 − 𝒄) ≤ 𝟖𝒂𝒃𝒄
𝒙 + 𝒚 + 𝒛 = 𝟐, then 𝟖
(a) (𝟐 − 𝒙)(𝟐 − 𝒚)(𝟐 − 𝒛) ≤ 𝟖𝒙𝒚𝒛; (c) (𝑷 − 𝒂)(𝑷 − 𝒃)(𝑷 − 𝒄) ≥ 𝟐𝟕 𝒑𝟑 ;
(b) (𝟐 − 𝒙)(𝟐 − 𝒚) × (𝟐 − 𝒛) ≤ 𝟖𝒙𝒚𝒛 (d) 𝒏𝒐𝒏𝒆
𝟏
(c) (𝟐 − 𝒙)(𝟐 − 𝒚)(𝟐 − 𝒛) ≥ ;
𝟐 Sol.: Using 𝐴. 𝑀 ≥ 𝐺. 𝑀 one can show
(d) 𝒏𝒐𝒏𝒆
(𝑏 + 𝑐)(𝑐 + 𝑎)(𝑎 + 𝑏) ≥ 8𝑎𝑏𝑐
Sol.: 𝑥 + 𝑦 + 𝑧 = 2 ∴ (2 − 𝑥)(2 − 𝑦)(2 − 𝑧) =
(𝑦 + 𝑧)(𝑧 + 𝑥)(𝑥 + 𝑦) ⟹ (𝑝 − 𝑎)(𝑝 − 𝑏)(𝑝 − 𝑐) ≥ 8𝑎𝑏𝑐 ⟹
(𝑏)ℎ𝑜𝑙𝑑𝑠
⟹ (𝑦 + 𝑧) ≥ 2√𝑦𝑧, (𝑥 + 𝑦) ≥ 2√𝑥𝑧,
(𝑥 + 𝑦) ≥ 2√𝑥𝑦.
258
(𝑝 − 𝑎) + (𝑝 − 𝑏) + (𝑝 − 𝑐) tan 𝛽 tan 𝛼
𝐴𝑙𝑠𝑜, ⟹ > 𝑜𝑟 𝛼 tan 𝛽 > 𝛽 tan 𝛼.
3 𝛽 𝛼
≥ [(𝑝 − 𝑎)(𝑝 − 𝑏)(𝑝
1
− 𝑐)]3
13) If x, y, z are real, distinct and 𝒖 = 𝒙𝟐 +
3𝑝 − (𝑎 + 𝑏 + 𝑐)
⟹ 𝟒𝒚𝟐 + 𝟗𝒛𝟐 − 𝟔𝒚𝒛 − 𝟑𝒛𝒙 − 𝟐𝒙𝒚, 𝒕𝒉𝒆𝒏 𝒖 is
3
(a) Zero; (b) non-negative; (c) non-
≥ [(𝑝 − 𝑎)(𝑝 − 𝑏)(𝑝
1 positive; (d) none
− 𝑐)]3
1
Sol.: 𝑢 = 2 {2𝑥 2 + 8𝑦 2 + 18𝑧 2 − 12𝑦𝑧 −
2𝑝 1
⟹ ≥ [(𝑝 − 𝑎)(𝑝 − 𝑏)(𝑝 − 𝑐)]3 1
6𝑧𝑥 − 4𝑥𝑦} = {(𝑥 − 2𝑦)2 + (2𝑦 − 3𝑧)2 +
3 2
(3𝑧 − 𝑥)2 }
8𝑝3
⟹ (𝑝 − 𝑎)(𝑝 − 𝑏)(𝑝 − 𝑐) ≤
27 ⟹𝑢≥0
⟹ (𝑐)𝑑𝑜𝑒𝑠 𝑛𝑜𝑡 ℎ𝑜𝑙𝑑𝑠
1 𝑏𝑐 𝑐𝑎 𝑏𝑐 𝑐𝑎
𝐴𝑔𝑎𝑖𝑛, 𝑠𝑖𝑛𝑐𝑒 ( + ) ≥ √( . ) 𝑒𝑡𝑐 14) The minimum value of p = 𝒃𝒄𝒙 + 𝒄𝒂𝒚 +
2 𝑎 𝑏 𝑎 𝑏
𝒂𝒃𝒛 when 𝒙𝒚𝒛 = 𝒂𝒃𝒄, 𝒊𝒔
(a) 𝒂𝒃𝒄; (b) 𝟒𝒂𝒃𝒄; (c) 𝟓 𝒂𝒃𝒄; (d)none
∴Adding the inequalities, we get
𝑏𝑐𝑥+𝑐𝑎𝑦+𝑎𝑏𝑧
𝑏𝑐 𝑐𝑎 𝑎𝑏 Sol.: 𝐴. 𝑀 ≥ 𝐺. 𝑀 ⟹ 3
≥
+ + ≥ 𝑎+𝑏+𝑐 = 𝑝 1
𝑎 𝑏 𝑐 (𝑎2 𝑏 2 𝑐 2 , 𝑥𝑦𝑧)
3
⟹ (a) does not holds.

𝑏𝑐𝑥 + 𝑐𝑎𝑦 + 𝑎𝑏𝑧 ≥ 3𝑥𝑦𝑧 𝑜𝑟
𝝅
12) If 𝟎 < 𝛼 < 𝛽 < 𝟐
then 𝑏𝑐𝑥 + 𝑎𝑐𝑦 + 𝑎𝑐𝑦 + 𝑎𝑏𝑧 ≥ 3𝑎𝑏𝑐
(a) 𝜷 𝐭𝐚𝐧 𝜶 < 𝛼 𝐭𝐚𝐧 𝜷; (b) 𝜷 𝐭𝐚𝐧 𝜶 >
𝛼 𝐭𝐚𝐧 𝜷; (c) 𝜷 𝐭𝐚𝐧 𝜶 < 𝛼 𝐬𝐢𝐧 𝜷; (d)
none
15) If a, b , c, d are positive real numbers such
sin 𝑥 that a +b+ c+ d = 2, then 𝑴 =
Sol.: We know, 𝑓(𝑥) = 𝑥
is decreasing
(𝒂 + 𝒃)(𝒄 + 𝒅) satisfies the relation
𝜋 sin 𝛽 (a) 𝟎 ≤ 𝑴 ≤ 𝟏; (b) 𝟏 ≤ 𝑴 ≤ 𝟐 (c) 𝟐 ≤
𝑓(𝛽) < 𝑓(𝛼) : 0 < 𝛼 < 𝛽 < . 𝑴 ≤ 𝟑 ; (d) none
2 𝛽
sin 𝛼 (𝑎+𝑏)+(𝑐+𝑑)
< 𝑜𝑟 𝛼 sin 𝛽 Sol.: (a) Using 𝐴. 𝑀 ≥ 𝐺. 𝑀, 𝑡ℎ𝑒𝑛 ≥
𝛼 2
1
< 𝛽 sin 𝛼 . 𝐴𝑙𝑠𝑜, 𝑓(𝑥) {(𝑎 + 𝑏)(𝑐 + 𝑑)} , 2
tan 𝑥
= 𝑖𝑠 𝑖𝑛𝑐𝑟𝑒𝑎𝑠𝑖𝑛𝑔 2 1
𝑥 ⟹ ≥ 𝑀2 , ⟹ 𝑀 ≤ 1.
2
∴ 𝑓(𝛽) > 𝑓(𝛼) 𝑎𝑠 𝛼 < 𝛽.
As a, b, c, d > 0. So, M = (𝑎 + 𝑏) × (𝑐 + 𝑑) > 0
𝑖. 𝑒. , 0 ≤ 𝑀 ≤ 1.
259
𝑛−1
𝑥𝑖+1 − 𝑥𝑖 𝑥𝑛 − 𝑥1
√2 ∑ sin ≤ (𝑛 − 1)√2 sin
(SUBJECTIVE TYPE) 2 2(𝑛 − 1)
𝑖=1
≤ √2(𝑛 − 1)
1) If−𝟏 ≤ 𝒂𝟏 ≤ 𝒂𝟐 ≤ ⋯ ≤ 𝒂𝒏 ≤ 𝟏, prove
that 𝜋
sin . 𝑆𝑖𝑛𝑐𝑒 𝑥𝑛 − 𝑥1 ∈ (0, 𝜋).
2(𝑛 − 1)
𝒏−𝟏
∑ √𝟏 − 𝒂𝒊 𝒂𝒊+𝟏 − √(𝟏 − 𝒂𝒊 𝟐 )(𝟏 − 𝒂𝒊+𝟏 𝟐 ) Using the fact that sin 𝑥 < 𝑥 𝑓𝑜𝑟 𝑥 > 0 𝑦𝑒𝑖𝑙𝑑𝑠
𝒊=𝟏
𝝅√𝟐 sin 𝜋 √2𝜋
≤ √2(𝑛 − 1) ≤
𝟐 (2(𝑛 − 1)) 2
Sol.: It is natural to make the

trigonometric substitution 𝑎𝑖 =
cos 𝑥𝑖 𝑓𝑜𝑟 𝑠𝑜𝑚𝑒 𝑥𝑖 ∊ 0, 𝜋, 𝑖 = 1, 2, … . , 𝑛. 2) Let 𝒙𝟎 = 𝟎 𝒂𝒏𝒅 𝒙𝟏 , 𝒙𝟐 , … . , 𝒙𝒏 > 0 with
Note that the monotonicity of the cosine ∑𝒏𝒌=𝟏 𝒙𝒌 = 𝟏
function combined with the given
Prove that
inequalities show that the 𝑥𝑖 ′𝑠 from a
decreasing sequence. The expression on 𝒙𝒌 𝝅
∑𝒏𝒌=𝟏 < 𝟐
the left becomes √𝟏+𝒙𝟎 +⋯+𝒙𝒌−𝟏 √𝒙𝒌+⋯+𝒙𝒏
𝑛−1
Sol.: Since 𝑥𝑖 ′𝑠 are positive and add up to
∑ √1 − cos 𝑥𝑖 cos 𝑥𝑖+1 − sin 𝑥𝑖 sin 𝑥𝑖+1 1, we can make the substitution 𝑥0 + 𝑥1 +
𝑖=1
⋯ + 𝑥𝑘 = sin 𝑎𝑘 , with 𝑎0 < 𝑎1 < ⋯ <
𝜋
𝑛−1 𝑎𝑛 = 2 , 𝑘 = 0, 1, … . , 𝑛. The inequality
= ∑ √1 − cos(𝑥𝑖+1 − 𝑥𝑖 ) sin 𝑎𝑘 −sin 𝑎𝑘−1 𝜋
becomes ∑𝑛𝑘=1 < ,
𝑖=1 √1+sin 𝑎𝑘−1 √1−sin 𝑎𝑘−1 2
𝑛−1
𝑥𝑖+1 − 𝑥𝑖
= √2 ∑ sin Which can be written as
2
𝑖=1
𝑛 𝑎𝑘 − 𝑎𝑘−1 𝑎 + 𝑎𝑘 − 1
2 sin cos 𝑘
Here we used a subtraction and a double- ∑ 2 2
angle formula. The sine function is concave cos 𝑎𝑘−1
𝑘=1
down on [0, 𝜋]; hence we can Jensen’s 𝜋
inequality to obtain For 0 < 𝑥 < 2 , cos 𝑥 is a decreasing
function and sin 𝑥 < 𝑥. Hence the left side
𝑛−1
1 𝑥𝑖+1 − 𝑥𝑖 of the inequality is strictly less than
∑ sin
𝑛−1 2 𝑎𝑘 −𝑎𝑘−1
𝑖=1 2 cos 𝑎𝑘−1
𝑛−1 ∑𝑛𝑘=1 2
= ∑𝑛𝑘=1(𝑎𝑘 −
1 𝑥𝑖+1 − 𝑥𝑖 cos 𝑎𝑘−1
≤ sin ( ∑ ) 𝜋
𝑛−1 2 𝑎𝑘−1 ) = and problem is solved.
𝑖=1 2
Hence,
260
3) If a, b, c be the edge of a right 5) The non-negative numbers a, b, c, A, B, C

parallelepiped and d its diagonal. Show and k satisfy a +A = b +B = c+ C = k.
that 𝒂𝟐 𝒃𝟐 + 𝒃𝟐 𝒄𝟐 + 𝒄𝟐 𝒂𝟐 ≥ 𝒂𝒃𝒄𝒅 √𝟑. Prove that 𝒂𝑩 + 𝒃𝑪 + 𝒄𝑨 ≤ 𝒌𝟐 .
Sol.: Since in a right parallelepiped the Sol.: The inequality is equivalent to

diagonal is given by the formula 𝑑 = 𝑎(𝑘 − 𝑏) + 𝑏(𝑘 − 𝑐) + 𝑐(𝑘 − 𝑎) ≤ 𝑘 2 . If
√𝑎2 + 𝑏 2 + 𝑐 2 , the inequality is equivalent to we view the left side as a function in a, it
(𝑎2 𝑏 2 + 𝑏 2 𝑐 2 + 𝑐 2 𝑎2 )2 ≥ 3𝑎2 𝑏 2 𝑐 2 is linear. The conditions from the
statement imply that interval of definition
(𝑎2 + 𝑏 2 + 𝑐 2 ) After regrouping term this is [0, k]. It follows that in order to
𝑐4 𝑎4 maximize the left and side we need to
becomes (𝑎2 − 𝑏2) + (𝑏 2 + 𝑐 2 )2 +
2 2
𝑏4 choose a ∊ {0, k}. Repeating the same
(𝑐 2 − 𝑎2 ) ≥ 0 argument for b and c, it follows that the
2
maximum of the left hand side is attained
Note that the equality holds if and only if = a
for some (a, b, c)∊ {0, 𝑘}3. Checking the
= b = c i.e. the parallelepiped is a cube.
eight possible situations, we obtain that
this maximum is 𝑘 2, and we are done.
4) If 𝒂𝟏 , 𝒂𝟐 , … , 𝒂𝒏 are real numbers, show

that
𝒏 𝒏 6) Let 𝟎 ≤ 𝒙𝒌 ≤ 𝟏 for all k = 1, 2, ….., n. Show
∑ ∑ 𝒊𝒋 𝐜𝐨𝐬(𝒂𝒊 − 𝒂𝒋 ) ≥ 𝟎 that 𝒙𝟏 + 𝒙𝟐 + ⋯ + 𝒙𝒏 −
𝒊=𝟏 𝒋=𝟏 𝒙𝟏 𝒙𝟐 … … … . 𝒙𝒏 ≤ 𝒏 − 𝟏
Sol.: By using the addition formula for the Sol.: Let us fix 𝑥2 , 𝑥3 … … 𝑥𝑛 and then
cosine we obtain consider the function f: [0, 1] →R.
f(x)= 𝑥1 + 𝑥2 + ⋯ + 𝑥𝑛 − 𝑥𝑥2 … … … . 𝑥𝑛 .
𝑛 𝑛
The function is linear in x, hence attains
∑ ∑ 𝑖𝑗 cos(𝑎𝑖 − 𝑎𝑗 ) its maximum the left side of the inequality
𝑖=1 𝑗=1
𝑛 𝑛 one must choose 𝑥1 𝑡𝑜 be 0 or 1, and by
= ∑ ∑(𝑖𝑗 cos 𝑎𝑖 cos 𝑎𝑗 symmetry, the same is true for the other
𝑖=1 𝑗=1
variables of occurs, if all 𝑥𝑖 are equal to 1,
+ 𝑖𝑗 sin 𝑎𝑖 + sin 𝑎𝑗 ) then we have equality. If at least one of
them is 0, then their product is also zero,
𝑛 𝑛
and the sum of the other 𝑛 − 1 terms is at
= ∑ 𝑖 cos 𝑎𝑖 ∑ 𝑗 cos 𝑎𝑗 most 𝑛 − 1. Which proves the inequality.
𝑖=1 𝑗=1
𝑛 𝑛
+ ∑ 𝑖 sin 𝑎𝑖 ∑ 𝑗 sin 𝑎𝑗
𝑖=1 𝑗=1 7) Find the maximum value of the sum 𝑺𝒏 =
𝒂𝟏 (𝟏 − 𝒂𝟐 ) + 𝒂𝟐 + (𝟏 − 𝒂𝟑 ) + ⋯ +
𝑛 2 𝑛 2
𝟏
𝒂𝒏 (𝟏 − 𝒂𝟏 ), where 𝟐 < 𝒂𝒋 ≤
= (∑ 𝑖 cos 𝑎𝑖 ) + (∑ 𝑖 sin 𝑎𝑖 ) ≥ 0
𝑖=1 𝑖=1 𝟏 𝒇𝒐𝒓 𝒆𝒗𝒆𝒓𝒚 𝒊 = 𝟏, 𝟐, … . , 𝒏.
261
Sol.: The expression is linear in each of (0, 1, 0, 1, ……0, 1). For n odd. Equality
the variables. So, as in the solutions to the holds when all pairs (𝑥𝑖 , 𝑥𝑖+1 ), 𝑖 =
previous problems, the maximum is 1, 2, … . , 𝑛. consist of a zero and a one,
1 except for one pair which consist of two
attained for 𝑎𝑘 = 2 𝑜𝑟 1, 𝑘 =
1 ones (with the convention 𝑥𝑛+1 = 𝑥𝑖 ).
1,2, … … , 𝑛. 𝐼𝑓 𝑎𝑘 = 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑘, 𝑡ℎ𝑒𝑛 𝑆𝑛 =
2
𝑛
4
, Let us show that the value of 𝑆𝑛 cannot
9) Prove that for numbers a, b, c in the
exceed this number. If exactly m of the 𝒂 𝒃 𝒄
𝑎𝑘′ 𝑠 are equal to 1, then m terms of the interval [0, 1] 𝒃+𝒄+𝟏 + 𝒄+𝒂+𝟏 + 𝒂+𝒃+𝟏 +
sum are zero. Also, at most m trams are (𝟏 − 𝒂)(𝟏 − 𝒃)(𝟏 − 𝒄) ≤ 𝟏
1
equal to 2 , 𝑛𝑎𝑚𝑒𝑙𝑦 those of the from
Sol.: For any non-negative numbers 𝛼, 𝛽,
1 𝛼
𝑎𝑘 (1 − 𝑎𝑘+1 )𝑤𝑖𝑡ℎ 𝑎𝑘 = 1 𝑎𝑛𝑑 𝑎𝑘+1 = 2. the function 𝑥 → is convex for 𝑥 ≥ 0.
𝑥+𝛽
Each of the remaining terms has both Viewed as a function in any of the three
1 1
factors equal to 2, and hence is equal to 4. variables, the given expression is a sum of
Thus the value of the sum is at most two convex functions and two linear
𝑚 (𝑛−2𝑚) 𝑛 functions so it is convex. Thus when two
𝑚. 0 + + = . Which shows that
2 4 4
𝑛 of the variables are fixed, the maximum is
the maximum is 4 .
attained when the third is at one of the
end points of the interval, so the values of
the expression are always less than the
8) If 𝒏 ≥ 𝟐 𝒂𝒏𝒅 𝟎 < 𝒙𝒊≤𝟏 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒊 = 1, 2, …., largest value obtained by choosing a, b, c
n show that (𝒙𝟏 + 𝒙𝟐 + ⋯ + 𝒙𝒏 ) − ∊[0, 1]. An easy check of the eight possible
(𝒙𝟏 𝒙𝟐 + 𝒙𝟐 𝒙𝟑 + ⋯ + 𝒙𝒏 𝒙𝟏 ) ≤ [ ] and
𝒏 cases shows that the value of the
𝟐 expression cannot exceed 1.
determine when there is equality [.]
denote the greatest integer function. 10) If a, b, c, d, e ∊[p, q] with p > 0, prove that
𝟏 𝟏 𝟏 𝟏 𝟏
(1+b+c+d+e) ( + + + + ) ≤ 𝟐𝟓 +
Sol.: Denote the left side of the inequality 𝒂 𝒃 𝒄 𝒅 𝒆
𝟐
by 𝑆(𝑥1 , 𝑥2 … 𝑥𝑛 ) This expression is linear 𝒑 𝒒
𝟔 (√𝒒 − √𝒑 )
in each of the variables 𝑥𝑖 As before, it
follows that it is enough to prove the
inequality when the 𝑥𝑖′ 𝑠 are equal to 0 or Sol.: If we fix four of the numbers and
1. If exactly k of the 𝑥𝑖 ′𝑠 are equal to 0, regard the fifth as a variable x, then the
and the others are equal to 1, then left side becomes a function of the form
𝛽
𝑆(𝑥1 , 𝑥2 , … , 𝑥𝑛 ) ≤ 𝑛 − 𝑘, and since the 𝛼𝑥 + 𝑥+𝑦, with 𝛼, 𝛽, y positive and x
sum 𝑥1 𝑥2 + 𝑥2 𝑥3 + ⋯ + 𝑥𝑛 𝑥1 is at least ranging over the interval [p, q]. This
𝑛 − 2𝑘,S(𝑥1 , 𝑥2 , … , 𝑥𝑛 ) is less than or function is convex on the interval [p, q]
equal to 𝑛 − 𝑘 − (𝑛 − 2𝑘) = 𝑘. So the being the sun of a linear and a convex
maximum of S is less than or equal to function, so it attains its maximum at one
𝑛
min(𝑘, 𝑛 − 𝑘) . 𝑊ℎ𝑖𝑐ℎ is at most [2 ]. If (or possibly both) of the end points of the
follows that for n even. Equality holds interval of definition. As the value of the
when (𝑥1 , 𝑥2 , …, ) =(1, 0, 1, 0, ……, 1, 0) or expression, it is enough to let a, b, c, d, e
take the values p and q.
262
If n of the numbers are equal tom p, and 12) Prove that

5 − 𝑛 are equal to q, then the left side is
𝟏 𝟏
equal to + +⋯
√𝟏 + √𝟑 √𝟓 + √𝟕
𝑝 𝑞 𝟏
𝑥 2 + (5 − 𝑛)2 + 𝑛(5 − 𝑛) ( + ) + > 24
𝑞 𝑝 √𝟗𝟗𝟗𝟗 + √𝟗𝟗𝟗𝟗
= 25
+ 𝑛(5 Sol.: There are some terms missing to make
2 this sum telescope. However, since the left
√𝑝 √𝑞 1 1
− 𝑛) ( − ) hand side is greater than + 7+ 9 + ⋯ +
𝑞 𝑝 √3+√5 √ √
1
the inequality will show from
√9999+√10001
The maximal value of 𝑛(5 − 𝑛 ) is attained 1 1 1 1
when n=2 or 3 in which case 𝑛(5 − 𝑛)=6, and + + + ⋯+ >
√1+√3 √3+√5 √5+√7 √9999+ √10001
the inequality is proved. 48 Now we are able to telescope. Rationalize
the denominators and obtain the equivalent
inequality.
11) Prove that if 𝟏 ≤ 𝒙𝒏 ≤ 𝟐, 𝒌 = 𝟏, 𝟐, … … , 𝒏
𝟏 𝟐 √3 − √1 √5 − √3 √7 − √5
then (∑𝒏𝒌=𝟏 𝒙𝒌 ) (∑𝒏𝒌=𝟏 𝒙 ) ≤ 𝒏𝟑 + + +⋯
𝒌
2 2 2
Sol.: Using the AM- GM inequality we can √10001 + √9999
+ > 48.
write 2
(√10001−1)
3 2 The left side is equal to , and an easy
√(∑𝑛𝑘=1 𝑥𝑘 ) (∑𝑛𝑘=1 1 ) ≤
1
(∑𝑛𝑘=1 𝑥𝑘 + 2
𝑥𝑘 3 check shows that this is larger than 48.
𝑛 1 𝑛 1
∑𝑘=1 + ∑𝑘=1 )
𝑥𝑘 𝑥𝑘 𝒌
13) If 𝒂𝒌 = (𝒌−𝟏)𝟒/𝟑+𝒌𝟒/𝟑+(𝒌+𝟏)𝟒/𝟑. Show that
𝑛 1 1 𝒂𝟏 + 𝒂𝟐 + ⋯ + 𝒂𝟗𝟗𝟗𝟗 < 50.
𝑥𝑘 + +
𝑥𝑘 𝑥𝑘
∑ .
3 Sol.: The idea is first to decreases the
𝑘=1
denominator of 𝑎𝑛 , replacing 𝑘 4/3 𝑏𝑦 (𝑘 −
2
The function 𝑥 + 𝑥 is convex on the interval 1)2/3 (𝑘 + 1)2/3 and then to rationalize it. We
[1, 2], so it attains its maximum at one of the have
end points of the interval. Also, the value of
𝑘
the function at each of the end point is equal 𝑎𝑛 < 4 2 2 4
to 3. This shows that (𝑘 − 1)3 + (𝑘 − 1)3 (𝑘 + 1)3 + (𝑘 + 1)3
2 2
1 1 𝑘((𝑘 + 1)3 (𝑘 − 1)3 )
𝑛𝑥𝑘 + 𝑥 + 𝑥 =
𝑘 𝑘 (𝑘 + 1)2 (𝑘 − 1)2
∑ ≤𝑛
3 1 2 2
𝑘=1 = ((𝑘 + 1)3 (𝑘 − 1)3 )
4
And the inequality is proved. 1
It follows that ∑999 999
𝑛=1 𝑎𝑛 < 4 ∑𝑛=1 𝑎𝑛 ((𝑘 +
Let us point out that the same idea can be 2 2
used to prove the more general from of this 1)3 (𝑘 − 1)3 )

inequality.
263
1 2 2 2 2 𝑛 𝑛
= (10003 + 9993 − 13 − 03 ) 𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 𝑘 + 1) 1 1
4 =∑ ∑
𝑛. 𝑛. 𝑛 … … … 𝑛 𝑘! 𝑘!
1 𝑘=0 𝑘=0
< (100 + 100 − 1)
4 1 2 𝑘−1
< 50. (1 − ) (1 − ) … . (1 − ).
𝑛 𝑛 𝑛
𝟏
14) Show that ∑∞
𝒏=𝟏 (𝒏+𝟏) < 2. In a similar manner,
√𝒏
𝑛+1
Sol.: It is natural to transform the terms of the 1 𝑛+1 1 1
sum as (1 + ) = ∑ (1 − ).
𝑛+1 𝑘! 𝑛+1
𝑘=0
1 1/𝑛 √𝑛 √𝑛
= = − . 2 𝑘−1
√𝑛(𝑛 + 1) 𝑛(𝑛 + 1) 𝑛 𝑛+1 (1 − … (1 − )
𝑛 + 1) 𝑛+1
This allow us to rewrite the sum as 1 + 1 𝑛+1
= ( )
√ 𝑛−√𝑛−1 𝑛+1
∑∞
𝑛=2 . 𝑛
𝑛 1
+ ∑ (1 − )
The sum does not telescope, but it is bounded 𝑛+1
𝑘=0
from above by
2 𝑘−1
∞ (1 − ) … . (1 − ).
√𝑛 − √𝑛 − 1 𝑛+1 𝑛+1
1+∑
𝑛=2
√𝑛√𝑛 − 1 The inequality is now obvious. Since
∞ 1
1 1 comparing the coefficients of : in these
=1+∑( − ) 𝑘
√𝑛 − 1 √𝑛 expressions. We see that for each k, k = 0, 1,
𝑛=2
2, ….., n.
With telescope to 2. This proves the
inequality. 1 2 𝑘−1
(1 − ) (1 − ) … … … (1 − )
𝑛 𝑛 𝑛
1
< (1 − ) (1
𝑛+1
15) For each positive integer n. Show that 2 𝑘−1
− ) … … … (1 − )
𝑛+1 𝑛+1
𝟏 𝒏 𝟏 𝒏+𝟏
(𝟏 + ) < (𝟏 + ) It is worth nothing that
𝒏 𝒏+𝟏
Sol.: This is an important inequality that can 1 2 1 1 2

(1 + ) = ∑𝑛𝑘=0 (1 − ) (1 − ) … … . (1 −
𝑛 𝑘! 𝑛 𝑛
be proved in a number of ways. Here we will 𝑘−1 1 1 2
give a proof based on comparing 𝑛
) < ∑𝑛𝑘=0 𝑘! (1 − 𝑛) (1 − 𝑛) … … … (1 −
corresponding terms in the binomial 𝑘−1 1 1
𝑛
) < ∑𝑛𝑘=0 𝑘! = 1 + ∑𝑛𝑘=0 𝑘! < 1 +
expansions of each side, 1 1 1
∑𝑛𝑘=0 𝑘−1 = 1 + ∑𝑛−1 ∞
𝑘=0 2𝑘 < 1 + ∑𝑘=0 2𝑘 = 3.
2
𝑛
1 𝑛 𝑛 1 𝑘
(1 + ) = ∑ ( ) ( ) 1 𝑛
𝑛 𝑘 𝑛 Thus the sequence (1 + 𝑛) is increasing and
𝑘=0
bounded above by 3. (It can be shown that
the sequence converges to the number e)
264
The next result is important theoretically and 11/(𝑛−1)

is very useful. = = 𝑛−1/(𝑛−1)
𝑛
𝟏
𝟏
16) Show that 𝒏 {(𝒏 + 𝟏)𝒏 − 𝟏} < 1 + 𝟐 + 𝟑 +
𝟏 17) Let 𝒂𝟏 , 𝒂𝟐 , … , 𝒂𝒏 are real (n > 1) and 𝑨 +
∑𝒏𝒊=𝟏 𝒂𝒊 𝟐 <
𝟏
⋯ + 𝒏 < 𝑛 − (𝑛 − 1)𝒏−𝟏/(𝒏−𝟏) 𝟏
(∑𝒏𝒊=𝟏 𝒂𝒊 )𝟐 𝑷𝒓𝒐𝒗𝒆 𝒕𝒉𝒂𝒕 𝑨 <
𝒏−𝟏
1 1 2𝒂𝒊 𝒂𝒋 𝒇𝒐𝒓 𝟏 ≤ 𝒊 ≤ 𝒋 ≤ 𝒏.
Sol.: Let 𝑆𝑛 = 1 + 2 + ⋯ + 𝑛. The left most
inequality is equivalent to proving. Sol.: By the Cauchy-Schwarz inequality
𝑛 + 𝑆𝑛 𝑛 2
> (𝑛 + 1)1/𝑛
𝑛 (∑ 𝑎𝑖 ) = [(𝑎1 + 𝑎2 ) − 𝑎3 + ⋯ + 𝑎𝑛 ]2
𝑖=1
Which has vaguely the look of an arithmetic ≤ (1 + ⋯ 1 )((𝑎1 + 𝑎2 )2
mean geometric mean inequality. We can + 𝑎3 2 … . +𝑎𝑛 2 )
make the idea work in the following way: 𝑛
= (𝑛 − 1) [∑ 𝑎2 + 2𝑎1 𝑎2 ]
1 1
𝑛 + 𝑆𝑛 𝑛 + (1 + 2 + ⋯ + 𝑛) 𝑖=1
=
𝑛 𝑛 This, together with the given inequality,
1 1 implies that
(1 + 1) + (1 + ) + ⋯ + (1 + )
= 2 𝑛
𝑛 𝑛 2
𝑛 1
𝐴 < − (∑ 𝑎𝑖 2 ) + (∑ 𝑎)
3 4 (𝑛 + 1) 𝑛−1
2 + 2 + 3 + ⋯+ 𝑛
𝑖=1 𝑖=1
𝑛
=
𝑛 < − (∑ 𝑎𝑖 2 )
𝑖=1
3 4 𝑛 + 1 1/𝑛
(2. . … … . . ) . 1
2 3 𝑛
+ [(𝑛
𝑛+1
For the right most inequality. We need to
𝑛−𝑆𝑛 𝑛
show that 𝑛−1
> 𝑛−1/(𝑛−1). Again, using the
− 1) [(∑ 𝑎2 − 2𝑎1 𝑎2 )]]
arithmetic mean geometric mean inequality.
𝑖=1
We have
= 2𝑎1 𝑎2 .
1 1 1
𝑛 − 𝑆𝑛 𝑛 − (1 + 2 + 3 + ⋯ + 𝑛) In a similar manner, 𝐴 <
= 2𝑎1 𝑎2 𝑓𝑜𝑟 1 ≤ 𝑖 ≤ 𝑗 ≤ 𝑛.
𝑛−1 𝑛−1
1 1 18) If positive numbers p, q, r such that 𝟐𝒑 =
(1 − 1) + (1 − ) + ⋯ + (1 − )
= 2 𝑛 𝒑𝒒−𝒓
𝑛−1 𝒒 + 𝒓, 𝒒 ≠ 𝒓 show that 𝒒𝟐𝒓𝟐 < 1.
1 2 (𝑛 − 1) Sol.: Suppose that q and r are positive

2 + 3 + ⋯+ 𝑛
= 1 1
𝑛−1 integers, and consider the q number 𝑞 … … 𝑞
1
1 1 3 𝑛 − 1 (𝑛−1) and the r. By the arthmatic mean geometric
> ( . . ….. ) mean equality.
2 3 4 𝑛
265
1 1 1/(𝑞+𝑟) 𝑞 (1/𝑞) + 𝑟 (1/𝑟) 1 1

(0, 2) 𝑎𝑛𝑑 𝐺′(𝑥) > 0 on the interval (2 , 1).
1
. < = ,
𝑞𝑞 𝑟𝑟 𝑞+𝑟 𝑝 Therefore 𝐺(𝑥) lakes its minimum value on
1
𝑤ℎ𝑖𝑐ℎ 𝑖𝑠 𝑒𝑞𝑢𝑖𝑣𝑎lent to the desired inequality (0, 1)𝑎𝑡 𝑥 = . Thus, the minimum value of
2
of course, this method breaks down if either q 1 1/2 1
𝐹(𝑥) on (0, 1) is 𝐹(1) = ( ) = . It follows
or r is not an integer, so how shall we 2
2 2
proceed? One idea is to rewrite the inequality 1 1
that 𝐹(𝑥) > for all x in (0, 1) 𝑥 ≠ and the
2 2
in the following manner:
proof is complete.
𝑟 𝑞 + 𝑟 𝑞+𝑟 1 𝑞+𝑟
𝑝𝑞+𝑟 < 𝑞 𝑞𝑟 , ( ) < 𝑞𝑞 𝑟𝑟 , ( )
2 2
𝑞 𝑞 19) If 𝟎 ≤ 𝒙𝒊 < 𝜋, 𝑖 = 1, … . , 𝑛 and set 𝒙 =
<( )
𝑞+𝑟 𝟏
(𝒙𝟏 + 𝒙𝟐 + ⋯ +
𝒏
𝑟 1𝑟 𝐬𝐢𝐧 𝒙𝒊 𝐬𝐢𝐧 𝒙 𝒏
( ) . 𝒙𝒏 ). 𝑺𝒉𝒐𝒘 𝒕𝒉𝒂𝒕 ∏𝒏𝒊=𝟏 ( ) ≤ ( )
𝒙 𝒙
𝑞+𝑟 2
𝑞 𝑞/(𝑞+𝑟) 𝑟 𝑟/(𝑞+𝑟) Sol.: The problem is equivalent to proving
< ( ) ( ) .
𝑞+𝑟 𝑞+𝑟 that ∑𝑛𝑖=1 log
sin 𝑥𝑖
≤ 𝑛 log
sin 𝑥
consider the
𝑥𝑖 𝑥
𝑞 𝑟 sin 𝑡
𝑆𝑒𝑡 𝑥 = 𝑎𝑛𝑑 𝑦 = . function 𝑓(𝑡) = log 𝑡
.
(𝑞 + 𝑟) (𝑞 + 𝑟)
It is a straight forward matter to show that f
𝑜𝑏𝑠𝑒𝑟𝑣𝑒 𝑡ℎ𝑎𝑡 𝑥 + 𝑦 = 1 𝑎𝑛𝑑 0 < 𝑥, 𝑦 < 𝑖.
Then the problem is equivalent to proving is concave (𝑓(𝑡) 𝑛 < 0) on the interval (0, 𝜋)
that
Therefore,
1
𝐹(𝑥) ≡ 𝑥 𝑥 (1 − 𝑥)1−𝑥 > , 0 < 𝑥 < 1, 𝑥 𝑥1 + 𝑥2 𝑓(𝑥 ) + 𝑓(𝑥2 )
2 𝑓( )≥ 1 .
1 2 2
≠ .
2 In a manner completely analogous to the
By introducing the function in this way, we proof it follows that
are able to use the methods of analysis. The 𝑥1 + ⋯ + 𝑥𝑛 𝑓(𝑥 ) + ⋯ + 𝑓(𝑥𝑛 )
idea is to find the minimum value of F on (0, 𝑓( )≥ 1
2 2
1). To simplify the differentiation, we will
consider the function 𝐺(𝑥) = log 𝐹(𝑥) . To find Direct substitution into this inequality
the critical points, we differentiate: completes the proof.
𝑑 sin 𝑥 1 sin 𝑥1
𝐺 ′ (𝑥) = [𝑥 log 𝑥 + (1 − 𝑥) log(1 − 𝑥)] log ( ) ≥ (log +⋯
𝑑𝑥 𝑥 𝑛 𝑥1
= (log 𝑥 + 1) − 1 sin 𝑥𝑛
𝑥 + log )
𝑥𝑛
− log(1 − 𝑥) = log .
1−𝑥
1
𝑊𝑒 𝑠𝑒𝑒 𝑡ℎ𝑎𝑡 𝐺′(𝑥) = 0 𝑖𝑓 𝑎𝑛𝑑 𝑜𝑛𝑙𝑦 𝑖𝑓 𝑥 = 2.
Furthermore, 𝐺′(𝑥) < 0 on the interval
266
20) If a, b, c, d are non-negative numbers such

𝑎1 𝑎2
that 𝒂 ≤ 𝟏, 𝒂 + 𝒃 ≤ 𝟓, 𝒂 + 𝒃 + 𝒄 ≤ = (4√𝑏1 . √ + 4√𝑏2 . √ + ⋯
𝑏1 𝑏2
𝟏𝟒, 𝒂 + 𝒃 + 𝒄 + 𝒅 ≤30. Prove that √𝒂 +
2
√𝒃 + √𝒄 + √𝒅 ≤ 𝟏𝟎. 𝑎𝑛
+ 4√𝑏𝑛 . √ )
Sol.: We will prove a more general statement. 𝑏𝑛
If 𝑎1 , 𝑎2 , … , 𝑎𝑛 are positive, 0 ≤ 𝑏1 ≤ 𝑏2 ≤ ≤ (√𝑏1 + √𝑏2 + ⋯ + √𝑏𝑛 )

⋯ ≤ 𝑏𝑛 and for all 𝑘 ≤ 𝑛, 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑘 ≤ 𝑎1 𝑎2 𝑎𝑛
𝑏1 + 𝑏2 + ⋯ + 𝑏𝑘 , then √𝑎1 + √𝑎2 + ⋯ + + + ⋯+
√𝑏1 √𝑏2 √𝑏𝑛
√𝑎𝑛 ≥ √𝑏1 + √𝑏2 + ⋯ + √𝑏𝑛 . The special
≤ (√𝑏1 + √𝑏2 + ⋯
case of the original problem is obtained for n
+ √𝑏𝑛 )2
= 4, by setting 𝑏𝑘 = 𝑘 2 , 𝑘 = 1, 2, 3, 4. Let us
𝑎 𝑎
prove the above result, we have 1 + 2 + 𝑇ℎ𝑖𝑠 𝑔𝑖𝑣𝑒𝑠 √𝑎1 + √𝑎2 + ⋯ + √𝑎𝑛 ≤
√𝑏1 √𝑏2
𝑎𝑛
⋯+ √𝑏1 + √𝑏2 + ⋯ + √𝑏𝑛 .
√𝑏𝑛
1 1 1 1
= 𝑎1 ( − ) (𝑎1 + 𝑎2 ) ( − )+
√𝑏1 √𝑏2 √𝑏2 √𝑏3
1 1 21) Suppose 𝒂𝟏 , 𝒂𝟐 , … , 𝒂𝒏 be non-negative
(𝑎1 + 𝑎2 + 𝑎3 ) ( − ) + ⋯ + (𝑎1 + 𝑎2 + 𝟏
√𝑏3 √𝑏4 numbers such that 𝒂𝟏 𝒂𝟐 − 𝒂𝒌 ≤ (𝟐𝒌)! for
1
⋯ + 𝑎𝑛 ) 𝟏
√𝑏𝑛 all k. Show that 𝒂𝟏 + 𝒂𝟐 + ⋯ 𝒂𝒏 ≥ +
𝒏+𝟏
𝟏 𝟏
The differences in the parenthesis are all 𝒏+𝟐
+ ⋯ + 𝟐𝒏.
positive. Using the hypothesis we obtain that
this expression is less than or equal to Sol.: We have
1
1 1 1 1 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑛 = (1 − 2) (1.2𝑎1 ) +
𝑏1 ( − ) − (𝑏1 + 𝑏2 ) ( − )
1 1 1 1
√𝑏1 √𝑏2 √𝑏2 √𝑏3 ( − ) (3.4𝑎2 ) + ⋯ + ( − ) ((2𝑛 −
3 4 2𝑛−1 2𝑛
1
+ ⋯ + (𝑏1 + 𝑏2 + ⋯ + 𝑏𝑛 ) 1). 2𝑛𝑎𝑛 )
√𝑏𝑛
1 1 1
= √𝑏1 + √𝑏2 + ⋯ + √𝑏𝑛 . = (1 − − + ) (1.2𝑎1 )
2 3 4
1 1 1 1
𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒, +( − − + )
3 4 5 6
𝑎1 𝑎2 𝑎𝑛 (1.2𝑎1 + 3.4𝑎2 ) + ⋯
+ + ⋯+
√𝑏1 √𝑏2 √𝑏𝑛 1 1
+( − ) (1.2𝑎1
≤ √𝑏1 + √𝑏2 + ⋯ + √𝑏𝑛 2𝑛 − 1 2𝑛
+ 3.4𝑎2 ) + ⋯
Using this result and the Cauchy-Schwarz + (2𝑛 − 1). 2𝑛𝑎𝑛
inequality, we obtain. (√𝑎1 + √𝑎2 + ⋯ +
2 Using the AM-GM inequality and the
√𝑎𝑛 ) hypothesis we obtain.
267
22) The numbers 𝒂𝟏 ≥ 𝒂𝟐 … ≥ 𝒂𝒏 > 𝑥1 𝑥2 𝑥𝑘 𝑘 𝑥1 𝑥2 𝑥𝑘

0 𝑎𝑛𝑑 𝒃𝟏 ≥ 𝒃𝟐 ≥ ⋯ ≥ 𝒃𝒏 > + + ⋯+ ≥𝐾 √ ……..
𝑦1 𝑦2 𝑦𝑘 𝑦1 𝑦2 𝑦𝑘
0. 𝑆𝑎𝑡𝑖𝑠𝑓𝑦 𝒂𝟏 ≥ 𝒃𝟏 , 𝒂𝟏 + 𝒂𝟐 ≥ 𝒃𝟏 +
𝒃𝟐 , 𝒂𝟏 + 𝒂𝟐 + ⋯ + 𝒂𝒏 ≥ 𝒃𝟏 + 𝒃𝟐 + ⋯ + ≥ 𝐾,
𝒃𝒏 . Prove that
𝑤ℎ𝑒𝑟𝑒 𝑡ℎ𝑒 𝑙𝑎𝑠𝑡 𝑖𝑛𝑒𝑞𝑢𝑎𝑙𝑖𝑡𝑦 𝑓𝑜𝑖𝑙𝑜𝑤𝑠 𝑓𝑟𝑜𝑚 𝑡ℎ𝑒 ℎ𝑦𝑝𝑜𝑡ℎ𝑒𝑠𝑖𝑠.
𝒌 𝒌
𝒂𝟏 𝒌 + 𝒂𝟐 𝒌 + ⋯ + 𝒂𝒏 𝒌 ≥ 𝒃𝟏 + 𝒃𝟐 + ⋯ + Returning to the original inequality we have
𝒃𝒏 𝒌 for every positive integer k.
𝑥1 𝑥2 𝑥1
𝑥1 + 𝑥2 + ⋯ + 𝑥𝑛 = 𝑦1 + 𝑦𝑛 =
Sol.: We can write 𝑦1 𝑦2 𝑦1
𝑎𝑖 𝑘 − 𝑏𝑖 𝑘 (𝑎𝑖 − 𝑏𝑖 )(𝑎𝑖 𝑘−1 + 𝑎𝑖 𝑘−2 + ⋯ + 𝑥1 𝑥2

(𝑦1 − 𝑦2 ) + ( + ) (𝑦2 − 𝑦3 ) + ⋯
𝑦1 𝑦2
𝑎𝑖 𝑏𝑖 𝑘−2 + 𝑏𝑖 𝑘−1 ) 𝑥1 𝑥2 𝑥𝑛
+ ( + + ⋯ + ) 𝐼𝑛.
𝑦1 𝑦2 𝑦𝑛
To simplify computations, set 𝑐𝑖 = 𝑎𝑖 =
𝑏𝑖 𝑎𝑛𝑑 𝑑𝑖 = 𝑎2 𝑘−1 + 𝑎𝑖 𝑘−2 𝑏𝑖 + ⋯ + By using the inequality deduced at the
𝑘−2 𝑘−1
𝑎𝑖 𝑏𝑖 + 𝑏𝑖 . beginning of the solution for the first factor in
each term, we obtain that this expression is
The hypothesis implies 𝑐1 + 𝑐2 + ⋯ + 𝑐𝑗 ≥ 0
greater than or equal to
for all j and 𝑑𝑖 > 𝑑𝑖+1 > 0 the latter since
𝑎𝑖 𝑎𝑛𝑑 𝑏𝑖 are decreasing positive sequences. 1 − (𝑦1 − 𝑦2 ) + 2(𝑦2 − 𝑦3 ) + ⋯ + 𝑥𝑦𝑛
Hence 𝑎1 𝑘 − 𝑏1 𝑘 + 𝑎2 𝑘 − 𝑏2 𝑘 + ⋯ + 𝑎𝑛 𝑘 − = 𝑦1 + 𝑦2 + ⋯ + 𝑦𝑛 and we and done.

𝑏𝑛 𝑘 = 𝑐1 𝑑1 + 𝑐2 𝑑2 + ⋯ + 𝑐𝑛 𝑑𝑛 =
(𝑑1 − 𝑑2 )𝑐1 + (𝑑2 − 𝑑3 )(𝑐1 + 𝑐2 ) + ⋯ +
𝑑𝑛 (𝑐1 + 𝑐2 + ⋯ + 𝑐𝑛 ) ≥ 0 the inequality is 24) Let {𝒂𝒏 } be a sequence of positive
proved. numbers such that for all n, ∑𝒏𝒌=𝟏 𝒂𝒌 ≥
√𝒏. 𝑺𝒉𝒐𝒘 𝒕𝒉𝒂𝒕
𝟏 𝟏 𝟏
∑𝒏𝒌=𝟏 𝒂𝟐 𝒌 ≥ (𝟏 + + ⋯ + ) for all
𝟒 𝟐 𝒏
23) If 𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏 and𝒚𝟏 ≥ 𝒚𝟐 ≥ ⋯ ≥ 𝒚𝒏 be n.
two sequence of positive numbers such
that 𝒙𝟏 ≥ 𝒚. Sol.: We start by proving another inequality,
namely that if 𝑎1 , 𝑎2 , … . , 𝑎𝑛 are positive and
𝒙𝟏 𝒙𝟐 ≥ 𝒚𝟏 𝒚𝟐 … … … . . 𝒙𝟏 𝒙𝟐 … 𝒙𝒏 ≥
𝒚𝟏 𝒚𝟐 … … 𝒚𝒏 . 𝑏1 ≥ 𝑏2 ≥ ⋯ … … . 𝑏𝑛 ≥ 0 and if for all
𝐾 ≥ 𝑛, 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑘 ≥ 𝑏1 ≥
𝑺𝒉𝒐𝒘 𝒕𝒉𝒂𝒕 𝒙𝟏 + 𝒙𝟐 + ⋯ + 𝒙𝒏 ≥ 𝒚𝟏 +
𝑏2 + ⋯ + 𝑏𝑘 , than
𝒚𝟐 + ⋯ + 𝒚𝒏 .
𝑎1 2 + 𝑎2 2 + ⋯ + 𝑎𝑛 2 ≥ 𝑏1 2 + 𝑏2 2 +
Sol.: We want to reduce the inequalities ⋯ + 𝑏𝑛 2 .
involving products to inequality involving
This inequality is the same as the one in
sums. For this we use the A.M. GM inequality
problem 2 in the particular case where the
we have
exponent is 2, but with a weaker hypothesis
268
using the Able summation formula, we can 1

𝑍𝑘 = 𝑥 Then we have 𝑆𝑘 ≥ 0 𝑎𝑛𝑑 𝑧𝑘 −
𝑘 𝑦𝑘
write
𝑧𝑘+1 > 0 𝑓𝑜𝑟 𝑎𝑛𝑦 𝐾 = 1, 2, … , 𝑛 − 1.
𝑎1 𝑏1 + 𝑎2 𝑏2 + ⋯ + 𝑎𝑛 𝑏𝑛 = 𝑎1 (𝑏1 − 𝑏2 ) + It follows that
(𝑎1 + 𝑎2 )(𝑏2 − 𝑏3 ) + (𝑎1 + 𝑎2 + 𝑎3 )(𝑏3 −
1 1 1 1 1 1
𝑏4 ) + ⋯ + (𝑎1 + 𝑎2 + ⋯ + 𝑎𝑛 ) 𝑏𝑛 this + + ⋯+ − − …
𝑥1 𝑥2 𝑥𝑛 𝑦1 𝑦2 𝑦𝑛
inequalities in the statement show that this is
greater than or equal to 𝑏1 (𝑏1 − 𝑏2 ) + 1 1 1 1 1 1
= ( − )+ ( − )+ ⋯+ ( − )
(𝑏1 + 𝑏2 )(𝑏2 − 𝑏3 ) + ⋯ + (𝑏1 + 𝑏2 + ⋯ + 𝑥1 𝑦1 𝑥2 𝑦2 𝑥𝑛 𝑦𝑛
𝑏𝑛 )𝑏𝑛 = 𝑏1 2 + 𝑏2 2 + ⋯ + 𝑏𝑛 𝑛 combining this
𝑦1 − 𝑥1 𝑦2 − 𝑥2 𝑦𝑛 − 𝑥𝑛
with the canchy Schwarz inequality we obtain = + + ⋯+
𝑥1 𝑦1 𝑥2 𝑦2 𝑥𝑛 𝑦𝑛
(𝑎1 2 + 𝑎2 2 + ⋯ + 𝑎𝑛 2 )(𝑏1 2 + 𝑏2 2 + ⋯ + = 𝑆1 𝑍1 − (𝑆2 − 𝑍2 )𝑍2 … . . −(𝑆𝑛
𝑏𝑛 2 ) ≥ (𝑎1 𝑏1 + 𝑎2 𝑏2 + ⋯ + 𝑎𝑛 𝑏𝑛 )2 ≥ − 𝑆𝑛−1 )𝑍𝑛
(𝑏1 2 + 𝑏2 2 + ⋯ + 𝑏𝑛 2 )2 and the proof is = −𝑆1 (𝑍1 − 𝑍2 )
complete. − 𝑆2 (𝑍2
− 𝑍3 ) … … . 𝑆𝑛−1 (𝑍𝑛−1
Returning to our problem, note first that √𝑛 − − 𝑍𝑛 )
1
√𝑛 − 1 > 2 Indeed, multiplying by the
√𝑛 −𝑆𝑛 𝑍𝑛 ≤ 0 with equality if and only if 𝑆𝑘 =
rational conjugate of the left side, this becomes 0, 𝐾 = 1, 2, … . , 𝑛 that is, when 𝑥𝑘 =
𝑦𝑘 , 𝐾 = 1, 2, … , 𝑥.
(√𝑛 − √𝑛 − 1)
𝑛(𝑛 − 1) > .
(2√𝑛) (b) We can assume without loss of generality
that 𝑎1 < 𝑎2 < ⋯ < 𝑎𝑛 . From the
After eliminating the denominators and
hypothesis it follows that if or any partition
cancelling out terms, this becomes √𝑛 − of the set {𝑎1 , 𝑎2 , … , 𝑎𝑛 } into two subset
√𝑛 − 1. since we can perform such a partition in 2𝑘
ways it follows that 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑘 ≥
The conclusion of the problem now follow from
the inequality proved in the beginning by 2𝑘 . we now apply (a) to the numbers 𝑎1 +
𝑎2 + ⋯ + 𝑎𝑛 𝑎𝑛𝑑 1.2. 22 … 2𝑛−1 .
choosing 𝑏𝑛 = √𝑛 − √𝑛 − 1.
(whose sum is 2𝑛 − 1) . It follows that
1 1 1 1 1 1
𝑎1
+ 𝑎 + ⋯ + 𝑎 ≤ 1 + 2 + ⋯ + 2𝑛−1 =
2 𝑛
1
25) Suppose 𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏 , 𝒚𝟏 , 𝒚𝟐 , . . , 𝒚𝒏 be 2 − 2𝑛−1
positive real numbers such that
(i) 𝒙𝟏 𝒚𝟏 < 𝒙𝟐 𝒚𝟐 < ⋯ < 𝒙𝒏 𝒚𝒏
(ii) 𝒙𝟏 + 𝒙𝟐 + ⋯ + 𝒙𝒌 ≥ 𝒚𝟏 + 𝒚𝟐 + ⋯ + 26) If 𝟎 = 𝒂𝟎 < 𝒂𝟏 < ⋯ < 𝒂𝒏 𝒂𝒏𝒅 𝒂𝒊+𝟏 −
𝒚𝒌 𝒘𝒉𝒆𝒓𝒆 𝟏 ≤ 𝒌 ≤ 𝒏. 𝒂𝒊 ≤ 𝟏 𝒇𝒐𝒓 𝟎 ≤ 𝒊 ≤ 𝒏 − 𝟏 then show that
(∑𝒏𝒊=𝟎 𝒂𝒊 )𝟐 ≥ ∑𝒏𝒊=𝟎 𝒂𝒊 𝟑
Sol.:
Sol.: Try to prove that
(a) Let 𝑆𝑘 = (𝑥1 − 𝑦1 ) + (𝑥2 − 𝑦2 ) + ⋯ +
(𝑥𝑘 − 𝑦𝑘 )𝑎𝑛𝑑
269
𝑛 2 𝑛 𝑛 𝑛 (𝑚 − 2)𝑡
3
𝑎𝑗 + 𝑎𝑗 − 1 1+ . 𝐻𝑒𝑛𝑐𝑒, 𝑙𝑖𝑚 → ∞ 𝐿𝑘 = 2.
(∑ 𝑎𝑖 ) − ∑ 𝑎𝑖 = 2 ∑ ∑ 𝑎𝑖 1 + 𝑡2
2
𝑖=0 𝑖=0 𝑖=0 𝑗=0
We can proceed similarly in the case 𝑘 = 2𝑚 +
[1 − (𝑎𝑗 − 𝑎𝑗−1 )] we have equality if 𝑎𝑗 − 1.
𝑎𝑗−1 = 1 for j = 1, …, n.
This gives the well known (∑𝑛𝑖=0 𝑖 )2 − ∑𝑛𝑖=0 𝑖 3

28) If x, y, z be positive reals with 𝒙𝒚 + 𝒚𝒛 +
𝟐𝒙(𝟏−𝒙𝟐 ) 𝟐𝒚(𝟏−𝒚𝟐 )
𝒛𝒙 = 𝟏 prove that (𝟏+𝒙𝟐 )𝟐
+ (𝟏+𝒚𝟐)𝟐 +
𝟐𝒛(𝟏−𝒛𝟐 )
27) Prove that, for any positive numbers ≤
𝒙𝟏 𝒙𝟐 (𝟏+𝒛𝟐 )𝟐
𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒌 (𝒌 ≥ 𝟒) + + ⋯+ 𝒙 𝒚 𝒛
𝒙𝒌 +𝒙𝟐 𝒙𝟏 +𝒙𝟑
+ +
𝒙𝟏
≥ 𝟐. Can you replace 2 by a greater 𝟏 + 𝒙𝟐 𝟏 + 𝒚𝟐 𝟏 + 𝒛𝟐
𝒙𝒌−𝟏 +𝒙𝟏
number? Sol.: This reminds of the formula sin 𝛼 =
𝛼 𝛼
Sol.: Denote the L.H. S of the inequality by 𝐿𝑘 . 2 tan ( 2 ) [1 + 𝑡𝑎𝑛2 ( 2 )] 𝑎𝑛𝑑 cos 𝛼 =
𝛼
For K = 4, we have [1−𝑡𝑎𝑛2 ( )]
2
𝛼 .
[1+𝑡𝑎𝑛2 ( )]
2
𝑥1 𝑥2 𝑥3 𝑥4
𝐿4 + + +
𝑥4 + 𝑥2 𝑥1 + 𝑥3 𝑥2 + 𝑥4 𝑥1 + 𝑥3 𝛼 𝛽
𝑥1 + 𝑥3 𝑥2 + 𝑥4 𝑆𝑜 𝑙𝑒𝑡 𝑢𝑠 𝑠𝑒𝑡 𝑥 = tan ( ) , 𝑦 = tan ( ) , 𝑧
= + ≥2 2 2
𝑥2 + 𝑥4 𝑥1 + 𝑥3 𝛾
= tan ( )
2
Now suppose that the proposed inequality is
true for some 𝑘 ≥ 4. i.e., that 𝐿𝑘 ≥ 2. Consider The inequality now becomes, cos 𝛼 sin 𝛼 +
(sin 𝛼+sin 𝛽+sin 𝛾)
k+1 arbitary positive numbers cos 𝛽 sin 𝛽 + cos 𝛾 sin 𝛾 ≤ 2
𝑥1 , 𝑥2 , … . , 𝑥𝑘 , 𝑥𝑘+1 . Since 𝐿𝑘+1 , is symmetric
with respect to these number without loss of sin 2𝛼 + sin 2𝛽 + sin 2𝛾 ≤ sin 𝛼 + sin 𝛽 +
generality , we may assume that 𝑥𝑖 ≥ sin 𝛾 (1) until now we ignored 𝑥𝑦 + 𝑦𝑧 + 𝑧𝑥 =
𝑥𝑘+1 𝑓𝑜𝑟 𝑖 = 1, … . , 𝑘. 𝑇ℎ𝑢𝑠, 1. It is satisfied if 𝛼+ 𝛽+ 𝛾 = 𝜋. Indeed 𝑧 =
𝜋 𝛼 𝛽 𝛼 𝛽
tan ( 2 − 2 − 2 ) = cot ( 2 + 2 ) =
𝑥1 𝑥𝑘
𝐿𝑘+1 = +⋯+ (1−𝑥𝑦)
𝑥𝑘+1 + 𝑥1 𝑥𝑘−1 + 𝑥𝑘−1 (𝑥+𝑦)
, 𝑎𝑛𝑑 𝑥𝑦 + 𝑦𝑧 + 𝑧𝑥 = 𝑥𝑦 + (𝑥 + 𝑦)𝑧 =
𝑥𝑘+1
+ > 𝐿𝑘 ≥ 2. 𝑥𝑦 + 1 − 𝑥𝑦 = 1.
𝑥𝑘 + 𝑥1
We may assume that in (1) we are dealing
Now we prove 2 cannot be replaced by a larger
with the angles 𝛼, 𝛽, 𝛾 of a triangle. By the
number. Consider the case k = 2m, where m is a
sine law, for the RHS we have
positive integer >1 set 𝑥1 = 𝑥2𝑚 = 1, 𝑥2 =
𝑥2𝑚−1, 𝑥3 = 𝑥2𝑚−2 = 𝑡 2 , … . , 𝑥𝑚 = 𝑥𝑚+1 = 𝑎 + 𝑏 + 𝑐 2𝑆 𝑆𝑟
sin 𝛼 + sin 𝛽 + sin 𝛾 = = =
𝑡 𝑚−1 2𝑅 2𝑅 𝑅𝑟
𝐴
Where t is an arbitrary positive number. Then =
𝑟𝑅
𝐿𝑘 simplifies to 𝐿𝑘 = 2.
270
Denote the distance of the circumcentre M. 30) Let n > 2 and 𝒙𝟏 , 𝒙𝟐 , … . , 𝒙𝒏 be non
from a, b, c by x, y, z. Then, for the LHS we get negative reals. Prove that
𝟏
𝟏
sin 2𝛼 + sin 2𝛽 + sin 2𝛾 (𝒙𝟏 𝒙𝟐 , … . , 𝒙𝒏 )𝒏 + ∑𝒊<𝑗 |𝒙𝒊 − 𝒙𝒋 | ≥
𝒏
𝟏
= 2(sin 𝛼 cos 𝛼 + sin 𝛽 cos 𝛽 + sin 𝛾 cos 𝛾) (𝒙𝟏 + 𝒙𝟐 + ⋯ + 𝒙𝒏 )
𝒏
𝑎 cos 𝛼 + 𝑏 cos 𝛽 + 𝑐 cos 𝛾
= 𝑏𝑢𝑡
𝑅
𝑥 𝑦 𝑧
𝑎 cos 𝛼 + 𝑏 cos 𝛽 + 𝑐 cos 𝛾 = 𝑎. + 𝑏. + 𝑐. Sol.: We may assume that 𝑥1 ≥ 𝑥2 ≥ ⋯ ≥ 𝑥𝑛 .
𝑅 𝑅 𝑅
2.4 Then all the points 𝑥1 , … . , 𝑥𝑛 lie on the
= segment [𝑥𝑛 , 𝑥1 ]. Hence |𝑥𝑖 − 𝑥𝑗 | ≤ |𝑥𝑛 − 𝑥1 |.
𝑅
In addition, |𝑥1 − 𝑥𝑘 | + |𝑥𝑘 − 𝑥𝑛 | = 𝑥1 − 𝑥𝑛
sin 𝛼 + sin 𝛽 + sin 𝛾 𝑅 for k = 2, …., n -1. Together with |𝑥1 − 𝑥𝑛 |we
𝐻𝑒𝑛𝑐𝑒, = ≥ 1.
sin 2𝛼 + sin 2𝛽 + sin 2𝛾 2𝑟 get the estimate ∑𝑖>𝑗|𝑥𝑖 − 𝑥𝑗 | ≥ (𝑛 − 1)(𝑥1 −
𝑥𝑛 )
1
𝑆𝑖𝑛𝑐𝑒 (𝑥1 … 𝑥𝑛 )𝑛 ≥ 𝑥𝑛 , it is sufficient to prove
1 𝑥1 +⋯+𝑥𝑛
that 𝑥𝑛 + 𝑛 (𝑛 − 1) (𝑥1 − 𝑥𝑛 ≥ )
29) Prove that for real numbers 𝒙𝟏 ≥ 𝒙𝟐 ≥ 𝑛
⋯ ≥ 𝒙𝒏 > 0.
𝒙𝟏 𝒙𝟐 𝒙𝒏−𝟏 𝒙𝒏 𝑜𝑟, 𝑥𝑛 + (𝑛 − 1)𝑥𝑖 ≥ 𝑥1 + ⋯ + 𝑥𝑛 , which is
+ + ⋯+ + valid. The proof of this weak inequality was
𝒙𝟐 𝒙𝟑 𝒙𝒏 𝒙𝟏
𝒙𝟐 𝒙𝟑 𝒙𝒏 so simple since. We could get by with huge
≤ + +⋯+ over estimations.
𝒙𝟏 𝒙𝟐 𝒙𝒏−𝟏
𝒙𝟏
+ .
𝒙𝒏
SET THEORY
Sol.: Transfer all terms to the left side and (OBJECTIVE TYPE)
𝑥 𝑥
look at all terms with an 𝑥𝑛 : 𝑓(𝑥) = 𝑛−1 + 𝑛 −
𝑥𝑛 𝑥1 1) Which of the following has only one
𝑥𝑛 𝑥1
− . Let us find the minimum of this subset?
𝑥𝑛−1 𝑥𝑛
(a) { }; (b) {4}; (c) {0}; (d) none
function on the interval [𝑥𝑛−1 , ∞]. the
derivation of 𝑓(𝑥𝑛 ) on this interval is positive, Sol.: Subsets of { }i.e. 𝜙 is 𝜙. Subsets of {4}
and hence the minimum is attained at 𝑥𝑛 = are 𝜙, {4} subsets of {4, 5} are 𝜙 {4}, {5},
𝑥𝑛−1 . Inserting 𝑥𝑛 = 𝑥𝑛−1 into the inequality, {4, 5}. Subsets of {0} are 𝜙, {0}
we get same inequality, but for variables
𝑥1 𝑡𝑜 𝑥𝑛−1 . We finish the proof by induction. ∴ cannot answer is (a).
2) If A = {𝒙 ∈ 𝒄; 𝒙𝟐 = 𝟏}𝒂𝒏𝒅 𝑩 = {𝒙 ∈
𝒄; 𝒙𝟒 = 𝟏}, then A ∆ B =
(a) {−𝟏, 𝟏}; (b) {−𝒊, 𝒊}; (c) {−𝟏, 𝟏, 𝒊, −𝒊}
(d) none
271
Sol.: 𝑥 2 = 1 ⟹ 𝑥 = −1, 1 ∴ 𝟏
6) If 𝑨 = {(𝒙, 𝒚): 𝒚 = 𝒙 , 𝟎 ≠ 𝒙 ∊
𝐴 = {−1, 1}
𝑹} 𝒂𝒏𝒅 𝑩 = {(𝒙, 𝒚): 𝒚 = −𝒙, 𝒙 ∊ 𝑹}, 𝒕𝒉𝒆𝒏
4 2
𝑥 = 1 ⟹ 𝑥 = −1, 1 ⟹ 𝑥 = −𝑖, 𝑖, −1, 1 (a) A ∩B = 𝜙 (b) A ∩B = A; (c) A∩ B =
B; (d) none
∴ 𝐵 = {−𝑖, 𝑖, −1, 1}
Sol.: Here A and B can be shown as;
∴ 𝐴 ∆𝐵 = (𝐴 − 𝐵) ∪ (𝐵 − 𝐴)
= 𝜙 ∪ {−𝑖, 𝑖} = {−𝑖, 𝑖} ⟹A ∩ B = 𝜙
3) If 𝒏(𝑨) = 𝟑, 𝒏(𝑩) = 𝒚, 𝒕𝒉𝒆𝒏 𝒏(𝑨 × 𝑨 × 7) Let x be the universal set for sets A and B.
𝑩) = If 𝒏(𝑨) = 𝟐𝟎𝟎, 𝒏(𝑩) = 𝟑𝟎𝟎 𝒂𝒏𝒅 𝒏(𝑨 ∩
(a) 36; (b) 102; (c) 108; (d) none 𝑩) = 𝟏𝟎𝟎, then 𝒏(𝑨′ ∩ 𝑩′ ) = 𝟑𝟎𝟎
provides n(x)=
Sol.: 𝑛(𝐴 × 𝐴 × 𝐵) = 𝑛(𝐴) × 𝑛(𝐴) ×
(a) 500; (b) 600; (c) 700; (d) none
𝑛(𝐵) = 3 × 3 × 4 = 36
Sol.: We have 𝑛(𝐴 ∩ 𝐵) = 𝑛(𝐴) + 𝑛(𝐵) −
4) If u = R and let A = {𝒙 ∊ 𝑹: 𝟎 < 𝑥 <
𝑛(𝐴 ∩ 𝐵)
2}, 𝑩 = {𝒙 ∊ 𝑹: 𝟏 < 𝑥 ≤ 3} which of the
following is false? ∴ 𝑛(𝐴 ∪ 𝐵) = 200 + 300 − 100 = 400
(a) 𝑨 ∩ 𝑩 = {𝒙 ∊ 𝑹: 𝟏 < 𝑥 < 2}
(b) 𝑨′ = {𝒙 ∊ 𝑹: 𝒙 ≤ 𝟎 𝒐𝒓 𝒙 ≤ 𝟐} 𝐴𝑙𝑠𝑜, 𝑛(𝐴′ ∪ 𝐵′ ) = 𝑛(𝐴 ∪ 𝐵′ ) = 𝑛(𝑥) −
(c) 𝑨 ∪ 𝑩 = {𝒙 ∊ 𝑹: 𝟎 ≤ 𝒙 ≤ 𝟑}; 𝑛(𝐴 ∪ 𝐵)
(d) 𝒏𝒐𝒏𝒆
∴ 300 = 𝑛(𝑥) − 400 𝑜𝑟 𝑛(𝑥) = 700.
′
Sol.: 𝐴 = 𝑅 − 𝐴 = {𝑥 ∊ 𝑅: 𝑥 ≤ 0 𝑜𝑟 𝑥 ≥ 2}
𝐵′ = 𝑅 − 𝐵 = {𝑥 ∊ 𝑅: 𝑥 ≤ 1 𝑜𝑟 𝑥 > 3}
8) If A ∪ B = A ∪ C and A ∩B = A ∩ C, then
𝐴 ∪ 𝐵 = {𝑥 ∊ 𝑅: 𝑥 ∊ 𝐴 𝑎𝑛𝑑 𝑥 ∊ 𝐵} = {𝑥 ∊ (a) B = C only when A ⊆ C
𝑅: 0 < 𝑥 ≤ 3} (b) B = C;
(c) B= C only when A ⊆ B
(d) Done
5) The set (A ∪ B ∩C) ∩(𝑨 ∪ 𝑩′ ∪ 𝑪′)′ 𝒏𝒄′= Sol.: Let x ∊ B ⟹ x ∊ A ∪ B ⟹ x ∊ A ∪ C
(a) A ∩ C; (b) B’ ∩ C’; (c) B ∩ C’ (d)
none Case I: x ∊ A, x ∊ A ∩ B or x ∊ A ∩ C or x ∊
C, B⊆C
Sol.: (A ∪ B ∪C) ∩(𝐴 ∪ 𝐵′ ∩ 𝐶 ′ )′ ∩ 𝐶 ′
Case II: x ∊ C, x∊ B⟹ x ∊ C or B ⊆ C
= (𝐴 ∪ 𝐵 ∪ 𝐶) ∩ (𝐴′ ∪ 𝐵 ∪ 𝐶) ∩ 𝐶 ′
Similarly C⊆ B
= (𝜙 ∪ 𝐵 ∪ 𝐶) ∩ 𝐶 ′ = (𝐵 ∪ 𝐶) ∩ 𝐶 ′ =
(𝐵 ∩ 𝐶 ′ ) ∪ (𝐶 ∩ 𝐶 ′ ) ∴B=C
= (𝐵 ∩ 𝐶 ′ ) ∪ 𝜙 = 𝐵 ∩ 𝐶′
272
9) If A = {𝜽: 𝟐 𝒄𝒐𝒔𝟐 𝜽 + 𝐬𝐢𝐧 𝜽 ≤ 𝟐} 𝒂𝒏𝒅 11) A set contains n elements, then its power
𝝅 𝟑𝝅 set
𝑩 = {𝜽: ≤ 𝜽 ≤ } 𝒕𝒉𝒆𝒏 𝑨 ∩ 𝑩 =
𝟐 𝟐 (a) n element; (b) 𝟐𝒏 elements; (c) 𝒏𝒏
𝟑𝝅 elements (d) none
(a) {𝜽: 𝝅 ≤ 𝜽 ≤ } ;
𝟐
𝝅 𝟓𝝅 𝟑𝝅
(b) {𝜽: 𝟐≤ 𝜽 ≤ 𝟔 𝒐𝒓 𝝅≤ 𝜽≤ 𝟐
}; Sol.: As power set is set of all subsets, and
𝟓𝝅 we know number of subsets of a set
(c) {𝜽: 𝝅 ≤ 𝜽 ≤ 𝟔 }
containing n element is 2𝑛 .
(d) None
𝜋
∴Power set contains 2𝑛 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠.
2
Sol.: Let 2 𝑐𝑜𝑠 𝜃 + sin 𝜃 ≤ 2 𝑎𝑛𝑑 ≤𝜃<
2
3𝜋
2
𝑩
12) If A and B are sets, then 𝑨 ∩ (𝑨)is
⟹ 2 − 2 𝑠𝑖𝑛2 𝜃 + sin 𝜃 ≤ 2 ⟹ 2 𝑠𝑖𝑛2 𝜃 −
sin 𝜃 ≥ 0 (a) 𝜙; (b) A; (c) B; (d) none
𝜋 𝐵
⟹ sin 𝜃 (2 sin 𝜃 − 1) ≥ 0 ⟹ ≤𝜃 Sol.: Let x ∊ 𝐴 ∩ ( ) ⟹ 𝑥 ∊ 𝐴 𝑎𝑛𝑑 (𝑥 ∊
𝐴
2 𝐵
5𝜋 3𝜋 𝐴
)
≤ 𝑜𝑟 𝜋 ≤ 𝜃 ≤
6 6
⟹ 𝑥 ∊ 𝐴 𝑎𝑛𝑑 (𝑥 ∊ 𝐵 𝑎𝑛𝑑 𝑥 ∉ 𝐴) ⟹ 𝑥 ∊
𝜋 5𝜋 𝜙
∴ 𝐴 ∩ 𝐵 = {𝜃: ≤ 𝜃 ≤ 𝑜𝑟 𝜃 ≤ 𝜋
2 2
3𝜋 𝐵
≤ } ∴ 𝐴 ∩ ( ) ⊂ 𝜙 … … … … . . (1)
2 𝐴
𝐵
𝑆𝑖𝑛𝑐𝑒 𝜙 ⊂ 𝐴 ∩ ( ) … … … … (2)
𝐴
10) If A and B be two sets such that
𝒏(𝑨 × 𝑩) = 𝟔. 𝐵
∴ 𝐹𝑟𝑜𝑚 (1) 𝑎𝑛𝑑 (2) 𝐴 ∩ ( ) = 𝜙
Let three elements of 𝑨 × 𝐴
𝑩 𝒂𝒓𝒆 (𝟑, 𝟐)(𝟕, 𝟓)(𝟖, 𝟓)then
(a) A= {3, 7, 8}; (b) B = {2, 5}; (c) C =
{3, 5}; (d) none 13) Let R be set of points inside a rectangle of
sides a and b (a, b>1) with two sides along
Sol.: Since (3, 2), (7, 5), (8, 5)∊ A × B, we the positive direction of x-axis and y-axis
have 3, 7, 8∊ A and 2, 5 ∊B. and C be the set of points inside a unit
Also 𝑛(𝐴 × 𝐵) = 6 = 3 × 2 circle central at origin, then
(a) 𝑹 = {(𝒙, 𝒚): 𝟎 ≤ 𝒙 ≤ 𝒂, 𝟎 ≤ 𝒚 ≤ 𝒃};
A = {3, 7, 8} and B = {2, 5} (b) 𝑹 = {(𝒙, 𝒚): 𝟎 < 𝑥 < 𝑎, 0 < 𝑦 < 𝑏};
(c) 𝑹 ∪ 𝑪 = 𝑹;
Since the graphs of 𝑥𝑦 = 4 and y = x, x > (d) None
0 intersect ay one point, we have 𝐴 ∩ 𝐵 =
𝜙 and A ∩B is a single set. Sol.: Since, R denotes the set of points
inside the rectangle of sides a and b for
both a and b >1, then 𝑅{(𝑥, 𝑦): 0 < 𝑥 <
273
𝑎, 0 < 𝑦 < 𝑏}. Also C is the set of points 17) Of the numbers of 3 teams in a college 21
inside the unit circle, centred at origin, are in the cricket team, 26 are in hockey
such that 𝑆 = {(𝑥, 𝑦): 𝑥 2 + 𝑦 2 < 1} team and 29 are in the football team.
Among team, 14 play football and cricket.
14) Which of the following is not correct? Eight play all the three games. The total
(a) 𝑨 ⊆ 𝑨𝒄 if and only if A = 𝜙; number of members in the three teams is
(b) 𝑨 = 𝑩 is equivalent to A ∪ C= B ∩ C (a) 43; (b) 49; (c) 64; (d) none.
and A ∩ C= B ∩ C;
(a) 𝑨𝒄 ⊆ 𝑨 if and only if A = x, where x is a Sol.: (a) Let C, H, F denote the sets
universal set. members who are on the cricket, hokey
(b) 𝒏𝒐𝒏𝒆 and football team respectively.
Sol.: 𝐴𝑐 satisfies (A) and (B) by definition ∴ n(C) = 21, n(H) = 26, n(F) = 29, n(C ∩
(D) also follows trivially. B) = 14, n(C∩ F) = 15, n(F ∩ C) = 12 and
n(C ∩ H ∩ F)= 8.
Assuming A to be any set other than the
empty set also 𝐵 = 𝐴 𝑎𝑛𝑑 𝐶 = ∴n(C ∪ H ∪ F) = n(C) + n(H)+ n(F) –n(C
𝜙, 𝑤𝑒 ℎ𝑎𝑣𝑒 𝐴 ∪ 𝐵 = 𝐴 − 𝐴 ∪ 𝐶 𝐵𝑢𝑡 𝐵 ≠ ∩ H) –n (H∩ F) –n (F ∩) +n(C∩ H ∩ F)
𝐶, 𝑠𝑜 (c) is incorrect.
= (21 + 26 + 29) − (14 + 15 + 12) +
15) Let S is the set of points inside the square. 9 = 43.
T is the set of points inside the triangle and
C is the set of the points inside the circle. If
the triangle and circle intersect each other (SUBJECTIVE TYPE)
and are contained in the square , then
(a) S∩ T ∩ C ≠ 𝜙; (b) S ∪T ∪C =C; (c) S 1) If the collection of all these three elements
∪T =S ∪C; (d) none subsets drawn from the set {1, 2, 3, ….,
300}. Find the number of these subsets for
Sol.: Since, T ∩ C≠ 𝜙 and S∩ T ∩ C= T ∩ C which the sum of the three elements is a
so option (c) is true multiple of 3.
Also T ⊂ S and C ⊂ S, So S ∪ T ∪ C = S Sol.: For 0 ≤ 𝑗 ≤ 2, 𝑙𝑒𝑡 𝐴𝑗 denote the set of
Also, S∪ T = S = S∪ C. all integers between 1 and 300 which
leave remainder j when divided by 3.
Then |𝐴𝑗 | = 100 𝑓𝑜𝑟 0 ≤ 𝑗 ≤ 2. If a, b, c is
a 3-element subset of the given set
16) The set (𝑨 ∩ 𝑩𝒄 )𝒄 ∪ (𝑩 ∩ 𝑪) =
(a) 𝑨𝒄 ∪ 𝑩; (b) 𝑨𝒄 ∪ 𝑩 ∪ 𝑪; (c) 𝑨𝒄 ∪ 𝑠 ′ = 1, 2, … , 300 then 3 divides a+ b+ c if
𝑩𝒄 ; (d) none and only if
Sol.: Let S = (𝐴 ∩ 𝐵𝑐 )𝑐 ∪ (𝐵 ∩ 𝐶) (i) All a, b, c are in𝐴0 or in 𝐴1 𝑜𝑟 𝑖𝑛 𝐴2
(ii) One of the a, b, c is in 𝐴0 , another in
⟹ 𝑆 = ( 𝐴𝑐 ∪ 𝐵) ∪ (𝐵 ∩
𝐴1 , and the third one in 𝐴2 .
𝐶) (𝐷𝑒 𝑀𝑜𝑟𝑔𝑎𝑛′ 𝑠𝐿𝑎𝑤)
⟹ 𝑆 = 𝐴𝑐 ∪ (𝐵 ∪ (𝐵 ∩ 𝐶)) ∴ 𝑆 = 𝐴𝑐 ∪ 𝐵
274
The number of 3 element subsets of Sol.: Since each 𝐴𝑖 contains 4 elements,

𝐴1 , 0 ≤ 𝑗 ≤ 2 is (100
3
). For each choice of a totally we get 24 elements of which some
in 𝐴0 . b in 𝐴1 and c in 𝐴2 . may be repeated. But each element is
repeated 4 times as each element belongs
We get a 3-element subset such that 3 to exactly 4 of the 𝐴′𝑖 𝑠. Hence there are
divides a+ b+ c. 24
= 6 𝑑𝑖𝑠𝑡𝑖𝑛𝑐𝑡 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑖𝑛 𝑆.
4
Thus the total number of 3-element
Since S = 𝐵1 ∪ 𝐵2 ∪ … ∪ 𝐵𝑛 and each 𝐵𝑖
subsets {a, b, c} such 3 divides a +b +c is
consists of each element appears exactly
equal to 3(100
3
) + 1003 = 1495100
3 times. Thus the number of distinct
2𝑛
elements in S is also equal to .
3
2𝑛
Therefore = 6hich gives n = 9.
2) How many 3-element subset of the set {1, 3
2, 3, …, 20} are there such that the product

of the three number in the subset is
divided by 4? 4) If A = {1, 2, 3, …, 100} and B is a subset of
A having 48 elements. Show that B has two
Sol.: We cannot the 3-element subset {a,
distinct elements x and y whose sum is
b, c} such that 4 does not divide 𝑎𝑏𝑐. This
divisible by 11.
is possible if and only if either all the
three are odd numbersor any two of them Sol.: For each n, 0 ≤ 𝑛 ≤
are odd and the other is an even number 10, 𝑙𝑒𝑡 𝐴𝑛 𝑑𝑒𝑛𝑜𝑡𝑒 𝑡ℎ𝑒 𝑠𝑒𝑡 𝑜𝑓 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 1 𝑡𝑜 100
not divisible by 4. There are 10 odd which leaves remainder n after division
numbers in the set {1, 2, 3, …20} and 5 by 11. Then 𝐴1 consists of 10 elements
even numbers not divided by 4. Thus the and 𝐴𝑛 for n ≠1 consists of 9 elements
numbers of 3-element subset {a, b, c} such each. If (a, b) is any two element subset of
that 4 does not divide 𝑎𝑏𝑐 is equal to (1, 2, 3, …, 100) the 11 divides a +b if and
(10
3
) + 5(10
3
) = 345. The number of 3 only if either both a and b are in 𝐴0 or else
element subset is a is 𝐴𝑘 and b is in 𝐴11−𝑘 for some 𝑘, 1 ≤
𝑘 ≤ 10.
(20
3
) = 1140. Thus the number of 3
element subsets such that the product of Consider any set B with 48 elements. If B
these element is divisible by 4 is equal to contains two element from the set 𝐴0 ,
1140 − 345 = 795. then we are done. Similarly if B contains
an element from 𝐴𝑘 and another from
𝐴11−𝑘 , 1 ≤ 𝑘 ≤ 10 then again, their sum is
divisible by 11. Thus B can contain one
3) Suppose 𝑨𝟏 , 𝑨𝟐 , … , 𝑨𝟔 are six sets each element from 𝐴0 , 10 from 𝐴1 and 9 from
with 4 elements and 𝑩𝟏 , 𝑩𝟐 , … , 𝑩𝒏 are n the sets 𝐴𝑘 for some 4 values of k (≠10),
sets each two elements such that 𝑨𝟏 ∪ say 𝑘1 , 𝑘2 , 𝑘3 , 𝑘4 no two of which add up
𝑨𝟐 ∪ … ∪ 𝑨𝟔 = 𝑩 𝟏 ∪ 𝑩 𝟐 ∪ … ∪ 𝑩 𝒏 = to 11.
𝑺 (𝒔𝒂𝒚). Given that each element of S
belongs to exactly 4 of the 𝑨𝒊 ′𝒔 and exactly But these account only for 47 elements.
3 of the 𝑩𝒋 ′𝒔 then find the value of n. Hence there must be an element which is
275
either in 𝐴10 or in 𝐴11−𝑘 𝑗 1 ≤ 𝑗 ≤ 4. Thus (3𝑛 −1)

not manner, we essentially have 2
we can always find an element a in
pairs.
𝐴𝑘 𝑎𝑛𝑑 𝑏 𝑖𝑛 𝐴11−𝑘 . Here a, b are in B and
11 divides a +b.
7) Let x be a set containing n elements. Find

the number of all ordered triplets (A, B, C)
5) If A⊂ {1, 2, 3, …100}, |A| =50 such that no
of subsets of x such that A is a subset of B
two numbers from A have their sum as
is a proper subset of C.
100 show that A contains a square.
Sol.: If 100∊ A then we are done , so Sol.: Let x be an n-element set and let B be
assume A ⊂ {1, 2, 3, …, 100} consider a subset of x containing r elements. Thus
the two element subsets {1, 99}, {2, there are (𝑛𝑟) choices for B, Hence there
98}, {3, 97}, …., {49, 51} along with the are 21 choices for A 2𝑛−1 − 1 choices for
singleton set (50). These fifty sets are C. Thus we obtain the total number of
disjoint, and their un ion is the set {1, triplets (A, B, C) such that A ⊂ B ⊂ C, but
2, 3, …., 99} and the sun of the two
B ≠ C as ∑𝑛𝑟=0 2𝑟 (𝑛𝑟)(2𝑛−𝑟 − 1) which
numbers in each of the two element
simiplifies to 4𝑛 − 3𝑛 .
set is 100. The hypotheses implies
that A can contain at most one Aliter: Let us denote by 0 or 1 the absence
elements it has to contain exactly one or presence of element of x in the sets A,
element from each of the fifty sets. B, C, for any fixed element of x, there are
Since (36, 64) is one of the pairs and only four choices, namely, 000, 011, 111.
both 36 and 64 are squares we are Hence there are 3𝑛 triplets (A, B, B). The
done. number of triples (A, B, C) with A ⊂ B ⊂ C
but B ≠ C is therefore 4𝑛 − 3𝑛
6) Find the number of un ordered pairs (A, B)
(i.e. the pair (A, B) and (b, A) are
considered to the same) of subsets of an n-
8) Show that the number of 3-element
element set x which satisfy the condition
subsets (a, b, c) of the set {1, 2, 3, …, 63}
(a) A ≠ b; (ii) A∪ B = x.
with a+ b+ c<95 is less than the number
Sol.: Suppose A has r elements, 0 ≤ 𝑟 ≤ 𝑛. of those with a +b +c > 95.
Such an A can be choosen in (𝑛𝑟) ways. For
Sol.: Suppose that (a, b, c) is a subset of {1,
each such A, the set B must necessarily 2, 3, …, 63} with a +b +c < 95. Then
have the remaining (n –r) elements and (64 − 𝑎, 64 − 𝑏, 64 − 𝑐) is a subset of {1,
possible some elements of A. Thus there 2, 3, …, 95} with (64 − 𝑎, 64 − 𝑏, 64 − 𝑐)
are ∑𝑛𝑟=0(𝑛𝑟)2𝑟 = (1 + 2)𝑛 = 3𝑛 ways of = 192−(𝑎 + 𝑏 + 𝑐) > 192 − 95 = 97.
choosing two sets A and B satisfying the Conversely, if (a, b, c) is a subset of {1, 2,
given condition. Among these choices, 3, …, 63} with a +b +c>97. Then (64 −
only in one case A = B (=x), and in all 𝑎, 64 − 𝑏, 64 − 𝑐) is such that (64 − 𝑎) +
other cases A ≠ B, since the order does (64 − 𝑏) + (64 + 𝑐) = 192 −
(𝑎 + 𝑏 + 𝑐) < 95. Thus there is one-one
correspondence between 3-element
276
subsets (a, b, c) with a +b +c <95 and 10) Find the number of ways to choose an
those such that a +b +c > 97. ordered pair (a, b) of numbers from the
set {1, 2, …., 10} such that |𝒂 − 𝒃| ≤ 𝟓.
Hence the number of subsets with a +b
+c < 95 is equal to that with a +b +c Sol.: Let 𝐴1 = [(𝑎, 𝑏)𝑎, 𝑏 ∊
>97. Thus the set of 3-element subsets (a, {1, 2, 3, … . , 10}, |𝑎 − 𝑏| = {𝑖}, 𝑖 =
b, c) with a+ b +c > 95 will contain those (𝑖,𝑖)
0, 1, 2, 3, 4, 5. 𝐴0 = { 𝑖
=
with a +b +c => 97 and a few more.
1, 2, 3, … , 10} 𝑎𝑛𝑑
(𝑖, 𝑖 + 1)
9) For which positive integral values of n can |𝐴0 | = 10, 𝐴1 = { = 1, 2, 3, … , 9}
𝑖
the set {1, 2, 3, …, 4n} be split into n (𝑖, 𝑖 − 1)1
disjoint 4-element subset {a, b, c, d} such ∪{
(𝒃+𝒄+𝒅)
𝑖
that in each of these sets 𝒂 = .
𝟑
= 1, 2, 3, … , 10} 𝑎𝑛𝑑 |𝐴1 |
Sol.: Suppose {a, b, c, d} is a group in
(𝑏+𝑐+𝑑)
= 9 + 9 = 18.
which 𝑎 = 3
. Then a + b+ c +d =
4a. Hence if such an n-exists, then 4 (𝑖, 𝑖 + 2)
𝐴2 = { = 1, 2, 3, … , 8}
divides 1+ 2 +…+ 4n. However this sum 𝑖
is 2𝑛(4𝑛 + 1). (𝑖, 𝑖 − 2)
∪{
𝑖
Thus a necessary condition for existence
of such a set is that n be even. = 3, 4, … . , 10} 𝑎𝑛𝑑 |𝐴2 |
We show that this condition is also = 8 + 8 = 16

sufficient i.e. if n = 2k for some k, then it (𝑖, 𝑖 + 3)
is possible to partition {1, 2, 3, …., 8k} into 𝐴3 = { = 1, 2, … , 7}
𝑖
groups of 4 elements {a, b, c, d} such that
(𝑏+𝑐+𝑑)
(𝑖, 𝑖 − 3)
a= . To this end, divide {1, 2, 3, …, ∪{
3 𝑖
8k} into groups of 8 integers such that
each group contains 8 consecutive = 4, 5, … , 10} 𝑎𝑛𝑑 |𝐴3 |
integers. If {𝑎 + 1, 𝑎 + 2, 𝑎 + 3, … , 𝑎 + 8} = 7 + 7 = 14
is one such set, we can divide this set into
two 4 integers each as follows: (𝑖, 𝑖 + 4)
𝐴4 = { = 1, 2, 3, … , 6}
{𝑎 + 4, 𝑎 + 1, 𝑎 + 3, .0 … , 𝑎 + 8}, {𝑎 + 𝑖
5, 𝑎 + 2, 𝑎 + 6, … , 𝑎 + 7}. (𝑖, 𝑖 − 4)
∪{
𝑖
The desired partition is obtained since
𝑎+1+𝑎+3+𝑎+8
𝑎+4= , = 5, 6, … , 10} 𝑎𝑚𝑑 |𝐴4 |
3
𝑎+2+𝑎+6+𝑎+7 = 6 + 6 = 12.
𝑎+5=
3
277
(𝑖, 𝑖 + 5) Again 11 ∉ S, for 11 ∉ S ∩{3, 5, 8, 11}= {5,

𝐴5 = { = 1, 2, … , 5}
𝑖 8}
(𝑖, 𝑖 − 5)
∪{ ∴ S = {5, 7, 8, 13}
𝑖
If condition (i) is not given, then S is not
= 6, 7, … , 10} 𝑎𝑛𝑑 |𝐴5 | =
unique as S may be {7, 8, 13} or {5, 7, 8,
= 5 + 5 = 10 13} or {5, 7, 8, 11, 13}. Similarly deleting
any other data leads to more than one
∴the required set of pairs (𝑎, 𝑏) = solution to S (verify)
⋃5𝑖=0 𝐴𝑖 and the number of such pairs,
(which are disjoint)
5 5 12) Let x ⊂ {1, 2, 3, …, 99} and n(x) =10. Show

= |⋃ 𝐴1 | = ∑ |𝐴𝑖 | that it is possible to choose two distinct
𝑖=0 𝑖=0 non empty proper subsets y, z of x such
= 10 + 18 + 16 + 14 + 12 𝒚 𝒛
that ∑ ( ∈ 𝒚) = ∑ ( ∈ 𝒛).
𝒚 𝒛
+ 10 = 80.
Sol.: Since n(x) = 10, the number of non-
empty, proper subsets of x is 210 − 2 =
11) Identify the set S by the following 1022.
information:
The sum of the elements of the proper
(i) S ∩ {3, 5, 8, 11} = {5, 8}
subsets of x can possibly range from 1 to
(ii) S ∪ {4, 5, 11, 13} = {4, 5, 7, 8, 11, 13}
∑9𝑖=1(90 + 𝑖). That is 1 to (91+ 92+ … +
(iii) {8, 13} ⊂ S
99) i.e. 1 to 855.
(iv) S ⊂ {5, 7, 8, 9, 11, 13}
That is the 1022 subsets can have sums
Also show that no three of the condition
from 1 to 855. By pigeon-hole principle, at
suffices to identify S uniquely.
least two distinct subsets B and C will
Sol.: From(i), 5, 8 ∊ S ……….(1) From (ii), have the same sum.
7, 8 ∊ S …… (2)From (iii), 8, 13∊ S
(∵ there are 855 different sums, and so if
……….(3)
we have more than 855 subsets then at
Therefore from eqns. (1) (2) and (3), we least two of then have the same sum.) If B
find that 5, 7, 8, 13 ∊ S. S ⊂ {5, 7, 8, 9, 11, and C are not disjoint, then let
13} ……….(4) (given)
𝑋 = 𝐵 − (𝐵 ∩ 𝐶)𝑎𝑛𝑑 𝑌 = 𝐶 − (𝐵 ∩ 𝐶).
If at all S contain any others element
Clearly, X and Y are disjoint and non-
other than those given in (4), it may be 9
empty and have the same sum of their
or 11 or both.
elements.
But 9 ∉ S [∵ 9 ∊ S ∪{4, 5, 11, 13}= {4, 5, 7,
Define S(A) = sum of the elements of A.
8, 11, 13}]
We have B and C not necessarily disjoint
such that S(B) = S(C).
278
Now, S(X)= S(B) –S(B∩ C), S(Y) = S(C) –S = 610 + 1681 × 40 + 101 × 51 = 73001.
(B∩ C) but S(B) = S(C).
Hence, S(X)= S(Y)

14) A student an vacation for a d days
Also X ≠ 𝜙. For if x is empty, then B ⊂C observed that
which implies S(B)< S(C) (a (i) It rained 7 times morning or
contradiction). Thus x and y non empty afternoon.
and S(X)= S(Y). (ii) When it rained in the afternoon, it
was clear in the morning.
(iii) There were five clear afternoon and
13) A, B, C are the set of all the positive (iv) There were 6 clear mornings. Find
the value of d.
divisors of 𝟏𝟎𝟔𝟎 , 𝟐𝟎𝟓𝟎 𝒂𝒏𝒅 𝟑𝟎𝟒𝟎
respectively. Find 𝒏(𝑨 ∪ 𝑩 ∪ 𝑪). Sol.: Let the set of days in rained in the
morning be M, and the set of days it
Sol.: Let n(A) = number of positive
rained in the afternoon be 𝐴𝑟 . Then,
divisors of 1060 = 2060 × 560 𝑖𝑠 612 n(B)
clearly the set of days when there were
= number of positive divisors of 205 =
clear morning is 𝑀′𝑟 and the set of days
2100 × 550 𝑖𝑠 101 × 51 and n(C) =
when there were clear afternoon is 𝐴𝑟 ′
number of positive divisors of 3040 =
240 × 340 × 540 = 413 . By condition (b), we get 𝑀𝑟 ∩ 𝐴𝑟 = 𝜙, by
(d), we get 𝑀𝑟′ = 6 𝑏𝑦 (𝑐), 𝑤𝑒 𝑔𝑒𝑡 𝐴′𝑟 =
The set of common factors of A and B will
5, 𝑎𝑛𝑑 𝑏𝑦 (𝑎), 𝑤𝑒 𝑔𝑒𝑡 𝑀𝑟 ∪ 𝐴𝑟 = 7, 𝑀𝑟 and
be of the form 2𝑚 . 5𝑛 𝑤ℎ𝑒𝑟𝑒 0 ≤ 𝑚 ≤
𝐴𝑟 are disjoint sets, and 𝑛(𝑀𝑟 ) = 𝑑 −
60 𝑎𝑛𝑑 0 ≤ 𝑛 ≤ 50. 𝑆𝑜, 𝑛(𝐴 ∩ 𝐵) = 61 ×
6, 𝑛(𝐴𝑟 ) = 𝑑 − 5
51.
∴ Applying the principle of inclusion and
Similarly, since the common factors of B
exclusion we get
and C and A are C are also of the from
2𝑚 × 5𝑛 , and in the former case 0 ≤ 𝑚 ≤ 𝑛(𝑀𝑟 ∪ 𝐴𝑟 ) = 𝑛(𝑀𝑟 ) + 𝑛(𝐴𝑟 ) −
40, 0 ≤ 𝑛 ≤ 40, and in the latter case 0 ≤ 𝑛(𝑀𝑟 ∩ 𝐴𝑟 )
𝑚 ≤ 40, 0 ≤ 𝑛 ≤ 40
⟹ 7 = (𝑑 − 6) + (𝑑 − 5) − 0 ⟹ 𝑑 =
∴ 𝑛(𝐵 ∩ 𝐶) = 412 also 𝑛(𝐴 ∩ 𝐶) = 18, ⟹ 𝑑 = 9.
412 𝑎𝑛𝑑 𝑛(𝐴 ∩ 𝐵 ∩ 𝐶)𝑖𝑠 𝑎𝑙𝑠𝑜 412 .
∴ 𝑛(𝐴 ∪ 𝐵 ∪ 𝐶) = 𝑛(𝐴) + 𝑛(𝐵) + 𝑛(𝐶)

− 𝑛(𝐴 ∩ 𝐵) − 𝑛(𝐵 ∩ 𝐶) 15) It is proposed to partition the set of
− 𝑛(𝐴 ∩ 𝐶) positive integers into two disjoint subsets
+ 𝑛(𝐴 ∩ 𝐵 ∩ 𝐶) A and B. Subject to the following
conditions: (i) 1 is in A; (ii) No two distinct
612 + 101 × 51 + 413 − 61 × 51 − 412 − numbers of A have a sum of the from𝟐𝒌 +
412 + 412 𝟐(𝒌 = 𝟎, 𝟏, 𝟐, … . ); (ii) No two distinct
members of 3 have a sum of the form
= 61(61 − 51) + 412 (41 − 1) + 101 × 51
𝟐𝒌 + 𝟐(𝒌 = 𝟎, 𝟏, 𝟐, … . ) Show that this
279
partitioning can be carried out in a unique ∴ 3 ∊ B consider k = 2.

manner and determine the subsets to
which 1987, 1988, 1989, 1997, 1998 ∴ 22−1 + 2 ≤ 𝑛 < 22 + 2 = 6, 4 ≤ 𝑛 < 6.
belong. When n = 4, as 6 − 𝑛 = 2 ∊ 𝐵, 𝑤𝑒 𝑎𝑠𝑠𝑖𝑔𝑛
Sol.: Since it is given that 1 ∊ A, 2 ∉ A For 4 to A. when n = 5, as 6 − 5 = 1 ∊ 𝐴, we
if 2 ∊ A then 20 + 2 = 3 is generated by 2 assign 5 to B. Since the set to when n gets
members of A violating the condition for assigned is uniquely determined by the
the partitioning. set to which 2𝑘 + 2 − 𝑛 belongs, the
partitioning is unique. Looking at the
∴ 2 ∊B similarly, 3∉ A as 3 = 4 = 21 + pattern of the partitioning of the initial set
2 ∴ 3 ∊ 𝐵. of positive integers, we conjecture the
following:
But 4 ∉B. For if 4∊ B, then 22 + 2 = 4 +
2 = 6 is generated by two members of B. 4
(1) n ∊ A if .
𝑛
2 4
∴ The partitioning for the first few (2) n ∊B if 𝑛
𝑏𝑢𝑡 𝑛
positive integers is 𝑟
(3) If n = 2 . 𝑘 + 1(𝑟 ≥ 1, 𝑘 𝑜𝑑𝑑, 𝑡ℎ𝑒𝑛 𝑛 ∊
𝐴 if k is of the form 4𝑚 − 1).
A = {1, 4, 7, 8, 12, 13, 15, 16, 20, 23, ….}
Proof the conjecture: we note that 1, 4∊ A
B = {2, 3, 5, 6, 9, 10, 11, 14, 17, 18, 19, 21,
and 2, 3 ∊B. 2𝑘−1 + 2 ≤ 𝑛 < 2𝑘 + 2 and all
22, ….}
numbers less than n have been assigned
Suppose 1, 2, …, n-1 (for 𝑛 ≥ 3) have to A or B and satisfy the above
4
already been assigned to A ∩ B in such a conjectures, then if , 𝑎𝑠 2𝑘 + 2 − 𝑛 is
𝑛
way that no two distinct members of A or divisible by 2 but not 4, 2𝑘 + 2 − 𝑛 ∊ 𝐵.
B have a sum = 21 + 2(𝑙 = 0, 1, 2, … … . ) Hence n ∊ A. Similarly, if 2 divides n but
Now, we need to assign n to A or B. not 4, then 2𝑘 + 2 − 𝑛 is divisible by 4
and hence, is in A
Let k be a positive integer such that
2𝑘−1 + 2 ≤ 𝑛 < 2𝑘 + 2. The assign ‘n’ to ∴ n ∊ B. If n = 2𝑟 . 𝑘 + 1
the complement of the set to which 2𝑘 +
2 − 𝑛 belongs. But for this, we need to Where r >1, k is odd and k = 4𝑚 −
check that 2𝑘 + 2 − 𝑛 has already been 1, 𝑡ℎ𝑒𝑛 2𝑘 + 2 − 𝑛 = 2𝑘 − 2𝑟 . 𝑘 + 1 =
assigned. Now as 𝑛 ≥ 2𝑘−1 + 2 < 2𝑘 + 2𝑟 (2𝑘−𝑟 − 𝑘) + 1, where clearly 2𝑘−𝑟 − 𝑘
1. 2𝑛 > 2𝑘 + 2 ∴ 𝑛 > 2𝑘 + 2 − is odd and equals 1 (mod 4)
𝑛.
∴ 2𝑘 + 2 − 𝑛 ∊ 𝐵
Since all numbers below n have been
Hence, n ∊ A similarly, it can be shown
assumed to be assigned to either A or ,
that if n = 2𝑟 . 𝑘 + 1 where k ≡1 (mod 4),
2𝑘 + 2 − 𝑛 has already been assigned and
then n ∊ B. Thus, the conjecture is proved.
hence n is also assigned uniquely. For
example, consider k =1, 3 = 20 + 2 ≤ 𝑛 < Now, 1988 is divisible by 4.
21 + 2 = 4. 𝐶𝑜𝑛𝑠𝑖𝑑𝑒𝑟 𝑛 = 3, 4 − 𝑛 = 1
Now 1 ∊ A (given) ∴ 1998 ∊ A.
280
1987 = 21 . 993 + 1 where 993= 1 (mod Sol.: There are 34 integers in A.P. 1, 4, 7, …,
4) ∴ 1988 ∈ 𝐵 100. Let us denote the set {1, 4, 7, …., 100} by
s. Let us group them into 17 pairs.
1989 = 22 . 497 + 1 where 497 = 1 (mod
4) ∴ 1989 ∈ 𝐵. (4, 100), (7, 97), (10, 94), …, (49, 55) and (1,
52). The sum of the integers in each of the
2 4
𝑏𝑢𝑡 ∴ 1998 ∊ 𝐵. first sixteen pairs is 104. The last pair
1998 1998 consists of the two integers which cannot be
1997 = 22 . 449 + 1 where 499= 3(mod paired with any other integer in the given A.P.
4) So as to have the sum 104. It is obvious that
the sum of two integers from the given A.P.
∴ 1997 ∊ A can be 104 if and only if two integers both
belong to some one of the first sixteen pairs
16) If A denote the subsets of the set {1, 11,
written above.
21, 31, ….541, 551} having the property
that no two elements of A odd up to 552. Let us try to construct a subset of S which is
Show that A cannot have more than 28 as big as possible, and has the property that
elements. no two numbers of the set add up to 104.
Such a set can have at the most 18 members,
Sol.: Observe that S consists of 56 numbers in
namely the two integers 1 and 100, and
A.P. Hence first term is 1 and common
exactly one out of each of the remaining16
difference is 10. The sum of every pair of
pairs.
numbers equidistant from the beginning and
the end is 552. Also, the sum of no two others The moment we odd one more member of S
elements can be 552. to it, it will have both the one of the sixteen
pairs (4, 100) …. (49, 55) i.e. it will have two
We divide S into 28 pairs: (1, 551), (11, 541),
distinct integers whose sum is 104.
(21, 531) ………….. (271, 282), if A consists of
at the most 28 elements, then it is possible to Therefore in any set of 20 (in fact 19!)
choose these elements in such a way that at distinct integers chosen forms, there will
most one element from a pair is in A. however always be two distinct integers whose sum is
if A contains 29 (or more) elements, then by 104.
the pigeon hole principle, A must contain
both the elements of at least one pair, and
therefore A contain two elements whose sum 18) Find all possible sets of consecutive
is 552. positive integers such that the sum of the
numbers in the set is 795 (e. g. the sets
Since A has the property that no two element {30}, {9, 10, 11}, {4, 5, 6, 7, 8} and {6, 7, 8,
of A add up to 552, therefore A cannot have 9} are the sets of consecutive positive
more than 28 elements. integers with sum 30.)
17) Show that in any set of 20 distinct integers Sol.: Suppose 𝑛 + 1, 𝑛 + 2, … , 𝑛 + 𝑘 is a set of
chosen from the set {1, 4, 7, …, 100} there k consecutive integers whose sum is 795 i.e.
will always be two distinct integers whose (𝑛 + 1) + (𝑛 + 2) + ⋯ + (𝑛 + 𝑘) = 795 ⟹
sum is 104. 1
{𝑘𝑛 + 2 𝑘(𝑘 + 1)} = 795 … … . . (1)
281
We are required to find all solutions of (1) in 19) If the 7 element set A= {a, b, …, g}, find a
integers. collection T of 3- element subsets of A such
that each pair of element from A occurs
Case I: If k is doubly even, say = 4m, then exactly in one of the subsets of T.
4𝑚𝑛 + 2𝑛(4𝑚 + 1) = 795.
Sol.: If the 3-element subsets in the class are
Here L HS is even and RHS is odd, and pairwise disjoint, then one of the subsets has
consequently no solution is possible. number of elements and so at least one pair
Case II: If k is singly even, say = 4𝑚 + 2, the has one element in common but not two or
(1) becomes (4𝑚 + 2)𝑛 + (2𝑚 + 1)(4𝑚 + more. If just one pair of subsets has common
3) = 795. elements, they have to have two elements in
common. So this is also not possible. Thus the
So that 2m +1 must divide 795, i.e. 2m +1 = problem reduces to finding a class of all 3-
1, 3, 5, 15, 53, 159, 265, 795. Also then 2𝑛 = element subsets with precisely one element
795 common between any two of the subsets.
− (4𝑚 + 3) > 0 i.e. 2m+1 cannot have
2𝑚+1
Clearly, {(a, b, d), (b, c, e), (c, d, f), (d, e, g), (e,
values other than 1, 3, 5, 15.
f, a ), (a, c, g), (b, f, g)}, in one such class. Any
For these values, we have k = 4m +2 = 2, 6, permutation of A will give another class.
10, 30 and the corresponding values of n are
𝑘(𝑘+1) 20) Let S in the set {1, 2, 3, …, 𝟏𝟎𝟔 }. Show that
[795− ]
2
i.e. 396, 129, 74, 11. for any subset A of S with 101 elements.
𝑘
We can find 100 distinct elements 𝒙𝒊 of S,
Thus the sets are {397, 398}, {130, 131, …, Such that the sets 𝒙𝒊 + A are all pair wise
135}{75, 76, …, 84,}{12, …, 13, 41} …. (A) disjoint.
{Note that 𝒙𝒊 + 𝑨 is the set
Case III: If k is odd, say 2m +1, then (1) 𝒙
becomes (2𝑚 + 1)𝑛 + (𝑚 + 1)(2𝑚 + 1) = {𝒂 + 𝒂𝒊 } 𝒊𝒔 𝒊𝒏 𝑨]
795.
Sol.:
So that 795 must be divided by 2m +1. The
Having found 𝑥1 , 𝑥2 , … , 𝑥𝑘 there are k. 101 -
possible values of 2m +1 are 1, 3, 5, 15, 53,
795 100 for –bidden values for 𝑥𝑘+𝑖 of the form
159, 265, 795 Further more 𝑛 = (2𝑚+1) − 𝑥1 + 𝑎𝑚 − 𝑎𝑛 with m and n unequal and
(𝑚 + 1) > 0, which gives n = 794, 263, 157, another k forbidden values with m= n.
45 respectively, when 2m +1 = 1, 3, 5, 15
Since 99.101.100+99=106 − 1.
The other values do not give positive values
of n and therefore must be rejected. The We can successively choose 100 distinct 𝑥𝑖 .
corresponding sets are {795}, {264, 265,
266}, {158, 159, 160, 161, 162}, {46, 47, ….,
60} …… (B) All the possible sets are those
given in (A) and (B).
282
COMBINATORICS Hence, 𝑆𝑛 = 1! + 2! + 3! + ⋯ + 𝑛! is not a

perfect square of a natural number except for
(OBJECTIVE TYPE) n = 1, 3. Hence (a) is correct answer.
𝟏
1) If S = 1.1!+2.2!+3.3!+…+n.n! then 𝒏! (𝑺 +
𝟏) is
3) The value of
(a) Not integer; (b) integer; (c)
(𝟕𝑪𝟎 + 𝟕𝑪𝟏 ) + (𝟕𝑪𝟏 + 𝟕𝑪𝟐 ) + ⋯ +
undefined; (d) none
(𝟕𝑪𝟔 + 𝟕𝟕 )𝒊𝒔
Sol.: We have S = ∑𝑛𝑘=1 𝑘(𝑘!) = (a) 𝟐𝟖 − 𝟐; (b) 𝟐𝟖 − 𝟑; (c) 𝟐𝟖 ; (d)
∑𝑛𝑘=1{(𝑘 + 1) − 1} (𝑘!) none
𝑛
Sol.: (7𝐶0 + 7𝐶1 ) + (7𝐶1 + 7𝐶2 ) + ⋯ +
= ∑{(𝑘 + 1)! − 𝑘!} = (𝑛 + 1)! − 1 ⟹ 𝑆 + 1
𝑘=1
(7𝐶6 + 77 ) = 8𝐶1 + 8𝐶2 + ⋯ + 8𝐶7 = 8𝐶0 +
= (𝑛 + 1)! 8𝐶1 + 8𝐶2 + ⋯ + 8𝐶7 + 8𝐶8 − (8𝐶0 + 8𝐶8 ) =
𝑆+1
28 − 1(1 + 1) = 28 − 2
Thus, 𝑛! ∊ integer. Hence (b) is correct
answer. Hence (a) is the correct answer.
2) If 1! +2! +3!+…+n! cannot be the square 4) The value of n for which

𝟓
of a natural number except for n = 𝒏 − 𝟏𝑪𝟒 − 𝒏 − 𝟏𝑪𝟑 − 𝟒 , 𝒏 − 𝟐𝑷𝟐 < 0.
(a) 1, 3; (b) 2, 3; (c) 3, 3; (d) none where n ∊ N is
(a) (−∞, 𝟏) ∪ (𝟑, 𝟏𝟎); (b) (0, 2) ∪(3, 10);
Sol.: For n = 1, we have 𝑆1 = 1!= 1, which is a
(c) {1, 2, 3}; (d) none
perfect square.
Sol.: we have
For n = 2, we have 𝑆2 = 1! + 2 = 1 + 2 + 3, 5
which is not a perfect square. 𝑛 − 1𝐶4 − 𝑛 − 1𝐶3 − . 𝑛 − 2𝑃2 < 0
4
For n = 3, We have 𝑆3 = 1! + 2! + 3! = 1 + (𝑛 − 1)(𝑛 − 2)(𝑛 − 3)(𝑛 − 4)
2 + 6 = 9, 𝑤ℎ𝑖𝑐ℎ is a perfect square. ⟹
4!
(𝑛 − 1)(𝑛 − 2)(𝑛 − 3)
For n = 4, we have 𝑆4 = 1! + 2! + 3! + 4! = −
3!
1 + 2 + 6, … , +24 = 33 which is not a perfect 5
square. − (𝑛 − 2)(𝑛 − 3) < 0
4
For 𝑛 ≥ 5, 𝑤𝑒 𝑓𝑖𝑛𝑑 𝑡ℎ𝑎𝑡 𝑡ℎ𝑒 𝑑𝑖𝑔𝑖𝑡𝑠 at units (𝑛 − 2)(𝑛 − 3)
⟹ {(𝑛 − 1)(𝑛 − 4)
place in n! is 0and 𝑆4 = 1! + 2! + 3! + 4! has 3 24
as the digit ay units place. Therefore for 𝑛 ≥ − 4(𝑛 − 1) − 30} < 0
5, 𝑆𝑛 has 3 at units place. Therefore 𝑆𝑛 is not a
perfect square for 𝑛 ≥ 5. ⟹ (𝑛 − 2)(𝑛 − 3)(𝑥 2 − 9𝑥 − 22) < 0
⟹ (𝑛 − 2)(𝑛 − 3)(𝑛 − 11)(𝑛 + 2) < 0
⟹ (𝑛 − 2)(𝑛 − 3)(𝑛 − 11) < 0
283
[∵ 𝑛 + 2 > 0 𝑓𝑜𝑟 𝑛 ∊ 𝑁] bracket there is product of n consecutive

natural numbers. From (1) we have,
⟹ 𝑛 ∊ (−∞, 2) ∪ (3, 11) ⟹ 𝑛
∊ (0, 2) ∪ (3, 11) (𝑛−1)!
(𝑛!)! = ∏ [(𝑟 − 1)𝑛 + 1{(𝑟 − 1)𝑛 + 3}

⟹ 𝑛 = 1, 4, 5, 6, 7, 8, 9, 10 𝑟=1
− {(𝑟 − 1)𝑛 + 𝑛}]
We know that the product of n

But 𝑛 − 1𝐶4 𝑎𝑛𝑑 𝑛 − 1𝑃2 both are
consecutive natural number is divisible
meaningful for 𝑛 ≥ 5. by n!
Hence, n = 5, 6, 7, 8, 9, 10. So, let {(𝑟 − 1)𝑛 + 1}{(𝑟 − 1)𝑛 +
2} … {(𝑟 − 1)𝑛 + 𝑛} = 𝑛! 𝐼𝑟 , 𝑟 =
1, 2, … , (𝑛 − 1)!
5) (n!)! is divisible by
(𝑛−1)!
(a) (𝒏!)𝒏! ; (b) (𝒏!)𝒏!−𝟏; (c) (𝒏!)(𝒏−𝟏)!
∴ (𝑛!)! = ∏ 𝑛! 𝐼𝑟 = (𝑛!)(𝑛−1)!
(d) none
𝑟=1
Sol.: Clearly. (n!) is the product of natural (𝑛−1)! (𝑛−1)!

numbers from 1 to n! (𝑛−1)!
∴ (𝑛!)! = ∏ 𝑛! 𝑙𝑟 = (𝑛!) . ∏ 𝑙𝑟
𝑟=1 𝑟=1
∴ (𝑛!)! = {1 × 2 × 3 … 𝑥𝑛}
= (𝑛!)(𝑛−1)!
× {(𝑛 + 1)(𝑛 + 2) … (2𝑛)}
× 𝑎 𝑛𝑎𝑡𝑢𝑟𝑎𝑙 𝑁𝑜.
×
⋮ ⋮ ⋮ Thus (n!)! is divisible by (𝑛!)(𝑛−1)!
{(2𝑛 + 1)(2𝑛 + 2) … . (3𝑛)}

× {(𝑛! − 𝑛 + 1)(𝑛! − 𝑛 6) Number of positive integer n <17, for
+ 2)(𝑛! − 𝑛 which n!(n+ 1)!+ (n+ 2)! Is an integral
+ 3) … . 𝑛!} … … … . . (1) multiple of 49 is
We observe that: Last term of the first (a) 5; (b) 6; (c) 7; (d) none
bracket on RHS of (1) in n Sol.: Here n! + (n +1)!+(n+2)! = n!
Last term of second bracket RHS of (1)𝑖𝑠 (1+(n+1)+(n+2) (n+1)) = n! (𝑛 + 2)2 ⟹
2n. either 7 divides (n+2) or 49 divides n!
Last term of third bracket on RHS of (1) is i.e., n = 5, 12, 14, 15, 16 (as n< 17). Thus the
3.n and so on number of solution if five
Last term of the last bracket on RHS of (1)

is (n−1)! n 7) Number of ordered triplets (x, y, z) such
It is clear from this that there are (𝑛 − 1)! that x, y, z are primes and 𝒙𝒚 + 𝟏 = 𝒛 is
brackets on the RHS of (1) and each (a) 0, (b) 1, (c) 2, (d) none
284
Sol.: Here, 𝑥 𝑦 + 1 = 𝑧, where x, y, z are 9) ∑𝟎≤𝒊 ∑≤𝒋 𝟏𝟎𝑪𝒋 . 𝒋𝑪𝒊 =

prime. (a) 𝟑𝟏𝟎 − 𝟏; (b) 𝟐𝟏𝟎 − 𝟏; (c) 𝟑𝟏𝟎 − 𝟐𝟏𝟎 ;
(d) none
Thus, y cannot be odd, as if y is prime
⟹𝑥 𝑦 + 1 is divisible by (x+1). Now, z

Sol.: ∑0≤𝑖 ∑≤𝑗 10𝐶𝑗 . 𝑗𝐶𝑖 = 10𝐶1 (1𝐶0 + 1𝐶1 ) +
must be odd
10𝐶2 (2𝐶0 + 2𝐶1 + 2𝐶2 )10𝐶3 (3𝐶0 + 3𝐶1 + 3𝐶2 +
⟹ x must be even (as, 𝑥 𝑦 = 𝑧 − 1). 3𝐶3 ) + ⋯ + 10𝐶10 (10𝐶0 + 10𝐶1 + 10𝐶2 + ⋯ +
Thus only even i.e. prime is x = 2 10𝐶10 )
⟹ x = 2, y = 2, z = 5 = 10𝐶1 . 2 + 10𝐶2 . 22 + 10𝐶3 . 23 + ⋯ +

10𝐶10 . 210
So, there is only one such triplet (2, 2, 5)
= (1 + 2)10 − 1 = 310 − 1
Hence (b) is correct answer.
10) If f(n) denotes the number of different

8) If 𝒏𝟏 = 𝒙𝟎 𝒙𝟐 𝒙𝟑 𝒂𝒏𝒅 𝒏𝟐 = 𝒚𝟏 𝒚𝟐 𝒚𝟑 be two
ways the position integer ‘n’ can be
3-digit numbers, then the pairs 𝒏𝟏 𝒂𝒏𝒅 𝒏𝟐
expressed as the sum of 𝟏′ 𝒔𝒂𝒏𝒅 𝟐′𝒔. For
can be formed, so that 𝒏𝟏 can be
example 𝒇(𝟒) = 𝟓, since 4 = 1+ 1+ 1 +1,
subtracted from 𝒏𝟐 without borrowing is
1 +1 +2, 1+ 2+ 1, 2 +1 +1, 2 +2 note that
(a) 45. 55; (b) 55. (𝟒𝟓)𝟐 ; (c) 𝟓𝟓𝟐 . 𝟒𝟓𝟐 ;
order of 𝟏′ 𝒔𝒂𝒏𝒅 𝟐′𝒔 is important then
(d) none
𝒇(𝒇(𝟔) )=
Sol.: Here, 𝑛1 = 𝑥1 𝑥2 𝑥3 𝑎𝑛𝑑 𝑛2 = 𝑦1 𝑦2 𝑦3 (a) 𝒇(𝟔) ; (b) 𝒇(𝟏𝟎) ; (c) 𝒇(𝟏𝟑) ; (d) none
⟹ 𝑛1 can be subtracted from 𝑛2 without

borrowing if 𝑦𝑖 ≥ 𝑥𝑖 𝑓𝑜𝑟 𝑖 = 1, 2, 3.
Sol.: As: 𝑓(4) = 5 given
𝑟 = 0, 1, 2, … , 9 𝑓𝑜𝑟 𝑥2 𝑜𝑟 𝑥3
∴ Let 𝑥1 = 𝑟 ⟹ {
𝑟 = 1, 2, 3, … . , 9 𝑓𝑜𝑟 𝑥1 ∴ 𝑓(6) can be written using 1′ 𝑠𝑎𝑛𝑑 2′𝑠 as
∴ 𝑦𝑖 = 𝑟, 𝑟 + 1, … . , 9. Thus for Number Number of No. of

𝑦1 , 𝑦2 𝑎𝑛𝑑 𝑦3 𝑤𝑒 ℎ𝑎𝑣𝑒 (10 − 𝑟) choices, each of 1’s 2’S arrangement
⟹ Total number of ways for choosing 0 3 3!
=1
𝑦𝑖 𝑎𝑛𝑑 𝑥𝑖 3!
2 2 4!
=6
= {∑9𝑟=1(10 − 𝑟)}{∑9𝑟=0(10 − 2! 2!
4 1 5!
𝑟)}. {∑9𝑟=0(10 − 𝑟)} = 45. 55. 55 = 45. 552 = 5
4!
6 0 6!
= 1
6!
Total
= 13
∴ 𝑓(6) = 13
285
∴ 𝑓(𝑓(6) ) = 𝑓(13) m n
1 4r 4s+2
11) The number of ways of choosing triplets 2 4r +1 4s +3

(x, y, z) such that 𝒛 ≥
3 4r +2 4s
𝐦𝐚𝐱{𝒙, 𝒚} 𝒂𝒏𝒅 𝒙, 𝒚, 𝒛 ∊ {𝟏, 𝟐, … , 𝒏, 𝒏 +
𝟏} is 4 4r +3 4s +1
(a) 𝒏 + 𝟏𝑪𝟑 + 𝒏 + 𝟐𝑪𝟑 ; (b) 𝒏 + 𝟏𝑪𝟐 +
𝒏 + 𝟐𝑪𝟑 ; (c) n (n+1); (d) none Thus for a given value of m there are just 25
values of n for which 7𝑚 + 7𝑛 ends in 0. For
Sol.: When z = n +1, we can choose x, y from instance, if m = 4r, then = 2, 6, 10, 98.
{1, 2, …, n}.
∴ There are 100 × 25= 2500 ordered pairs
Thus when z = n +1, x, y can be chosen 𝑛 . 2 (m, n) for which 7𝑚 + 7𝑛 is divisible by 5.
When z = n, x, y can be chosen in(𝑛 − 1)2
ways and so on.
13) A 7-digit number is divisible by 9 is to be
Thus, there are 𝑛2 + (𝑛 − 1)2 + ⋯ + 12 =
1 formed by using 7 out of numbers {1, 2, 3,
𝑛(𝑛 + 1)(2𝑛 + 1) ways of choosing the
6 4, 5, 6, 7, 8, 9}. The number of ways in
triplets. which this can be done is
(a) 4. 7! ; (b) 3, 7!; (c) 2. 7!; (d) none
Alternatively, triplets with x = y < z, x < y <z,
y < z < x can be chosen in 𝑛 + 1𝐶2 , 𝑛 + Sol.: Sum of 7 digits = a multiple of 9. We
1𝐶3 , 𝑛 + 1𝐶3 𝑤𝑎𝑦𝑠 know, sum of numbers 1, 2, 3, 4, 5, 6, 7, 8, 9 is
45. So, two left number should also have sum
∴ There are 𝑛 + 1𝐶2 + 2(𝑛 + 1𝐶3 ) = as 9.
𝑛 + 2𝐶3 + 𝑛 + 1𝐶3 .
The pairs to be left are (1, 8)(2, 7), (3, 6)(4,
5) which each pair left number of 7 –digit
number is 7! So, with all 4 pairs = 4 × 7!
12) The number of ordered pairs (m, n), m, n ∊
{1, 2, …., 100} such that 𝟕𝒎 + 𝟕𝒏 is
divisible by 5 is
(a) 1000; (b) 12000; (c) 3000, (d) 14) The number of ways af arranging m
none members out of 1, 2, 3, …, n so that
maximum is (n –2) and minimum is 2
Sol.: Note that 7𝑟 (𝑟 ∊ 𝑁) ends in 7, 9, 3, or 1 (repetitions of number is allowed) such
(corresponding to r = 1, 2, 3 and 4 that maximum and minimum both occur
respectively). Thus 7𝑚 + exactly once (𝒏 > 5, 𝑚 > 3) is
7𝑛 𝑐𝑎𝑛𝑛𝑜𝑡 𝑒𝑛𝑑 𝑖𝑛 5 𝑓𝑜𝑟 𝑎𝑛𝑦 𝑣𝑎𝑙𝑢𝑒𝑠 𝑜𝑓 𝑚. 𝑛 ∊ (a) (𝒏 − 𝟏𝑪𝒎−𝟐 )𝟐 ; (b) 𝒎(𝒎 −
𝑁. In other words, for 7𝑚 + 7𝑛 𝑡𝑜 be divisible 𝟏)(𝒏 − 𝟓)𝒎−𝟐 (c) 𝒏𝑪𝟐 . 𝒏𝑪𝒎 ; (d)
by 5, it should end in 0. none
For 7𝑚 + 7𝑛 to end in 0, the forms of m and n
should be as follows:
286
Sol.: First we take one number as 2 and one as 4𝐶4 4! 5𝐶5 5!

∴ Total number of ways = ( )( )
2!2! 3!2!
(𝑛 − 2) and put them in m (𝑚 − 1) ways..
Now remaining (𝑚 − 2) numbers can be any 17) The sum of all possible numbers greater
one from, 3, 4, …., (n-4), (n-3), than 𝟏𝟎𝟒 formed by using the digits from
{1, 3, 5, 7, 9} is
Which we can do in (𝑛 − 5)(𝑚−2) .
(a) 6, 66, 66, 600; (b) 6, 66, 600; (c) 6,
∴ Total number of ways = 𝑚(𝑚 − 1)(𝑛 − 66, 660; (d) none
5)(𝑚−2) .
Sol.:
If 1 were at units place (i.e. 5)then the

15) The number of rational numbers lying in remaining first 4 places (1- 4)can be filled in
the interval (2002, 2003) all whose digits 4! Ways.
other the decimal point are non- zero and
∴ sum of all 4! (1)= 24 similarly for 3, 5, 7
are in decreasing order is
and 9 filled in units place the rest four places
(a) 𝟐𝟏𝟎 − 𝟏; (b) 𝟐𝟗 − 𝟏 ; (c) 𝟐𝟏𝟎 − 𝟐;
can be filled in 4! Ways in each case
(d) none
∴ If sum of all digits in units place is S.
Sol.: A rational number of the desired
category is of the form 2002. 𝑥1 , 𝑥2 , … , 𝑥𝑘 ⟹ S = 4! (1+3+5+7+9)⟹ S = 4! × 25 =
where 1 ≤ 𝑘 ≤ 9 and 9 ≥ 𝑥1 > 𝑥2 > ⋯ > 600.
𝑥𝑘 ≥ 1. We can choose k digits out in 9𝐶𝑘
ways and arrange them is decreasing order in Similarly, sum of all digits in ten places,
just one way. Thus, the desired number of hundred’s place, thousands place, ten
rational number is 9𝐶1 + 9𝐶2 + ⋯ + 9𝐶9 = thousands place and hundred thousands
place in 600 in all cases.
29 − 1.
18) The number of ways of arranging letters

16) How many different 9 digit numbers can
AAAAABBBCCCDEEF in a row if the letters
be formed from the number 22, 33, 55,
C are Separated from one another
888 by rearranging its digits so that the
(a) 95135040; (b) 95135039; (c)
odd digits occupy even positions?
95135041; (d) none
(a) 16; (b) 32; (c) 64; (d) none
Sol.: ⏟
𝐴𝐴𝐴𝐴𝐴 𝐵
⏟𝐵 𝐵 ⏟
𝐶𝐶𝐶 𝐸
⏟ 𝐸 𝐹
⏟
Sol.: 5 3 3 2 1
Number of ways of arranging AAAABBDEEF

12!
are
5!3!2!
Now, there are 13 places in between or on the

sides of 12 characters, and since we want to
separate all the c’s this can be done in placing
Out of 4 odd digits, 4 even places can be these c’s in these 13 places This can be done
occupied in 𝑛𝐶4 ways. in 13𝐶3 ways.
287
12! set and two straight lines from the second

∴ Total number of ways = 5!3!2! × 13𝐶3
set.
∴ Total number of ways = 95135040.
Two straight line from the first set can be
chosen in 𝑚 + 2𝐶2 ways and two strainght
lines from the second set can be chosen in
19) The number of rectangles in the following 𝑚 + 2𝐶2 ways.
fig is
(a) 𝟓 × 𝟓; (b) 𝟓𝟐 × 𝟑𝟑 ; (c) 𝟓𝑪𝟐 × 𝟓𝑪𝟐 ; Hence, the total number of parallelograms
2
(d) none formed = 𝑚 + 2𝐶2 . 𝑚 + 2𝐶2 = (𝑚 + 2𝐶2 )
Sol.: Since, there are 5 horizontal lines
and 5 vertical lines, and each choice of a
pair of horizontal lines and a pair of 22) If n dice from an even number is 189, then
vertical lines gives us a rectangle. Hence n=
the no. of rectangles = 5𝐶2 × 5𝐶2 (a) 3; (b) 4; (c) 8; (d) none
Sol.: Number of all possible outcomes, on

all the n-sides ≡ 6𝑛 . Now, for any one
20) From a company of 15 soldiers any 4 are dice odd number on it can occur in 3𝐶1
placed on guard, each both to catch for 4 ways.
hour. For what length of time (in hour) can
different batches be selected? So, for all the dice, an odd number can
(a) 5460; (b) 5410; (c) 54090; (d) none occur in 3𝑛 ways
Sol.: The number of ways in which 4 𝑁𝑜. 𝑜𝑓 𝑤𝑎𝑦𝑠 𝑖𝑛 𝑤ℎ𝑖𝑐ℎ 𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 𝑜𝑛𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑑𝑖𝑐𝑒
[ ]
soldiers can be selected out of 15 are the 𝑠ℎ𝑜𝑤𝑠 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟
number of ways batches can be formed. [𝑁𝑜. 𝑜𝑓 𝑎𝑙𝑙 𝑝𝑜𝑠𝑠𝑖𝑏𝑙𝑒 𝑜𝑢𝑡𝑐𝑜𝑚𝑒𝑠 𝑜𝑛 𝑛
Now 4 soldiers can be selected out of 15 . 𝑑𝑖𝑐𝑒𝑠][𝑒𝑣𝑒𝑟𝑦 𝑑𝑖𝑐𝑒 𝑠ℎ𝑜𝑤𝑛 𝑜 𝑜𝑑𝑑 𝑛𝑢𝑚𝑏𝑒𝑟]
in 15𝐶4 ways = 1365. Again, if can batch
has two watch for 4 hours, then 1365 ⟹ Required ways = 6𝑛 − 3𝑛 = 189 (𝑔𝑖𝑣𝑒𝑛).
batches will watch for 1365 × 4 = 5460.
𝐵𝑦 𝐻𝑖𝑡 𝑎𝑛𝑑 𝑇𝑟𝑖𝑎𝑙 𝑡ℎ𝑒 𝑒𝑞𝑢𝑎𝑙𝑖𝑡𝑦 𝑖𝑠 𝑡𝑟𝑢𝑒 𝑓𝑜𝑟 𝑛
= 3.
21) A parallelogram is cut by two sets of m

lines parallel to its sides. The number of
23) If a, b, c, d, e are primes, the number of
parallelograms thus formed is
divisions of 𝒂𝒄𝟐 𝒅𝒆 is
(a) 𝒎𝑪𝟐 ; (b) (𝒎𝑪𝟐 )𝟐 ; (c) (𝒎 + 𝟐𝑪𝟐 )𝟐 ;
(a) 73; (b) 72; (c) 71; (d) none
(d) none
Sol.: Let N = 𝑎𝑏 2 𝑐 2 𝑑𝑒
Sol.: Each set is having (𝑚 + 2) parallel
lines and each parallelogram is formed by Where a, b, c, d and e are prime out of one
choosing two straight lines from the first factor a, we can have either one or none.
288
∴Number of possible divisors of a = 25) The number of ways of choosing 10 balls

(1+1) = 2, for b, there are two factors, we from infinite white, red , blue and green
can have either one, two or none balls is
(a) 286; (b) 295; (c) 312; (d) none.
∴ Number of possible divisors of b =
(2+1) = 3 Sol.: Required ways =
{𝑐𝑜𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑡 𝑜𝑓 𝑥 10 𝑖𝑛 (1 + 𝑥 + 𝑥 2 +
Similarly, the number of possible factors ⋯ )4 }
of c, d and e is (2+1), (1+1) and (1+1)
respectively. 1 4
⟹ coefficient of 𝑥 10 𝑖𝑛 ( ) ⟹
1−𝑥
10 −4
Hence, the number of all possible divisors coefficient of 𝑥 in (1 − 𝑥) ⟹
of 𝑎𝑏 2 𝑐 2 𝑑𝑒 𝑎𝑟𝑒 (1 + 1)(2 + 1)(2 + 𝑐𝑜𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑡 𝑜𝑓 𝑥 10 in
1)(1 + 1)(1 + 1).
5.4 2 4.5.6 3
(1 + 4𝑥 + 𝑥 + 𝑥 + 7𝐶 4 + 8𝐶 5
Now, there exists only one possible worst 2! 3! 4𝑥 5𝑥
case in which the factors is 𝑎0 𝑏 0 𝑐 0 𝑑0 𝑒 0 = + 9𝐶 + ⋯ + 13𝐶 )

6 10
6𝑥 10𝑥
1 which a factor of every number. ∴
Number of ways = 72 -1 = 71. 13.12.11
∴ Required ways= 13𝐶10 = 3.2.1
= 286
24) If 3dices are thrown together, then the
number of ways in which the sum of the 26) In how many ways can 6 coins be chosen
number of ways in which the sum of the from 20 one rupee coins, 10 fifty paise
numbers appearing on the dice is n, 𝟗 ≤ coins, 7 twenty paise coins?
𝒏 ≤ 𝟏𝟒 is (a) 𝟑𝟕𝑷𝟔 ; (b) 𝟑𝟕𝑪𝟔 ; (c) 𝟑𝟕𝑷𝟏𝟎 ; (d) none
(a) −𝒏𝟐 + 𝟐𝟏𝒏 − 𝟖𝟑; (b)( −𝒏𝟐 − 𝟐𝟏𝒏 −
Sol.: Since, the distribution equation is x +
𝟖𝟑; (c) −𝒏𝟐 + 𝟐𝟏𝒏 + 𝟖𝟑 (d) none y + z = 6, where x, y and z represents one
Sol.: If 9 ≤ 𝑛 ≤ 14, 𝑡ℎ𝑒𝑛 6 ≤ 𝑘 − 3 ≤ 11. rupee, fifty paise and twenty paise coins
Thus the coeff. of 𝑥 𝑛−3 𝑖𝑛 (1 − 𝑥 6 )3 (1 − respectively.
𝑥)3 = 𝑐𝑜𝑒𝑓𝑓. 𝑜𝑓 𝑥 𝑛−3 in ∴Number of ways of choosing r things out
of n things = 𝑛 + 𝑟 − 1𝐶𝑟 .
(3𝐶0 − 3𝐶 6 + 3𝐶 12 − 3𝐶 18 )×
1𝑥 2𝑥 3𝑥
(1 − 𝑥)−3 = 3𝐶0 Where everything occur any number of
time.
𝐶𝑜𝑒𝑓𝑓. 𝑜𝑓 𝑥 𝑛−3 𝑖𝑛 (1 − 𝑥)−3 −
∴Required ways = 3 + 6 − 1𝐶6 = 8𝐶2 =
3𝐶1 𝑐𝑜𝑒𝑓𝑓. 𝑜𝑓 𝑥 𝑛−9 𝑖𝑛 (1 − 𝑥)−3 = 3𝐶0 ×
28.
𝑛 − 3 + 3 − 1𝐶3−1 − 3𝐶1 × 𝑛 − 9 + 3 −
1𝐶3−1
= 𝑛 − 1𝐶2 − 3 × 𝑛 − 7𝐶2 = 21𝑛 − 𝑛2 − 27) The number of non-negative solution of

2
83 = −𝑛 + 21𝑛 − 83 𝒙𝟏 + 𝒙𝟐 + 𝒙𝟑 + ⋯ + 𝒙𝒏 ≤ 𝒏.(where n is
possible integer) is
(a) 𝟐𝒏𝑪𝒏−𝟏 ; (b) 𝟐𝒏𝑪𝒏−𝟏 − 𝟏; (c) 𝟐𝒏𝑷𝒏 −
𝟏; (d) none
289
Sol.: In general, we know that, for the 29) In how many ways the letters of the word
distribution equation 𝑥1 + 𝑥2 + 𝑥3 + ⋯ + PERSON can be placed in the squares of
𝑥𝑛 = 𝑛. The number of ways in which n the adjoining fig. So that no row remains
things can be distributed among r in such empty?
a ways end can receive none, one or more (a) 81; (b) 18720; (c) 18721; (d) none
or all of n items are 𝑛 + 𝑟 − 1𝐶𝑟−1 .
Sol.: In PERSON total letters = 6 which
∴ for the distribution equation are to be filled in 8 squares.
𝑥1 + 𝑥2 + 𝑥3 + ⋯ + 𝑥𝑛 ≤ 𝑛. Let required 6 number of ways of choosing 6 letters to

ways = w fill in 8 squares= 8𝐶6 − 2 = 28 − 2 = 26
⟹𝑊= Required ways = 26 × 6!= 18720.

{𝑁𝑜. 𝑜𝑓 𝑤𝑎𝑦𝑠 𝑜𝑓 𝑑𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑛𝑔 1 𝑖𝑡𝑒𝑚}{𝑁𝑜. 𝑜𝑓 𝑤𝑎𝑦𝑠 𝑜𝑓 𝑑𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑛𝑔 2 𝑖𝑡𝑒𝑚}
30) The number of ways of arranging 5
{𝑁𝑜. 𝑜𝑓 𝑤𝑎𝑦𝑠 𝑜𝑓 𝑑𝑖𝑠𝑡𝑟𝑖𝑏𝑢𝑡𝑖𝑛𝑔 𝑖𝑛 𝑖𝑡𝑒𝑚} players to through the cricket ball so that
the youngest way no thrown first is
⟹ 𝑊 = 1 + 𝑛 − 1𝐶𝑛−1 + 2 + 𝑛 − 1𝐶𝑛−1 + (a) 97; (b) 98; (c) 99; (d) none.
⋯ + 𝑛 + 𝑛 − 1𝐶𝑛−1
Sol.: Keeping the youngest player aside,
⟹ 𝑊 = 𝑛𝐶𝑛−1 + 𝑛 + 1𝐶𝑛−1 + ⋯ + one of four players can throw the cricket
2𝑛 − 1𝐶𝑛−1 ball at first place in 4𝐶1 ways.
⟹ 𝑊 = (𝑛𝐶𝑛−1 + 𝑛𝐶𝑛 ) + 𝑛 + 1𝐶𝑛−1 + ⋯ + Now the three players (not able to throw)
2𝑛 − 1𝐶𝑛−1 the ball in first placed and 1 youngest
player i.e. 4 can arrange themselves in 4!
⟹ 𝑊 = {(𝑛 + 1𝐶𝑛 + 𝑛 − 1𝐶𝑛−1 ) + ⋯ + Ways to thrown the ball.
2𝑛 − 1𝐶𝑛−1 } − 𝑛𝐶𝑛
∴ Required ways = 4𝐶1 4! = 96.
…………………………………………………
31) The total number of ways in which a
…………………………………………………… bigger can be given at least one rupee from
four 25 paise coins three 50 paise coins
⟹ 𝑊 = (2𝑛𝐶𝑛 + 2𝑛 − 1𝐶𝑛−1 ) − 𝑛𝐶𝑛 ⟹ and 2 one rupee coin is
𝑊 = 2𝑛𝐶𝑛 − 𝑛𝐶𝑛 (a) 55; (b) 54; (c) 53; (d) none
∴ 𝑊 = 2𝑛𝐶𝑛−1 − 1. Sol.: (b)
28) For 𝟐 ≤ 𝒓 ≤ 𝒏, (𝒏𝒓) + 𝟐(𝒓−𝟏

𝒏 𝒏
) + (𝒓−𝟐)= 32) In how many ways can 4 prizes be
distributed in a class of 20 students when
(a) (𝒏+𝟐
𝒓
); (b) (𝒏𝒓); (c) (𝒏+𝟏
𝒓+𝟏
); (d) none
each student is eligible for all prizes?
Sol.: Let n be the number of newspaper (a) 1600; (b) 16000; (c) 160000; (d)
which are read none
⟹60n = (300)(5) Sol.: The first prize can be given in 20

ways.
∴ n = 25
290
The next prize can be given in 20 ways (a) 𝟑𝟏𝟐 ; (b) 𝟑𝟏𝟐 − 𝟏𝟐; (c) 𝟑𝟏𝟐 + 𝟏;
(d) none
The next prize can be given in 20 ways.
Sol.: First stall can be filled in 3 ways, 2nd
The last prize can be given in 20 ways. stall in 3 ways and so on. Similarly, 12th
Total number of ways all the four prizes stall in 3 ways.
can be given is 20 × 20 × 20 × 20 = ∴ Number of ways of loading steamer is
160000.
3 × 3 × 3 … . .× 3(12 𝑡𝑖𝑚𝑒𝑠) = 312 .
33) The number of ways in which 4 particular
persons A, B, C, D and 6 move persons can
stand in a queue. So that A always stand (SUBJECTIVE TYPE)
before B. B stand C and C before D is
𝒏
(a) 10! 4!; (b) 10! -4!; (c)
𝟏𝟎!
; (d) none 1) Evaluate: ∑∞ 𝑪𝒓
𝒓=𝟎 𝟐𝒏−𝟏
𝟒! 𝑪𝒓
Sol.: Total number of arrangements of 10 Sol.: A general method of finding the sum
persons when there is no restriction = of a series ∑∞
𝑟=0 𝑢𝑟 is to express
10! 𝑢𝑟 𝑎𝑛𝑑 𝑣𝑟 − 𝑣𝑟+1 so that 𝑣𝑛 → 0 𝑎𝑠 𝑛 →
∞, 𝑤𝑒 𝑔𝑒𝑡.
Number of ways in which A, B, C, D can be
∞ ∞
arranged among themselves = 4!
Lt ∑ 𝑢𝑟 = Lt ∑(𝑣𝑟 − 𝑣𝑟+1 )
𝑛 →∞ 𝑛 →∞
∴ Number of arrangements of 10 persons 𝑟=0 𝑟=0
when A, B, C, D occurs in a particular
10!
= Lt (𝑣0 − 𝑣𝑟+1 ) = 𝑣0 .
𝑛 →∞
order = 4!
In the present case, it is easily verified
34) A father with 8 children taken 3 at a time that
to Nicco Park, as often as he can without
talking the same children together more 𝑛𝐶𝑟 𝑛𝐶 ∟𝑛 ∟𝑟 ∟2𝑛 − 𝑟
− 𝑟+1 =
than once. How often will be father go? 2𝑛𝐶𝑟 2𝑛𝐶𝑟+1 ∟𝑟 ∟𝑛 − 𝑟 ∟2𝑛
(a) 56; (b) 106 ; (c) 206; (d) none. ∟𝑛 ∟𝑟 + 1
−
∟𝑟 + 1 ∟𝑛 − 𝑟 − 1
Sol.: [The number of times he can select 3
children out of 8]= [The number of visits ∟2𝑛 − 𝑟 − 1
he (the father) can make] ∟2𝑛
∟𝑛 ∟2𝑛 − 𝑟 ∟2𝑛 − 𝑟 − 1
= [ ]
∴ The number of ways of selecting 3 ∟2𝑛 ∟𝑛 − 𝑟 ∟𝑛 − 𝑟 − 1
children out of 8 = 8𝐶3 = 56. ∟𝑛 ∟2𝑛 − 𝑟 − 1
=
∟2𝑛 ∟𝑛 − 𝑟
35) In a steamer there are stalls for 12 animals
[(2𝑛 − 𝑟) − (𝑛 − 𝑟)]
and there are horse cows and calves (not
1 ∟𝑛 ∟2𝑛 − 𝑟 − 1
less than 12 each) ready to be shipped. In =
2 ∟2𝑛 − 1 ∟𝑛 − 𝑟
how many ways can the ship load be
made?
291
∞
1 𝑛𝐶𝑟 𝑛𝐶𝑟 (2𝑛 + 𝑟 − 1)!
= ∑ ={ } (2𝑛)!
2 2𝑛 − 1𝐶𝑟 2𝑛 − 1𝐶𝑟 (2𝑛)! (𝑟 − 1)!
𝑟=0
∞ = (2𝑛)! 2𝑛 + 𝑟 − 1𝐶2𝑛
𝑛𝐶 𝑛𝐶
= 2 ∑ [ 𝑟 − 𝑟+1 ] = (2𝑛)!
2𝑛𝐶𝑟 2𝑛𝐶𝑟+1
𝑟=0
(A natural number). Hence, P is divisible
𝑛𝐶 by (2n)!
=2 0 =2
2𝑛𝐶0
4) How many 3-digit numbers are of the from
2) Given that the number C is greater than 1, 𝒂𝒃𝒄, with a, c < b and a ≠ 0?
show that one of the two number
√𝒄 + 𝟏 − √𝑪, √𝑪 − √𝑪 − 𝟏 is always Sol.: Since the digit at hundred’s place
greater than the number. cannot be zero
Therefore, we must have 𝑎 ≥ 1.

Sol.: In fact √𝑐 + 1 − √𝑐, √𝑐 − √𝑐 − 1
But it is given that a, c < b. Therefore 𝑏 ≥
To show this we have to show that
2.
√𝑐 + 1 + √𝑐 − 1 ≤ 2√𝑐
⟹b = 2, 3, 4, 5, …., 9
𝑜𝑟 2𝑐 + 2√𝑐 2 − 1 ≤ 4𝑐 𝑜𝑟√𝑐 2 − 1 ≤ 𝑐
Let b = r, where r = 2, 3, ….., 9. Then a can
𝑤ℎ𝑖𝑐ℎ 𝑖𝑠 𝑡𝑟𝑢𝑒. take (𝑟 − 1) values 1, 2, …., r-1. Thus for
Alternatively, consider the parabola 𝑦 = each value of r, abc can take r(r−1)
values. But, r can take value from 2 to 9.
√𝑥. and √𝑥 is a concave function.
Therefore, by the fundamental principle
3) Show that the product of 2n consecutive of addition. Required number of numbers
negative integers is divisible by (2n)! 9 9 9
2
Sol.: Let r be a natural number, Then = ∑ 𝑟(𝑟 − 1) = ∑ 𝑟 − ∑ 𝑟
−𝑟, −𝑟 − 1, −𝑟 − 2, … , −𝑟 − (2𝑛 − 1) are 𝑟=2 𝑟=2 𝑟=2
9 9
an consecutive negative integers.
= ∑ 𝑟2 − ∑ 𝑟
𝑟=1 𝑟=1
Let P be their product. Then, 𝑃 =
(−𝑟)(−𝑟 − 1)(−𝑟 − 2) … . (−𝑟 − 9(9 + 1)(9 × 2 + 1)
= − 9(9 + 1).
(2𝑛 − 1)) 6
= (−1)2𝑛 𝑟(𝑟 + 1)(𝑟 + 2) … . (𝑟 5) There are two sets of parallel lines, their
+ 2𝑛 − 1) equations 𝒙 𝐜𝐨𝐬 𝜶 + 𝒚 𝐬𝐢𝐧 𝜶 = 𝑷; 𝑷 =
= 𝑟(𝑟 + 1)(𝑟 + 2) … . (𝑟 𝟏, 𝟐, … . , 𝒎 𝒂𝒏𝒅
+ 2𝑛 − 1) 𝒚 𝐜𝐨𝐬 𝜶 − 𝒙 𝐬𝐢𝐧 𝜶 = 𝒒; 𝒒 =
𝟏, 𝟐, … . , 𝒏(𝒏 > 𝑚) where 𝛼 is a given
(𝑟 + 1)! 𝑟(𝑟 + 1)(𝑟 + 2) … . (𝑟 + 2𝑛 − 1) const. Show that the lines from
=
(𝑟 − 1)! 𝟏
𝒎(𝒎 − 𝟏)(𝟑𝒏 − 𝒎 − 𝟏) squares.
(𝑟 + 2𝑛 − 1)! 𝟔
=
(𝑟 − 1)!
292
Sol.: The equation 𝑥 cos 𝛼 + 𝑦 sin 𝛼 = 𝑝; 𝑝 = Therefore, number of squares whose sides
1, 2, 3, … . , 𝑚 represents m parallel lines such are of length 2 units = (𝑚 − 2)(𝑛 − 2)
that the distance between two consecutive containing in this, manner, we find that the
lines is one unit. Similarly the equation number of squares whose sides are of length
𝑦 cos 𝛼 − 𝑥 sin 𝛼 = 𝑞; 𝑞 = 1, 2, … . , 𝑛 2 units = (𝑚 − (𝑚 − 1))(𝑛 − (𝑚 − 1))
represents n parallel lines such that the
distance between any two consecutive lines is Hence, Total number of squares
one unit.
= (𝑚 − 1)(𝑛 − 1) + (𝑚 − 2)(𝑛 − 2) + ⋯ +
We observe that the slope of each line of first (𝑚 − (𝑚 − 1))(𝑛 − (𝑚 − 1))
set is 𝑚1 = − cot 𝛼 and the slope of each line 𝑚−1
of second set is 𝑚2 = tan 𝛼.
= ∑ (𝑚 − 𝑟)(𝑛 − 𝑟)
Clearly, 𝑚1 𝑚2 = −1 𝑟=1
𝑚−1
Therefore every line of first set is
= ∑ {𝑚𝑛 − 𝑟(𝑚 + 𝑛) + 𝑟 2 }
perpendicular to every line of second set. 𝑟=1
= 𝑚𝑛(𝑚 − 1) − (𝑚 + 𝑛)
We observe that four lines consisting of two
lines of the first set and two lines of the 𝑚−1 𝑚−1
second set will form a square, if the distance ∑ 𝑟 + ∑ 𝑟2
between two parallel lines of first set is same 𝑟=1 𝑟=1
as the distance between two parallel lines of
𝑚(𝑚 − 1)
second set. = 𝑚𝑛(𝑚 − 1) − (𝑚 + 𝑛)
2
(𝑚 − 1)𝑚(2𝑚 − 1)
Since m < n therefore the length of the side of +
the largest square formed by the two sets of 6
lines is (𝑚 − 1) units and the length of the 𝑚(𝑚 − 1)
side of the smallest square is 1 unit. Clearly, = {6𝑛 − 3(𝑚 + 𝑛) + (2𝑚 − 1)}
6
two lines at a unit distance from the set of m
𝑚(𝑚−1)
parallel lines can be chosen in (𝑚 − 1) ways, = {6𝑛 − 3𝑚 − 3𝑛 + 2𝑚 + 1} =
6
namely (1, 2) (2, 3) (3, 4)……., (m-1, m) and 𝑚(𝑚−1)(3𝑛−𝑚−1)
6
.
two lines at a unit distance from the set of n
parallel lines can be chosen in (𝑚 − 1) ways,
namely (1, 2)(2, 3), …., (n-1, n). Therefore
number of squares whose sides are of length 6) There are n straight lines in a plane such
1 unit (m-1)(n-1). that 𝒏𝟏 are parallel in different direction,
𝒏𝟐 are parallel in different direction and so
Similarly two lines at a distance of 2 units on, 𝒏𝒌 𝒂𝒓𝒆 parallel in another direction
from the set of m parallel lines can be chosen such that 𝒏𝟏 + 𝒏𝟐 + ⋯ 𝒏𝟐 = 𝒏. Also no
in (𝑚 − 2) ways, namely (1, 3) (2, 4), …, (m-2, three of the given lines meet a point. Show
m) and two lines at a distance of 2 units from that the total number of inter section is
the set of n parallel lines can be chosen in (n - 𝟏
(𝒏𝟐 − ∑𝒌𝒓=𝟏 𝒏𝒓 𝟐 ).
2) ways, namely (1, 3)(2, 4), ….., (n -2, n) 𝟐
293
Sol.: If no two of n given lines are parallel Thus, we have the following cases for the
and no three of them meet at a point, then selection of seats.
the total number of points of intersection
is 𝑛𝐶2 . But it is given that there are k sets Case I: When two seats are selected on the
right side sixth seat and one seat on its right
of 𝑛1 , 𝑛2 , 𝑛3 , … , 𝑛𝑘 parallel lines such that
side;
no line in one set is parallel to a lines in
any other set. Also lines of one set do not Since no two adjacent seats are selected, so
intersect with each other. we can select either 1st and 3rd or 2nd and 4th
or 1st and 4th seats. So, there are 3 ways to
Therefore, lines of one set do not provide
select 2 seat on the left side of sixth seat one
any points of intersection. Hence, total
the right side of sixth seat there are 9 seats.
number of points of intersection
Therefore, one seat (excluding 7th seat) on the
= 𝑛𝐶2 − (𝑛1 𝐶 + 𝑛2 𝐶 + ⋯ + 𝑛𝑘 𝐶 +) right side of sixth seat can be chosen in 8
2 2 2
ways.
𝑛(𝑛 − 1) 𝑛1 (𝑛1 − 1) 𝑛2 (𝑛2 − 1)
= −{ + Case II: When two seats are selected on the
2 2 2
right side of sixth seat and one seat on its left
𝑛𝑘 (𝑛𝑘 − 1) side.
+ ⋯+ }
2
In this case, one seats are selected on the
𝑛(𝑛 − 1) 1 right side of sixth seat and one seat on its left
= − {(𝑛1 2 + 𝑛2 2 + ⋯ + 𝑛𝑘 2 )
2 2 side.
− (𝑛1 + 𝑛2 + ⋯ + 𝑛𝑘 )}
In this case, one seat on the left side of sixth
𝑛(𝑛 − 1) 1
= − {(𝑛1 2 + 𝑛2 2 + ⋯ + 𝑛𝑘 2 ) seat can be chosen in 4 ways (any one of the
2 2 first four seats) and the number of ways of
− 𝑛}
selecting two seats on the right side of sixth
𝑛2 1 seat is same the number of non-negative
= − (𝑛 2 + 𝑛2 2 + ⋯ + 𝑛𝑘 2 )
2 2 1 integral solutions of the equation 𝑥1 + 𝑥2 +
𝑘
1 𝑥3 = 7, where 𝑥1 ≥ 1, 𝑥2 ≥ 1 𝑎𝑛𝑑 𝑥3 ≥ 0.
= [𝑛2 − ∑ 𝑛𝑟 2 ]
2 Here, 𝑥1 is the number of vacant seats
𝑟=1
between sixth seat and the first seat selected
on the right side of sixth seat, 𝑥2 𝑖𝑠 the
7) There are 15 seats in as row numbered as number of vacant seats between sixth seat
1 to 15. In how many ways can 4 persons and the first seat selected on the right side of
sit in such a way that seat number 6 is sixth seat, 𝑥2 is the number of vacant seats
always occupied and no two person sit in between first and second seat selected on the
adjacent seats. right side of sixth seat and 𝑥3 is the number of
vacant seats on the right side of the second
Sol.: Since seat number ‘6’ is always occupied selected seat.
and no two persons can occupy adjacent
seats. Therefore , at most two persons can sit Let 𝑦1 = 𝑥1 − 1, 𝑦2 = 𝑥2 − 1 𝑎𝑛𝑑 𝑦3 = 𝑥3 .
on the left side of sixth seat. Then 𝑥1 + 𝑥2 + 𝑥3 = 7
294
⟹ 𝑦1 + 𝑦2 + 𝑦3 = 5, where 𝑦1 , 𝑦2 , 𝑦3 ≥ 0 8) In the given figure, you have the road

plane of a city. A man standing at x wants
Total number of integral solutions of this to reach the house at y by the shortest
equation is 5 + 3 − 1𝐶3−1 = 7𝐶2 = 21. path. What is the number of different
paths that he can take?
Thus, the number of ways in which two seats
can be chosen on the right side of sixth seat = Sol.: As the man wants to travel by one many
21. Hence total number of selection of seats in possible shortest paths, he will never turn up
this case 4 × 21 = 84. the trim down words. So a travel by one of the
shortest path is to take a horizontal pieces
Case III: When all the three persons sit on the
and 4 vertical pieces of roads. As he cannot
right side of sixth seat:
take a right turn, he will use only one of the
Let 𝑥1 be the number of vacant seats between five horizontal pieces in the same vertical
6th seat and first seat selected on the right of column. Similarly same horizontal row.
6th seat, 𝑥2 𝑏𝑒 the number of vacant seats
∴A shortest path is an arrangement of eight
between first selected seat and the second
things
selected seat, 𝑥3 be the number of seats
between second and third selected seat and 𝐿1 , 𝐿2 , 𝐿3 , 𝐿4 , 𝑈1 , 𝑈2 , 𝑈3 , 𝑈4 . So that the order
𝑥1 be the numbers of vacant seats on the right of 𝐿5 𝑎𝑛𝑑 𝑈5 do not change.
side of fourth selected seat. Then, the number
of ways of selecting 3 seats on the right side (∵ clearly 𝐿2 cannot be taken without talking
of sixth seat is equal to the number of the 𝐿1 , 𝐿2 can not taken without taking 𝑈1 etc.)
integral solution of the equation 𝑥1 + 𝑥2 +
Hence, the number of shortest path = the
𝑥32 + 𝑥4 = 6, where 𝑥1 ≥ 1, 𝑥2 ≥ 1, 𝑥3 ≥
number of arrangements of
1, 𝑥4 ≥ 0. Let 𝑧1 = 𝑥1 − 1, 𝑧2 = 𝑥2 − 1, 𝑧3 =
𝐿1 , 𝐿2 , 𝐿3 , 𝐿4 , 𝑈1 , 𝑈2 , 𝑈3 , 𝑈4 where the order of
𝑥3 − 1 and 𝑧4 = 𝑥4 . Then, we have 𝑧1 + 𝑧2 +
𝐿5 as well as the order of 𝑈5 do not change =
𝑧3 + 𝑧4 = 3, 𝑤ℎ𝑒𝑟𝑒 𝑧𝑖 ≥ 0; 𝑖 = 1, 2 , 3, 4
the number of arrangements treating
8!
Total number of solution of this equation is 𝐿5 𝑖𝑑𝑒𝑛𝑡𝑖𝑐𝑎𝑙 𝑎𝑛𝑑 𝑈5 as identical = = 70.
4!4!
3 + 4 − 1𝐶4−1 = 6𝐶3 = 20 9) Find the number of permutations

(𝑷𝟏 , 𝑷𝟐 , 𝑷𝟑 , 𝑷𝟒 , 𝑷𝟓 )𝒐𝒇 𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟔 such
Thus the number of ways of selecting 3 seats
that for any k, 𝟏 ≤ 𝒌 ≤ 𝟓, (𝑷𝟏 , 𝑷𝟐 , … . , 𝑷𝒌 )
on the right side of 6th seat = 20.
does not from a permutation of 1, 2, …., k.
Hence total number of ways of selection of 4
So.: Let 𝑇𝑛 is the required number of
seats 24 +84+ 20= 128.
permutations. If k is the least positive integer
But, corresponding to each way of selection of such that (𝑃1 , 𝑃2 , … . , 𝑃𝑘 ) is a permutations of
4 seats there are 4! Arrangements of 4 1, 2, 3, …, k.
persons. Hence total number of seating
Now are desire of count the number of
arrangement =128× 4! = 3072.
permutation for k = n. Now,
295
𝑛 (2𝑚+1)
Case II: If 𝑛 = 2𝑚 + 1 𝑆 = ∑𝐾=1 (2𝑘 −
∑ 𝑇𝑘 . (𝑛 − 𝑘)! = 𝑛!
2𝑚 − 1) 𝑥𝑘
𝑘=1
⟹ 𝑇𝑛 = 𝑛! − 𝑇1 . (𝑛 − 1)! − 𝑇2 . (𝑛 − 2)! − Now we choose 𝑥1 = 𝑥2 = ⋯ = 𝑥𝑚 = 0, 𝑥𝑚+1

⋯ − 𝑇𝑛−1 . 1! can take any𝑥𝑛+2 = ⋯ = 𝑥2𝑚+1 = 1
𝐶𝑙𝑒𝑎𝑟𝑙𝑦, 𝑇1 = 1; 𝑇2 = 2! − 𝑇1 . 1! = 1, 𝑇3 = ∴ 𝑆𝑚+𝑥 = 2 + 4 + ⋯ + 2𝑚 = 𝑚(𝑚 + 1)

3; 𝑇4 = 13; 𝑇5 = 71 𝑎𝑛𝑑 𝑇6 = 461. (𝑛2 − 1)
=
4
10) Find the best and the greatest value of
𝑛2
∑𝒏𝒋=𝟏 ∑𝒏𝒊=𝟏 |𝒙𝒊 − 𝒙𝒋 | ; 𝒘𝒉𝒆𝒓𝒆 𝟎 < 𝑥 < Combining, 𝑆 ′ 𝑚𝑎𝑥 = [ 4 ].
1 ∀ 1 ≤ 𝑖 ≤ 𝑛; 1 ≤ 𝑖 ≤ 𝑗 ≤ 𝑛.
By actually, 𝑥𝑖 ≠ 0 & 𝑥𝑖 = 1 ∀ 𝑖 =
Sol.: For last value: ∵It is possible to have 𝑥𝑖 = 1, 2, … … … … , 𝑛
𝑥𝑗 ; 𝑖 = 𝑗 = 1, 2, 3, … , 𝑥
∴𝑆′𝑚𝑎𝑥 is not possible.
∴ 𝑆𝑚𝑖𝑛 = 0
Even if you show S= ∑2𝑚
𝑘=1(2𝑘 − 𝑛 − 1) 𝑥𝑘
For greatest value: without loss of generality,
and mentions than to get 𝑆𝑚𝑎𝑥 we have to put
we can assume that 0 ≤ 𝑥1 ≤ 𝑥2 ≤ ⋯ ≤ 𝑥𝑛 ≤
𝑥𝑖 , 𝑆 = 0 and some 𝑥𝑖 ,
1 (supposing the equality sign for 0 and 1
also). 𝑆 = 1 𝑤ℎ𝑖𝑐ℎ 𝑖𝑠 𝑛𝑜𝑡 𝑝𝑜𝑠𝑠𝑖𝑏𝑙𝑒. He will get full
Then 𝕊 = (𝑥2 − 𝑥1 ) + [(𝑥3 − 𝑥1 ) + credit.
(𝑥3 − 𝑥2 )] + [(𝑥4 − 𝑥1 )] + [(𝑥4 − 𝑥2 ) +
(𝑥4 − 𝑥3 )] + ⋯ + [(𝑥4 − 𝑥1 ) + (𝑥4 − 𝑥2 ) +
⋯ + 𝑥𝑥 − (𝑥𝑥 − 1)] 11) If (𝟏 + 𝒙)𝒏 ∑𝒏𝒓=𝟎 𝒏𝑪𝒓 . 𝒙𝒓 = then, show that
Case I: If n = 2m, Number of Number of Total

times times with
𝕊= ∑2𝑚 occurring positive
𝐾=1(2𝑘 − 2𝑚 − 1) 𝑥𝑘
with negative sign
If k= 1, 2, …, m; then coefficients are negative. sign
∴To maximize S’, We chose 𝑥1 = 𝑥2 = ⋯ = 𝑥1 (𝑛 − 1) 0 −(𝑛

𝑥𝑛 = 0 𝑥2 (𝑛 − 2) 1 − 1)𝑥1
⋮ ⋮ ⋮ −(𝑛
If 𝑘 = 𝑚 + 1, 𝑚 + 2, … , 2𝑚 then coefficients ⋮ ⋮ ⋮ − 3)𝑥2
are positive. 𝑥𝑛 (𝑛 − 𝑘) (k- 1) ⋮
⋮
∴ To maximize 𝑆 ′ ∼, we choose 𝑥𝑚+1 = (2𝑘 − 𝑛
𝑥𝑚+2 = ⋯ ∼= 𝑥2𝑚 = 1 − 1)𝑥𝑘
𝑛2
∴ 𝑆𝑚𝑎𝑥 = 1 + 3 + ⋯ + (2𝑚 − 1) = 𝑚2 =
4
296
∞ 𝟐 9
{∑(−𝟏)𝒓−𝟏 . 𝒄𝟐𝒓−𝟐 } 𝐵 = ∑ 𝑥 𝑘𝑘𝑘 = 𝑥 0 + 𝑥 1111 + 𝑥 2222 + ⋯

𝒓=𝟏 𝑘=0
∞ 𝟐 𝒏 9
9999
+ {∑(−𝟏)𝒓−𝟏 . 𝒄𝟐𝒓−𝟏 } = ∑ 𝒄𝒓 +𝑥 𝑎𝑛𝑑 𝐴 = ∑ 𝑥 𝑘
𝒓=𝟏 𝒓=𝟎 𝑘=0
= 𝑥 0 + 𝑥1 + 𝑥 2 + ⋯ + 𝑥 9
9
Sol.: Let 𝑁𝑜𝑤, 𝐵 − 𝐴 = ∑(𝑥 𝑘𝑘𝑘 − 𝑥 𝑘 )

𝑘=0
∞ 2 9
{∑(−1) 𝑟−1
. 𝑐2𝑟−2 } = ∑ 𝑥 𝑘 {(𝑥 10 )𝑘𝑘𝑘 − 1}
𝑟=1 𝑘=0
2 9
= (𝑐0 − 𝑐2 + 𝑐4 … . ) … … … . (𝑖)𝑎𝑛𝑑
∞ 2 = {(𝑥 10 )𝑘𝑘𝑘 − 1} ∑ 𝑥 𝑘
{∑(−1)𝑟−1 . 𝑐2𝑟−1 } 𝑘=0
9
𝑟=1
= (𝑐1 − 𝑐3 = 𝑀 ∑ 𝑥𝑘,
𝑘=0
+ 𝑐5 … . )2 … … (𝑖𝑖)
⟹ 𝐵 = (𝑀 + 1) ∑9𝑘=0 𝑥 𝑘 , 𝑖. 𝑒. ∑9𝑘=0 𝑥 𝑘𝑘𝑘 is
divisible by ∑9𝑘=0 𝑥 𝑘 .
𝐺𝑖𝑣𝑒𝑛: (1 + 𝑥)𝑛 = 𝑐0 + 𝑐1 𝑥 + 𝑐2 𝑥 2 + ⋯ +
𝑐𝑛 𝑥 4 … … . (𝑖𝑖𝑖)
𝑃𝑢𝑡 𝑥 = 𝑖 𝑖𝑛 (𝑖𝑖𝑖): (1 + 𝑖)𝑛 = 𝑐0 + 𝑐1 𝑖 − 𝑐2 − 13) After several operation of differentiation

𝑐3 𝑖 + 𝑐4 … … … = (𝑐0 − 𝑐2 + 𝑐4 … . ) + and multiplying by (x+ 1) performed in an
𝑖(𝑐1 − 𝑐3 + 𝑐5 … . ) … … … … (𝑖𝑣) arbitrary order the polynomial 𝒙𝟖 + 𝒙𝟕 is
𝑃𝑢𝑡 𝑥 = 𝑖 𝑖𝑛 (𝑖𝑖𝑖): (1 − 𝑖)𝑛 = 𝑐0 − 𝑐1 𝑖 − 𝑐2 + changed to ax +b. Prove that the
𝑖𝑐3 + 𝑐4 … … … = (𝑐0 − 𝑐2 + 𝑐4 … . ) + difference between the in tegers a and b is
always divisible by 49.
𝑖(𝑐1 − 𝑐3 + 𝑐5 … . ) … . . (𝑣)
(𝑖𝑣) × (𝑣) = {(1 + 𝑖)(1 − 𝑖)}𝑛 = Sol.: Let 𝑓(𝑥) = 𝑥 𝑚 , 𝑡ℎ𝑒𝑛 𝑓 𝑛 (𝑥) =
(𝑐0 − 𝑐2 + 𝑐4 … . )2 + (𝑐1 − 𝑐3 + 𝑐5 … . )2 𝑚(𝑚 − 1)(𝑚 − 2) … . (𝑚 + 1 −
𝑛)𝑥 𝑚−𝑛 𝑤ℎ𝑒𝑟𝑒 𝑓 𝑛 (𝑥)𝑖𝑠 𝑛𝑡ℎ derivative of f(x).
⟹ 2𝑛 = (𝑐0 − 𝑐2 + 𝑐4 … . )2 + (𝑐1 − 𝑐3 +
𝑚!
𝑐5 … . )2 , ∴ 𝑓 𝑛 (𝑥) = 𝑥 𝑚−𝑛
(𝑚 − 𝑛)!
⟹ ∑𝑛𝑟=0 𝑐𝑟 = (𝑐0 − 𝑐2 + 𝑐4 … . )2 +
𝐿𝑒𝑡 𝑔(𝑥) = 𝑥 8 + 𝑥 7 , 𝑡ℎ𝑒𝑛 𝑔𝑛 (𝑥) =
(𝑐1 − 𝑐3 + 𝑐5 … . )2 8! 7!
(8−𝑛)!
𝑥 8−𝑛 + (7−𝑛)! 𝑥 7−𝑛 Multiplying both
sides by (1+ x), then
12) Prove that ∑𝟗𝒌=𝟎 𝒙𝒌 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 ∑𝟗𝒌=𝟎 𝒙𝒌𝒌𝒌
Sol.: Let
297
8! First way 𝐼𝑛 ∑ 𝑆(𝑎) , 𝑘1 is multiplied by each i

(1 + 𝑥)𝑔𝑛 (𝑥) = 𝑥 8−𝑛
(8 − 𝑛)! ∊ {1, …, n} a total of (n -1)! Times. Once for
7! each permutation of {1, …, n} in which 𝑎1 = 𝑖.
+ 𝑥 7−𝑛
(7 − 𝑛)! Thus the coefficient of 𝑘1 𝑖𝑛 ∑ 𝑆(𝑎) 𝑖𝑠 (𝑛 −
8! (𝑛+1)!
+ 𝑥 9−𝑛 1)! (1 + 2 + ⋯ + 𝑛) = .
(8 − 𝑛)! 2
After (8 − 𝑛)𝑛𝑡ℎ differentiation of (i) we get The same is true for all k, so ∑ 𝑆(𝑎) =
7! (𝑛+1)!
𝑥 8−𝑛 … … . . (𝑖) if into the from ax +b. ∑𝑛𝑖=1 𝑘𝑖 … … … . (1)
(7−𝑛)! 2
Let h(x) = (x+1) 𝑔𝑛 (𝑥). Second way, if n! is not a divisors of 𝑆(𝑏) − 𝑆(𝑐)
for any b ≠ c, then each 𝑆(𝑎) must have a
8! (8 − 𝑛)!
𝑁𝑜𝑤 ℎ8−𝑛 (𝑥) = . different remainder mod n! Since there are n!
(8 − 𝑛)! 0!
permutations, these remainders must be
7! (9 − 𝑛)!
+ . precisely the numbers 0, 1, 2, …, n! -1. Thus
(7 − 𝑛)! 7!
8! (9 − 𝑛)! (𝑛!−1)𝑛!
+ . 𝑥 ∑ 𝑆(𝑎) = 𝑚𝑜𝑑 𝑛! … … … … . . (2)
(8 − 𝑛)! 2
7!
= 8! (9 − 𝑛)𝑥 + 7! (8 − 𝑛) Combining (1) and (2), we get
+ 8.7!
𝑛
(𝑛 + 1)!
= 8! (9 − 𝑛)𝑥 + 7! (16 − 𝑛)𝑐𝑜𝑚𝑝𝑎𝑟𝑖𝑛𝑔 𝑎 = ∑ 𝑘𝑖
2
8! (9 − 𝑛)𝑥 𝑖=1
(𝑛! − 1)𝑛!
= 7! (72 − 8𝑛)! 𝑏 = 7! (16 − 𝑛) ≡ 𝑚𝑜𝑑 𝑛! … … … … . (3)
2
∴ 𝑎 − 𝑏 = 7! (72 − 8𝑛 − 16 + 𝑛) = Now, for n odd, the left side of (3) is

7! (56 − 7𝑛) = 7 × 7! (8 − 𝑛) = 49.6! (8 − 𝑛) congruent to 0 modulo n!, while for n >1 the
right side is not congruent to 0 (n! -1 is odd)
∴ 𝑎 − 𝑏 is divisible by 49. For n> 1 and odd, we have a contradiction.
14) Let n be an odd integer greater than 1 and
𝒌𝟏 , 𝒌𝟐 , … . , 𝒌𝒏 be given integers. For each
of the n! Permutations 𝒂 = 15) If 𝒙𝟏 , 𝒙𝟐 , … , 𝒙𝒏 be real numbers satisfying
(𝒂𝟏 , 𝒂𝟐 , … . , 𝒂𝒏 )𝒐𝒇 𝟏, 𝟐, … … … , 𝒏. Let the conditions: |𝒙𝟏 + 𝒙𝟐 + ⋯ + 𝒙𝒏 | =
𝑺(𝒂) ∑𝒏𝒊=𝟏 𝒌𝒊 𝒂𝒊 . Show that there are two 𝟏 𝒂𝒏𝒅 |𝒙𝒊 | ≤
𝒏+𝟏
𝒐𝒓 𝒊 = 𝟏, 𝟐, … . . , 𝒏. show
𝟐
permutations b and c, b ≠ c such that n! is that there exist a permutations
a divisors of 𝑺(𝒃) − 𝑺(𝒄) . 𝒚𝟏 , 𝒚𝟐 , … … . . , 𝒚𝒏 𝒐𝒇 𝒙𝟏 , 𝒙𝟐 , … . , 𝒙𝒏 such
𝒏+𝟏
Sol.: Let ∑ 𝑆(𝑎) be the sum of 𝑆(𝑎) over all n! that |𝒚𝟏 + 𝟐𝒚𝟐 + ⋯ + 𝒏𝒚𝒏 | ≤ 𝟐
.
permutation a = (𝑎1 , 𝑎2 , … . , 𝑎𝑛 ). We compute
Sol.: For any permutation 𝜋 = (𝑦1 , 𝑦2 , … . , 𝑦𝑛 )
∑ 𝑆(𝑎) mod n! two ways one of which depends
of (𝑥1 , 𝑥2 , … . , 𝑥𝑛 ) Let S(𝜋)= 𝑦1 + 2𝑦2 + 3𝑦3 +
on the desired conclusion being false, and
⋯ + 𝑛𝑦𝑛 Let 𝜋0 be the identity permutation,
reach a contradiction when n is odd.
𝜋0 = (𝑥1 , 𝑥2 , … . . , 𝑥𝑛 ) and let 𝜋 be the reverse
permutation, 𝜋 =
298
(𝑥𝑛 , 𝑥𝑛−1 , … , 𝑥1 ), 𝑖𝑓 |𝑆(𝜋0 )| ≤ 𝑆(𝜋𝑖 ) must lie in this interval. For this
(𝑛+1) (𝑛+1) (𝑛+1)
𝑜𝑟 |𝑆(𝜋)| ≤ , then we are done. particular 𝜋𝑖 we have |𝑆(𝜋𝑖 )| ≤ 2
.
2 2
Thus we assume |𝑆(𝜋0 )| > (𝑛 +
(𝑛+1) 16) Find the number of non-degenerate
1)𝑎𝑛𝑑 |𝑆(𝜋)| > 2 triangle whose vertices lie in set of points
(s, t) in the plane such that 𝟎 ≤ 𝑺 ≤ 𝟒, 𝟎 ≤
Note that 𝑆(𝜋0 ) + 𝑆(𝜋) = (𝑥1 + 2𝑥2 + ⋯ +
𝒕 ≤ 𝟒, S and t are integers.
𝑛𝑥𝑛 ) + (𝑥𝑛 + 2𝑥𝑛−1 + ⋯ + 𝑛𝑥1 ) =
(𝑛 + 1)(𝑥1 + 𝑥2 + ⋯ + Sol.: There are 25 points in the given set, we
𝑥𝑛 )𝑎𝑛𝑑 ℎ𝑒𝑛𝑐𝑒 𝑡ℎ𝑎𝑡 |𝑆(𝜋0 ) + 𝑆(𝜋)| = 𝑛 + 1. can choose 3 out of them in (25 ) ways. Let us
(𝑛+1) 3
Since each of 𝑆(𝜋0 )𝑎𝑛𝑑 𝑆(𝜋) 𝑒𝑥𝑐𝑒𝑒𝑑𝑠 2
is count the number of ways in which the 3
absolute value, they must have opposite points chosen will lie on a line. L : The given
signs. Thus, one of 𝑆(𝜋0 )𝑎𝑛𝑑𝑆(𝜋) is greater set S contains 5 horizontal lines 5 points each.
(𝑛+1) (𝑛+1)
than , and the other is less than − .
2 2 We can choose 3 points from any of them in
Now, starting from 𝜋0 , we can obtain any (53) ways.
permutation by successive, transpositions of
neighboring elements. In particular, there Hence the number of ways in which L can be
exists a chain 𝜋0 , 𝜋1 , … . , 𝜋𝑚 of permutations a horizontal line is 5. (53) = 50. Similarly the
𝜋𝑥+1 is obtained from 𝜋𝑖 by interchanging number of ways in which L can be a vertical
two of its neighboring terms. line is 50.
This means that if 𝜋𝑖 = As shown in fig.(ii) S contains 5 lines of slope
𝑦1 , 𝑦2 , … … . . , 𝑦𝑛 𝑎𝑛𝑑 𝜋𝑖+1 = 1; one line contain 5 points, 2 lines contain 4
(𝑧1 , 𝑧2 , … , 𝑧𝑛 ) 𝑡ℎ𝑒𝑛 𝑡ℎ𝑒𝑟𝑒 𝑖𝑠 𝑎𝑛 𝑖𝑛𝑑𝑒𝑥 𝑘, 1 ≤
points each and 2 lines contain 3 points each.
𝑘 ≤ 𝑛 − 1, such that 𝑧𝑘 = 𝑦𝑘+1 , 𝑧𝑘+1 = So the number of ways in which L can be line
𝑦𝑘 𝑎𝑛𝑑 𝑧𝑖 = 𝑦𝑖 , 𝑗 ≠ 𝑘, 𝑗 ≠ 𝑘 + 1.
of slope 1 is (53) + 2(43) + 2(33) = 20.
(𝑛+1)
Because the numbers 𝑥𝑖 do not exceed 2 Similarly, the number of ways in which L can
in absolute value, we have |𝑆(𝜋𝑖+1 ) − be a line of slope −1 𝑖𝑠 20.
𝑆(𝜋𝑖 )| = |𝑘𝑥𝑘 + (𝑘 + 1)𝑧𝑘+1 − 𝑘𝑦𝑘 −
1
(𝑘 + 1)𝑦𝑘+1 | = |𝑦𝑘 − 𝑦𝑘+1 | ≤ |𝑦𝑘 | + |𝑦𝑘+1 | ≤ As shown in fig (ii) there are 3 lines of slope 2
𝑛 + 1. It follows that the difference between each containing 3 points; and there are 3 lines
any two consecutive numbers in the sequence of slope 2, each containing 3 points. So the
𝑆(𝜋0 ), 𝑆(𝜋1 ), … . , 𝑆(𝜋𝑚 ) is at most n +1 in number of ways in which L can have slope 2
1
absolute value. Recall that the numbers
or 2 is 6 (33)= 6 similarly L can have slope
𝑆(𝜋0 ) 𝑎𝑛𝑑 𝑆(𝜋𝑚 ) = 𝑆(∼ 𝜋
) regarded as points
1
on the real line, lie outside of and on opposite − 𝑜𝑟 − 2 𝑖𝑛 6 ways.
2
(𝑛+1) (𝑛+1)
sides of the interval [− , ].
2 2 Since no other line can contain more than two
points of S, the number of ways in which the 3
Because this interval has length n +1, it
points chosen will lie is
follows that at least. One of the numbers
50+50+20+20+6+6= 152
299
The required number of triangle is therefore Sol.: (i) S consists of single digit numbers, two
(25
3
) − 152 = 2148. digits numbers three digits numbers and four
digit numbers.
17) For non-negative integers n, r the binomial
coefficient (𝒏𝒓) denotes the number of No. of single digit number = 4, No. of two
digit number = 4 × 3 = 12 (since repeatation
combinations of n objects chosen r at a
is not allowed, there are four choices for ten’s
time, with the convention that (𝒏𝟎) =
place and three choices for unit’s place)
𝟏 𝒂𝒏𝒅 (𝒏𝒓) = 𝟎 𝒊𝒇 𝒏 < 𝑟.
No. of three digit number = 4 × 3 × 2 = 24
𝒏−𝒓+𝟏 𝒓−𝟏 𝒏
Prove that ∑∞ 𝒅=𝟏( 𝒅 ) (𝒅−𝟏) = ( 𝒓 ) for all
integers n, r with 𝟏 ≤ 𝒓 ≤ 𝒏. No. of four digit number = 4 × 3 × 2 × 1 =
24
Sol.: We use a combinatorial argument to
establish the obviously equivalent identity ∴ n(s) = 4 +12+ 24+ 24 = 64.
∞ Now for the sum of these 64 numbers, sum of

𝑛−𝑟+1 𝑟−1
∑( )( ) all the single digit number is 1 +2 +3 +4=
𝑑 𝑑−1
𝑑=1 10. (since there are exactly 4 digits 1, 2, 3, 4
𝑛
= ( ) … … . (∗)𝑤ℎ𝑒𝑟𝑒 𝑘 and their numbers are 1, 2, 3 and 4).
𝑟
= min{𝑟, 𝑛 − 𝑟 + 1}. Now, to find the sum of all the two digit
numbers. No of two digit number is 12.
It clearly suffices to demonstrate that the left
hand side of (i) counts the number of ways of The digit used in units place are 1, 2, 3 and 4.
selecting r objects from n distinct objects In the 12 numbers, each of 1, 2, 3 and 4
(without replacements). Let 𝑆2 = 𝑟 − 1. For occurs thrice in unit digit (12 = 3).
4
each fixed d = 1, 2, …, k any selection of d
𝑆 Again in ten’s place, each of these digits
objects from 𝑆1 ( ) together with any
𝑆2
occurs thrice also so, sum of these 12
selection of 𝑟 − 𝑑 objects from 𝑆2 would yield
numbers = 30 × (1 + 2 + 3 + 4) + 3 ×
a selection of r objects from S. The total
(1 + 2 + 3 + 4) = 300 + 30 = 330. No. of the
number of such electrons is (𝑛−𝑟+1 𝑟−1
) (𝑑−1 ).
𝑑 digit numbers is 24. So, the number of times
Conversely each selection of r objects from S each of 1, 2, 3, 4 occurs in each of unit’s ten’s
clearly much arise in this manner. Summing 24
and hundred’s place is 4
= 6.
over d = 1, 2, ….(*) follows.
So, sum of all these three digit number is
100 × 6(1 + 2 + 3 + 4) + 10 × 6(1 + 2 + 3 +
18) If S be the set of natural numbers whose 4) + 1 × 6(1 + 2 + 3 + 4) = 6, 000 + 600 +
digits are chosen from {1, 2, 3, 4} such that 60 = 6660.
(i) when no digits are repeated, find n(s)
and the sum of all numbers in S and (ii) Similarly for the four digit numbers, the sum
when 𝑺𝟏 is the set of up to 4-digits is computed as 100 × 6(1 + 2 + 3 + 4) +
numbers where digits are repeated. Find 100 × 6(1 + 2 + 3 + 4) + 10 × 6(1 + 2 + 3 +
|𝑺𝟏 | and also find the sum of all the 4) + 1 × 6(1 + 2 + 3 + 4) = 60,000 +
numbers in 𝑺𝟏 . 6,000 + 600 + 60 = 66, 660.
300
[Since there are 24 digit numbers, each of 1, 19) Find the number of 6 digit natural
24 numbers where each digit appears at least
2, 3, 4 occurs in each of the four digits in 4
=
twice.
6 times]
Sol.: We consider number like 222222 or
So, the sum of all the single digit, two digit,
233200 but not 212222. Since the digit 1
three digit and four digit number =
occurs only once.
10+330+6660+66660= 73, 660.
The set of all such 6 digits can be divided into
(i) There are just four single digits
following classes.
numbers 1, 2, 3, 4.
(ii) There are 4 × 4 = 16 two digits 𝑆1 = the set of all 6 digit numbers where a
numbers, as digit can be repeated. single digit is repeated 6 times.
(iii) There are 4 × 4 × 4 = 64 three
digit numbers. 𝑛(𝑆1 )= 9.
(iv) There are 4 × 4 × 4 × 4 = 256
four digit numbers. Since ‘0’ cannot be a significant number when
all its digits are zero.
So, that total number of numbers up to 4 digit
numbers that could be formed using the 𝐿𝑒𝑡 𝑆2 be the set of all six digit numbers,
digits 1, 2, 3 and 4 is 4 + 16 + 64 + 256 = made up of three distinct digits.
340. Here we should have two cases : 𝑆2 (𝑎) one
Sum of the 4 single digit numbers = with the exclusion of zero as a digit and other
𝑆2 (𝑏) with the inclusion of zero as a digit.
1+2+3+4= 10. To find the sum of 16, two
digit number each of 1, 2, 3, 4 occur in each of 𝑆2 (𝑎) The numbers of ways, three digit could
16
units and ten’s place 4
= 4 𝑡𝑖𝑚𝑒𝑠. So, the be chosen from 1, 2, …, 9 is 9𝐶3 . Each of these
sum of all these 16 numbers is = 10 × three digits occurs twice. So, the number of
4(1 + 2 + 3 + 4) + 4(1 + 2 + 3 + 4) = 400 + six digit number in this case is
40 = 440.
6! 9 × 8 × 7 720
9𝐶3 × = ×
Similarly, the sum of all the 64 three digit 2! × 2! × 2! 1 × 2 × 3 8
numbers 100 ×
64
× (1 + 2 + 3 + 4) + 10 × = 9 × 8 × 7 × 15 = 7560.
4
64 64
× (1 + 2 + 3 + 4) + 1 × × (1 + 2 + 3 + 𝑆2 (𝑏) the three digits used include one zero,
4 4
4) = 16,000 + 1,600 + 160 = 17,760. implying we have to choose the other two
digits from the 9 non zero digits.
Again the sum of al the 256 four digit
9×8
numbers = 1000 ×
256
× (1 + 2 + 3 + 4) = This could be done in 9𝐶2 = 1.2
= 36. Since
4
6,40,000 + 64,000 + 6,400 + 640 = zero can not be in the leading digit. So let us
7,11, 040. fix one of the fixed non-zero number in the
extreme left. Then the other five digits are
Therefore, sum of all the number is 10 + 440 made up of 2 zeros, 2 fixed non zero number
+17,760+ 7,11,040= 7,29,250. and the another non-zero number, one of
which is put in the extreme left.
301
In this case the number of six digit numbers If a and b are the two non-zero numbers a
5 6!
that could be formed is 2!×2!×2! × 2 (since used twice and b four times, then we get 2!×4!
from either of the pairs of fixed non-zero and when a used four times, b twice, we again
numbers, one can occupy the extreme digit) 6!
get 2!×4!. So, when 2 of the nine non-zero
= 60.
digits are used to from the six digit number in
So, the total number in this case = 36 × 60 = this case, the total numbers got is 9𝐶2 × 2 ×
6!
2160. = 36 × 5 × 6 = 1080.
4!×2!
∴ n(𝑆2 ) = 𝑛(𝑆2 𝑎) + (𝑆2 𝑏) = 7560 + 2160 = Thus n[𝑆4 (𝑎)] = 1080.

9720
For counting the numbers in 𝑆4 (𝑏).
Now, Let 𝑆3 be the set of six digit numbers,
whose digits are made up to of two distinct, In this case we may use 4 zeros and a non-
digits each of which occurs thrice. Here again, zero number twice or 2 zeros and a non-zero
there are two cases: 𝑆3(𝑎) excluding the digit number for times. In the former case,
zero and 𝑆3(𝑏) including the digit zero. assuming the one of the fixed non-zero digit
occupying the extreme left, we get the other
𝑆3(𝑎) is the set of six digit numbers, each of five digits consisting of 4 zeros and one non-
whose digits are made up of two non-zero zero number.
digits each occurring thrice 5!
This result in 9 × 4!×1! = 45 six digit numbers.
6!
∴n[𝑆3(𝑎) ] = 9𝐶2 × 3!×3! = 36 × 20 = 720 When we use the fixed non-zero digit 4 times
5!
and use zero twice, then we get 9 × = 90
𝑆3(𝑏) consists of 6 digits numbers whose 3!×2!
six digit numbers, as fixed number occupies
digits are made up of three zeros and one of
the extreme left and for the remaining three
non-zero digit, occurring thrice. If you fix one
times it occupies 3 of the remaining digit,
of the nine non-zero digit, use that digit in the
other digits being occupied by the two zeros.
extreme left.
So, n(𝑆4 ) = 𝑛 [𝑆4 (𝑎)] + 𝑛[𝑆4 (𝑏)] = 1080 +
This digit should be used thrice. So in the 45 + 90 = 1215.
remaining 5 digits, this fixed non zero digit is
Hence, the total number of six digit numbers
used twice and the digit zero occurs thrice.
satisfying the given condition = 𝑛(𝑆1 ) +
So, the number of 6 digit numbers formed in 𝑛(𝑆2 ) + 𝑛(𝑆3 ) + 𝑛(𝑆4 )= 9+720+810+1215
these cases is 9 ×
5!
= 90 ∴ 𝑛(𝑆3 ) = = 2754
3!×2!
𝑛𝑆3 (𝑎) + 𝑛𝑆3 (𝑏) = 720 + 90 = 810.
Now let us take 𝑆4 , the case where the six 20) If x = {1, 2, 3, … 4}, where n ∊N, show that
digit number consists of exactly two digits, the number of r combinations of x which
one of which occurs twice and the other four contain no consecutive integer is given by
times. (𝒏−𝒓+𝟏 ), 𝒘𝒉𝒆𝒓𝒆 𝟎 ≤ 𝒓 ≤ 𝒏 − 𝒓 + 𝟏.
𝒓
Here, again, there are two cases; 𝑆4 (𝑎)

Sol.: From the hypothesis 𝑟 ≤ 𝑛 − 𝑟 +
excluding zero and 𝑆4 (𝑏) including zero.
1, 𝑤𝑒 𝑔𝑒𝑡 2𝑟 ≤ 𝑛 + 1. Each such r
302
combinations can be represented by a binary 21) If 𝑺 = {𝟏, 𝟐, 𝟑, … . , (𝒏 + 𝟏)}𝒘𝒉𝒆𝒓𝒆 𝒏 ≥ 𝟐

sequences 𝑏1 , 𝑏2 , 𝑏3 … … . 𝑏𝑛 where 𝑏𝑖 = (𝒙,𝒚,𝒛)
and let 𝒕 − { ∊ 𝑺, 𝒙 < 𝑧, 𝑦 < 𝑧}. By
𝒙,𝒚,𝒛
1, 𝑖𝑓 𝑖 𝑖𝑠 a number of the r combinations and
counting the numbers of T in two different
0, otherwise with no consecutive 𝑏𝑖 ′𝑠 =1 (the
above r combinations contain no consecutive ways, show that ∑𝒏𝒌=𝟏 𝒌𝟐 = (𝒏+𝟏
𝟐
)+
integers). The number of 1s in the sequence is 𝟐(𝒏+𝟏
𝟑
).
r. Now, this amounts to counting such binary
sequences. Now, look at the arrangements of Sol.: T can be written as 𝑇 = 𝑇1 ∪ 𝑇2 , 𝑇1 =
(𝑥,𝑥,𝑧) (𝑥,𝑦,𝑧)
the following boxes; { , ∊ 𝑆, 𝑥 < 𝑧} 𝑎𝑛𝑑 𝑇2 = { 𝑥,𝑦,𝑧 ∊ 𝑆, 𝑥 +
𝑥,𝑧
And the balls in them 𝑦 < 𝑧}
1 2 3 4 5 6 7 The number of elements in 𝑇1 is the same as

00 000 00 0000 0 0 000 choosing two elements from the set S, where
n(S)= (n +1). i.e. 𝑛(𝑇1 ) = (𝑛+1
2
) (as every subset
Here, the balls stand for the binary digits of two elements the larger elements will be z
zero, and the boundaries on the left and right and the smaller will be x and y.)
of each box can be taken as the binary digit
one. In this display of boxes and balls as In 𝑇2 . we have 2(𝑛+1
3
) elements, other choosing
interpreted gives previously how we want the 3 elements from the set S, two of the smaller
binary numbers. here there are 7 boxes, and 6 elements will be x and y and they may be either
left/right boundary for the boxes.. So, this is taken as (x, y, z) or as (y, x, z) or in other words,
an illustration of 6 combinations of non- every three element subset of S, say {a, b, c} the
consecutive numbers. greatest is z, and the other two can be placed in
two different ways in the first two positions,
The reason for zeros in the front and at the end
is that we can have leading zeros and trailing ∴n(T) (𝑜𝑟 |𝑇|) = (𝑛+1
2
) + 2(𝑛+1
3
)𝑇, can also be
zeroes in the binary sequence 𝑏1 , 𝑏2 , … . 𝑏𝑛 considered as ⋃𝑛+1
𝑖=2 𝑆𝑖 ,
Now clearly finding the r combination amounts (𝑥,𝑦,𝑖)

where 𝑆𝑖 = { 𝑦 < 𝑖, 𝑥, 𝑦 ∊ 𝑆}.
to distribution of (n-r) balls into (𝑟 + 1) distinct 𝑥
boxes [(𝑛 − 𝑟)𝑏𝑎𝑙𝑙𝑠 = (𝑛 − 𝑟)] zeros as these

All these sets are pair wise disjoint as for
are r ones, in the n number sequence]. Such
different i, we get different ordered triplets (x,
that the 2nd, 3rd-rth boxes are non-empty.(The
y, i).
first and the last boxes may or may not be
empty in the illustration 1st and the 7th may Now in 𝑆𝑖 , the first two components of (x, y, i)
have zeros or may not have balls as we have namely (x, y) can be any element from the set 1,
already had 6 combinations!). Put (𝑟 − 1) balls 2, 3, …., (i-1) equal or district.
one in each of 2nd, 3rd, …., rth boxes. (So, that no
two 1’s occurs consecutively). ∴ The number of ways of selecting (x, y), x, y
∊{1, 2, 3, ….., (i-1)} is (𝑖 − 1)2
Now we have (𝑛 − 𝑟) − (𝑟 − 1) balls to be
distributed in r +1 distinct boxes. Thus, n(𝑆𝑖 )𝑓𝑜𝑟 𝑒𝑎𝑐ℎ 𝑖 𝑖𝑠(𝑖 − 1)2 , 𝑖 ≥ 2.
303
For example, 𝑛(𝑆2 ) = 1, 𝑛(𝑆3 ) = 22 = 4 and 2𝑚 − 5 2𝑚 − 3 2𝑚 − 1

so on
Thus there are 2𝑚 − 5 A.P.’s here with
Now, 𝑛(𝑇) = 𝑛(⋃𝑛+1 𝑛+1
𝑖=2 𝑆𝑖 ) = ∑𝑖=2 𝑛(𝑆𝑖 )
common difference 2.
(because all 𝑆𝑖′ 𝑠 are pair –wise disjoint)
Now let us consider an A.P. with common
𝑛+1 difference 𝑚 − 1, then (1, m, 2m-1) will
= ∑(𝑖 − 1)2 be the only Ap with this common
𝑖=2 difference m -1. Thus the greatest value
𝑛
𝑛+1 𝑛+1 for the common difference of the Ap’s in
= ∑ 𝑖 2 𝑎𝑛𝑑 ℎ𝑒𝑛𝑐𝑒, ( ) + 2( ) equation is d = 𝑚 − 1
2 3
𝑖=1
𝑛
Now, let us taken all the AP’s with
= ∑ 𝑘2
common difference d,
𝑘=1
1 1+𝑑 1 + 2𝑑
2 2+𝑑 2 + 2𝑑
⋮ ⋮ ⋮
22) Show that the number of ways in which 3
numbers in A.P. can be selected from 1, 2, 2𝑚 − 1 − 2𝑑 2𝑚 − 1 − 2𝑑 2𝑚 − 1
𝟏 𝟐 𝟏
3, …., n is 𝟒 (𝒏 − 𝟏) 𝒐𝒓 𝟒 𝒏(𝒏 − 𝟐)
Therefore, there are exactly (2𝑚 − 1 −
according as n is odd or even. 2𝑑) triplets in Ap with common
Sol.: difference d, but d varies from 1 to m -1.
Let us assume that n is odd, so 𝑛 = 2𝑚 − 1. So, the total number of triplets in AP in

this case is
Now, we will count the set of all triplets of
𝑚−1
numbers which are in A.P.
∑ (2𝑚 − 1 − 2𝑑)
Observe the following sequence of triplets in 𝑑=1
A.P. with common difference 1. = (𝑚 − 1)(2𝑚 − 1)

(𝑚 − 1)𝑚
−2
1 2 3 2
2 3 4
𝑚−1
3 4 5
∴ ∑ 2𝑚 − 1 − 2𝑑
⋮ ⋮ ⋮ 𝑑=1
= (𝑚 − 1)(2𝑚 − 1)
𝑛−2 𝑛−1 𝑛 𝑚−1
𝑜𝑟,
2𝑚 − 3 2𝑚 − 2 2𝑚 − 1 −2 ∑ 𝑑
𝑑=1
AP is common difference 2.
(𝑚 − 1)𝑚
1 3 5 = (𝑚 − 1)(2𝑚 − 1) − 2
2 4 6 2
3 5 7 = 2𝑚2 − 3𝑚 + 1 − 𝑚2
+𝑚
⋮ ⋮ ⋮
= 𝑚2 − 2𝑚 + 1 = (𝑚 − 1)2
304
𝑛+1 𝑚−1 𝑚−1

𝐵𝑢𝑡 𝑛 = 2𝑚 − 1 ⟹ 𝑚 = ⟹𝑚−1
2 ∑ (2𝑚 − 2𝑑) = 2 ∑ (𝑚 − 𝑑)
𝑛−1 𝑑=1 𝑑=1
= 𝑎𝑛𝑑 1
2 = 2 [𝑚(𝑚 − 1) − (𝑚 − 1)𝑚]
2
Hence, when n is odd, the total number of 1
𝑛−1 2 1
= 2 × 𝑚(𝑚 − 1)
A.P.’s is ( ) = 4 (𝑛 − 1)2 2
2 = 𝑚(𝑚 − 1)
For the case where n is even, assume = 1 1
2m. In this case also we can show that the 𝑏𝑢𝑡 𝑚 = 𝑛 𝑎𝑛𝑑 𝑚 − 1 = (𝑛 − 2),
2 2
AP with the biggest value of the common
difference is again 𝑚 − 1. 𝑓𝑜𝑟 1, 𝑚, 2𝑚 − 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑡ℎ𝑒 𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝐴𝑃′ 𝑠 𝑖𝑛 𝑡ℎ𝑖𝑠 𝑐𝑎𝑠𝑒
1, it will form an Ap with common 1 1 1
= 𝑛 × (𝑛 − 2) = 𝑛(𝑛 − 2).
difference 𝑚 − 1 𝑎𝑛𝑑 1, 𝑚, 2𝑚 − 1 all 2 2 4
belong to the given set of natural
numbers up to n. If m is the common
difference then 1, 1 + 𝑚, 1 + 2𝑚, will be 23) There are two boys, each containing m
triplet in A.P., but 2m +1 does not belong balls. A person has to select an equal
to the given set. number of balls from both bags. Find the
number of ways in which he can select at
However there are two AP’s with least one ball from each bags.
common differences 𝑚 − 1 𝑎𝑠 (2, 𝑚 +
1, 2𝑚) will from the Ap, with all the three Sol.: He may choose one ball or two balls …..
numbers belonging to the set, whereas or m balls from each bags.
there is just one AP with biggest possible
common difference (m -1) in the case of Choosing one ball from one of the bags can be
n, an odd number 1. done in 𝑚𝐶1 𝑤𝑎𝑦𝑠. Then, choosing one ball
from the other bag also can be done in 𝑚𝐶1
Now, consider the Aps with common ways.
differences d, (1,1 + 𝑑, 1 + 2𝑑), (2, 2 +
𝑑, 2 + 2𝑑), (3, 3 + 𝑑, 3 + 2𝑑), … . , (2𝑚 − Thus, there are 𝑚𝐶1 × 𝑚𝐶1 ways of choosing
2𝑑, 2𝑚 − 𝑑, 2𝑚) one ball from each bag. Similarly if r balls, 1 ≤
𝑟 ≤ 𝑚 are chosen from each of the two bags,
So for each d, there are 2𝑚 − 2𝑑 Ap’s d the number of ways of doing this is
varying from 1 to 𝑚 − 1. 2
(𝑚𝐶𝑟 ). (𝑚𝐶𝑟 ) = (𝑚𝐶𝑟 )
So, the total number of AP’s in this case
Thus , the total number of ways of choosing at
where n = 2m is
least one ball from both the bag is
2 2 2
∑𝑚 𝑚
𝑟=1(𝑚𝐶𝑟 ) = ∑𝑟=0(𝑚𝐶𝑟 ) + (𝑚𝐶0 ) =
2𝑛!
2𝑛𝐶𝑛 −1 = 𝑛!𝑛! − 1 𝑎𝑠 𝑚𝐶0 = 1
𝑚
2
[∑(𝑚𝐶𝑟 ) = 2𝑚𝐶𝑚 ]
𝑟=0
305
24) If 𝑨𝒊 = 𝟏, 𝟐, … . , 𝟐 be the vertices of a 21 10 as we have only 21 balls. Also, any one of

sided regular polygon inscribed in a circle the 3 boxes can get more than 10 balls. To
with centre 0. Triangles are formed by find the number of ways where box 1 gets
joining the vertices of the 21 sided more than 10. i.e. at least 11 balls’ in box 1. 1
polygon. How many of them are acute each in boxes 2 and 3. We are left with 8 balls
angled triangles? How many of them are now. Now, number of ways of distributing 8
obtuse angles triangles? How many of balls unconditionally in 3 boxes in 8 + 2𝐶2 =
them are equilateral. How many of them 10×9
= 45 ways. Thus number of acute angled
2
are isosceles?
triangles with 𝐴1 as vertex = 190 − 3 × 45 (3
times, as each box could get at least 11 balls)
Sol.: Since this is a regular polygon with odd = 55. Now, for each vertex, we get 55 such
number of vertices, no two of the vertices are triangles. But a triangle 𝐴𝑖 , 𝐴𝑗 , 𝐴𝑘 will be
placed diagonally opposite, so there are no counted in 𝐴𝑖 vertex,
right angled triangles. Hence number of right 𝐴𝑗 𝑣𝑒𝑟𝑡𝑒𝑥 𝑎𝑛𝑑 𝐴𝑘 𝑣𝑒𝑟𝑡𝑒𝑥. 𝑖. 𝑒. 𝑡ℎ𝑟𝑖𝑐𝑒 so, each
angled triangles is zero. Let A be the number triangle will be counted thrice. Thus , the total
of acute angled triangles. To from a triangle number of acute angled triangles.
we need to choose 3 vertices out of the 21
21
vertices which can be done in C (21, 3) = 𝐴 = 55 × = 385, 0 = 1330 − 385
21×20×19 3
6
= 1330 ways. = 955
Since the triangles are either acute or obtuse A triangle 𝐴𝑖 , 𝐴𝑗 , 𝐴𝑘 is equilateral if 𝐴𝑖 , 𝐴𝑗 , 𝐴𝑘

get A+0 = 133D are equally spaced out of 𝐴1 , … . . , 𝐴21 . We
have only 7 such triples
To find A, the number of acute angled
𝐴1 𝐴8 𝐴15 , 𝐴2 𝐴9 𝐴16 , … … , 𝐴7 𝐴14 𝐴21 .
triangles The 3 vertices of a triangle (say
𝐴𝑖 𝐴𝑗 𝐴𝑘 , 1 ≤ 𝑖 ≤ 𝑗 < 𝑘 ≤ 21). Divide the 21 Therefore, there are only 7 equilateral
spaces between the vertices into say x, y, z triangles.
such that x + y +z = 21. We will count now
the acute angled triangle with 𝐴𝑖 as one of the Consider the diameter 𝐴1 𝑂𝐵 where B is the
vertices. For 𝐴𝑖 𝐴𝑗 𝐴𝑘 to be acute angled, 𝑗 ≤ point. Where 𝐴1 𝑂 meets the circle. If we have
11 and the distance between 𝐴𝑗 𝑎𝑛𝑑 𝐴𝑘 is less an isosceles triangle 𝐴1 as its vertex then 𝐴1 𝐵
is the altitude and the base is bisected by 𝐴1 𝐵.
than 10, here 𝑥 = 𝑗 − 1, 𝑦 = 𝑘 − 𝑗𝑎𝑛𝑑 𝑧 =
This means that the other 2 vertices
22 − 𝑘 (as we want the distance from
𝐴𝑗 𝑎𝑛𝑑 𝐴𝑘 , 𝑎𝑟𝑒 𝑒𝑞𝑢𝑎𝑙𝑙𝑦 𝑠𝑝𝑎𝑐𝑒𝑑 𝑓𝑟𝑜𝑚 𝐵.
𝐴𝑘 𝑡𝑜 𝐴1 ). The problem can be modeled as
distributing 21 identical balls’ into 3 boxes We have 10 such pairs, so we have 10
with each box getting at least one ball. This isosceles triangle with 𝐴1 as vertex of which
20×19
can be done in (21 − 3 + 2)𝐶2 = 2
= 190. one is equilateral.
But these, note that 𝑗 − 1, 𝑘 − 𝑗, 𝑎𝑛𝑑 22 −
Because proper isosceles triangles with 𝐴1 as
𝑘 𝑎𝑙𝑙 𝑚𝑢𝑠𝑡 𝑏𝑒 ≤ 10. Now, we need to find the
vertex (non equilateral) are 9. With each
number of distribution of these balls in 3
vertex 𝐴𝑖 , 𝑖 = 1, 2, … . . , 21 we have such
boxes where at least one box gets more than
isosceles triangles.
10. Note that only one box can get more than
306
So, total number of isosceles but non- 27) Find the number of integer solutions to the
equilateral triangles are 9 × 21 = 189. But equation 𝒙𝟏 + 𝒙𝟐 + 𝒙𝟑 = 𝟐𝟖 𝒘𝒉𝒆𝒓𝒆 𝟑 ≤
the 7 equilateral triangles are also to be 𝒙𝟏 ≤ 𝟗, 𝟎 ≤ 𝒙𝟐 ≤ 𝒑 𝒂𝒏𝒅 𝟕 ≤ 𝒙𝟑 ≤ 𝟏𝟕
considered as isosceles.
Sol.: considered three numbered boxes whose
∴Total number of isosceles triangle are 196. contents are denoted as 𝑥1 , 𝑥2 , 𝑥3
Note this problem can be generalized to a respectively. The problem now reduces to
polygon having n vertices. Find the number of distributing 28 balls in the three boxes such
acute, obtuse, right, isosceles and equilateral that the first box has at least 3 and not more
triangles. than 9 balls, the second box has at most 8
balls and the third box has at least 7 and at
25) Show that for any set of 10 points chosen most, 17 balls. In first put 3 balls in the first
within a square whose sides are of length box, and 7 balls in the third box. So, now the
3 units, there are two points in the set problem reduces to finding the number of
whose distance most √𝟐. distribution of 18 balls in 3 boxes such that
the first has at most (9- 3) = 6, the second at
Sol.: Divide the square into 9 unit squares as
most 8 and the third at most (17-7)=10. The
given in the figure. Out of the 10 points
number of ways of distributing 18 balls in 3
distributed in the big square, at least one of
boxes with no condition is (18+3−1 ) = (20 )=
the small squares must have at least two 3−1 2
points by the pigeon hole principle (p.p.). 190.

These two points being in a unit square, are at
[The number of ways of distributing r
the most √2 unit distance a part as √2 is the identical objects in n distinct boxes is
length of the diagonal of the unit square.
(𝑛+𝑟−1
𝑟
)(𝑛+𝑟−1
𝑛−1
) where ‘n’ stands for the
numbers of boxes and r for balls. ]
26) Show that given a regular hexagon of side
Let 𝑎1 be the distributions where the second
2cm. and 25 points inside it, there are at
box gets at least 7; 𝑑2 the distributions where
least two points among them which are at
the third gets at least 9; and 𝑑3 the
most 1 cm. distance a part.
distributions where the third gets at lest 11.
Sol.: If ABCDE is the regular hexagon of side
18 − 7 + 3 − 1 13
2cm and P, Q, R, S, T and u are respectively |𝑑1 | = | |= ( )
3−1 2
the midpoints of AB, BC, CD, DE, EF, and FA
respectively, then by joining the opposite 13 × 12 18 − 9 + 3 − 1
= = 78, |𝑑2 | = | |
vertices, and joining PR, RT, TP, UQ, QS, and 1.2 3−1
SU. We get in all 24 equilateral triangles of 11 11 × 10
=( )= = 55,
side 1 cm. 2 1.2
18 − 11 + 3 − 1 9 9×8
We have 25 points so, these 25 points inside |𝑑3 | = | |= ( )=
the hexagon ABCDEF, at least 2 points lie 3−1 2 1.2
= 36,
inside any one triangle whose sides are 1 cm
long. So, at least two points among them will 18 − 7 − 9 + 3 − 1 4
∴ 𝑑1 ∩ 𝑥𝑑2 = =
be 1cm apart. 3−1 2
= 6,
307
18 − 9 − 11 + 3 − 1 29) In base 𝟐𝒌, 𝒌 ≥ 𝟏 number system, any

|𝑑2 ∩ 𝑑3 | = ( )
3−1 3non-zero k-digit numbers are written
0 without repetition of digits. Show that two
= ( ) = 0,
2 of them have a common digit among them.
18 − 11 − 7 + 3 − 1 2 In base 𝟐𝒌 + 𝟏, 𝒌 ≥ 𝟏 among any 3k +1
|𝑑3 ∩ 𝑑1 | = = =1 digit non-zero numbers, there is a
3−1 2
common numbers occurring in any two
Therefore, |𝑑1 ∩ 𝑑2 ∩ 𝑑3 | = 0 𝑎𝑛𝑑 |𝑑1 ∪ digits.
𝑑2 ∪ 𝑑3 | = 78 + 55 + 36 − 6 − 0 − 1 +
0 = 162. Sol.: case (i): in case k = 1, we have the digits
0, 1 and the k-digit non-zero number (s) is 1
So the required number of solutions = 190 − only. Thus, all the three numbers in this case
162 = 28. are trivially the some 1.
Note that the number of ways the first box For k >1. There ‘k’ digit (non-zero) numbers
gets at most 6, the second utmost 8 and the will have altogether 3k digits and the total
third utmost 10= total number of ways of number of digits in base 2k system is 2k.
getting 18 balls distributed in 3 boxes –(the Since repetition of digit is not allowed and
numbers of ways of getting at least 7 in the 3k>2k implies that among the digits of at
first box, at least 9 in the second box and at least two of the numbers, there is at least one
least 1 in the third box) and 𝑛(𝐴 ∪ 𝐵 ∪ 𝐶) = digit common among them (by pigeon-hole
𝑛(𝐴′ ∩ 𝐵′ ∩ 𝐶 ′ ). principle)
28) If repetition of digits is not allowed in any Case(ii) in the case of k = 1,2k+1=3, the
number (in base 10) show that among three digits in base 2k+1=3 systems are 0,1
three four digit numbers two have a and 2k+1=1+1=2 and the digits non-zero
common digit occurring in them. Also, numbers here are 10, 20, 12, 21. So, we can
show that in base 7 system any two four pick up 10,20 and 12 or 10,20,20,21,……..in
digit numbers without repetition of digit each of the cases there is a common digit
will have a common number occurring in among two of them. (in fact, any two numbers
their digits. will have to a common digit 1 ) in general
case, 3 (k+1) digit numbers will have 3k+3
Sol.: In base 10, we have ten digits 0, 1, 2, 3,
digits in all. But it is a base (2k+1) system.
4,5 ,6, 7 8 and 9. Thus, for 3 digit numbers
without repetition of digits, we have to use in The numbers are written without repetition
all 12 digits but in base 10 we have just 10 of digits since 3k+ 3 > 2k+ 1. In fact, any two
digits. Thus, at least at least any two of the k+1 digit numbers could also have the same
three 4 digit numbers have a common property as 2k+2 >2k+1, again by the
number occurring in their digits by pigeon pigeon-hole principle at least two of the
hole principle. Again for base 7 system, we numbers, will have at least one common
have seven digits 0, 1, 2, 3, 4, 5, 6. For two number in their digits.
four digit numbers without repetition we
have to use eight digits and again by 30) There are certain number of all balls and
pigeonhole principle they have at least one they are painted with the following
common number in their digits. conditions:
308
(i) Every two colours appear on (condition 4 satisfied). Now, consider the four
exactly one ball. colour GRYV. No. three of these colours are
(ii) Every two balls have exactly found on a ball. (condition 3 is satisfied).
one colour in common. Thus, the total number of colour is 7 and the
(iii) There are four colours such total number of balls is also 7.
that any three of them appear
on one ball. 31) A mathematical conjection consisted of a
(iv) Each ball has three colours. part I and part II with a combined total of
Find the number of balls and 28 problems. Each contestant solved 7
colour used. problems altogether. For each pair of
problems there were exactly two
Sol.: Let us represent each of the balls by a contestants who solved both of them.
line segment with three points to show the 3 Show that there was a constants who in
colours. Thus, Roy is a ball with three colours part I solved either no problem or at least
red, orange and yellow. We have to have 4 problems.
three more balls such that on yellow. So, next
drawn lines through R, O, Y to meet at a Sol.: We will find the total number of
common point G standing for green colour. contestants. Since for each pair of problems
But the balls with colours RG, OG AND YG there were exactly two contestants let us
must have a third colour in them say indigo assume that an arbitrary problem 𝑃1 was
(i), violet (v) and Blue (B). Thus we have 7 solved by r contestants. Each of these r
balls and 7 colours in all. 7 colours R, O, Y, G, I, constestants solved 6 more problems, solving
V, B and 7 balls. 1. ROY, 2. RIG, 3. RVB, 4. Ova, 6r more problems in all counting
5. YBa, 6. YVI, 7. IBO multiplicants. Since every problem, other
than 𝑃1 , was paired with 𝑃1 and was solved by
exactly two constants, each of the remaining
27 problems (i.e. other than 𝑃1 ) is counted
twice among the problems solved by the r
contestants. i.e. 6r = 2 × 27 𝑜𝑟 𝑟 = 9.
Therefore an arbitrary problem 𝑃1 is solved
by 9 contestants.
9×28
Hence, in all we have 7
= 36 contestants,
as each contestant solves 7 problems.
Clearly any pair of the above 7 balls have From the rest of the proof, let us assume the
exactly one colour in common (satisfying countrary that is every constant solved either
condition 2). Each of the balls contribute 3 1, 2, or 3 problems in part 1.
pairs of colours. In all, we have 21 pairs of Let us assume that there are n problems in
columns in all the 7 balls. Now 7 colours lead part 1 and let x, y, z be the number of
7×6
to 2
= 21 pairs of colours and each pair of contestants who solved 1, 2, and 3 problems
colours is found in exactly one ball satisfying in part 1.
condition 1. Each ball has 3 colours
309
Since every one of the contestants solve (ii) It first 2 digits are identical.
either 1, 2, or 3 problems in part 1,
Let (i) hold. Then the sequence starts with
we get 𝑥 + 𝑦 + 𝑧 = 36 … … … (1) one of 1, 02, 12, 20, 21. First suppose that it
starts with 01. Now the condition that the
𝑥 + 2𝑦 + 3𝑧 = 9𝑛 … … … . (2) (since each sequence contain “2 consecutive identical
problem was solved by 9 contestants). digits” is symmetric w. r. t. all 3 digits 0, 1, 2.
Since every contestant among y solves of a Hence these are
1
pair of problems in part I and every 𝑎𝑛 𝑒𝑞𝑢𝑎𝑙 𝑎 𝑛𝑢𝑚𝑏𝑒𝑟, 𝑛𝑎𝑚𝑒𝑙𝑦 𝑚 = 3 𝑎𝑛−1 , of
contestants among z solves 3 pairs of sequence of length n -1 and starting with 0, 1,
problems was solved by exactly two or 2. So by appending 0 as first digit to each
contestants, we get the following equations (𝑛 − 1) sequences starting with 1, we get m
sequence of length n which start with 01.
𝑛(𝑛 − 1)
𝑦 + 3𝑧 = 2. 𝑛𝐶2 = 2. Similarly, there are m sequences of length n
2 starting with 02, 01, 12, 20 or 21.
= 𝑛(𝑛
− 1) … … … … (3) Thus there are 6𝑚 = 2𝑎𝑛−1 sequence in this
case. Let (ii) hold. Then the sequences starts
From eq.(1). Eq. (2) and Eq. (3), we get
with 00 or 11 or 22 and its remaining 𝑛 − 2
𝑧 = 𝑛2 − 10𝑛 + 36 𝑎𝑛𝑑 𝑦 = −2𝑛2 + 29𝑛 − digits can form any (𝑛 − 2) ternary sequences
29 2 23 Hence rhere are 3𝑛−2 𝑛 sequence starting
108 = −2 (𝑛 − ) − < 0.
4 8 with 00; and the same holds for 11 and 22.
As y < 0 is not an acceptable result, our Thus there are 3 × 3𝑛−2 = 3𝑛−1 sequences in
assumption is wrong. Hence, there is at least this case.
one contestants who solved either no
problem from part 1 or solved at least 4 Required recurrence relation is 𝑎𝑛 = 2𝑎𝑛−1 +
problems from part 1. 3𝑛−1 with initial conditions𝑎1 = 0, 𝑎2 = 3.
Hence 𝑎3 = 15, 𝑎4 = 57, 𝑎5 = 195, 𝑎6 = 633.

32) Find a recurrence relation for the number
𝒂𝒏 of ten nary sequence of length n that
33) For every real number 𝒙𝟏 construct the
contain 2 consecutive digits that are the
sequence 𝒙𝟏 , 𝒙𝟐 , … .. by setting 𝒙𝒏+𝟏 =
same. What are the initial conditions? Find 𝟏
𝒂𝟔 . 𝒙𝒏 (𝒙𝒏 + 𝒏) for each𝒏 ≥ 𝟏. Show that
there exists exactly one value of 𝒙𝟏 for
Sol.: Clearly, no ternary sequence of length 1 which 𝟎 < 𝒙𝒏 < 𝒙𝒏+𝟏 < 1 for every n.
can contain 2 consecutive identical digits and
so 𝑎1 = 0. Next the only ternary 2sequence of Sol.: Let 𝑃1 (𝑥) = 𝑥, 𝑃𝑛+1 (𝑛) = 𝑃𝑛 (𝑛) [𝑃𝑛 (𝑥) +
the required type are 00, 11, 22 and so 𝑎2 = 1
3. 𝐿𝑒𝑡 𝑛 ≥ 3. Every n sequence of the required 2
] 𝑓𝑜𝑟 𝑛 = 1, 2, ….
from satisfies exactly one of the following
conditions: (i) from this recursive definition, we
see inductively that (i) 𝑃𝑛 is an
(i) It first 2 digits are unequal. polynomial of degree 2𝑛−1
310
(ii) 𝑃𝑛 has positive coefficients is unique common value to that they approach
therefore an increasing convex 𝑎𝑛 < 𝑡 < 𝑏𝑛 ∀ 𝑛.
function for 𝑥 ≥ 0.
1
(iii) 𝑃𝑛 (0) = 0, 𝑃𝑛 (1) ≥ 1. Number of uniquely satisfies 1 − 𝑛 < 𝑃𝑛 (𝑡) <
(iv) 𝑃𝑛 (𝑥1 ) = 𝑥𝑛 . 1∀ 𝑛.
Since the condition 𝑥𝑛+1 > 𝑥𝑛 is equivalent to 34) Find the number of isosceles triangle with
1
𝑥𝑛 > 1 − integer sides, if no sides a exceeds 1994.
𝑛
We can reformulate the problem as follows Sol.: Let 2 equal sides of an isosceles ∆ be P
show that there is unique positive real units each and let remaining sides be q units.
1
number t such that 1 − < 𝑃𝑛 (𝑡) < 1 for Case I : P > q. q can take values 1, 2, 3, ….., P -1
𝑛
every n. (if 𝑃 − 1 > 0) condition for p, q, q be a sides
of a ∆ is automatically satisfied here, for each
Since 𝑃𝑛 is continuous and increases from 0 to positive integer P > 1, we can have P -1
a value of ≥ 1 for 0 ≤ 𝑥 ≤ 1, there is unique isosceles ∆ is
values 𝑎𝑛 and 𝑏𝑛 such that 𝑎𝑛 < 𝑏𝑛 , 𝑃𝑛 (𝑎𝑛 ) =
1 1994
1 − 𝑛 , 𝑃𝑛 (𝑏𝑛 ) = 1 … … . . (2)
∑ (𝑃 − 1) = 1 + 2 + 3 + ⋯ + 1993
𝑝=2
By definition (1)
(1993 × 1994)
=
1 1 1 1 2
𝑃𝑛+1 (𝑎𝑛 ) = (1 − ) (1 − + ) = 1 − = 1998721.
𝑛 𝑛 𝑛 𝑛
1 case II: p < q in order that p, q, may be sides
𝑃𝑛+1 (𝑎𝑛−1 ) = 1 − . 𝑊𝑒 𝑠𝑒𝑒 𝑡ℎ𝑎𝑡 𝑎𝑛
𝑛+1 of ∆ we must have 2p > q. i.e. 𝑝 < 𝑞 < 2𝑝.
< 𝑎𝑛+1 … … … . (3)
If p is even say 2m, then q can take value 1, 2,
1 …., m -1 if p is odd say 2𝑚 − 1 then q can take
𝐴𝑙𝑠𝑜 𝑠𝑖𝑛𝑐𝑒 𝑃𝑛+1 (𝑏𝑛 ) = 1 + 𝑎𝑛𝑑 𝑃𝑛+1 (𝑏𝑛+1 )
𝑛 𝑝−1
values 1, 2, …., m -1 = ( ). Numbers of
=1 2
1−1 3−1
possible isosceles ∆ is 2 + 2 + ⋯ +
𝑏𝑛 > 𝑏𝑛+1 . Since 𝑃𝑛 is convex, the graph of 1993−1
1 + 1 + 2 + 3 + ⋯ for q = 1994, p +q >p
𝑃𝑛 (𝑥) lies below, the chord 𝑦 = 𝑏𝑛
𝑥 𝑓𝑜𝑟 0 ≤ 2
𝑞
is true. Also, we must have 2 < 𝑝 < 𝑞. If q is
𝑥 ≤ 𝑏𝑛
𝑞−1 𝑞−2
even there are 𝑞 − 2
− 2 = possible
1 𝑎
𝐼𝑛 𝑝𝑎𝑟𝑡𝑖𝑐𝑢𝑙𝑎𝑟 𝑃𝑛 (𝑎𝑛 ) = 1 − 𝑛 ≤ 𝑏𝑛 from this 𝑞−1
𝑛 values for p. If q is odd, there (𝑞 − 1) − 2
−
and the fact than 𝑏𝑛 ≤ 1.we find that 𝑏𝑛 − 𝑞−1
𝑏𝑛 𝑏𝑛 1 2
= possible value for p.
𝑛
≤ 𝑎𝑛 , 𝑏𝑛 − 𝑎𝑛 ≤ 𝑛
≤ for all n.
𝑛
𝑞−2
There are in all isosceles ∑𝑞 𝑒𝑣𝑒𝑛 +
Thus we have2 in finite bounded 2
𝑞−1
sequences{𝑎𝑛 }, {𝑏𝑛 } the first is increasing the ∑𝑞 𝑜𝑑𝑑 ∆𝑠 1 ≤ 𝑞 < 1994
2
second decreasing 𝑎𝑛 > 𝑏𝑛 and the different
between their nth numbers approaches 0 as n 1 ≤ 𝑞 ≤ 1994 1 ≤ 𝑞 ≤ 1994
on creases. We conclude that there is a
311
𝑖. 𝑒. (1 + 2 + ⋯ + 996) are both even because 𝑚𝑛 is divisible by 4.

+ (1 + 2 + ⋯ + 996)∆𝑠 Imagine that the rectangle divided into unit
996.997 squares with the rows and columns formed
= 2. ∆𝑠 = 993012 ∆𝑠
2 labeled 1, ……, m and 1, ….., n write 1 in the
square (i, j) if exactly one of i and j is divisible
Total number of isosceles ∆s = 1998721+
by 4. Since the number of square in each row
993012 = 2991733.
and column is even the sum of all numbers,
35) Define a hook to be a figure made up to 6 written is even.
unit sequences as shown in the diagram or
Now 3 × 4 rectangle always covers number
any of the figures obtained by applying
with sum 3 or 7 other 12 square shape always
rotations and reflections to this, figure.
covers number with sum 5 or 7.
Find all 𝒎 × 𝒏 rectangles that can be
covered with hooks so that Consequently, the total number of 12 square
(i) The rectangle is covered without shape is even. But the 𝑚𝑛 is divisible by 24
gaps and without overlaps. and hence by 8 country to the assumption
(ii) No part of hook covers are outside that m and n are not divisible by 4. Also,
the rectangle. neither m nor n can be 1, 2, 5
Sol.: Consider a covering of an 𝑚 × 𝑛 If a tiling is possible when one of m and n is
rectangle satisfying the conditions. divisible be 4, one is divisible by 4 and m ∉ {1,
2, 5}
For any hook A there is a unique hook B
which covered the inside square of A with one Conversely, if these conditions are satisfied
of its end most squares. On the other hand the the tilling is possible (using only 3 × 4
inside square of B must be covered by an end rectangle at that)
most square of A. Thus in a tasting all hooks
are matched into pairs. This is immediate if 3 divides m and 4 divides
n. Let m be divisible by 12 and n ∉ {1, 2, 5}
There are only 2 possible way to place B so then n can be represented as the sum of
that it does not overlap with A and no gaps several 3’s and 4’s.
occur.
Hence the rectangle can be partitioned into
In one of the base A and B from 3 × 4 𝑚 × 3 and 𝑚 × 4 rectangle which are easy to
rectangle and the other case their union has cover only with 3 × 4 tiles again.
an rectangle shape with side lengths 3, 2, 1, 3,
2, 1, 2 FUNCTIONAL EQUATIONS
So an 𝑚 × 𝑛 rectangles can be covered with

hooks and only if it can be covered with the
12 square titles as discussed above. 1) If f be a function satisfying 𝒇(𝒙 + 𝒚) =
𝒇(𝒙) + 𝒇(𝒚) ∀ 𝒙, 𝒚 ∊ 𝑹 𝒂𝒏𝒅 𝒇(𝟏) = 𝒌, then
Suppose that such a tiling exists then 𝑚𝑛 is 𝒇(𝒙) where n ∊N is
divisible by 12. We now show that one of m (a) 𝒏𝒌; (b) 𝒏𝒌 ; (c) 𝒌𝒏 ; (d) none
and n is divisible by 4. Suppose on the
contrary that this is not the case then m and n
312
Sol.: Since 𝑓(𝑥 + 𝑦) = 𝑓(𝑥) + 𝑓(𝑦) . 𝑥 = 1, 𝑦 = 𝑓(𝑥) = {𝑓(𝑥) − 4 ≤ 0 ≤ 0. 𝑓(−𝑥)0 < 𝑥 ≤

1, 4}
𝑓(1 + 1) = 𝑓(1) + 𝑓(1) ⟹ 𝑓(1) = 27(1) Hence, even extension of the function from [0,
4] is 𝑓(−𝑥) = 𝑒 −𝑥 + sin(−𝑥) ⟹ 𝑓(−𝑥) =
𝑥 = 2 𝑦 = 1 𝑓(2 + 1) = 𝑓(2) + 𝑓(1) ⟹
𝑒 −𝑥 − sin 𝑥
𝑓(3) = 2𝑓(1) + 𝑓(1) = 3𝑓(1)
∴ 𝑓(𝑥) = 𝑒 −|𝑥| − sin|𝑥|
𝑥 = 2 𝑦 = 2 𝑓(2 + 2) = 𝑓(2) + 𝑓(2) ⟹
𝑓(4) = 4𝑓(1)
𝐼𝑛 𝑔𝑒𝑛𝑒𝑟𝑎𝑙, 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑓(𝑛) = 𝑛𝑓(1) 4) If 𝒇(𝒙) = 𝒙(𝟐 − 𝒙), 𝟎 ≤ 𝒙 ≤ 𝟐 and the

definition of f is extended over the set 𝑹 −
∴ 𝑓(𝑛) = 𝑛𝑘 𝑓𝑜𝑟 𝑘 = 𝑓(1) [𝟎, 𝟐]𝒃𝒚 𝒇(𝒙 + 𝟏) = 𝒇(𝒙), 𝒕𝒉𝒆𝒏 𝒇 𝒊𝒔
(a) Period 1 ; (b) non-period ;
𝝅𝒙
2) The function 𝒇(𝒙) = 𝐬𝐢𝐧 ( 𝒏! ) − (c) period 2 ; (d) none
𝝅𝒙
𝐜𝐨𝐬 {((𝒏+𝟏)!)} 𝒊𝒔
Sol.: In 𝑅 − [0, 2], 𝑤𝑒 ℎ𝑎𝑣𝑒𝑓(𝑥+2) = 𝑓((𝑥+1)+1)
(a) Not periodic; (b) period (2n!); (c)
period (n+1); (d) none ⟹ 𝑓(𝑥+2) = 𝑓(𝑥+1) = 𝑓(𝑥) {𝑔𝑖𝑣𝑒𝑛}
𝜋𝑥 𝜋𝑥 Graphically
Sol.: 𝑓(𝑥) = sin ( 𝑛! ) − cos {((𝑛+1)!)} = 𝑡1 −
𝑡2 𝑝𝑒𝑟𝑖𝑜𝑑 𝑜𝑓
2𝜋
𝑡1 = 𝜋 = 2(𝑛!) = 𝐴 (𝑠𝑎𝑦)
(𝑛!)
Period of 𝑡2 = 2((𝑛 + 1)!) = 𝐵 (𝑠𝑎𝑦)
Now, LCM of A and B is 2((𝑛 + 1)!). Hence the

function 𝑓(𝑥) is periodic with period 5) The value of the b and c for which the
2((𝑛 + 1)!). identity 𝒇(𝒙+𝟏) − 𝒇(𝒙) = 𝟖𝒙 + 𝟑 is
satisfied, where 𝒇(𝒙) = 𝒃𝒙𝟐 + 𝒄𝒙 + 𝒅, 𝒂𝒓𝒆
(a) 2, 1; (b) 4, -1; (c) 2, -2; (d) none
𝒙
3) If 𝒇: [−𝟒, 𝟎] → 𝑹 is defined by 𝒆 +
Sol.: Since, 𝑓(𝑥) = 𝑏 𝑥 2 + 𝑐𝑥 + 𝑑.
𝐬𝐢𝐧 𝒙, its even extension to [−𝟒, 𝟒] is given
by 𝑁𝑜𝑤, 𝑓(𝑥+1) − 𝑓(𝑥) = 8𝑥 + 3
(a) −𝒆−|𝒙| − 𝐬𝐢𝐧 |𝒙|; (b) 𝒆−|𝒙| − 𝐬𝐢𝐧 |𝒙|;
(c) 𝒆−|𝒙| + 𝐬𝐢𝐧 |𝒙|; (d) none ⟹ 𝑏(𝑥 + 1)2 + 𝑐(𝑥 + 1) + 𝑑 − 𝑏𝑥 2 −
𝑐𝑥 − 𝑑 = 8𝑥 + 3
Sol.: To make 𝑓(𝑥) an even function, in the
interval [−4, 4]𝑓(𝑥) can be re-defined as under ⟹ 𝑏𝑥 2 + 2𝑏𝑥 + 𝑏 + 𝑐𝑥 + 𝑐 − 𝑏𝑥 2 − 𝑐𝑥 =
8𝑥 + 3
⟹ 2𝑏𝑥 + (𝑏 + 𝑐) = 8𝑥 + 3
313
Comparing respective coefficients, we have b 1

Sol.: 2𝑓(2) − 3𝑓 (2) =
= 4, and c = -1. 1
4 … … … . . (𝑖)𝑎𝑛𝑑 2𝑓 ( ) − 3𝑓(2) =
2
1
4
… … … … (𝑖𝑖)
6) If 𝒇(𝒙) = 𝐜𝐨𝐬(𝐥𝐨𝐠 𝒙), then
3
Thus 2(ii) +3(iii), ⟹−5𝑓(2) = 8 + 4 , ⟹
𝟏 𝒙𝟐 7
𝒇(𝒙𝟐) 𝒇(𝒚𝟐) − [𝒇 ( 𝟐 ) + 𝒇(𝒙𝟐 𝒚𝟐 )] 𝑓(2) = − 4
𝟐 𝒚
𝟏
(a) -2; (b) -1; (c) ; (d) none
𝟐
9) If 𝒇(𝒙) be defined for all x > 0 and be
𝑥2 𝑥2 𝒙
Sol.: 𝑓 ( 2 ) + 𝑓(𝑥 2 𝑦 2 ) = cos (log 2 ) + continuous,. Let 𝒇(𝒙) satisfy 𝒇 ( ) =
𝑦 𝑦 𝒚
2 2 )}
cos{log(𝑥 𝑦 = cos(𝑝 − 𝑞) + cos(𝑝 + 𝑞), 𝒇(𝒙) − 𝒇(𝒚) for all x, y and 𝒇(𝒆) =
𝟏 𝒕𝒉𝒆𝒏 𝒇(𝒙) =
𝑤ℎ𝑒𝑟𝑒 𝑝 = log 𝑥 2 .
(a) Bounded; (b) 𝒙𝒇(𝒙) → 𝟏 𝒂𝒔 𝒙 →
𝑞 = log 𝑦 2 = 2 cos 𝑝 . cos 𝑞. 𝟎; (c) 𝐥𝐨𝐠 𝒙 ; (d) none
∴ 𝑅𝑒𝑞𝑑. 𝑣𝑎𝑙𝑢𝑒 = cos 𝑝 . cos 𝑞 − Sol.: If we have 𝑓(𝑥) = log 𝑥 … … … . (𝑖), then
1 𝑥
(cos 𝑝 . cos 𝑞) =0 the conditions 𝑓 (𝑦) = 𝑓(𝑥) − 𝑓(𝑦) 𝑎𝑛𝑑 𝑓(𝑒) = 1
2
are satisfied (i). 𝑓(𝑥) is not bounded as 𝑓(𝑥) is
increasing function.
𝒙𝟏 −𝒙𝟐
7) If 𝒇(𝒙𝟏) − 𝒇(𝒙𝟐) = 𝒇 ( ) 𝒇𝒐𝒓 𝒙𝟏 , 𝒙𝟐 ∈
𝟏−𝒙𝟏 𝒙𝟐
(−𝟏, 𝟏), 𝒕𝒉𝒆𝒏 𝒇(𝒙) =
𝟏−𝒙 𝟏−𝒙 𝟐𝒙 −𝟐−𝒙
(a) 𝐥𝐨𝐠 ; (b) 𝐭𝐚𝐧−𝟏 ; (c) 10) If 𝒇(𝒙) = 𝟐
, 𝒕𝒉𝒆𝒏 𝒇(𝒙+𝒚) 𝒇(𝒙+𝒚) =
𝟏+𝒙 𝟏+𝒙
𝟏 𝟏
𝟏−𝒙 (a) {𝒇(𝟐𝒙) + 𝒇(𝟐𝒚) }; (b) 𝟐 {𝒇(𝟐𝒙) − 𝒇(𝟐𝒚) };
𝐜𝐨𝐭 −𝟏 𝟏+𝒙 ; (d) none 𝟐
𝟏
(c) 𝟐 {𝒇(𝟐𝒚) − 𝒇(𝟐𝒙) }; (d) none
Sol.: For (a) is correct is because LHS =
1−𝑥 1−𝑥 (1−𝑥 )(1+𝑥 )
log 1+𝑥1 − log (1+𝑥2 ) = log (1+𝑥1 )(1−𝑥2 ) 𝑎𝑛𝑑 2𝑥+𝑦 +2−(𝑥+𝑦)
1 2 1 2
Sol.: 𝑓(𝑥 + 𝑦) − 𝑓(𝑥 − 𝑦) = { 2
} ×
2𝑥−𝑦 +2−(𝑥−𝑦) 1
(𝑥 −𝑥 )
{1− 1 2 }
1−𝑥1 𝑥2 (1−𝑥 )(1+𝑥 ) { 2
} = 4 (22𝑥 + 2−2𝑥 + 22𝑦 + 2−2𝑦 )
𝑅𝐻𝑆 = log (𝑥1 −𝑥2 ) = log (1+𝑥1 )(1−𝑥2 ) .
{1+ } 1 2
1−𝑥1 𝑥2
1
= {𝑓(2𝑥) + 𝑓(2𝑦) }
2
𝟏
8) If 2 𝒇(𝒙) − 𝟑𝒇 (𝒙) = 𝒙𝟐 , 𝒙 is not equal to
zero, then 𝒇(𝟐) = 11) If f is even function defined on the interval
(a) -1;
𝟕
(b) − 𝟒; (c) 0; (d)none (−𝟓, 𝟓) then the real values of x satisfying
𝒙+𝟏
the equation 𝒇(𝒙) = 𝒇 ( ) are
𝒙−𝟏
−𝟏±√𝟓 −𝟐±√𝟓
(a) 𝟐
; (b) 𝟐
; (c) 0; (d) none
314
𝑥+1 𝑥+1
Sol.: 𝑓(𝑥) = 𝑓 (𝑥+2) , ⟹ 𝑥 = 𝑥+2 , ⟹ 𝑥 2 + 2𝑥 =
−1±√5
𝑥 + 1, ⟹ 𝑥 = . Both lie in (−5, 5). (SUBJECTIVE TYPE)
2
For an even function: 𝑓(𝑥) = 𝑓(−𝑥) , ⟹ −𝑥 = 1) Find all subjection functions f: No → No

𝑥+1 with the property that for all 𝒏 ≥ 𝟎, 𝒇(𝒏) ≥
;
𝑥+2 𝒏 + (−𝟏)𝒏
⟹ 𝑥 2 − 2𝑥 = 𝑥 + 1; ⟹ 𝑥 2 + 3𝑥 + 1 = Sol.: If we let 𝑔: 𝑁𝑜 → 𝑁𝑜, 𝑔(𝑛) = 𝑥 + (−1)𝑛 ,
0,
then g satisfies the equation. Moreover, g is
−3±√5 bijective. We will show that for any solution f
⟹𝑥= which lies in (−5, 5).
2 we must have f = g.
12) If 𝒇(𝒙) = 𝒙𝒆𝒙(𝟏−𝒙), then 𝒇(𝒙) is In fact , we will prove a more general
𝟏 property, namely that if f and g are two
(a) Increasing on [− 𝟐 , 𝟏]; (b) decreasing
𝟏 functions defined on the non-negative
on [− 𝟐 , 𝟏]; (c) increasing on R; (d) integers such that 𝑓(𝑛) ≥ 𝑔(𝑛) for all n, and f is
none subjective and bijective, then f = g. The proof
is based on the wall ordering of the set of
Sol.: 𝑓 ′ (𝑥) = 𝑒 𝑥(1−𝑥) . (1 + 𝑥 − 2𝑥 2 ) =
positive integers, namely on the fact that any
−𝑒 𝑥(1−𝑥) . (𝑥 − 1)(2𝑥 + 1) set of positive integers has a smallest
element.
𝑎𝑛𝑑 𝑒 𝑥(1−𝑥) > 0∀ 𝑥, 𝑓(𝑥) 𝑖𝑠 𝑑𝑒𝑐𝑟𝑒𝑎𝑠𝑖𝑛𝑔. ⟹
𝑓 ′ (𝑥) < 0, Assume f ≠ g, and let no be such that 𝑓(𝑛0) >
𝑔(𝑛0) If we let M= 𝑔(𝑛0) , then the set A =
1
⟹ (𝑥 − 1)(2𝑥 + 1) < 0, ⟹ − 2 ≤ 𝑥 ≤ 1. {𝑘, 𝑔(𝑘) ≤ 𝑛} has exactly M +1 elements, since
g is bijective. On the other hand, since, 𝑓 ≥ 𝑔
13) If 𝒇(𝒙) = {𝒙(𝒙 − 𝟑)}𝟐 increase for the and no does not belong to A, the set B =
values of x lying the interval {𝑘, 𝑓(𝑘) ≤ 𝑀} is included in A but has at least
(a) 𝟏 < 𝑥 < 3; (b) 𝟎 < 𝑥 < ∞; (c)
one less element, namely no. Hence the values
−∞ < 𝑥 < 0; (d) none
of f do not exhaust all numbers less than M
𝑑𝑦 +1. Which contradicts the subjectivity of f.
Sol.: 𝑑𝑥 = 2𝑥(𝑥 − 3)(2𝑥 − 3) and for
Therefore, 𝑓(𝑛) = 𝑔(𝑛) = 𝑛 + (−1)𝑛 is the
increasing,
only solution.
𝑑𝑦 3
> 0, ⟹ 0 < 𝑥 < , 3 < 𝑥 < ∞,
𝑑𝑥 2
3
⟹ 𝐼𝑛 𝑃𝑎𝑟𝑡𝑖𝑐𝑢𝑙𝑎𝑟 0 < 𝑥 < 2. 2) Find all function f: N →N with the property
that 𝒇{𝒇(𝒎) + 𝒇(𝒏) } = 𝒎 + 𝒏 for all m and
n.
Sol.: The solution is done by manipulating the

equation and plugging in particular values for
the variables.
315
Thinking of 𝑓(𝑚) 𝑎𝑛𝑑 𝑓(𝑛) as positive integers. 𝑓(𝑛) = 0. A backwards induction shows that,
We have 𝑓(𝑓(𝑓(𝑚) + 𝑓(𝑛) ) + 𝑓(𝑘) ) = 𝑓(𝑚) + 𝑓(𝑛−1) = 𝑓(𝑛−2) = ⋯ = 𝑓(0) = 0
𝑓(𝑛) + 𝑘 on the other hand by using the given
Hence in order for f not be identically zero,
relation for f
there must exist m such that 𝑔(𝑘) = 0 for all
𝑓(𝑚) + 𝑓(𝑛) + 𝑓(𝑘) 𝑤𝑒 𝑜𝑏𝑡𝑎𝑖𝑛 k≥ 𝑚.
𝑓(𝑚 + 𝑛 + 𝑓(𝑘) ) = 𝑓(𝑓 𝑓(𝑚) + 𝑓(𝑛) + Assume m minimal, that is, 𝑔(𝑚−1) ≠ 0, then
𝑓(𝑘) ) = 𝑓(𝑚) + 𝑓(𝑛) + 𝑘 on the one hand, 𝑓(𝑘) = 0 𝑓𝑜𝑟 𝑘 ≥ 𝑚 − 1, and
on the other hand 𝑓(𝑘) = 2𝑘−𝑚 𝑓(𝑚) 𝑓𝑜𝑟 𝑘 >
For m = n = 0 this reduces to 𝑓(𝑓(𝑘) ) = 𝑚, 𝑠𝑜 𝑓𝑜𝑟 𝑘 ≥ 𝑚 the function is strictly
2𝑓(0) + 𝑘. increasing. This together with 𝑓(𝑛) +
𝑓(𝑛+𝑔(𝑛)) = 𝑓(𝑛+1) implies that 𝑛 + 𝑔(𝑛)
Also for k = 0 and m, n arbitrary, we have
cannot exceed m; hence 𝑔(𝑛) > 𝑚 − 𝑛. Thus
𝑓(𝑚 + 𝑛 + 𝑓(0) ) = 𝑓(𝑚) + 𝑓(𝑛) . all other solutions (𝑓. 𝑔)𝑠𝑎𝑡𝑖𝑠𝑓𝑦 𝑓(0) − 𝑓(1) =
⋯ = 𝑓(𝑚−1) = 0,
𝐻𝑒𝑛𝑐𝑒 𝑓 (𝑓(𝑚 + 𝑛 + 𝑓(0) )).
𝑓(𝑘) = 2𝑘−𝑚 𝑎 𝑓𝑜𝑟 𝑘 ≤ 𝑚 and a arbitrary,
The left hand side of this equality is equal to and 𝑔(𝑘) ≤ 𝑚 − 𝑘, 𝑓𝑜𝑟 𝑘 ≤ 𝑚, 𝑔(𝑘) =
2𝑓(0) + 𝑚 + 𝑛 + 𝑓(0) and the right hand side is 0 𝑓𝑜𝑟 𝑘 ≥ 𝑚.
equal to m +n. It follows that 𝑓(0) = 0 and for
all m, n, 𝑓(𝑚+𝑛) = 𝑓(𝑚) + 𝑓(𝑛) , that is, f is
additive. Choose m = 1 and use induction to 4) Let F: N→ be such that 𝒇(𝒏+𝟏) > {𝒇(𝒏) } for
show that 𝑓(𝑛) = 𝑓(1) 𝑛 . From 𝑓(𝑓(𝑚) + 𝑓(𝑛) ) = all n ∊ N. Show that 𝒇(𝒏) = 𝒏 ∀ 𝒏 ∊ 𝑵.
𝑚 + 𝑛 one obtains 𝑓(1)2 (𝑚 + 𝑛) = 𝑚 + 𝑛, for
Sol.: This problem might look easy to people
all m, n. This can happen only if 𝑓(1) = 1, so
familiar with the axiomatic description of the
the only solution to the functional equation is
set of positive integers. The solution uses
the identity function f: N→ N, 𝑓(𝑛) = 𝑛
again the property that every set of natural
3) Find all pairs of functions f, g: N → N numbers has a smallest element.
satisfying 𝒇(𝒏) + 𝒇{𝒏 + 𝒈(𝒏) } = 𝒇(𝒏+𝟏) Let us look at the set
{𝑓(𝑓(1) ), 𝑓(2) , 𝑓(𝑓(2) ), 𝑓(3) , 𝑓(𝑓(3) ), 𝑓(𝑛) , 𝑓(𝑓(𝑛) ), … . }
Sol.: One possibility is that f is identically
equal to 0 and g is arbitrary. Another Note that these are, exactly the numbers that
possibility is that g is identically equal to zero
appear in the inequality 𝑓(𝑓(𝑛) ) < 𝑓(𝑛+1). This
and 𝑓(𝑛) = 2𝑛 𝑓(0) .
set has a smallest element, which cannot be of
Let us find the remaining pairs of functions. the from 𝑓(𝑛+1) because then it, would be
Note that the identically implies 𝑓(𝑛+1) ≥ 𝑓(𝑛) larger than 𝑓(𝑓(𝑛) ). Thus it is of the form
for all n; hence f is increasing. If for a certain 𝑓(𝑓(𝑛) ). The same argument shows that for
n, 𝑔(𝑛) ≥ 1, then 𝑓(𝑛+1) ≤ 𝑓(𝑛+𝑔(𝑛)) ; hence this n, 𝑓(𝑛) =
1. 𝐼𝑓 𝑛 𝑖𝑡𝑠𝑒𝑙𝑓 𝑤𝑒𝑟𝑒 𝑔𝑟𝑒𝑎𝑡𝑒𝑟 𝑡ℎ𝑎𝑛 1, 𝑤𝑒 𝑤𝑜𝑢𝑙𝑑 𝑔𝑒𝑡 1 =
316
𝑓(𝑛) > 𝑓(𝑓(𝑛−1) ), which is impossible. Hence ℎ𝑒𝑛𝑐𝑒 𝑓(𝑓(𝑛) ) 𝑓(𝑛+2) = 0, which is impossible.
𝑓(1) = 1 𝑎𝑛𝑑 𝑓(𝑛) > 1 𝑓𝑜𝑟 𝑛 > 1. Therefore 𝑓(𝑛) 𝑓𝑜𝑟 𝑛 > 1. we use induction to
show that 𝑓(𝑓(𝑛) ) < 𝑓(𝑛+1) . The inequality is
Considering the restriction𝑓: {𝑛 ≥ 2} → {𝑛 ≥
true for n =1, since 𝑓(2) > 1 =
2}, the same argument applies maintains
mutadis to show that 𝑓(2) = 2 𝑎𝑛𝑑 𝑓(𝑛) > 𝑓(𝑓(1) ). 𝐴𝑙𝑠𝑜 𝑖𝑓 𝑓(𝑛+1) > 𝑓(𝑓(𝑛) ), then 𝑓(𝑛+1) ≥
2 𝑓𝑜𝑟 𝑛 > 2. By induction one shows that 𝑓(𝑓(𝑛) )+1.
𝑓(𝑘) = 𝑘 , 𝑎𝑛𝑑 𝑓(𝑛) 𝑘 𝑓𝑜𝑟 𝑛 > 𝑘 thus the unique
Hence 𝑓(𝑓(𝑛) )𝑓(𝑛+2) + 1 ≥ 𝑓(𝑓(𝑛+1) )𝑓(𝑓(𝑛) ) +
solution to the problem is identify function.
𝑓(𝑓(𝑛+1) ). Since 𝑛 + 1 > 1, 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑓(𝑛+1) >
5) Find all functions f: N →N with the 1, 𝑡ℎ𝑢𝑠 𝑓(𝑓(𝑛+1) ) > 1, which implies that
𝟏
property that for all n ∊ N, + 𝑓(𝑛+2) > 𝑓(𝑓(𝑛+1) ).
𝒇(𝟏) 𝒇(𝟐)
𝟏 𝟏 𝒇{𝒇(𝒏) }
+ ⋯+ 𝒇 = Therefore the function satisfies 𝑓(𝑛+1) >
𝒇(𝟐) 𝒇(𝟑) (𝒏) 𝒇(𝒏+𝟏) 𝒇(𝒏+𝟏)
𝑓(𝑓(𝑛) ) for all N. In view of problem 6, the
Sol.: The equality from the statement reminds only function with this property is the
1 1
us of the well-known identify + + ⋯ + identify function, and we done.
1.2 2.3
1 𝑛
𝑛(𝑛+1)
= 𝑛+1, which shows that the function f:
N → N, 𝑓(𝑛) = 𝑛 is a solutions.
6) Find all function f : No → No satisfying
Let us prove that this is only function with the following two conditions: (ii) For any m , n
required property. ∊𝑵𝟎 , 𝒘𝒊𝒕𝒉 𝒎 ≥ 𝒏, 𝒇(𝒎𝟐) ≥ 𝒇(𝒏𝟐) (i) for
𝟐
(𝑓(𝑛) ) any m, n ∊𝑵𝟎 , 𝟐𝒇(𝒎𝟐 + 𝒏𝟐 ) = {𝒇(𝒎) } +
The ratio 𝑓 𝑓 remainds us of the previous 𝟐
(𝑛+1) {𝒇(𝒏) } ;
problem. In fact, we will reduce the present
problem to the previous one. Sol.: Substituting successively m = 0 and n =
0 in (a) and subtracting the two relations
Plugging in n = 1 into the given relation
yields 𝑓(𝑚)2 − 𝑓(𝑛)2 = 2 (𝑓(𝑚2 ) ) (𝑓(𝑛2 ) )
yields
which together with (b) implies that f is
𝑓(𝑓(1) )𝑓(1) = 1; 𝑙ℎ𝑒𝑛𝑐𝑒 𝑓(1) = 1. increasing i.e. if 𝑚 ≥ 𝑛, then 𝑓(𝑚) ≥ 𝑓(𝑛) .
Plugging m = n = 0 into (b) yields 𝑓(0) =
Replacing the given equality for into the one
0 𝑜𝑟 1.
for n+1 we obtain
Case I : 𝑓(0) = 1, 𝑡ℎ𝑒𝑛 2𝑓(𝑚2 ) = 𝑓(𝑚2 ) + 1, so
𝑓(𝑓(1) ) 1 𝑓(𝑓(𝑛+1) )
+ = 𝑓(1) = 1 𝑝𝑙𝑢𝑔𝑔𝑖𝑛𝑔 𝑚 = 𝑛 = 1 in (a) we get
𝑓(𝑛+1) 𝑓(𝑛+1) 𝑓(𝑛+2) 𝑓(𝑛+2)
1
𝑓(2) = 1. 𝐴𝑙𝑠𝑜 𝑓(2𝑛 ) = 2 (𝑓(22𝑛−1 )2 + 1). This
𝑇ℎ𝑖𝑠 𝑖𝑠 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑡 𝑡𝑜 𝑓(𝑓(𝑛) )𝑓(𝑛+2) + 1 = implies that 𝑓(2𝑘) = 1 for all non-negative
𝑓(𝑓(𝑛+1) )𝑓(𝑛+1) 𝑁𝑜𝑡𝑒 𝑡ℎ𝑎𝑡 𝑓(𝑛+1) = integers k. By the monotonicity of f, we
1 𝑖𝑚𝑝𝑙𝑖𝑒𝑠 𝑡ℎ𝑎𝑡 𝑓(𝑓(𝑛+1) ) = 1; conclude that 𝑓(𝑛) = 1for all non-negative
integers n.
317
Case II : 𝑓(0) = 0. 𝑇ℎ𝑒𝑛 2𝑓(𝑚2 ) = z, then 𝒇(𝒎) = 𝒇(𝒏) ; (ii) 𝒇(𝒎𝒏) = 𝒇(𝒎) 𝒇(𝒏)
𝑓(𝑚2 ) 𝑓(𝑚) 2 for all m, n ∊z.
𝑓(𝑚2 ) 𝑜𝑟 = ( ) 𝑠𝑖𝑛𝑐𝑒 𝑓(2) = 𝑓(1)2 ,
2 2
we obtain Sol.: Show first that 𝑓(0) = 0 𝑜𝑟 𝑓(𝑛) = 1
for all n ∊ z consider non constant
2
𝑓(22𝑛 ) 𝑓(22𝑛−1 )2 𝑓(22𝑛−1 ) solution of the given equation. Show that
=( )= ( )
2 2 2 𝑓(𝑘𝑝) = 0 for all integers k. Using Fermat’s
𝑓(2) 2 little theorem, prove that 𝑓(𝑚) = 𝑓(𝑚) 𝑝 for
=⋯= ( )
2 each integer m. This 𝑓(𝑚) = 0 𝑜𝑟 𝑓(𝑚) =
𝑓(1)2𝑛+1 ±1. Choose m = a, a primitive root, with
= .
22𝑛 respect to p, Then 𝑓(𝑎) ≠ 0. Consider the
On the other hand, (a) implies that 𝑓(1) = cases 𝑓(𝑎) = 1 𝑎𝑛𝑑 𝑓(𝑎) = −1 separately.
𝑓(1)2 . So either 𝑓(1) = 0 𝑜𝑟 𝑓(1) = 2 𝑝
0 𝑖𝑓
𝑓(𝑛) ≡ 0, 𝑓(𝑛) ≡ 1, 𝑓(𝑛) ={ 𝑛
If 𝑓(1) = 0, the above chain of equalities 1 𝑖𝑓 𝑝 × 𝑛
implies that 𝑓(22𝑛 ) = 0 𝑓𝑜𝑟 𝑛 ≥ 0.
Monotonicity implies that f is identically 0 𝑖𝑓 𝑝/𝑛
𝑓(𝑛) = {1 𝑖𝑓 𝑝 × 𝑛 , 𝑛 𝑖𝑠 𝑎 𝑠𝑞𝑢𝑎𝑟𝑒
equal to zero.
1 𝑖𝑓 𝑝 × 𝑛, 𝑛 𝑖𝑠 𝑛𝑜𝑡 𝑠𝑞𝑢𝑎𝑟𝑒
𝑓(𝑚2 )
If 𝑓(1) = 2, 𝑡ℎ𝑒𝑛 𝑓(22𝑛 ) = 2. 22𝑛 . 𝑆𝑖𝑛𝑐𝑒 2
= The last function is precisely Legendre’s
𝑓(𝑚) 2 symbol.
( 2
) 𝑓(𝑚) is always even. We
have𝑓(𝑚+1) 2 = 2𝑓(𝑚 + 1)2 ≥ 2𝑓(𝑚2 + 1) =
𝑓(𝑚)2 + 𝑓(1)2 > 𝑓(𝑚)2 . which implies that
8) Find all the function f : z → z which
𝑓(𝑚+1) > 𝑓(𝑚) .
satisfies the equation 𝒇(𝒂𝟑 + 𝒃𝟑 + 𝒄𝟑 ) =
Consequently, 𝑓(𝑚+1) − 𝑓(𝑚) − 2 ≥ 0 {𝒇(𝒂)𝟑 + 𝒇(𝒃)𝟑 + 𝒇(𝒄) }𝟑
2𝑛−1
𝐵𝑢𝑡 ∑2𝑚=0 (𝑓(𝑚+1) − 𝑓(𝑚) − 2) = 𝑓(22𝑛 ) − Sol.: Show that 𝑓(0) = 0 and hence 𝑓(𝑥) =
−𝑓(𝑥) for all x∊ z. Prove that 𝑓(1) = −1, 0 𝑜𝑟 1
𝑓(0) − 2. 22𝑛 =
and hence 𝑓(2) = 2𝑓(1) 𝑓(3) = 3𝑓(1) . 𝐹𝑜𝑟 𝑥 > 3
0 𝑣𝑎𝑟𝑦𝑖𝑛𝑔 𝑛 𝑤𝑒 𝑐𝑜𝑛𝑐𝑙𝑢𝑑𝑒 𝑡ℎ𝑎𝑡 𝑓(𝑚+1) =
prove that 𝑥 3 is a sum of five cubes has
𝑓(𝑚) + 2 for all 𝑚 ≥ 0. Thus 𝑓(𝑛) =
absolute value smaller than x, using the
2𝑛 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ∊ 𝑁0 .
identity. (2𝑘 + 1)3 = (2𝑘 − 1)3 + (𝑘 + 4)3 +
𝐼𝑛 𝑐𝑜𝑚𝑐𝑙𝑢𝑠𝑖𝑜𝑛, 𝑓(𝑛) identically equal to zero. (4 − 𝑘)3 + (−5)3 + (−1)3 using this
𝑓(𝑛) identically equal to 1, or 𝑓(𝑛) = 2𝑛 for all representation, prove that 𝑓(𝑥) = 𝑥𝑓(1) .
n, are the only possible solutions.
𝑓(𝑥) = −𝑥, 𝑓(𝑥) = 0 𝑜𝑟 𝑓(𝑥) = 𝑥
7) Let P be a given odd prime. Find all

9) For what integers k, there exists a
functions f: z → z satisfying the following
functions f : N →z which satisfies, (i)
conditions (i) If m = n (mod p) for m, n ∊
318
f(1995) = 1996 and (ii) 𝒇(𝒙𝒚) = 𝒇(𝒙) + We start by computing the value of 𝑓(3) . Since
𝒇(𝒚) + 𝒌𝒇{𝐠𝐜𝐝(𝒙, 𝒚)} for all x, y ∊N? the function is increasing, 𝑓(3) 𝑓(5) = 𝑓(15) <
𝑓(18) = 𝑓(2) 𝑓(9) ℎ𝑒𝑛𝑐𝑒 𝑓(3) 𝑓(5) <
Sol.: Using (b), get an expression for 𝑓(𝑥 2 ) 2𝑓(9) 𝑎𝑛𝑑 𝑓(9) < 𝑓(10) = 𝑓(2) 𝑓(5) = 2𝑓(5).
and hence for 𝑔(𝑥 4 ). Using 𝑥 4 = 𝑥. 𝑥 3 , 𝑥 3 =
Combining the two inequalities we get
𝑥. 𝑥 2 , get another expression for 𝑔(𝑥 4 ). Show
𝑓(3) 𝑓(5) < 4𝑓(5) ℎ𝑒𝑛𝑐𝑒 𝑓(3) < 4. We also have
that k = 0 or -1. Using prime decomposition,
that 𝑓(3) > 𝑓(2) = 2; thus 𝑓(3) can be equal
define if f suitably for these value of k.
only to 3.
Since 2 and 3 are relatively prime, we deduce

10) The set of all positive integers is the union that 𝑓(6) = 6, and from monotinicity it follows
of two disjoint subsets : that 𝑓(4) = 4 𝑎𝑛𝑑 𝑓(5) = 5. We will prove by
𝑵{𝒇(𝟏) , 𝒇(𝟐) , … , 𝒇(𝒏) , … } ∪ induction that 𝑓(𝑛) = 𝑛 for all n ∊ N. For n =
{𝒈(𝟏) , 𝒈(𝟐) , … . , 𝒈(𝒏) , … }𝒘𝒉𝒆𝒓𝒆 𝒇(𝟏) < 1, 2, 3, 4, 5, 6 the property is true, as shown
𝒇(𝟐) < ⋯ < 𝒇(𝒏) … , 𝒈(𝟏) < 𝒈(𝟐) < ⋯ < above. Let n > 6 and assume that 𝑓(𝑘) = 𝑘 <
𝒈(𝒏) 𝒂𝒏𝒅 𝒈(𝒏) = 𝒇{𝒇(𝒏) } + 𝟏; 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒏 ≥ 𝑛. Let us show that, 𝑓(𝑛) = 𝑛. Consider
𝟏. 𝒇𝒊𝒏𝒅 𝒇(𝟐𝟒𝟎) . 2𝑟 (2𝑚 + 1) to be the smallest even integer
greater than or equal to n that is not a power
Sol.: Show that 𝑓(1) = 1 𝑎𝑛𝑑 𝑔(1) = of 2. This number is equal either to n, 𝑛 +
2. 𝑆𝑢𝑝𝑝𝑜𝑠𝑒 𝑓(𝑛) = 𝑘 for some n. Show that the 1, 𝑛 + 2 𝑜𝑟 𝑛 + 3, and since n >6, both
disjoint sets 2𝑟 𝑎𝑛𝑑 2𝑚 + 1 are strictly less than n.
{𝑓(1) , 𝑓(2) , … , 𝑓(𝑘) }𝑎𝑛𝑑 {𝑔(1) , 𝑔(2) , … . , 𝑔(𝑛) } ,
Hence 𝑓(2𝑟 (2𝑚 + 1)) = 𝑓(2𝑟 )𝑓(2𝑚 + 1) =
together exhaust all the number from 1 to
2𝑟 (2𝑚 + 1) by the induction hypothesis.
𝑔(𝑛) . Conclude that 𝑔(𝑛) = 𝑘 + 𝑛. Prove that
From monotonicity and the fact that are
𝑓(𝑘) = 𝑘 + 𝑛 − 1 . Show also that no two
exactly 2𝑟 (2𝑚 + 1) values that the function
consecutive integers lie in the set
can take in the interval [1, 2𝑟 (2𝑚 + 1)] it
{𝑔(𝑚) : 𝑚 ∊ 𝑁}. Conclude that 𝑓(𝑘+1) = 𝑘 + 𝑛 follows that 𝑓(𝑘) = 𝑘 𝑓𝑜𝑟 𝑘 ≤ 2𝑟 (2𝑚 + 1). In
use these three implication to get 𝑓(240) = particular, 𝑓(𝑛) = 𝑛, and the proof is finished.
388.
12) Find a bijective function f: No →No such

11) If f: w → N be a strictly increasing function that for all m, n; 𝒇(𝟑𝒎𝒏 + 𝒎 + 𝒏) =
such 𝒇(𝟐) = 𝟐 𝒂𝒏𝒅 𝒇(𝒎𝒏) = 𝒇(𝒎) 𝒇(𝒏) for 𝟒𝒇(𝒎) 𝒇(𝒏) + 𝒇(𝒎) + 𝒇(𝒏)
every relatively prime pair of natural
numbers m and m. Show that 𝒇(𝒏) = Sol.: The solutions, as in the case of the
𝒏 𝒇𝒐𝒓 𝒆𝒗𝒆𝒓𝒚 positive integer n. previous problem, uses of the factorization of
positive integers. Suppose that a function f
Sol.: One can easily see that 𝑓(𝑛) = 𝑛 satisfies having the required property has been found.
the given property. Let us show this is the We use f to be defined a function.
only function. The proof is based on
factorizations of positive integers.
319
𝑔: 3𝑁0 + 1 → 4𝑁0 + 1 𝑏𝑦 𝑔(𝑥) primes, their product lies in 𝑛 ∈ 4 𝑁0 + 1.

𝑥−1 The multiplicavity of g follows easily.
= 4𝑓 ( )+1
3
This is certainly well defined and one can

check immediately that g is a bijection from 13) Find whether there exists a function f: N →
3𝑁0 → 1 onto 4𝑁0 → 1. with the inverse N such that 𝒇{𝒇(𝒏) } = 𝒏𝟐 − 𝟏𝟗𝒏 + 𝟗𝟗 for
𝑦−1 all positive integer n.
function given by 𝑔− (𝑦) = 3𝑓 −1 ( 4
)+
1. 𝐹𝑜𝑟 𝑚, 𝑛 ∈ 𝑁0 by using the definition of f Sol.: Such a function does exist. Let 𝑃(𝑛) =
and g, we obtain 𝑛2 − 19𝑛 + 99 𝑎𝑛𝑑 𝑛𝑜𝑡𝑒 𝑡ℎ𝑎𝑡 𝑃(𝑛) =
𝑔(3𝑚 + 1)(3𝑛 + 1) = 𝑔(3(3𝑚𝑛 + 𝑚 + 𝑛) +
𝑃(19 − 𝑛)𝑎𝑛𝑑 𝑡ℎ𝑎𝑡 𝑝(𝑛) ≥ 9 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ∈ 𝑁.
1) = 4𝑓(3𝑚𝑛 + 𝑚 + 𝑛) + 1
we first set 𝑓(9) = 𝑓(10) = 9 𝑎𝑛𝑑 𝑓(8) =
= 4(4𝑓(𝑚) 𝑓(𝑛) + 𝑓(11) = 11. (one could alternatively set 𝑓(9) =
𝑓(𝑚) +𝑓(𝑛) ) +1= (4𝑓(𝑚) + 1) + 1 𝑓(10) = 11 𝑎𝑛𝑑 𝑓(8) = 𝑓(11) = 9)
= (4𝑓(𝑚) + 1)(4𝑓(𝑛) + Write 𝑃(𝑛) (𝑘) for the kth composite of P. That
1) = 𝑔(3𝑚 + 1)𝑔(3𝑛 + 1). is 𝑃(𝑛) (0) = 𝑛 𝑎𝑛𝑑 𝑃(𝑛) (𝑘+1) =
𝑝(𝑛) (𝑘) . 𝐹𝑜𝑟 𝑛 ≥ 12, 𝑙𝑒𝑡 𝑔(𝑛) be the smallest
This g is multiplicative, in the case sense that
integer k such that n is not in the image of
𝑔(𝑥𝑦) = 𝑔(𝑥) 𝑔(𝑦) 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥, 𝑦 ∊ 3𝑁0 + 1.
𝑃(𝑘) . Such a k exists because a side from 9 and
Conversely, given any multiplicative bijection 11, every integer in the image of
from 3𝑁0 + 1 𝑜𝑛𝑡𝑜 4𝑁0 + 1, we can construct 𝑃(𝑛) (𝑘) 𝑓𝑜𝑟 𝑘 > 0 is greater than or equal to
a function f having the required property by 𝑃(12) (𝑘) , and an easy induction shows that
letting 𝑓(𝑥) = (𝑔(3𝑥 + 1)). 𝑃(𝑚) (𝑘) > 𝑛 + 𝑘 𝑓𝑜𝑟 𝑛 ≥ 12.
It remains only to exhibit such a bijection. Let Let 12= 𝑆1 ≤ 𝑆2 ≤ ⋯ be the integers greater
𝑃1 𝑎𝑛𝑑 𝑃2 denotes the sets of primes of the for than or equal to 12, not in the image of P, in
3n +1 and 3n +2, respectively and let creasing order. Then for every integer 𝑛 ≥ 12,
𝑄1 𝑎𝑛𝑑 𝑄2 denote the sets of primes of the there exists a unique integer h(n) such that
form 4n +1 and 4n +3 respectively. Since
𝑛 = 𝑃(𝑔(𝑛) ) 𝑆(𝑛(𝑛))
each of these sets is infinite, there exists a
bijection h from 𝑃1 ∪ 𝑃2 𝑡𝑜 𝑄1 ∪
𝐹𝑜𝑟 𝑛 ≥ 12, 𝑠𝑒𝑡
𝑄2 𝑡ℎ𝑎𝑡 𝑚𝑎𝑝𝑠 𝑃1 bijectively onto 𝑄1 𝑎𝑛𝑑 𝑄2 .
Define g as following 𝑔(1) = 1 , 𝑎𝑛𝑑 𝑓𝑜𝑟 𝑛 > 𝑃(𝑔(𝑛) )(𝑆 ℎ(𝑛) + 1)ℎ(𝑛) 𝑜𝑑𝑑
1, 𝑛 ∈ 3 𝑁0 + 1, let the prime factorization of 𝑓(𝑛) = {
𝑃(𝑔(𝑛)+1 ) (𝑆 ℎ(𝑛) − 1) ℎ(𝑛) 𝑒𝑣𝑒𝑛
n be n = ∏ 𝑝𝑖 (with possible repititions among
the 𝑝𝑖 ′𝑠), then define 𝑔(𝑛) = ∏ ℎ(𝑝𝑖 ). 𝐹𝑜𝑟 𝑛 ≤ 7, 𝑝𝑢𝑡 𝑓(𝑛) = 𝑓(19−𝑛) . To show that
𝑓(𝑓(𝑛) ) = 𝑃(𝑛)
Note that g is well –defined, because if 𝑛 ∈
3 𝑁0 + 1, then there must be an even number We need only consider 𝑛 ≥ 12, and we may
of 𝑃2 type primes that divide n. Each of these examine two cases. If h(n) is odd, then
primes gets mapped by h to a prime in 𝑄2 , 𝑔(𝑓(𝑛) ) = 𝑔(𝑛) 𝑎𝑛𝑑 ℎ(𝑓(𝑛) ) = ℎ(𝑛) +
and since there are an even number of such
320
1 𝑖𝑠 𝑒𝑣𝑒𝑛, 𝑠𝑜 𝑓(𝑓(𝑛) ) = 𝑓 (𝑃(𝑔(𝑛) ) (𝑆 ℎ(𝑛) + also happen that 𝑓(𝑥) = 𝑥 + 1 for some real
number x and 𝑓(𝑦) = 𝑦 − 1 for some other
1)) = 𝑃 (𝑔(𝑛)+1) 𝑆 ℎ(𝑛) = 𝑃(𝑛)
real number y. We have to resolve this before
concluding anything. 𝑆𝑢𝑝𝑝𝑜𝑠𝑒
Similarly, if h(n) is even, then 𝑔(𝑓(𝑛) ) =
𝑔(𝑛+1) 𝑎𝑛𝑑 ℎ(𝑓(𝑛) ) = ℎ(𝑛) − 1𝑖𝑠 𝑜𝑑𝑑, 𝑓(𝑥0 ) = 𝑥0 − 1
𝑠𝑜 𝑓(𝑓(𝑛) ) = 𝑓𝑃(𝑔(𝑛) +1) (𝑠 ℎ(𝑛) − 1) = 𝑓𝑜𝑟 𝑠𝑜𝑚𝑒 𝑟𝑒𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑥0 . 𝑇ℎ𝑒𝑛 𝑢𝑠𝑖𝑛𝑔 (3)
(𝑔𝑛 +1)
𝑃 ( 𝑠 ℎ(𝑛) ) = 𝑃(𝑛)
𝑎𝑛𝑑 (2), 𝑤𝑒 𝑔𝑒𝑡 1 + 𝑥02 = 𝑓(𝑥02 ) = 𝑓(𝑥0 )2 −
2𝑥0 = (𝑥0 − 1)2 − 2𝑥0 = 𝑥0 2 − 4𝑥0 +
1. 𝑇ℎ𝑖𝑠 𝑓𝑎𝑐𝑒𝑠 𝑥0 = 0. but the we obtain 1 =
14) Find all functions f : R→ R which obey the 𝑓(0) = 𝑓(𝑥0 ) = 𝑥0 − 1 = −1, which is absurd,
equation 𝒇{(𝒙 − 𝒚)𝟐 } = {𝒇(𝒙) }𝟐 − we concluded that 𝑓(𝑥) = 𝑥 + 1 for real
𝟐𝒙𝒇(𝒚) + 𝒚𝟐 . number x.
Sol.: One can easily guess that 𝑓(𝑥) = 𝑥 is a If follows that 𝑓(𝑥) = 𝑥 and 𝑓(𝑥) = 𝑥 + 1 and
solution of this functional equation. Are there the only solutions of the given functional
any other solutions which are not obvious but equation.
hidden in the equation? Indeed there is one
more solution, 𝑓(𝑥) = 𝑥 + 1 which is not
apparent from the equation. We see that for 15) If f : R →R be a function such that (i)
the function, 𝑓(𝑥) = 𝑥 + 1 𝑤𝑒 ℎ𝑎𝑣𝑒 𝒇(𝒙+𝒚) = 𝒇(𝒙) + 𝒇(𝒚) ∀ 𝒙, 𝒚 ∊ 𝑹 𝒂𝒏𝒅 (ii)
𝟏 𝒇(𝒙)
𝑓((𝑥−𝑦)2 ) = (𝑥 − 𝑦)2 + 1 = 𝑥 2 − 2𝑥𝑦 + 𝑦 2 + 𝒇 ( 𝒙) = 𝒙𝟐
∀ 𝒙 ≠ 𝟎, 𝒔𝒉𝒐𝒘 𝒕𝒉𝒂𝒕 𝒇(𝒙) =
1, 𝑎𝑛𝑑 𝒄𝒙 ∀ 𝒙 ∈ 𝑹 where c is constant.
𝑓(𝑥)2 − 2𝑥𝑓(𝑦) + 𝑦 2 = (𝑥 + 1)2 − Sol.: It is easy to check that (a) gives 𝑓(0) =
2𝑥(𝑦 + 1) + 𝑦 2 = 𝑥 2 − 2𝑥𝑦 + 𝑦 2 + 1. 0 𝑎𝑛𝑑𝑓 𝑓(−𝑥) = −𝑓(𝑥) for all real x, we know,
1 1
for x ≠ 0 and x ≠ 1, the identity 𝑥−1 − 𝑥 =
How do we compute these two and other if
1
any? Put y = 0 in (1) to obtain 𝑓(𝑥 2 ) = 𝑥(𝑥−1)
𝑓(𝑥)2 − 2𝑥𝑓(0) 𝑎𝑛𝑑 𝑝𝑢𝑡 𝑥 = 0 to get, 𝑓(𝑦2 ) +
𝑓(0)2 + 𝑦 2 . This in conjunction with the property (a)
gives
𝑇𝑎𝑘𝑖𝑛𝑔 𝑦 = 0 𝑖𝑛 (3)𝑤𝑒 𝑠𝑒𝑒 𝑡ℎ𝑎𝑡 𝑓(0)2 =
1 1 1
𝑓(0) 𝑔𝑖𝑣𝑖𝑛𝑔 𝑓(0) = 0 𝑜𝑟 𝑓(0) = 1. 𝑇𝑎𝑘𝑖𝑛𝑔 𝑥 = 𝑦 𝑓( )−𝑓( ) = 𝑓( )
𝑥−1 𝑥 𝑥(𝑥 − 1)
in (1), we obtain 𝑓(0) = 𝑓(𝑥)2 − 2𝑥𝑓(𝑥) + 𝑥 2 =
(𝑓(𝑥) − 𝑥)2 Now an application of (b) yields
𝐼𝑓 𝑓(0) = 0, then the above relation shows 𝑓(𝑥 − 1) 𝑓(𝑥) 𝑓(𝑥(𝑥 − 1))
− 2 = 2
(𝑥 − 1)2 𝑥 𝑥 (𝑥 − 1)2
that 𝑓(𝑥) = 𝑥 for all x ∊R. If 𝑓(0) =
1, 𝑡ℎ𝑒𝑛 𝑓(𝑥) − 𝑥 = ±𝑖 𝑎𝑛𝑑 ℎ𝑒𝑛𝑐𝑒 𝑓(𝑥) = 𝑥 ± 1, 𝑇ℎ𝑖𝑠 𝑠𝑖𝑚𝑝𝑙𝑖𝑓𝑖𝑒𝑠 𝑡𝑜
which sign should we choose here? It may
321
𝑥 2 𝑓(𝑥 − 1) − (𝑥 − 1)2 𝑓(𝑥) = 𝑓(𝑥 2 − 𝑥) I𝑓 𝑓(1) ≠ 1, 𝑡ℎ𝑒𝑛 𝑤𝑒 𝑔𝑒𝑡 𝑓(𝑥) =

𝑓(0) (𝑓(1) +1)
,
𝑓(1) −1
If we use (a) and 𝑓(−𝑦) = showing that f is constant function. Since we
−𝑓(𝑦) ℎ𝑒𝑟𝑒, 𝑤𝑒 𝑜𝑏𝑡𝑎𝑖𝑛 have ruled out constant function. We
conclude that 𝑓(1) = 1 and hence 𝑓(0) = 0.
𝑓(𝑥 2 ) + 𝑥 2 𝑓(1) = 2𝑥𝑓(𝑥) .
Now replacing y by 𝑥 − 2 in (i), we obtain
𝑓(𝑥) +𝑓(𝑥−2)
1
Replacing x by 𝑥 + (𝑥) and simplifying, we 𝑓(𝑥−1) = 𝑓 … … . (2)
(𝑥) −𝑓(𝑥−2)
𝑓(2) +2𝑓(1)
obtain 𝑓(𝑥) = ( 4
) 𝑥,valid for all x ≠ 0 If we replace x by 𝑥 − 1 and y by 1 in (1), we
and x ≠ 1. get
Putting x = 2 in this relation, we see that 𝑥 𝑓(𝑥+1) + 1

𝑓( )= , … … . (3)
𝑓(2) = 2𝑓(1) Thus we obtain 𝑓(𝑥) = 𝑓(1)𝑥 , for 𝑥−2 𝑓(𝑥−1) − 1
all x ≠ 0 and x ≠ 1.
Where we have used 𝑓(1) = 1. If we use the
This remains valid for x = 0 and x = 1 as may value of
be seen by inspection. 𝑓(𝑥−1) 𝑓𝑟𝑜𝑚 (2)𝑖𝑛 (3)𝑎𝑛𝑑 𝑠𝑖𝑚𝑝𝑙𝑖𝑓𝑦, 𝑤𝑒 𝑔𝑒𝑡 𝑓 (𝑥−2) =
𝑥
𝑓(𝑥)
The above problems reveal the fact that using … … … . . (4)
𝑓(𝑥−2)
simple manipulations, we can solve some
functional equations on R. We have not A comparison of (3) and (4) shows that
exactly effectively used any structure of R to
arrive at the solution, next few problems tell 𝑓(𝑥−1) +1
𝑓(𝑥) = 𝑓(𝑥−2) {𝑓 } … … … . . (5) putting
(𝑥−1) −1
us how to use the known structure(s) of real
numbers to solve equations. x = 3 in (3), we get
16) Let f : R →R is a function such that 𝑓(2) + 1

𝑓(3) = .
𝒙+𝒚 𝒇(𝒙) +𝒇(𝒚) 𝑓(2) − 1
𝒇 (𝒙−𝒚) = 𝒇 , 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒙 ≠ 𝒚. Show
(𝒙) −𝒇(𝒚)
that 𝒇(𝒙) = 𝒙, 𝒇 𝒙 ∊ 𝑹 𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝑡ℎ𝑒 𝑠𝑢𝑏𝑠𝑡𝑖𝑡𝑢𝑡𝑖𝑜𝑛 𝑥 = 4 𝑖𝑛 (4) leads

to 𝑓(4) = 𝑓(2)2 . Taking x = 5 in (5).
Sol.: we use similar techniques here as in the
𝑓(4) +1
earlier problem but in a more subtle way. We We also obtain 𝑓(5) = 𝑓(3) = {𝑓 }=
(4) −1
start with the observation that such a
𝑓(2) +1 𝑓(2)2+1 𝑓(2)2 +1
function is one−one and hence cannot be {𝑓 }{
−1 𝑓
}= 2 .
(2) (2)2 −1 (𝑓(2)2 −1)
constant on any interval. Otherwise the right
hand side is not defined since the However we can also express 𝑓(5) in a
denominator reduces to zero. 3+2
different way using (1). 𝑓(5) = 𝑓 ( ) =
3−2
𝑓(𝑥) +𝑓(0) 𝑓(3) +𝑓(2)
Taking y = 0 in (1). We obtain 𝑓(1) = using the expression for
𝑓(𝑥) −𝑓(0) 𝑓(3) −𝑓(2)
𝑓(3) , 𝑤ℎ𝑖𝑐ℎ we have obtained earlier, we get
This can be solved for 𝑓(𝑥) to get
𝑓(2)2 +1
𝑓(5) = 1+2𝑓 2
(2) −𝑓(2)
𝑓(𝑥) (𝑓(1) − 1) = 𝑓(0) (𝑓(1) + 1).
322
Comparing two expressions for 𝑓(5) , we see that maps non-negative reals to non-negative
that (𝑓(2) − 1)2 = 1 + 2𝑓(2) − 𝑓(2)2 . reals, since f is one-one and 𝑓(0) = 0. We
conclude that 𝑓(𝑥) > 0. Whenever x > 0.
The quadratic equation for 𝑓(2) simplifies to Suppose x > y we consider different cases:
𝑓(2)2 = 2𝑓(2). (a) suppose x > y≥ 0. Here we obtain
We conclude that 𝑓(2) = 0 𝑜𝑟 𝑓(2) = 𝑓(𝑥) +𝑓(𝑦) 𝑥+𝑦

= 𝑓 (𝑥−𝑦) > 0, showing that
𝑓(𝑥) −𝑓(𝑦)
2. 𝑠𝑖𝑛𝑐𝑒 𝑓 𝑖𝑠 𝑜𝑛𝑒 − 𝑜𝑛𝑒 𝑎𝑛𝑑 𝑓(0) = 0, we
𝑓(𝑥) > 𝑓(𝑦). (b) Suppose y< 0<x. In this
cannot have 𝑓(2) = 0.
case 𝑓(𝑦) < 0 𝑎𝑛𝑑 𝑓(𝑥) > 0 show that
The only possibility is 𝑓(2) = 2. 𝑓(𝑦) < 𝑓(𝑥) .
This is the most difficult and important step is (𝑐)𝑐𝑜𝑛𝑠𝑖𝑑𝑒𝑟 the case y < x < 0. Then 0 <
getting a solution of our problem. The set −𝑥 < −𝑦 and by (a), we conclude that
follows familiar track. We compute 𝑓(3) = 𝑓(−𝑥) < 𝑓(−𝑦).
3, 𝑓(4) = 4 𝑎𝑛𝑑 𝑓(5) = 5. Suppose 𝑓(𝑘) = 𝑘 for
all natural numbers 𝑘 < −= 𝑛, where n is a Using the fact that f is an odd function, this
natural number. reduces to 𝑓(𝑦) < 𝑓(𝑥) . It follows that f is a
strictly increasing function on R. Since 𝑓(𝑟) =
𝑓(𝑛) +1 𝑟 for all rational number r, we obtain 𝑓(𝑥) = 𝑥
Then (5) shows that 𝑓(𝑛+1) = 𝑓(𝑛−1) { }
𝑓(𝑛) −1
for real number x.
𝑆𝑖𝑛𝑐𝑒 𝑓(𝑛−1) = 𝑛 − 1 𝑎𝑛𝑑 𝑓(𝑛) = 𝑛, we obtain
𝑓(𝑛+1) = 𝑛 + 1. We conclude that 𝑓(𝑛) = 𝑛 for
all natural numbers n. Replacing y by 𝑥𝑧 in 17) Find all f : R →R such that 𝒇(𝒇(𝒙) + 𝒚) =
(1), we get 𝒇(𝒙𝟐 − 𝒚) + 𝟒(𝒙)𝒚 ∀ 𝒙, 𝒚 ∈ 𝑹.
𝑥 + 𝑥𝑧 1+𝑧 1 + 𝑓(𝑧) Sol.: It is easy to check that 𝑓(𝑥) ≡
𝑓( ) = 𝑓( )= ,
𝑥 − 𝑥𝑧 1−𝑧 1 − 𝑓(𝑧) 0 𝑎𝑛𝑑 𝑓(𝑥) = 𝑥 2 are solutions of this problem.
𝑤ℎ𝑒𝑟𝑒 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑢𝑠𝑒𝑑 (1) again, comparing We show that these are the only solutions of
these two expressions and solving for 𝑓(𝑥𝑧), the problem.
we obtain 𝑓(𝑧𝑥) = 𝑓(𝑧) 𝑓(𝑥) . 𝐴 𝑝𝑟𝑖𝑜𝑟𝑖 this is Suppose 𝑓(𝑎) ≠ 𝑎2 for some a. Replacing by y
valid for x ≠ 0 and z ≠ 1. But since 𝑓(0) = (𝑥 2 −𝑓(𝑥) )
in (1) by , 𝑤𝑒 𝑔𝑒𝑡 𝑓(𝑥) (𝑥 2 − 𝑓(𝑥) ) = 0.
0 𝑎𝑛𝑑 𝑓(1) = 1, we see that this multiplicative 2
property is valid for all x, z in R. Taking 𝑦 =

𝑆𝑖𝑛𝑐𝑒 𝑓(𝑎) ≠ 𝑎2 , 𝑖𝑡 𝑓𝑜𝑙𝑙𝑜𝑤𝑠 𝑡ℎ𝑎𝑡 𝑓(𝑎) = 0. This
−𝑥 in (1), we see that 𝑓(0) =
𝑓(𝑥) +𝑓(𝑦)
also shows that a ≠ 0, for then 𝑎2 = 0 = 𝑓(𝑎)
, 𝑔𝑖𝑣𝑒𝑛 𝑢𝑠 𝑓(−𝑥) = −𝑓(𝑥). This f is also contradicting the choice of a. We further
𝑓(𝑥) −𝑓(𝑦)
an odd function. Since 𝑓(𝑛) = 𝑛 for all natural observe that 𝑓(𝑥) = 0 𝑜𝑟 𝑓(𝑥) = 𝑥 2 for any x.
numbers n, now it follows that 𝑓(𝑘) = 𝑘 for all In any case 𝑓(0) = 0. 𝑇𝑎𝑘𝑖𝑛𝑔 𝑥 = 0 in (1), we
integers k. This with multiplicativity (6) get 𝑓(𝑦) = 𝑓(−𝑦) .
implies that 𝑓(𝑟) = 𝑟 for all rational number r.
Putting x = a and replacing y by –y, we also
Since (6)implies that 𝑓(𝑥 2 ) = 𝑓(𝑥)2 . It follows
see that 𝑓(𝑎2 +𝑦) = 𝑓(−𝑦) = 𝑓(𝑦)
323
Thus f is periodic with period 𝑎2 . This implies Since there can be at most one fixed point of
that 𝑓(𝑓(𝑥) ) = 𝑓(𝑓(𝑥) + 𝑎2 ) = 𝑓(𝑥 2 −𝑎2 ) + 𝑓(𝑥) in (-1, 0). We conclude that
4𝑓(𝑥) 𝑎2 . Putting y = 0 in (1) we get another
2𝑢 + 𝑢2 = 𝑢. 𝑇ℎ𝑖𝑠 𝑓𝑜𝑟𝑐𝑒𝑠 𝑢(𝑢 + 1) = 0, we
expression 𝑓(𝑓(𝑥) ) = 𝑓(𝑥 2 ) contradicting the assumption that u ∊(-1, 0).
It follows that there is no fixed point of 𝑓(𝑥) in
Invoking the periodicity of f. we note that
(-1, 0). Similar analysis shows that 𝑓(𝑥) has no
𝑓(𝑥) 𝑎2 = 0
fixed in (0, ∞) as well. Thus 0 is the only
However, we have observed that a ≠0 by our possible fixed point of 𝑓(𝑥) if at all it has any.
choice of a. It follows that if 𝑓(𝑥) ≠ 𝑥 2 , then we However taking x = y in (i), we see that
must have 𝑓(𝑥) ≡ 0. This completes our claim 𝑓(𝑥 + 𝑓(𝑥) + 𝑥𝑓(𝑥) ) = 𝑥 + 𝑓(𝑥) +
and determines all the solutions of the 𝑥𝑓(𝑥) 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥 ∊ (−1, ∞). Thus each 𝑥 +
problem. 𝑓(𝑥) + 𝑥𝑓(𝑥) , 𝑥 ∊ (−1, ∞) is a fixed point of f.
We conclude that 𝑥 + 𝑓(𝑥) + 𝑥𝑓(𝑥) = 0 for all
x∊ (-1, ∞) we see that
18) Find all f: (−𝟏, ∞) → (−𝟏, ∞) such that the 𝑦 𝑥𝑦 𝑥−𝑦
function 𝑥 + 𝑓(𝑦) + 𝑥𝑓(𝑦) = 𝑥 − − = .
1+𝑦 1+𝑦 1+𝑦
(i) 𝒇{𝒙 + 𝒇(𝒚) + 𝒙𝒇(𝒚) } = 𝒚 + 𝒇(𝒙) +
𝒚𝒇(𝒙) , 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒙, 𝒚 ∊ (−𝟏, ∞) 𝑇ℎ𝑢𝑠 𝑤𝑒 𝑜𝑏𝑡𝑎𝑖𝑛 𝑓(𝑥 + 𝑓(𝑦) + 𝑥𝑓(𝑦) )
𝒇(𝒙) 𝑥−𝑦 𝑦−𝑥
(ii) is strictly increasing on each of = 𝑓( )= .
𝒙 1+𝑦 1+𝑦
the intervals (-1, 0) and (0, ∞)
𝑥
It follows that 𝑓(𝑥) = − ( ) indeed satisfies
Sol.: Let f: (−1, ∞) → (−1, ∞) be a function of 1+𝑥
𝑓(𝑥) (a) we can easily check that is also satisfied
the desired type since is strictly
𝑥 (b).
increasing on the interval (-1, 0) the equation
𝑓(𝑥) = 𝑥 can have at most one solution in (0, The fixed points, can also be used in proving
∞). Moreover x = 0 may be a solution in non-existence of solutions to some functional
𝑓(𝑥) = 𝑥. Thus the equation 𝑓(𝑥) = 𝑥 can have equations. The following problem illustrates
at most three solution in (−1, ∞). In other this point.
words, there are at most three fixed points of
𝑓(𝑥) in the domain (−1, ∞).
19) Find all functions f: R →R such that
Suppose u ∊ (-1, 0) is a fixed point of 𝑓(𝑥). 𝒇{𝒙 − 𝒇(𝒚) } = 𝒇{𝒇(𝒚) } + 𝒙𝒇(𝒚) + 𝒇(𝒙) − 𝟏
Thus we have 𝑓(𝑢) = 𝑢. Taking x = y = u in holds for all x, y ∊R.
(a). we see that 𝑓(2𝑢 + 𝑢2 ) = 2𝑢 + 𝑢2 . This
shows that 2𝑢 + 𝑢2 is also a fixed point 𝑓(𝑥). 𝑥2
Sol.: We easily see that 𝑓(𝑥) = 1 − 2
satisfies
We claim that 2𝑢 + 𝑢2 is also a fixed point is the equation (1), We show that this is the
in the interval (-1, 0). In fact 2𝑢 + 𝑢2 = only function which obey the relation (1). Let
𝑢(2 + 𝑢) < 0. Since u <0 and 2+u>1>0 S denote the range of f. Put c = 𝑓(0) . Taking x
because u>-1. On the other hand 2𝑢 + 𝑢2 >
= y= 0 in (1), we obtain
−1 because 2𝑢 + 𝑢2 + 1 = (𝑢 + 1)2 > 0.
324
𝑓(−𝑐) = 𝑓(𝑐) + 𝑐 − 1 𝑦0 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑓(𝑦0 ) ≠ 0. 𝑇𝑎𝑘𝑖𝑛𝑔 𝑥 =

1
𝑎𝑛𝑑 𝑦 = 𝑦0 𝑖𝑛 (1), 𝑤𝑒 𝑜𝑏𝑡𝑎𝑖𝑛 𝑓(𝑥 −
This shows that c ≠ 0. Taking x = 𝑓(𝑦) in (1), 𝑓(𝑦0 )
we also get c = 𝑓(𝑥) + 𝑥 2 + 𝑓(𝑥) − 1. 𝑓(𝑦0 ) ) = 𝑓(𝑓(𝑦0 ) ) + 𝑓(𝑥) . 𝑆𝑒𝑡𝑡𝑖𝑛𝑔 𝑥 − 𝑓(𝑦0 ) =

𝑎, 𝑎𝑛𝑑 𝑓(𝑦0 ) = 𝑏, 𝑤𝑒 𝑜𝑏𝑡𝑎𝑖𝑛 𝑓(𝑎) = 𝑓(𝑏) + 𝑓(𝑥)
𝑐+1
This gives 𝑓(𝑥) = 2
− 𝑥 2 … … … . . (2)
𝑐−1
whenever x = 𝑓(𝑦) Thus (4) gives 𝑔(𝑥) + 2
− 𝑔(𝑥 − 𝑓(𝑎) ) =
𝑐−1
𝑔(𝑥 − 𝑓(𝑏) − 𝑓(𝑥) ) = 𝑔(𝑥 − 𝑓(𝑏) ) + 2
=
This determines f on s, the range of f. Taking y
= 0 in (1), we get 𝑓(𝑥 − 𝑐) = 𝑓(𝑐) + 𝑐𝑥 + 𝑔(𝑥) + 𝑐 − 1.
𝑓(𝑥) − 1 It follows that c = 1 and now (4) shows that
This can be written in the form 𝑓(𝑥 − 𝑐) − 𝑔(𝑥 − 𝑓(𝑦) ) = 𝑔(𝑥) , for all reals x, y. Thus we
𝑓(𝑥) = 𝑐𝑥 + 𝑓(𝑐) − 1 consider the set obtain that every element in the range of f is a
period for g. However putting 𝑓(0) = 𝑐 =
{𝑐𝑥 + 𝑓(𝑐) − 1; 𝑥 ∊ 𝑅}. Since c ≠ 0, it follows
1
that this set is R itself. Thus we conclude that 1 𝑖𝑛 (3), we obtain 𝑓(1) = 𝑓(𝑓(0) ) = 2. Also
{𝑓(𝑥 − 𝑐) − 𝑓(𝑥) ; 𝑥 ∊ 𝑅} = 𝑅. We use this to taking y = 0 in (1), we see that 𝑓(𝑥−1) = 𝑥 +
1 1
determine f on R. Fix any x ∊ R. we find 𝑓(𝑥) − 2. We have proved that 2 , 𝑓(𝑥) 𝑎𝑛𝑑 𝑥 +
𝑦1 , 𝑦2 ∈ 𝑆 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑥 = 𝑦1 − 𝑦2 . 𝐿𝑒𝑡 𝑦2 = 1
𝑓(𝑥) − 2 are periods of g. Since a linear
𝑓(𝑥2 ) . 𝑇ℎ𝑒𝑛𝑓(𝑥) = 𝑓(𝑦1 − 𝑓(𝑥2 ) ) = 𝑓( 𝑓(𝑥2 ) ) +
combination of several periods is again a
𝑦2 𝑓(𝑥2 ) + 𝑓(𝑦1 ) − 1 = 𝑓(𝑦2 ) + 𝑦1 𝑦2 + 𝑓(𝑦1 ) −
period, x it self is period for g.
1.
Since this is true for every real number x, we
But we know f on s: from (2) we see that
conclude that g is constant function. However
𝑐+1 𝑦2 2 𝑐+1 𝑦1 2
𝑓(𝑦2 ) = 2
− 2
, 𝑓(𝑦1 ) =
2
− 2
. Putting 𝑔(0) = 𝑓(0) = 1 𝑎𝑛𝑑 𝑤𝑒 𝑔𝑒𝑡 𝑔(𝑥) ≡ 1. The
(𝑦 −𝑦 )2 𝑥2
these values, we obtain 𝑓(𝑥) = 𝐶 − 2 2 1 = definition of g shows that 𝑓(𝑥) = 1 − 2
.
𝑥2
𝐶− .
2 Some of the functional equations may require
a single or a combination of several ideas in
Comparing these expressions, we conclude
their solutions. This is illustrated in the
that c = 1.
solution of the following few problems.
𝑥2
Thus we obtain 𝑓(𝑥) = 1 − , for all x ∊ R
2
Alternate Solution: As in the first solution, we 20) Find all functions f : [𝟏, ∞) → [𝟏, ∞) which
take c = 𝑓(0) . Putting x = 𝑓(𝑦) in (1), we can satisfy,
𝑐+1−𝑓(𝑦)2 (i) 𝒇(𝒙) ≤ 𝟐(𝟏 + 𝒙)∀𝒙 ∈ [𝟏, ∞);
solve for 𝑓(𝑓(𝑦) ): 𝑓(𝑓(𝑦) ) = 2
… … . . (3)
𝟐
(ii) 𝒙𝒇(𝒙+𝟏) = {𝒇(𝒙) } − 𝟏∀ 𝒙 ∈
𝑥2 [𝟏, ∞).
𝐼𝑛𝑡𝑟𝑜𝑑𝑢𝑐𝑖𝑛𝑔 𝑔(𝑥) = 𝑓(𝑥) + 2
it is easy to
𝑐−1
compute 𝑔(𝑥 − 𝑓(𝑦) ) = 𝑔(𝑥) + 2 Sol.: It is easy to verify that 𝑓(𝑥) = 𝑥 + 1
satisfies both (a) and (b). We show that is the
Note that the given equation has no constant only solutions.
solutions. Thus we may find
325
We have 𝑓(𝑥)2 = 𝑥𝑓(𝑥 + 1) + 1 ≤ By an easy induction, we see that 𝑓(𝑥0 +𝑘) <
2 𝑥0 − 𝑘 + 1
𝑥(2(𝑥 + 1)) + 1 = 1 + 4𝑥 + 2𝑥 <
2(1 + 2𝑥 + 𝑥 2 ) = 2(1 +
If k is large enough, then 𝑓(𝑥0+𝑘) < 1. This
𝑥)2 . 𝐼𝑡 𝑓𝑜𝑙𝑙𝑜𝑤𝑠 𝑡ℎ𝑎𝑡 𝑓(𝑥) < √2(1 + 𝑥) using
contradiction forces 𝑓(𝑥) = 1 + 𝑥 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥 ∈
this fresh bound, we obtain
[1, ∞)
𝑓(𝑥)2 = 𝑥𝑓(𝑥 + 1) + 1 < √2𝑥 (2 + 𝑥) + 1
In some cases the functional relation may
= √2𝑥 2 + 2√2𝑥 + 1 reveal some useful information about the
< √2(𝑥 2 + 2𝑥 + 1) function.
= √2(𝑥 + 1)2
Thus we obtain another bound; 𝑓(𝑥) <

1 GEOMETRY
24 (𝑥 + 1).
1) The length of a rectangle is increasing by
Continuing by induction, we arrive at 𝑓(𝑥) < 60%. By what percent would the width
1
22𝑘 (1 + 𝑥), 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑘 ∈ 𝑁, 𝑎𝑛𝑑 𝑥 ∈ [1, ∞). have to be decreased to maintain the same
area?
It follows that 𝑓(𝑥) ≤ 1 + 𝑥 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥 ∈ [1, ∞) (a) 37.5% (b) 37% (c) 75% (d)
none
𝑆𝑢𝑝𝑝𝑜𝑠𝑒 𝑓(𝑥0 ) < 1 + 𝑥0 𝑓𝑜𝑟 𝑠𝑜𝑚𝑒 𝑥0 ∈ [1, ∞).
Let 𝑓(𝑥0 ) = 1 + 𝑥0 −∈ 𝑤ℎ𝑒𝑟𝑒 0 <∈< 𝑥0 , we Sol.: Let the length = x and breadth = y
then have
∴ Area = 𝑥𝑦
𝑓(𝑥0 )2 − 1 160𝑥 8𝑥
𝑓(1+𝑥0 ) = New length = =
𝑥0 100 5
(1 + 𝑥0 −∈)2 − 1
= 𝑥0 − 2 Let the new breadth be y
𝑥0
∈2 − 2 ∈ ∴
8𝑥
× 𝑐 = 𝑥𝑦.
∈ +2 + ≤ 𝑥0 − 2 5
𝑥0
∈ +2+∈ −2 = 𝑥0 −∈< 𝑥0 8𝑥
𝑜𝑟, 5
× 𝑐 = 𝑥𝑦
Using this bound we get 5𝑦 3𝑦
∴ decreases in breadth = 𝑦 − 8
= 8
𝑓(𝑥0 + 1)2 − 1 𝑥0 2 − 1
𝑓(𝑥0 +2) = < < 𝑥0 − 1. 3𝑦 1
𝑥0 + 1 𝑥0 + 1 ∴ 𝐷𝑒𝑐𝑟𝑒𝑎𝑠𝑒 % = × × 100 = 37.5%
8 𝑦
This is turn implies that
𝑓(𝑥0 + 2)2 − 1 (𝑥0 − 1)2 − 1 2) On the two square fields, the area of one is
𝑓(𝑥0 +3) = <
𝑥0 + 2 𝑥0 + 2 1 heal are, while the other one is border by
𝑥0 (𝑥0 − 2) 2%. The different in their areas is
= < 𝑥0 − 2
𝑥+2 (a) 𝟒𝟎𝟎𝒎𝟐 ; (b) 404𝒎𝟐 ; (c) 410 𝒎𝟐
; (d) none
326
Sol.: Each side of a square field is 5) The interior angles of a hexagon are in the
2
√1 ℎ𝑒𝑐𝑡𝑎𝑟𝑒 √10,000 𝑚 = 100𝑚. ratio 1 :2 :2: 3: 2: 2, then the largest angle
∴ each side of the second square field is is
(100 + 100 × 1%)𝑚 = 102𝑚. (a) 150°; (b) 170°; (c) 180°; (d)
Thus the area is (102𝑚)2 = 10,404𝑚2 none
∴ Required area = (10,404 − 10,000)𝑚2 = Sol.: The sum is interior angles of a hexagon =
404𝑚2. (2 × 6 − 4)90° = 720°
3) The diagonal of a square A is (x+y). The
diagonal of a square B with twice the area Now let its angles be x, 2x, 2x, 3x, 2x, 2x
of A is respectively
(a) √(𝒙 + 𝒚); (b) √(𝟐𝒙 + 𝒚); (c)
∴ 𝑥 + 2𝑥 + 2𝑥 + 3𝑥 + 2𝑥 + 2𝑥 = 720.
√(𝒙 + 𝟐𝒚); (d) none
Sol.: If a is a side of the square A, then 2𝑎2 = ∴ 12𝑥 = 720°, 𝑥 = 60°

(𝑥 + 𝑦)2 … … . . (𝑖)
∴ 𝑇ℎ𝑒 𝑙𝑎𝑟𝑔𝑒𝑠𝑡 𝑎𝑛𝑔𝑙𝑒 = 3𝑥 = 3 × 60° = 180°
∴ Area of the square 𝐵 = 2 × Area of square A
=2 × (2𝑎2 ) = 4𝑎2 . 𝐵𝑢𝑡 4𝑎2 = 2(𝑥 + 𝑦)2 from 6) The difference between the interior and
(i) exterior angles of a regular polygon is 60°.
∴ Side of the square B = √2(𝑥 + 𝑦) The polygon is
(a) Hexagon; (b) Octagon; (c)
4) If the base of a rectangle is increased by
10% and the area is unchanged, then the Decagon; (d) none
corresponding altitude must be decreased
by Sol.: Let the polygon be n-sided.
𝟏
(a) 10%; (b) 𝟗 (𝟏𝟏) %; (c) 11% ; (d)
Thus, per the condition given
none
(2𝑛 − 4) × 90 360
− = 60
Sol.: Area of the rectangle is 𝑥𝑦 where x is 𝑛 𝑛
base and y is itself. Second time area is
𝑜𝑟, (2𝑛 − 4)90 − 360
𝑥
(𝑥 + 10
) 𝑦′ where y’ is height. = 60𝑛 𝑜𝑟 180𝑛 − 720
= 60𝑛
1𝑥 ′ 10
.𝑦 = 𝑦
10 11 𝑜𝑟, 𝑛=6
10
∴ Altitude decreased = 𝑦 − 11 𝑦 = ∴The polygon is a hexagon.
9 9
𝑦 𝑖. 𝑒. % is decreased.
11 11
327
7) As ABC and DBC are on the same base BC. 𝑎+𝑏

Sol.: By rule,
2
AL ⊥BC and DM ⊥BC. Then area ∆ ABC :
Area ∆DBC is 11) The radius of a circle is 5 cm. Two chords
(a) AO : AD; (b) 𝑨𝑶𝟐 : 𝑶𝑫𝟐 ; (c) AO : of length 6 cm and 8 cm, respectively are
OD ; (d) none drawn parallel to each other. Then the

distance between the chord is
1
𝐴𝑟𝑒𝑎 (∆𝐴𝐵𝐶) .𝐵𝐶.𝐴𝐿 𝐴𝐿 𝐴𝑂
Sol.: 𝐴𝑟𝑒𝑎 (∆𝐷𝐵𝐶) = 2
1 = 𝐷𝑀 = 𝑂𝐷 (a) 1cm; (b) 3 cm; (c) 4 cm; (d) none
.𝐵𝐶.𝐷𝑀
2
Sol.: In the figure, OC = 5 cm = OA

(as ∆ALO ∆ DMO are similar)
1 1
CM = 2 𝐶𝐷 = 2 8𝑐𝑚 = 4 𝑐𝑚
∴ The needed ratio = AO: OD.
1 1
𝑨𝑩
8) If in ∆ABC and ∆ DEF 𝑫𝑬 = 𝑬𝑭 = 𝑫𝑭 = 𝟑,
𝑩𝑪 𝑨𝑪 𝟐 𝐴𝑁 = 2 𝐴𝐵 = 2 6 𝑐𝑚 = 3𝑐𝑚
then area ∆ABC : area ∆DEF is ∴ 𝑂𝑁 2 = 𝑂𝐴2 − 𝐴𝑁 2 = 52 − 32 =

(a) 2: 3; (b) 4: 9; (c) 3: 2; (d) none 25 − 9 = 16
Sol.: Since ∆ABC ∼ ∆DEF ⟹ 𝑂𝑁 = 4
𝐴𝑟𝑒𝑎 𝑜𝑓 ∆𝐴𝐵𝐶 𝐴𝐵2 𝐵𝐶 2 𝐴𝐶 2 4

∴ 𝐴𝑟𝑒𝑎 𝑜𝑓 ∆𝐷𝐸𝐹 = 𝐷𝐸 2 = 𝐸𝐹2 = 𝐷𝐹2 = 9 𝐴𝑔𝑎𝑖𝑛, ⟹ 𝑂𝑀2 = 𝑂𝐶 2 − 𝐶𝑀2 = 52 −
42 = 25 − 16 = 9
9) In an equilateral ∆ABC, if AD ⊥ BC, then
(a) 𝟑𝑨𝑩𝟐 = 𝟒𝑨𝑫𝟐 ; (b) 𝟑𝑨𝑩𝟐 = ∴ 𝑂𝑀 = 3𝑐𝑚
𝟐𝑨𝑫𝟐 ; (c) 𝟐𝑨𝑩𝟐 = 𝑨𝑫𝟐 ; (d) ∴ MN = The distance between the

none chords = ON –OM = 4 -3 = 1 cm.
Sol.: Let its side be a
𝑎 2 3𝑎2 3𝐴𝐵2
∴ 𝐴𝐷 2 = 𝑎2 − ( ) = =
2 4 4
∴ 3𝐴𝐵2 = 4𝐴𝐷 2
10) The parallel sides of a trapezium are a and

b. Then the line joining the mid-points of
its non-parallel sides will be 12) If AB and AC are tangents to the circle with
𝒂+𝒃 𝒂−𝒃 centre O, if ∠CAB = 60° then ∠BDC = is
(a) 𝟐𝒂𝒃
; (b) 𝟐
; (c) √𝒂𝒃 ; (c) none
(a) 60°; (b) 70°; (c) 80 °; (d) none
328
1 (a) 115°; (b) 30°; (c) 70°; (d) none

Sol.: Here ∠ACO = 90°; ∠CAO = 2 × 60° = 30°
∴ ∠𝐶𝑂𝐴 = 180° − 90° − 30° = 60°
𝐴𝑔𝑎𝑖𝑛 ∠𝐶𝑂𝐴 = ∠ 𝐵𝑂𝐴 = 60°.
𝑇ℎ𝑢𝑠, ∠𝐶𝑂𝐵 = ∠𝑂𝐷𝐴 + ∠𝐵𝑂𝐴 = 60° + 60° =

120°.
1 1
𝐴𝑙𝑠𝑜, ∠𝐵𝐷𝐶 = ∠𝐶𝑂𝐵 = × 120° = 60°.
2 2
13) Let A, B, C are three points on a circle with

centre 0. If ∠AOB = 90° 𝒂𝒏𝒅 ∠𝑩𝑶𝑪 =
𝟏𝟑𝟎°, 𝒕𝒉𝒆𝒏 ∠𝑨𝑩𝑪 is Sol.: In ∆ ABC; AB = AC
(a) 45°; (b) 55°; (c) 65°; (d) none
∴ ∠ACB = ∠ABC = 65°
Sol.: ∠AOC = 360° − (90° + 130°) = 140°
∴ ∠BAC = 180° − (65° + 65°) = 50°
1 1
∴Also ∠ABC = ∠𝐴𝑂𝐶 = × 140° = 70°
2 2
But ∠BPC = ∠BAC = 50°
14) Let AD, AE, BC are tangents to the circle at
D, E, F respectively, then
(a) AD= AB+ BC+ CA; (B) 2AD= (SUBJECTIVE TYPE)
AB+BC+ CA; (C) 3AD =
1) In a ∆ ABC, AB = AC. A circle is drawn
AB+BC+CA; (D) none
touching the circum circle of ∆BC
Sol.: Knowing that the tangents drawn to a internally and also, touching the sides AB
circle from a point outside are equal, on get and Ac at P and Q respectively. Show the
mid. Point of PQ is the in centre of ∆ABC.
AD = AE, BD = BF, CF = CE
Sol.: Let ∠ABC = ∠ACB = 𝛽.
∴ AD = AB+BD= AB+BF
ATS the angle bisector of ∠A. I is the mid-
Also AD= AE = AC + CE = AC +CF
point of PQ. Now AP = AQ as the smaller
∴ 2AD = AB+ AC+BF+ CF = AB +AC +BC. circle touches AB and AC at P and Q
respectively. The centre of the circle PQT lies
15) In the given fig. ∠ABC = 65° and AB = AC,
on the angle bisector of ∠A, namely AT; since
then the measure of ∠BPC is
329
PQ is the chord of contact of the circle PQT , ∠𝐵𝑃𝑇 = 180° − ∠𝑇𝑃𝐴 = 180° − ∠𝐴𝑃𝐼 −
PQ ⊥ AT and the midpoint 1 of PQ lies on AT. ∠𝐼𝑃𝑇 = 180° − 𝛽 − 90° + 𝛼 = 90° + 𝛼 −
𝛽 … … … . (2)
Now to prove that I is the in centre of ∆ABC, it
is enough to prove that BI is the angle But APT is a tangent to circle PQT ∠BPT =
bisector of ∠B. and CI is the angle bisector of ∠PQT = ∠IQT from (1) and (2),
∠C respectively. By symmetry ∠PTI = ∠QTI =
we get 90° + 𝛼 − 𝛽 = 90° − 𝜶 ∴ 2𝛼 = 𝛽
𝛼°
∴ ∠𝐼𝐵𝐷 = 𝛽 − ∠𝑃𝐵𝐼 = 2𝛼 − 𝛼 = 𝛼 ∴
∠𝐼𝐵𝐷 = ∠𝑃𝐵𝐼
∴ BI is the angle bisector of ∠B. Hence the

result.
2) ABC is a rt. Angled triangle with ∠ C = 90°.

The centre and the radius of the inscribed
circle is I and r. Show that 𝑨𝑰 × 𝑩𝑰 =
√𝟐 × 𝑨𝑩 × 𝒓.
Now ∠ABT = 90° (∵AT is diameter of ⊙ABC)

Sol.:
∴ ∠PBT = 90° Also ∠PIT = 90°
∴ PBTI is cyclic
∴ ∠PBI = ∠PTI = 𝛼°(angle in the same

segment)
1
Area of the right angled ∆ ACD = 2 𝐴𝐶 × 𝐵𝐶
∴ ∠IBD = ∠ABD -∠ABI = 𝛽 –𝛼
1 1
= 2 (𝑥 + 𝑟)(𝑦 + 𝑟) = 2 {𝑥𝑦 + 𝑟(𝑥 + 𝑦) + 𝑟 2 }
∠TBC = ∠TAC = 90° − 𝛽
⟹ 𝐴𝐶 × 𝐵𝐶 = 𝑥𝑦 + 𝑟𝐴𝐵 + 𝑟 2 ⟹ 𝑥𝑦
∴ ∠𝐼𝛽𝑇 = ∠𝐼𝐵𝐷 + ∠𝐷𝐵𝑇 = 𝛽 − 𝛼 + 90° −
= 𝐴𝐶 × 𝐵𝐶 − 𝑟𝐴𝐵 − 𝑟 2
𝛽 = 90° − 𝛼
𝑁𝑜𝑤 𝐴𝐼 2 × 𝐵𝐼 2 = (𝑥 2 + 𝑟 2 )(𝑦 2 + 𝑟 2 )
𝑆𝑖𝑛𝑐𝑒 𝑃𝐵𝑇𝐼 𝑖𝑠 𝑐𝑦𝑐𝑙𝑖𝑐, ∠𝐼𝑃𝑇 = ∠𝐼𝐵𝑇 = 90° −
= 𝑥 2 𝑦 2 + 𝑟 2 (𝑥 2 + 𝑦 2 ) + 𝑟 4
𝛼 … … … (1)
330
= 𝑥 2 𝑦 2 + 𝑟 2 [(𝑥 + 𝑦)2 − 2𝑥𝑦] + 𝑟 4 circle k lies inside L and now D lies on the
= 𝑥 2 𝑦 2 + 𝑟 2 [(𝐴𝐵2 − 2𝑥𝑦)] radius OC.
+ 𝑟4
= 𝑥 2 𝑦 2 + 𝑟 2 𝐴𝐵2 − 𝑟 2 + 2𝑥𝑦 + 𝑟 4
= 𝑥 2 𝐴𝐵2 + (𝑟 2 − 𝑥𝑦)2
= 𝑟 2 𝐴𝐵2 + [𝑟 2 − 𝐴𝐶 × 𝐵𝐶 + 𝑟𝐴𝐵 + 𝑟 2 ]2
= 𝑟 2 𝐴𝐵2
+ [2𝑟 2 − 𝐴𝐶 × 𝐵𝐶 + 𝑟𝐴𝐵]2
𝐴𝑟𝑒𝑎 𝑜𝑓 𝑡ℎ𝑒 ∆𝐴𝐵𝐶 = 𝑟(𝑟 + 𝑥 + 𝑦)

= 𝑟(𝑟 + 𝐴𝐵) = 𝑟 2 + 𝑟𝐴𝐵 Length of arc ABD > AD+ DB
1
= 𝐴𝐶. 𝐵𝐶 As we have to prove that arc ABD > AC = AD
2
+DC, we should show that DB> DC.
⟹ 𝐴𝐶 × 𝐵𝐶 = 2𝑟 2 + 2𝑟. 𝐴𝐵
Now the circle k’’ with centre D and radius
∴ 𝐴𝐼 2 × 𝐵𝐼 2 = 𝑟 2 𝐴𝐵2 + [2𝑟 2 − 2𝑟 2 −
DC, is a circle touching k internally and B lies
2𝑟𝐴𝐵 + 𝑟𝐴𝐵]2 = 𝑟 2 𝐴𝐵2 + 𝑟 2 𝐴𝐵2 = 2𝑟 2 . 𝐴𝐵2 outside this circle k”, So the radius of k” is less
than DB i.e. DC <DB or DB >DC.
∴ 𝐴𝐼. 𝐵𝐼 = √2𝑟 2 . 𝐴𝐵2 = √2𝑟. 𝐴𝐵.
⟹ arc ADB > AD +BD > AD+ DC = AC

3) Let A and B be two points on a circle k.
Suppose that on arc k’ of a another circle 1 ⟹ arc ADB > the diameter of k.
connects A with B and divides the area
Note that O lies inside the circle k’ since every
inside the circle k into two equal parts.
diameter of k meets the circle k’ (i.e. arc AB)
Show that arc ‘k’ is longer than the
as k’ bisects area in k.
diameter k.
Sol.: Since arc ‘k’ bisector the area of the

circle k, k cannot entirely lie on the one side 4) Two given circles intersects in two points
of any diameter of circle k. P and Q. Show how to construct a segment
AB passing through P and terminating on
Hence every diameter ok k intersects k’ Let
the two circles such that AP. PB is a
AC be one such diameter and k’ intersects AG
maximum.
at D, say. Now the centre O of the circle k lies
inside the circle L, and hence the radius AO of
331
Sol.: Let 𝑐1 , 𝑐2 be two circles. We first show

that if APB is a straight line such that there is
a circle c touching 𝑐1 at A and 𝑐2 at B, then A,
AB is segment giving the required maximum.
1
∠PAT = x = ∠AOB (angle in the alternate
2
segment theorem). Since BS is tangent to

circle c.
1
Let A’P and P’B be any other chords so that ∠PBS = y = 2∠AOB. ∴ x = y since AT is
A’PB’ may be collinear and the extension of tangent to circle 𝑐1 , we get ∠PAT = x =
these chords meet the circle c at C and D. 1
∠𝐴𝑂1 𝑃
2
CP. CD = AP. PB > A’P × 𝑃𝐵′

Similarly since BS is tangent to circle 𝑐2 , we
1
∴ AP. PB is maximum. Now we need to get ∠PBS = y = 2 ∠𝐵𝑂2 𝑃 = 𝑥 ∴ ∠𝐴 𝑂1 𝑃 =
construct such a chord APB. For this we need ∠𝐴𝑂𝐵 = ∠𝐵𝑂2 𝑃
to construct a circle c touching 𝑐1 𝑎𝑛𝑑 𝑐2 at
∴ ∆𝐴𝑂1 𝑃 ∼ ∆𝑃𝑂2 𝐵
points A and B. So that APB are collinear. Let
us find the properties of the points A and B. 𝐴𝑃 𝐴𝑂1 𝑟1
∴ = = .
𝑃𝐵 𝑃𝑂2 𝑟2
Let O be the centre of the circle C and
𝑂1 𝑎𝑛𝑑 𝑂2 be the centres of the circles There for the line segment AB must be such
𝑐1 𝑎𝑛𝑑 𝑐2 . Now C and 𝑐1 touch at A. that P divides AB internally in the ratio 𝑟1 : 𝑟2
∴ A 𝑂1 𝑂 are collinear. Similarly B 𝑂2 𝑂 are Further 𝑃𝑂2 ∥ 𝑂𝑂1 𝑎𝑛𝑑 𝑃𝑂1 ∥ 𝑂𝑂2 .
collinear. Let AT, BS be the common tangents
So join 𝑃𝑂1 𝑎𝑛𝑑 𝑃𝑂2 . Through 𝑂2 draw a line
to circles C and 𝑐1 and C and 𝑐2 respectively.
parallel to P𝑂1 to must the circle 𝑐2 𝑖𝑛 𝐵. Now
Let ∠PAT = x and ∠PBS = y since AT is these two parallel lines drawn meet at O. If
tangent to circle c. we drawn a circle with O as centre and radius
OA = OB, then the circle touches 𝑐1 at A and
332
𝑐2 at B. By retracting the arguments we can SD meeting them at Q and R respectively.

prove that APB are collinear and AB is the PQRS is the required square.
required chord.
Proof: Draw BL and CN ⊥r to AS and SD
respectively.
∆𝐿𝐵𝐵′ ≡ ∆ 𝑁𝐶𝐷 𝑎𝑠 ∠𝐿𝐵𝐵′ = 90° − ∠𝐴𝐵𝐿

= ∠𝐿𝐴𝐵 = ∠𝑁𝐶𝐷 𝑎𝑛𝑑 𝐵𝐵′
= 𝐶𝐷 𝑎𝑛𝑑 ∠𝐵𝐿𝐵′ = ∠𝐶𝑁𝐷
= 90°. 𝑃𝑄 = 𝐿𝐵 = 𝐶𝑁 = 𝑄𝑅
Note→ in the previous problem the line AB
= 𝑃𝑆
and 𝑂1 𝑂2 meet in a point 𝑆1 say. This point 𝑆1
divides 𝑂1 𝑂2 externally in the ratio 𝑟1 : 𝑟2 . The
point 𝑆1 is called the external centre of
similitude of 2 circles 𝑐1 𝑎𝑛𝑑 𝑐2 . If we draw
any line 1 through 𝑆1 meeting
𝑐1 𝑖𝑛 𝑃1 , 𝑄1 𝑎𝑛𝑑 𝑐2 𝑖𝑛 𝑃2 , 𝑄2 𝑡ℎ𝑒𝑛 𝑂1 𝑃1 ∥
𝑂2 𝑃2 𝑎𝑛𝑑 𝑂1 𝑄1 ∥ 𝑂2 𝑄2 .
Thus the adjacent sides of the rectangle PQRS
Moreover the direct common tangents to the
are equal and hence it is a square.
two circles 𝑐1 𝑎𝑛𝑑 𝑐2 meet at 𝑆1 .
If B’ is constructed on the opposite half-plane,
5) Let A, B, C , D be four given points on a line.
we get P’Q’R’S’, the reflection on the PQRS
Contract a square such that two of its
about the line 1 and lying on the opposite half
parallel on a line. Contract a square such
plane.
that two of its parallel sides or their
extensions go through A and B This construction exactly follows the same
respectively and the other two sides (or procedure BB‘(BB) is perpendicular to CD
their extensions) go through C and D and equal to CD. Join AB’(or AB”)
respectively.
Draw CP . DS⊥ r to AB’ produced and extend
Sol.: Draw BB’ ⊥ r’ to l and BB’ = CD. Join AB’ PC and SD. Through B draw BR and BQ
and extend it to y. Through C and D draw perpendicular to SR and PQ. PQRS is the
perpendiculars to meeting Ay at P and S. required square.
Through B draw BZ perpendicular to CP and
333
IC’ = IB’ (given)
∠IEC’ = ∠IDB’ = 90°,
𝑠𝑜 ∆𝑠 𝐼𝐸𝐶 ′ 𝑎𝑛𝑑 𝐼𝐷𝐴′ are congruent ∠IC’E =

∠IB’D ……..(1)
𝐼𝑛 ∆𝐴𝐼𝐶 ′ 𝑎𝑛𝑑 ∆𝐴𝐼𝐵′ . AI is the bisector of ∠A
∴ ∠𝐼𝐴𝐶 ′ = ∠𝐼𝐴𝐵′
Draw C𝑃1 , 𝐷𝑆1 ⊥ 𝑟 𝑡𝑜 𝐴𝐵′′ and through B
draw ⊥ r to c𝑝1 𝑎𝑛𝑑 𝐷 𝑆1 produced meeting ∴ ∠𝐼𝐶 ′ 𝐴 = ∠𝐼𝐵′ 𝐴
them at Q and 𝑟1 respectively. 𝑃1 𝑄1 𝑅1 𝑆1 is the
[𝐹𝑟𝑜𝑚 (1)] … … … . (2)
required square. Thus there are two
solutions(The proof is similar to that to the AI is common. So ∆𝑠 𝐴𝐼𝐶 ′ 𝑎𝑛𝑑 𝐴𝐼𝐵′ are
former one). argument from(2)
6) In ∆ ABC, AB ≠ AC. The bisector of ∠ B and ∠BC’I = 180° − ∠𝐼𝐶 ′ 𝐴 = 180° − ∠𝐼𝐵′ 𝐴 =
∠C meet their opposite sides AC and AB at ∠𝐼𝐵′ 𝐶
B’ and C respectively. The Two bisectors
∠𝐶 ′ 𝐼𝐵 = ∠𝐵′𝐼𝐶 (vertically opposite ∠s)
intersects at I. Show that, if IB’ = IC’, then
∠BAC = 𝟔𝟎°. 𝐼𝐶 ′ = 𝐼𝐵′ (𝑔𝑖𝑣𝑒𝑛)
Sol.: Let us first prove that the perpendiculars ∴BC’ = CB’

from 1 to AB and AC. i.e. IE and ID lie on
opposite sides of the bisectors CC’ i.e. (points ∴AB = BC’+C’A= CB’+B’A =AC
E and D lie on opposite, sides of the bisectors But by hypothesis AB ≠ AC and hence, the
CC’ , where IE and ID are the perpendiculars assumption that E and D are on the same side
drawn from the in centre I to AB and Ac.) In of CC’ is false.
the figure D and E lie on the same side of CC’.
IE = ID (in radii of ∆ABC)
334
In the figure, we have taken AB < AC, and E ∠CMP = ∠CMN = ∠CND (angle in the
and D lie on opposite sides of CC’. alternate segment)
If AB> AC, then E and D lie on opposite sides ∠CNP = ∠CNM = ∠CMB (angle in the
of BB’ alternate segment)
Now, for the solution of the main problem. ∴∠CMP+∠CNP=∠CMP+∠CMB= ∠PMB =

180° − 45° = 135°
In ∆𝑠 𝐼𝐵′ 𝐷𝑎𝑛𝑑 𝐼𝐶 ′ 𝐸. 𝐼𝐶 ′ = 𝐼𝐵′ , 𝐼𝐷 = 𝐼𝐸 and
1 1
hence ∆ IB’D = ∆IC’E (congruence of right ∠MCN = 2 ∠𝑀𝑂𝑁 = 2 . 90° = 45° (∴∠AMN =
angled triangles)
∠OMN = 45° in the square ANON)
1
∠EC’I= ∠BC’I = ∠BC’C = 180° − (𝐵 + + 𝐶) ∆𝑠 CPN and CBM are similar for ∠CPN =
2
∠CBM = 90° and ∠CNP = ∠CMB …………(1)

1
∠IB’D = ∠BB’D = C+ 2 𝐵
Again ∆𝑠 CPM and CDN are similar for ∠CPM
But ∠IB’D = ∠IC’E (since the ∆IB’D = IC’ E) = ∠CDN = 90° and ∠CMP = ∠CND
𝐶𝑃
=
𝐶𝑁
𝐶𝐵 𝐶𝑀
proved. 𝐶𝐷
(from 1), = (𝑓𝑟𝑜𝑚 2)
𝐶𝑃
1 1
∴180° − (𝐵 + 𝐶) = 𝐶 + 𝐵
2 2 𝐶𝑃 𝐶𝐷
∴ 𝐶𝐵 = 𝐶𝑃 ⟹ 𝐶𝑃2 = 𝐶𝐷. 𝐶𝐵 ⟹ 52 = 𝐶𝐷. 𝐶𝐵,
3
⟹ 2 (𝐵 + 𝐶) = 180°, i.e., area of the rectangle is CB.CD = 25 sq.
units.
2
𝐵 + 𝐶 = × 180° = 120°
3
8) ABCD is a convex pentagon inscribed in a
⟹ 𝐴 = 180° − 120° = 60° circle of radius 1 unit with AE as diameter.
It AB = a, BC = b, CD = c, DE = d, Prove
7) A circle passes through the vertex c of a
that 𝒂𝟐 + 𝒃𝟐 + 𝒄𝟐 + 𝒅𝟐 + 𝒂𝒃𝒄 + 𝒃𝒄𝒅 < 𝟒
rectangle ABCD and touches the sides AB
and AD at M and N respectively. If the Sol.: Since AE is the diameter ∠ACE = 90° and
distance from c to the line segment MN is 𝐴𝑐 2 + 𝑐𝐸 2 = 𝐴𝐸 2 = 22 = 4.
equal to b units, find the area of the
By cosine formula (for ∆ ABC)
rectangles.
𝐴𝐶 2 = 𝑎2 + 𝑏 2 − 2𝑎𝑏 cos(180° − 𝜃) = 𝑎2 +
Sol.: Let ‘O’ be the centre of the circle.
𝑏 2 + 2𝑎𝑏 cos 𝜃
OM= ON = OC each being the radius of the
same circle, end AMON is a square.
335
𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦 𝑖𝑛 ∆𝐶𝐸𝐷, 𝐶𝐸 2 = 𝑐 2 + 𝑑2 −
2𝑐𝑑 cos(90° + 𝜃) = 𝑐 2 + 𝑑 2 + 2𝑐𝑑 sin 𝜃
∴ 𝐴𝑐 2 + 𝐶𝐸 2 = 𝑎2 + 𝑏 2 + 𝑐 2 + 𝑑2 +
2𝑎𝑏 cos 𝜃 + 2𝑐𝑑 sin 𝜃
𝐴𝐶
𝐼𝑛 ∆𝐴𝐶𝐸, = sin 𝜃 ⟹ 𝐴𝐶 = 2 sin 𝜃 1
𝐴𝐸 By hypothesis, this area is equal to 2 𝑎2 =
> 𝑏(∵ 𝐴𝐸 = 2) … … … . (1) 1
𝑎2 sin 𝜃 ⟹ sin 2𝜃 = 2 ⟹ 2𝜃 = 30° 𝑜𝑟 150°
𝐶𝐸
𝑎𝑛𝑑 = cos 𝜃 (𝐴𝐸 = 2) ⟹ 𝜃 = 15° 𝑜𝑟 75°
𝐴𝐸
⇒ 𝐶𝐸 = 2 cos 𝜃 > 𝑐 …….(2) [If the acute angle of the rhombus is 30°, the
other angle which is obtuse is 150°]
(Because in ∆𝑠 ABC and CDE, ∠B and ∠D are
𝐵𝐷 𝐴𝐵
obtain angles and AC is the greatest side of By sine formula, = (𝐼𝑛 ∆𝐴𝐵𝐷)
sin 2𝜃 sin(90−𝛩)
∆ABC and CE is the greatest side of ∆CDE) 𝑎×2 sin 𝜃 cos 𝜃
⟹ 𝐵𝐷 = cos 𝜃
= 2𝑎 sin 𝜃
∴ 𝐴𝐶 2 + 𝐶𝐸 2 = 𝑎2 + 𝑏 2 + 𝑐 2 + 𝑑2 +
𝐴𝐶 𝑎
2𝑎𝑏 cos 𝜃 + 2𝑐𝑑 cos 𝜃 = 4 𝐴𝑔𝑎𝑖𝑛 = (𝐼𝑛 ∆𝐴𝐵𝐶)
sin(180 − 2𝜃) sin 𝜃
⟹ 𝑎2 + 𝑏 2 + 𝑐 2 + 𝑑2 + 𝑎𝑏. 2 cos 𝜃 + 𝑎 sin 2𝜃 2𝑎 sin 𝜃 cos 𝜃

𝐴𝐶 = = = 2𝑎 cos 𝜃
𝑐𝑑. 2 sin 𝜃 = 4 sin 𝜃 sin 𝜃
⟹ 𝑎2 + 𝑏 2 + 𝑐 2 + 𝑑2 + 𝑎𝑏𝑐 + 𝑏𝑐𝑑 < 𝐴𝐶 ∶ 𝐵𝐷 = cos 𝜃 : sin 𝜃 [𝑖𝑓 𝜃 = 15°, 𝑡ℎ𝑒𝑛 𝐴𝐶

4 [𝑏𝑦 (1)𝑎𝑛𝑑 (2)] > 𝐵𝐷 𝑎𝑛𝑑 𝜃 = 75°, 𝐵𝐷 > 𝐴𝐶].
9) A rhombus has half the area of the square 𝐴𝐶: 𝐵𝐷 = cos 15° : sin 15° =
with the same side length. Find the ratio of sin 75° : sin 15° = sin(45° + 30°) : sin(45° −
the longer diagonal to that the shortest 30°)
one.
Sol.: If a is the side of the rhombus, then area = sin 45° cos 30°
1 2 + cos 45° sin 30° : sin 45° cos 30°
of the rhombus is 2
𝑎 sin 2𝜃 × 2.
− cos 45° sin 30°
1 1
= (√3 + 1): (√3 − 1)
2 2
= (√3 + 1): (√3 − 1)
336
𝑋𝐸 𝐴𝐸 𝐸𝑌
𝐴𝐶 √3 + 1 From (3) and (4) 𝐵𝐷 = 𝐴𝐷 = 𝐷𝐶
𝑜𝑟, = : (2 + √3).
𝐵𝐷 √3 − 1
𝑋𝐸 𝐸𝑌 𝐵𝐷 𝑋𝐸
⟹ = ⟹ = .
𝐵𝐷 𝐷𝐶 𝐷𝐶 𝐸𝑌
10) From a point E on the median AD of ∆ ABC, But D is the midpoint of BC and hence BD =
the perpendiculars EF is dropped to the DC ⟹XE = EY i.e., XE = YE ……….(5).
sides BC. From a point M on EF
Now draw XY parallel to BC through E. join
perpendiculars MN and MP are drawn to
AM join the collinear points P, E, N. MPAN is a
the sides AC and AB respectively. If N, E, P
cyclic quadrilateral as ∠MPA+∠MNA = 90° +
are collinear. Show that M lies on the
90° = 180°.
internal bisector of ∠BAC.
Since EF is perpendicular to BC and XY is
Sol.: Before proving the main problem, let us
drawn parallel to BC. ∠XEM = ∠EFB = 90°. In
prove the following: If in ∆ABC, AD is the
the quadrilateral MPXE. ∠MPX+∠MEX =
median xy is a line segment parallel to BC
90°+90° = 180° and hence MPXE is a cyclic
intersecting the median AD at E, then AE is
quadrilateral and in the quadrilateral MENY.
the median of ∆AXY, or in other words XE =
∠MEY = ∠MNY = 90° …………..(6)
YE.
So MENY is a cyclic quadrilateral, since ∠MEY
and ∠MNY are subtended by MY at E and N
and they are equal by (6). In ∆𝑠 MEX and
MEY, XE = YE.
∠MEX = ∠MEY = 90° ME is common and

hence ∆MEX ≡ ∆MEY
∴ ∠MEX = ∠MYE ………….(7)
∠PAM = ∠PNM (angle on the same segment,

in the cyclic quadrilateral MPAN) = ∠ENM =
∆ AXE similar to ∆ABD ………………..(1) and ∆ ∠EYM (angle on the same segment in
AYE similar to ∆ ACD ………………(2) quadrilateral EMYN by (7)) = ∠EXM = ∠EPM
𝐴𝑋 𝐴𝐸 𝑋𝐸 (angle on the same segment in cyclic
𝐴𝐵
= 𝐴𝐷 = 𝐵𝐷 … … … … (3)𝑎𝑛𝑑
quadrilateral MPEX) = ∠NPM = ∠NAM
𝐴𝑌 𝐴𝐸 𝐸𝑌 (cyclic quadrilateral APMN)
= = … … … . (4)
𝐴𝐶 𝐴𝐷 𝐷𝐶
337
That is AM bisects the vertical angle A of ∆ parallel to CA; 𝑷𝟓 𝑷𝟔 parallel to BC. Here
ABC. That is M lies on the bisector of ∠A. 𝑷𝟐 , 𝑷𝟓 lie on AB; 𝑷𝟑 , 𝑷𝟔 on CA; and 𝑷𝟒 on
BC. Show that 𝑷𝟔 𝑷𝟏 is parallel to AB.
Sol.: Suppose B𝑃1 = 𝑘 𝐵𝐶, (so that𝑃1 divides

11) ∆ ABC is an isosceles triangle and XY is
BC in the ratio k: 1-k).
drawn parallel to the base cutting the sides
in X and T. Show that is four points B, C, X, Since 𝑃1 𝑃2 ∥ 𝐴𝐶, 𝑎𝑛𝑑 𝐵𝑃1 ∶ 𝐵𝐶 = 𝑘 ∶ 1
Y lie on a circle.
Therefore, from similar triangles B𝑃1 𝑃2 and
Sol.: Since xy ∥BC, and AB meets them, BCA, B𝑃2 = 𝑘, 𝐵𝐴, 𝑃2 𝐴 = (1 − 𝑘)𝐵𝐴.
therefore,
∠BXY +∠XBC = 2rt ∠S ……….(1)
Also, since AB = AB, ∠B = ∠C …………(2)
From (1) and (2), we find that
∠BXY +∠BCY = 2rt. ∠S
Since a pair of opposite angles of the

Since 𝑃2 𝑃3 ∥ 𝐵𝐶, 𝑎𝑛𝑑 𝑃2 𝐴 = (1 − 𝑘)𝐵𝐴,
quadrilateral BCYX is supplementary,
therefore from similar triangles
therefore it is cyclic. i.e. the points B, C, X, Y lie
𝑃2 𝐴𝑃3 𝑎𝑛𝑑 𝐵𝐴𝐶, 𝑤𝑒 ℎ𝑎𝑣𝑒
on a circle.
𝐴𝑃3 = (1 − 𝑘)𝐴𝐶, 𝑃3 𝐶 = 𝑘 𝐴𝐶
Since 𝑃3 𝑃4 ∥ 𝐴𝐵, 𝑎𝑛𝑑 𝐶𝑃3 = 𝑘. 𝐴𝐶
Therefore from similar triangles

C𝑃3 𝑃4 𝑎𝑛𝑑 𝐶𝐴𝐵.
𝐶𝑃4 = 𝑘𝐶𝐵. 𝑃4 𝐵 = (1 − 𝑘)𝐶𝐵.
𝑆𝑖𝑛𝑐𝑒 𝑃4 𝑃5 ∥ 𝐶𝐴, 𝑎𝑛𝑑 𝑃4 𝐵 = (1 − 𝑘)𝐶𝐵,

therefore B𝑃5 = (1 − 𝑘)𝐵𝐴.
12) Take any point𝑷𝟏 on one side BC of a
triangle ABC and draw the following chain 𝑆𝑖𝑛𝑐𝑒 𝑃5 𝑃6 ∥ 𝐵𝐶, and A𝑃5 : 𝐴𝐵 = 𝑘: 1,
of lines : 𝑷𝟏 𝑷𝟐 parallel to AC; 𝑷𝟐 𝑷𝟑 therefore similar triangle A𝑃5 𝑃6 , 𝐴𝐵𝐶, 𝐴𝑃6 =
parallel to BC : 𝑷𝟑 𝑷𝟒 parallel to AB; 𝑷𝟒 𝑷𝟓 𝑘AC, 𝑃6 𝐶 = (1 − 𝑘)𝐴𝐶. In ∆CAB 𝑃1 divides CB
338
in the ratio 1 − 𝑘; 𝑘 and 𝑃6 divides CA in the 1 𝑎2 1 𝑎2

𝑖. 𝑒., 𝑟1 = ( ) ( + 𝑏 2 ) = 𝑏 +
ratio 1-k: M; i.e. C𝑃6 : 𝑃6 𝐴 = 𝐶𝑃1 : 𝑃1 𝐵. 2𝑏 4 2 8𝑏
1 𝑏2
𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 𝑃6 𝑃1 ∥ 𝐴𝐵 Similarly, 𝑟1 = 𝑎 +
2 8𝑎
(∆s C𝑃6 𝑃1 and CAB are similar and hence 1 𝑎2 1 𝑏2

Now 𝑟1 + 𝑟2 = (2 𝑏 + 8𝑏) + (2 𝑎 + 8𝑏) =
equi-triangular; consequently ∠C𝑃6 𝑃1 =
1 𝑎2 𝑏2 1 𝑎 3 +𝑏3
∠𝐶𝐴𝐵 which are corresponding angles) (𝑎 + 𝑏) + 8𝑏 + 8𝑏 , = 2 (𝑎 + 𝑏) +
2 8𝑎𝑏
1 (𝑎 + 𝑏)[(𝑎 − 𝑏)2 + 𝑎𝑏]

= (𝑎 + 𝑏) +
2 8𝑎𝑏
13) Let ABCD be a rectangle with AB = a and 1 1
≥ (𝑎 + 𝑏) + (𝑎 + 𝑏)
BC = b. Suppose 𝒓𝟏 is the radius of the 2 8
circle passing through A and B and 5
= (𝑎 + 𝑏).
8
touching CD; and similarly 𝒓𝟐 is the radius
of the circle passing through B and C and 5
𝑇ℎ𝑢𝑠 𝑟1 + 𝑟2 ≥ (𝑎 + 𝑏).
𝟓 8
touching AD. Show that 𝒓𝟏 + 𝒓𝟐 ≥ 𝟖 (𝒂 +
𝒃)
Sol.: Let O be the centre of the circle which 14) A rigid square plate ABCD of unit side
touches CD and passes through the points A rotates in its own plane about the middle
and B, E the point of tangency and F the point point of CD unit the new position of A
at which OE meets AB. Since OE ⊥ OC, and AB coincide with the old position of B. How
∥DC, therefore OF ∥ AB, Also OF = b- far is the new position of B from the old
1 position of A?
𝑟1 𝑎𝑛𝑑 𝐹𝐵 = 2 𝑎
Sol: Let O be midpoint of CD. Since the new

position of A coincides with the old position
of B. Therefore, the rotation is in the counter
clockwise sense (in fig) about O, through the
angle AOB
Let OB and AB’ intersects at P. Then ∠BOB’ =

In right angled triangle OFB, 𝑂𝐵2 = 𝑂𝐹 2 + ∠AOB. Also OA = OB = OB’. Therefore OB is
𝑎 2 the internal bisector of ∠AOB’ of isosceles
𝐹𝐵2 , 𝑠ℎ𝑜𝑤 𝑡ℎ𝑎𝑡 𝑟1 2 = (𝑏 − 𝑟1 )2 + (2 )
triangle AOB’. Therefore OP ⊥ AB’ and AP =
PB’
339
1 1 two lines GH. EP parallel to DC, and two lines

Also, ∠AOB = 2 × 𝑎𝑟𝑒𝑎 𝑜𝑓 𝑠𝑞𝑢𝑎𝑟𝑒 𝐴𝐵𝐶𝐷 = 2.
JP, KQ parallel to DA.
1
𝐵𝑢𝑡, [𝐴𝑂𝐵] = 𝐴𝑃. 𝑂𝐵, 𝑂𝐵 = √(𝑂𝐶 2 + 𝐶𝐵2 )
2
√5
=
2
2
∴ 𝐴𝑃 = , 𝑠𝑜 𝑡ℎ𝑎𝑡
√5
4 4√5
𝐴𝐵′ = 2𝐴𝑃 = =
√5 5
16) A river flows between two houses A and

B, the house standing some distance away
from the banks , where should a bridge be
built on the river. So that a person going
from A to B using the bridge to cross the
river may do so by the shortest path?
Assume that the banks of the river are
15) Show how will you cut a rectangular sheet
straight and parallel, and the bridge must
of paper along two lines segments parallel
be perpendicular to the banks.
to a side and two parallel to an adjacent
side, into five pieces whose areas are in Sol.: Let xy and PQ denote the two banks of
the ratio 1 : 2 : 3 :4 : 5. the river (parallel to each other) at a distance
d from each other and let A and B be the
Sol.: Since 1+2+3+4+5 = 15, therefore really
situated on opposite sides of the river as
speaking the rectangles has to be divided into
shown in the figure.
15 equal parts, and then we have to take 1, 2,
3, 4, and 5 parts respectively to get the five Take a point C on the line through A
pieces. We take two points E and G in AD so perpendicular to the banks and towards the
that AE = EG = GD and draw GH, EP parallel bank such that AC= L (two different cases
to AB. Also take points J. K, L, M in DC such arise according as the point C is between A
that DJ = JK = KL = LM = MC and draw JP, KQ and xy, or is between xy and PQ of course, it
parallel to CD. Clearly areas of rectangles can even be on xy) join CB. Let CB meet PQ in
DJRG, GSTE, SHFT, JCHR, EFBA are in the ratio D. It can be shown that if DE be the
1 : 2 : 3 : 4 :5. The division has been made by perpendicular from D and xy, then bridge
340
should be built along DE. As is clear from fig

(a) and (b), the position of the bridge does
not depend on the position on C.
Draw the circle of the triangle ABC, and let

the tangent to it at A meet BC produced at D.
Then D is desired point. In order to prove the
result stated above, we have only to observe
If the bridge is along ED, the distance
that in ∆s ABD and CAD, ∠ABC = ∠CAD
required to be travelled for reaching from A
(angles in the alternate segment): ∠ADB =
to B = AE+ED+DB+= CD+AC+DB = L+CB.
∠ADC so that the triangles are equiangular
𝐴𝐷
In instead of building the bridge along ED, the and hence similar consequently =
𝐵𝐷
bridge is built along some other line, say E’, D’ 𝐶𝐷
, 𝑤ℎ𝑒𝑟𝑒𝐴𝐷 2 = |𝐵𝐷|. |𝐶𝐷|
𝐴𝐷
then the distance to be travelled would be
AE’+E’D+D’B= CD’+AC+D’B= l+ C’D+D’B.
In ∆CD’B, CD’+D’B>CB, therefore if instead of 18) Given any acute−angled ∆ ABC, let points
building the bridge along DE, the bridge along A’B’ C’ be located as follows: A’ is the point
some other line the distance required to be where altitude A on BC meets the onwards
travelled would be greater. –facing semicircle drawn on BC as
diameter points B’. C’ are located similarly.
Show that [𝑩𝑪′ 𝑨]𝟐 + [𝑪𝑨𝑩′ ]𝟐 +
17) ∆ABC is scalene with ∠A having measure [𝑨𝑩𝑪]𝟐 = [𝑨𝑩𝑪′ ]𝟐 ,
greater than 𝟗𝟎°.Determine the set of 𝒘𝒉𝒆𝒓𝒆 |𝑨𝑩𝑪|𝒅𝒆𝒏𝒐𝒕𝒆𝒔 𝒕𝒉𝒆 𝒂𝒓𝒆𝒂 𝒐𝒇 ∆𝑨𝑩𝑪
points D on the extended line BC for which etc.
|𝑨𝑫| = √{(|𝑩𝑫|)(|𝑪𝑫|)}, 𝒘𝒉𝒆𝒓𝒆 |𝑩𝑫|

Sol.: In right angled triangles are equiangular
refers to the (positive) distance o0f B and 𝐵𝐷 𝐴′ 𝐷
and hence similar. Consequently 𝐴′ 𝐷 = 𝐷𝐶
, so
D.
that A’𝐷 2 = 𝐵𝐷. 𝐷𝐶 𝑠𝑖𝑛𝑐𝑒 𝐵𝐷 =
Sol.: We shall use the following well known 𝐴′ 𝐷𝑐𝑜𝑡 𝐵, 𝐷𝐶 = 𝐴′ 𝐷𝑐𝑜𝑡 𝐶,
result. If the tangent to a circle at a point. A
2
meet a chord BC at D, then 𝐴𝐷 2 = |𝐵𝐷|. |𝐶𝐷| 𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 𝐴′𝐷 = 𝐴𝐷 2 cot 𝐵 cot 𝐶
341
2 (𝑐 − 𝑎) (𝑎 − 𝑏)
1 1
∴ [𝐵𝐶′𝐴]2 = ( . 𝐵𝐶. 𝐴′ 𝐷) = 𝐵𝐶 2 . 𝐴′𝐷2 𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦, 𝑦 =
(𝑐 + 𝑎)
,𝑧 =
(𝑎 + 𝑏)
2 4
1
= 𝐵𝐶 2 . 𝐴𝐷 2 cot 𝐵 cot 𝐶 𝑏−𝑐 𝑐−𝑎
4 𝑁𝑜𝑤, 𝑥 + 𝑦 + 𝑧 = +
𝑏+𝑐 𝑐+𝑎
= [𝐴𝐵𝐶]2 cot 𝐵 cot 𝐶 … … (1)
𝑎−𝑏
+ ,
𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦, [𝐶𝐴𝐵′ ]2 𝑎+𝑏
= [𝐴𝐵𝐶]2 cot 𝐶 cot 𝐴 … … . (2) 1

= (− ) ∑(𝑏 − 𝑐) {(𝑐 + 𝑎)(𝑎
𝑝
[𝐴𝐵𝐶]2 = [𝐴𝐵𝐶]2 cot 𝐴 cot 𝐵 … … … … . . (3).
+ 𝑏)}. 𝑤ℎ𝑒𝑟𝑒
𝑝 = (𝑏 + 𝑐)(𝑐 + 𝑎)(𝑎 + 𝑏)
𝑁𝑜𝑤 ∑(𝑏 − 𝑐)(𝑐 + 𝑎)(𝑎 + 𝑏)
= ∑ 𝑎2 (𝑏 − 𝑐)
Adding corresponding sides of (1), (2) and + ∑ 𝑎2 (𝑏 − 𝑐)

(3) and using the fact that in any angle.
∑ 𝑏𝑐(𝑏 − 𝑐) + ∑ 𝑎(𝑏 2 − 𝑐 2 )
cot 𝐵 cot 𝐶 + cot 𝐶 cot 𝐴 + cot 𝐴 cot 𝐵 = 1,
𝑁𝑜𝑤, ∑ 𝑏𝑐(𝑏 − 𝑐) = −(𝑏 − 𝑐)(𝑐 −
We get the desire result. 𝑎)(𝑎 − 𝑏),
∑ 𝑎(𝑏 2 − 𝑐 2 ) = − ∑ 𝑎2 (𝑏 − 𝑐),
19) Given a ∆ABC, define the equalities x, y, z 𝑆𝑜 𝑡ℎ𝑎𝑡 ∑ 𝑏𝑐(𝑏 − 𝑐) = −(𝑏 − 𝑐)(𝑐 −
𝑩−𝑪 𝑨
as follows : x = 𝐭𝐚𝐧 𝟐 . 𝐭𝐚𝐧 𝟐 ; 𝒚 = 𝑎)(𝑎 − 𝑏),
𝑪−𝑨 𝑩
𝐭𝐚𝐧 𝟐
. 𝐭𝐚𝐧 𝟐 ; 𝒛 = ∑ 𝑎(𝑏 2 − 𝑐 2 ) = − ∑ 𝑎2 (𝑏 − 𝑐).
𝑨−𝑩 𝑪
𝐭𝐚𝐧 . 𝐭𝐚𝐧 . 𝑷𝒓𝒐𝒗𝒆 𝒕𝒉𝒂𝒕 𝒙 + 𝒚 + 𝒛 + 1
𝟐 𝟐
𝑆𝑜 𝑡ℎ𝑎𝑡 𝑥 + 𝑦 + 𝑧 = (𝑝) (−(𝑏 −
𝒙𝒚𝒛 = 𝟎.
𝑐)(𝑐 − 𝑎)(𝑎 − 𝑏)) = −𝑥𝑦𝑧
Sol.: By Napier’s analogies,
𝐻𝑒𝑛𝑐𝑒 𝑥 + 𝑦 + 𝑥 + 𝑥𝑦𝑧 = 0.
𝐵−𝐶 (𝑏 − 𝑐) 𝐴
tan [ ]=[ ] cot ( )
2 (𝑏 + 𝑐) 2
(𝑏 − 𝑐)
𝑆𝑜 𝑡ℎ𝑎𝑡 𝑥 =
(𝑏 + 𝑐)
342
20) ∆ABC has in centre I. Let x, y, z be located 1

= 90° + ∠𝐴 … … . . (4)
on the line segments that AB. AC 2
respectively. So that Bx. AB= Since 𝑥𝐼𝑌 𝑖𝑠 𝑎 𝑠𝑡. 𝑙𝑖𝑛𝑒, 𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 ∠𝑥𝐼𝐵 +
I𝑩𝟐 𝒂𝒏𝒅 𝑪𝒚. 𝑨𝑪 = 𝑰𝑪𝟐 . Given that the ∠𝐵𝐼𝐶 + ∠𝐶𝐼𝑌 = 180° … … . . (5)
points x, I, y lie on a straight line, find the
Adding corresponding sides of relations (2),
possible values the measure of ∠A.
(3) and (4), and using (5),
𝐵𝑥
Sol.: Since Bx. AB= I𝐵2 , 𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 𝐵𝐼 =
1 1 1
we have 2
∠𝐴 + (90° + 2 ∠𝐴) + 2 ∠𝐴 =
𝐵𝐼
𝐵𝐴
… … … … (1)
180° 𝑆𝑜 𝑡ℎ𝑎𝑡 ∠𝐴 = 60°.
𝐵𝑥 𝐵𝐼
In ∆s B x I and BIA, ∠xBI = ∠ABI, and 𝐵𝐼 = 𝐵𝐴
from (1). Therefore ∆s BxI and BIA are 21) The diagonals AC and BD of a cyclic
similar and hence equiangular. quadrilateral ABCD intersect at P. Let O be
1
the circumcentre of ∆APB and H be the
∴ ∠𝐵𝐼𝑥 = ∠𝐵𝐴𝐼 = ∠𝐴 … … … . . (2)
2 orthocenter of ∆CPD. Show that the points
Since AI is the interval bisector of ∠BAC (I H.P.O are collinear.
being the in centre) Sol.:
Similar by considering triangles 𝑐𝑦𝐼 𝑎𝑛𝑑 𝐶𝐼𝐴,

1 We shall show that if OP is produced to meet
we have ∠𝐶𝐼𝑌 = 2 ∠𝐴 … … … … (3)
CD in M, then PM ⊥CD, so that PM is an
𝐴𝑙𝑠𝑜, ∠𝐵𝐼𝐶 = 180° − (∠𝐼𝐵𝐶 + ∠𝐼𝐶𝐵) altitude of ∆PCD. This will ensure that the
1 1 orthocenter H of the triangle PCD lies on PM
= 180° − ( ∠𝐵 + ∠)
2 2 and consequently the points O, P, H are
1
= 180° − [90° − ∠𝐴], collinear. To complete the proof join AO, draw
2
OL ⊥AP and consider ∆s PLO and PMC. In
343
1
these two triangles ∠LOP = 2 ∠𝐴𝑂𝑃 (because therefore, 𝐵𝑥 = 𝑥𝐶 = 𝑏, similarly, 𝐷𝑦 =
𝑦 𝐸 = 𝑑, 𝐹𝑧 = 𝑧𝐴 = 𝑓,
O is the circumcentre of ∆ABP, and OL ⊥
chord AP) = ∠APB (being the angle ∴ zx = f+a+b, xy = b +c +d, yz = d+ e +f,
subtended by the chord AP at a point B of the since ∆xyz is equilateral,
circumcentre of the circle ABP)=
∠PCD(angles in the same segment of a circle). therefore f+ a +b = b +c +d = 𝑑 + 𝑒 + 𝑓 =
1
[(𝑓 + 𝑎 + 𝑏) + (𝑏 + 𝑐 + 𝑑) + (𝑑 + 𝑒 + 𝑓)]
3
Now in ∆s PLO and PMC, ∠LOP = ∠PCM
(proved), and ∠LOP = ∠CPM (vert opp ∠S), 1
= (𝑎 + 𝑏 + 𝑐 + 𝑑 + 𝑒 + 𝑓)
therefore ∠CMP= ∠PLO = 90° and 3
1
consequently PM ⊥ CD, and the proof is + (𝑏 + 𝑑
3
complete. + 𝑓) … … … . . (1)
We are inserted in contacting a hexagon for
22) Show that there exist convex hexagon in which a, b, c, d, e, f are numbers 1, 2, 3, 4, 5, 6
1
the plane such that (a) all its interior in some order so, that 3 (𝑎 + 𝑏 + 𝑐 + 𝑑 + 𝑒 +
angles are equal (b) its sides are 1, 2, 3, 4, 𝑓) = 7.
5, 6 in some order.
We shall choose values of b, d, f out of the
Sol.: Suppose there exists a convex hexagon given values in such a manner (to simplify the
ABCDEF such that all its interior angles are working) that b +d +f is a multiple of 3. This
equal, and the lengths of its sides are a, b, c, d, can be done in several ways. One with this
e, f respectively. Produced AB and DC meet at choice, b +d+ f = 15, so that f +a +b= b +c
x, CD and EF to meet at y, and EF and BA to 1
+d = d+ e +f = 7 + 3 . 15 = 12
meet at z. It can easily be seen that ∆xyz is
equilateral. In fact since the hexagon ABCDEF Using the values b = 4, d = 5, f = 6, we have a
us equiangular, each of its interior angles is = 2, c = 3, e = 1. Thus we get a = 2, b = 4, c =
120°, consequently each of its interior angles 3, d = 5, e = 1, f= 6 we therefore have the
is 60°be ∠XBC= ∠xcB = 60°, ∠EDY =∠DEY = following construction:
60°, ∠FAZ= ∠AFZ = 60°.
Construct an equilateral triangle xyz having
It follows that ∠𝐵𝑥𝐶, ∠𝐷𝑦𝐸, ∠𝐹𝑧𝐴 are each each side equal to 12 units. Cut of P 𝑥𝑏 =
equal to 60°. Since ∆BxC is equilateral, 𝑥𝑐 = 4 units, 𝑦𝐷 = 𝑦𝐸 = 5 𝑢𝑛𝑖𝑡𝑠, 𝑧𝐴 = 𝑧𝐹 =
6 𝑢𝑛𝑖𝑡𝑠
344
Join the pairs of points B, C; D, E; F, A, 𝑟−𝑟 ′ 𝐴 𝜋−𝐴

∴ 𝑟+𝑟′ = sin ( 2 ) = cos 𝜃 ; 𝑤ℎ𝑒𝑟𝑒 𝜃 = 2
.
ABCDEF is the desired hexagon.
𝑟 ′ 1 − cos 𝜃 𝜃 𝜋−𝐴
Justification for the above construction has ∴ = = 𝑡𝑎𝑛2 ( ) = 𝑡𝑎𝑛2 ( ).
𝑟 1 + cos 𝜃 2 4
already been provided by the analysis of the
problem.
24) Let 𝜆 be straight line and P.Q two distinct
arbitrary points lying on one side of the
23) Let ∆ABC and circle C’ be drawn lying line 𝜆, but not lying on l. Determine with
inside the triangle touching the two sides proof the point T on L such that the sum of
AB and AC. Show that the radii of the the distance of P and Q from T shall be
𝝅−𝑨
circles C’ and C is equal to 𝒕𝒂𝒏𝟐 ( ) least.
𝟒
Sol. Sol.:
Let I be the in centre, r the in radius and E the

point of contact of the in circle with AB. Also
Let R be the reflection of P in l, i.e. Let R be a
let l’ be the center of the circle touching AB.,
point such that l is the perpendicular bisector
AC and the in circle, r’ the radius of this circle
of PR. Join QR and let T be its point of
and F its point of contact with AB. Since AB
intersection with 𝜆. We claim that T is the
and AC both touch this circle and F its point of
desired point.
contact with AB. Since AB and AC both touch
this circle, its centre must also lie on AI. From Let N be the point on 𝜆 other than T. We shall
l’ draw I’D ⊥ IE in ∐ ′𝑑 show that since 𝜆 is the right bisector of PR,
therefore every point on 𝜆 is equidistant from
𝐼𝐷 = 𝑟 − 𝑟 ′ 𝑙𝑙 ′ = 𝑟 + 𝑟 ′
P and R. In particular TP = TR, NP = NR.
′ 𝜋 𝐴
∠𝑙𝐷𝑙 = 2
, ∠𝐷𝑙 ′ 𝑙 = 2
,
Therefore PT +QT = TR+QT= QR
345
(Since Q, T, R are in a straight line). Adding corresponding sides of (1) and (2),
we have [APD]+[BQC]= [ACP]+[BQC]=
Also PN +QN = QN+NR. Since two sides of a
[AQCP], = [AQP]+[PQC]……(3)
triangle are together greater than the third,
therefore in ∆ QNR, 𝑄𝑛 + 𝑁𝑅 > 𝑄, 𝑖. 𝑒. 𝑃𝑁 + Since Q is the midpoint of AB, therefore ∆s
𝑄𝑁 > 𝑃𝑇 + 𝑄𝑇. AQP and BQP have equal bases AQ and QB,
and a common vertex P. Consequently
Hence the sum of the distances of P and Q
[AQP]=[QBP] …………..(4)
from T is the least.
Again, since P is the midpoint of CD, therefore
∆s PQC and QPD have equal bases CP and PD,
25) ABCD is a quadrilateral and P, Q are mid- and a common vertex Q. Consequently, [PCQ]
points of CD, AB, AP, DQ meet at x and BP, = [QPD] …………..(5)
CQ meet at y. Show that ∆ADx+∆BCy=
Adding corresponding sides of (4) and (5),
area of quadrilateral PxQy
we have [AQP]+[PQC]= [QBP]+[QPD]=
Sol.: As usual we shall denote the area of a [QBPD] …………..(6)
∆ABC by [ABC] and that of a quadrilateral
From (3) and (6), we have [APD]+[BQC]=
ABCD by [ABCD] join AC and PQ. Since P is the
[QBPD] ………..(7)
midpoint of DC, therefore ∆APD and ∆ACP
have equal bases PD and CP, and a common Since [APD]= [AxD] +[DxP] …………….(8)
vertex A.
[BQC] = [BYC]+[BYQ] …………….(9), [QBPD]=
[QBY]+[PxQY]+[DxP] ………..(10)
Substituting from (8), (9) and (10), we have
[AxD]+[DxP]+[ByC]+[ByQ]=[QBy]+[PxQy]+
[DxP] i.e. [AxD]+[ByC]= [PxQy] as described.
Consequently, [APD]≠[ACP] ………..(1) Again,

∆s BQC and AQC have equal base QB and AQ 26) A ∆ ABC has in centre I. It’s in circle
(because Q is the mid points of AB), and a touches the side BC at T. The line through
common vertex C. Consequently, [BQC]= T parallel to IA meets the in circle again at
[AQC] ………(2) S and the tangent to the in circle at S’

meets the sides AB, AC at points C, B’
346
respectively. Show that ∆A’B’C’ is similar 1 1

= ( ∠𝐴 + ∠𝐵) − ∠𝐴, = ∠𝐵
to ∆ABC. 2 2
Since ∠A is common and ∠B’= ∠B, therefore

Sol.:
∆AB’C’ and ∆ABC are equiangular and hence
similar.
27) Let ABC be a triangular in a plane∑. Find

the set of all points P (distinct from A, B, C)
in the plane ∑ such that the circumcircles
of ∆s ABP, BCP, and CAP have the same
radii.
Sol.:
Let Al produced meet BC in H. Since ∆s ABC
and AB’C’ have ∠A in common, therefore in
order to show that ∆s ABC and ∆AB’C’ are
similar, we should compute ∠B’ (or ∠C’) in
terms of ∠A, ∠B and ∠C, and show that ∠B’ is
equal to either ∠B or ∠C.
Let us denote the point of intersection of B’C’

and AH by x. In ∆AB’x, ext.
∠𝐵′ 𝑥𝑙 = ∠𝑥𝐴𝐵′ + ∠𝐴𝐵′ 𝐶 ′
1 If P lies on the circumcircle of ∆ABC, then the

𝑆𝑜 𝑡ℎ𝑎𝑡, ∠𝐴𝐵′ 𝐶 ′ = ∠𝐵′ 𝑥𝑙 − ∠𝐴
2 circumcircles ∆s BCP, CAP, and ABP coincide
1
= (90° − ∠𝑥𝐿𝑠) − ∠𝐴 with the circumcircle of triangle ABC, and
2
1 therefore they are all congruent. Therefore
= 90° − ∠𝐼𝑆𝑇 − ∠𝐴,
2 every point on the circumcircle of ∆ABC
satisfies the given condition.
𝑆𝑖𝑛𝑐𝑒 ∠𝑥𝑙𝑆 𝑎𝑛𝑑 ∠𝐼𝑆𝑇 𝑎𝑟𝑒 𝑎𝑙𝑙. ∠𝑆 𝑠𝑖𝑛𝑐𝑒 𝐼𝑇 =
1 1
𝐼𝑆 = 90° − ∠𝐼𝑇𝑆 − 2 ∠𝐴, = ∠𝑆𝑇𝐶 − 2 ∠𝐴 Let P be a point not lying on the circumcircle
of ∆ABC and satisfying the condition that
1
= ∠𝐼𝐻𝐶 − ∠𝐴(𝑐𝑜𝑟𝑟𝑒𝑠, ∠𝑆)
2
347
circumcircle of ∆s PBC, PCA, and PAB are circumcentre of the triangle and the point
congruent. O are collinear.
Let us denote the circles PBC, PCA, PAB by Sol.: Suppose three congruent circles with
𝑐1 , 𝑐2 , 𝑐3. respectively and their centres by L, centres P , Q, R lie inside a ∆ABC, and are such
M, N respectively, Since L and M are the that the circle with centre P touches AB and
centres of two congruent circles 𝑐1 𝑎𝑛𝑑 𝑐2 AC, that with centre Q touches BC, and AB,
respectively. And the points P, C lie on both and that with centre R touches CA and BC. BC
these circles, therefore LC = LP = MC = MP. and AB, and that with centre R touches CA
and BC.
Therefore P, L, C, M are the vertices of a
rhombus. Similarly P, L, B, N are the vertices
of a rhombus, and P, M, A., A, N are also the
vertices of a rhombus.
Now PL is equal and parallel to BN, and PL is

also equal and parallel to CM. Therefore BN is
equal and parallel to CM. Therefore BNMC is a
parallelogram. Therefore BC is parallel to MN.
Also let the circles pass through a common
Now MN is the line joining the centres of the point O.
circles 𝑐2 𝑎𝑛𝑑 𝑐3 and PA is the common chord
Since O lies on all the three circles, therefore
of these circles. Therefore MN ⊥AP. Since BC
PO = QO = RO. Therefore O is the
∥MN, it follows that BC⊥ AP. Similarly CA⊥BP.
circumcentre of ∆PQR. Let O’ (not shown in
AB ⊥CP consequently P is the orthocenter of
the fig) be circumcentre of ∆ABC.
∆ABC.
Since BC is a tangent to the circles Q and R,
Thus we find that if P be a point such that the
the lengths of perpendiculars from Q and R on
circles PBC, PCA, PAB are congruent, then P is
these circles are equal.
either the orthocenter of ∆BC or it is a point
on the circumcircle of ∆ABC. Therefore QR ∥BC
28) Three congruent circles have a common Similarly RP ∥CA, PQ∥AB

point O and lie inside a triangle such that
Again , since AB and AC both touch the circle
each circle touches a pair of sides of the
with centre P therefore P is equidistant from
triangle. Show that the in centre and the
348
AB and AC. Therefore P lies on the internal 𝐶𝐴2 + 𝐶𝐵2 = 2𝐶𝐹 2 + 2𝐴𝐹 2
bisector of ∠A.
1 3
So that, 2
𝐴𝐵2 = 𝐴𝐶 2 + 𝐵𝐶 2 − 2 (4 𝐵𝐶 2 ),
Similarly Q and R lie on the internal bisector
𝑖. 𝑒. , 𝐴𝐵2 = 2𝐴𝐶 2 − 𝐵𝐶 2
of ∠B and ∠C respectively.
Since ∠C is an obtuse angle, therefore A𝐵2 >
Therefore AP, BQ, CR when produced meet at
𝐴𝐶 2 + 𝐵𝐶 2 , 𝑠𝑜 𝑡ℎ𝑎𝑡 2𝐴𝐶 2 − 𝐵𝐶 2 > 𝐴𝐶 2 +
the in centre l of ∆ABC. Since QR ∥BC, RP ∥CA,
𝐵𝐶 2 .
PQ∥AB, it follows that l is also the in centre of
𝐴𝐶
∆PQR. 𝑖. 𝑒. , 𝐴𝐶 2 > 2𝐵𝐶 2 𝑜𝑟 𝐵𝐶 > √2
29) Let G be the centriod of ∆ABC in which the Since AGCP is an 118𝑚 , therefore
angle at C is obtuse AD, Fare the medians
from A, C respectively on to the sides BC, ∠𝑃𝐴𝐺 = 180° − ∠𝐶𝐺𝐴 = 180° − ∠𝐷𝐺𝐹 =
AB. If the four points B, D, G, F are ∠𝐶𝐵𝐴 … … … . . (𝑖𝑖𝑖)

𝑨𝑪
concyclic, show that > √𝟐. If further P 𝐴𝐺
2
( )𝐴𝐷 𝐴𝐵
𝑩𝑪 3
Also 𝐴𝑃
= 2 = 𝐵𝐶 , by (i) and (ii)
( )𝐶𝐹
is a point on the line BG extended such 3
that AGCP is a parallelogram, Show that …………(iv)

the ∆s ABC and GAP are similar.
From (iii) and (iv), we find that ∆GAP and
Sol.: Since chords BF and DG of the circle ∆ABC are similar, the correspondence G→A,
BDGF meet at A (outside the circle), therefore A→B, P→C being a similarity.
1
BA. FA = DA. GA so that 2 𝐴𝐵2 = 30) Let 𝑨𝟏 , 𝑨𝟐 , 𝑨𝟑 , … . , 𝑨𝒏 is n sided regular
2 3 𝟏 𝟏 𝟏
𝐴𝐷 2 , 𝑖. 𝑒. 𝐴𝐷 2 = 𝐴𝐵2 … … … … . . (𝑖) polygon such that 𝑨 =𝑨 +𝑨 .
3 4 𝟏 𝑨𝟐 𝟏 𝑨𝟑 𝟏 𝑨𝟒
Determine n, the number of sides of the

Again, since chords FG and BD meet at C
polygon.
(outside the circle), therefore FC. GC= BC. DC.
2 1 Sol.: Let each side of the polygon be of length

So that 𝐹𝐶 2 = 𝐵𝐶 2 𝑖. 𝑒. 𝐶𝑃2 =
3 2 (𝑛−2)𝜋
3
a since ∠𝐴1 𝐴2 𝐴3 = 𝑛
, 𝐴1 𝐴2 = 𝐴2 𝐴3 = 𝑎.
4
𝐵𝐶 2 … … … … (𝑖𝑖)
𝜋
therefore from ∆𝐴1 𝐴2 𝐴3 , 𝐴1 𝐴3 = 2𝑎 cos (𝑛).
𝜋
Also from ∆𝐴2 𝐴3 𝐴4 , 𝐴2 𝐴4 = 2𝑎 cos (𝑛)
349
Since the polygon 𝐴1 𝐴2 … . . 𝐴𝑛 is regular, its 𝑆𝑜 𝑡ℎ𝑎𝑡 4𝜃 = (2𝑛 + 1)𝜋 − 3𝜃

vertices lie on a circle. In particular, the
∴ cos 4𝜃 = cos[(2𝑛 + 1)𝜋 − 3𝜃] = − cos 3𝜃
quadrilateral 𝐴1 𝐴2 𝐴3 𝐴4 is cyclic.
⟹ 2𝑐𝑜𝑠 2 2𝜃 − 1 = (4𝑐𝑜𝑠 3 𝜃 − 3 cos 𝜃 ),
⟹ 2(2𝑐𝑜𝑠 2 𝜃 − 1)2 = 1 + 4𝑐𝑜𝑠 3 𝜃 − 3 cos 𝜃 =

0,
⟹ 8𝑐𝑜𝑠 4 𝜃 + 4𝑐𝑜𝑠 3 𝜃 − 8𝑐𝑜𝑠 2 𝜃 − 3 cos 𝜃 +

1 = 0,
By Ptolemy's theorem𝐴1 𝐴2 𝐴3 𝐴4 + ⟹ (cos 𝜃 + 1)8𝑐𝑜𝑠 3 𝜃 − 4𝑐𝑜𝑠 2 𝜃 − 4 cos 𝜃 +

𝐴1 𝐴4 . 𝐴2 𝐴3 − 𝐴1 𝐴3 − 𝐴2 𝐴4 1 = 0 … … … . . (2)
𝜋 2
𝜋 3𝜋 5𝜋
∴ 𝑎2 + 𝐴1 𝐴4 . 𝐴2 𝐴3 = [2 acos (𝑛)] ; 𝑖. 𝑒., Now (2) is satisfied by 𝜃= 7 , , , 𝜋, … …
7 7
𝜋
𝐴1 𝐴4 = 𝑎 (4𝑐𝑜𝑠 2 𝑛
− 1)
Rejecting the factor cos 𝜃 + 1 which
1 1 1 corresponds to 0= 𝜋 and putting cos 𝜃 =y,

𝑆𝑖𝑛𝑐𝑒 = +
𝐴1 𝐴2 𝐴1 𝐴3 𝐴1 𝐴4
We find that
1 1 1 𝜋 3𝜋 5𝜋
𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒, 𝑎 = 𝜋 + 𝜋 cos , cos , cos , 𝑎𝑟𝑒 𝑟𝑜𝑜𝑡𝑠 𝑜𝑓 8𝑦 3 −
2 acos( ) 𝑎[4𝑐𝑜𝑠2 ( )−1] 7 7 7
𝑛 𝑛
4𝑦 2 − 4𝑦 + 1 = 0 … … … (3)
𝜋 𝜋
⟹ 2 cos ( ) [4𝑐𝑜𝑠 2 − 1]
𝑛 𝑛 Since equations (1) and (3) are the same,
𝜋 𝜋
= 4𝑐𝑜𝑠 2 − 1 + 2 acos ( ) therefore the roots of (1) are
𝑛 𝑛
𝜋 3𝜋 5𝜋 𝜋
cos 7 , cos 7
, 𝑎𝑛𝑑 cos 7
. But cos 𝑛 is a root of
𝜋 𝜋 𝜋
⟹ 8𝑐𝑜𝑠 3 (𝑛) − 4𝑐𝑜𝑠 2 (𝑛) − 4 cos (𝑛) + 1 =
(1). Therefore we must have n = 7.
0
𝜋
⟹ 𝑥 = acos ( ) 𝑖𝑠 𝑎 𝑟𝑜𝑜𝑡 𝑜𝑓 𝑡ℎ𝑒 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛
𝑛
8𝑥 3 − 4𝑥 2 − 4𝑥 + 1 = 0 … … … … (1)
We shall show that the roots of (1) are

𝜋 3𝜋 5𝜋
cos ( 7 ) , cos ( 7 ), cos ( 7 )
𝐿𝑒𝑡 7𝜃 = (2𝑛 + 1)𝜋.
350

Bs Book

Uploaded by

Copyright:

Available Formats

Bs Book

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Bs Book

Uploaded by

Copyright:

Available Formats

Challenging Mathematical Problems

1000 Solved Problems for Bachelor's Entrances

This page is intentionally left blank.

With Best Wishes,

Founder of Ctanujit Classes.

Indian Statistical Institute, Kolkata.

Content of the Book:

ISI B.STAT/B.MATH Alternatively, put p=5,n=100,thus from

[Theorem: (de Polinac's formula) ⇒ P (12) 13-1 = -1

Ans:- (b) The sum of the digits in unit place

𝑦 log −log Number of numbers containing the even

So we take advantage of ‘i’ the square root ∴ 𝐴2008 = (𝐴4 )502 = 𝐴4 =

(d) none of the above (a) 𝒆−𝟏 (b) 𝒆−𝟐

Ans:- (a) f(x, y) = 4𝑥 2 + 9𝑦 2 − 12𝑥 − = 2426 − 2326

= (4𝑥 2 − 12𝑥 + 9)+( 9𝑦 2 − Also, R= 2426 − 2326 = (1 + 23)26 − 2326

𝟒𝟖𝟓𝟐 − 𝟒𝟔𝟓𝟐 ⇒ f (0) = f(x) + f (-x)

20. If f(x)= x+ sinx, then find 𝐿𝑅 𝑃𝐿 𝛼−𝑎 𝑏

⟹ 𝛥 PRL and QRM are similar (c)(x-n)a = (y-m)b

Ans:- (d) (a) 𝒆𝟐 (b) 3

2(y-b)= (k+ 1)n ……………….(2) 26. If f(x) = cos x+ cos ax is a periodic

⇒ 891011 ≡ −1 (𝑚𝑜𝑑 3) = n (say)

Here 1234 is even, so 1234567 ≡ 27. Let f : R⟶ R defined by f(x)= 𝒙𝟑 +

⇒ 891011 ≡ 1 (𝑚𝑜𝑑 4) (a) many-one onto (b) many-one into

∴ f is an increasing function and 29 . If k be the value of x at which the

Ans. (a) when x= n𝜋, n 𝜖 I, sin x = 0 and f(x) has max. at x = 2

∴ f(x) = 0 Now sin x + cosec x = k ⟹ sin x + cosec x

Given f(x+ y)= f(x)+f(y) - xy - 1 ∀ 𝑥, 𝑦, 𝜖 𝑅

f(2) = f(1+1)= f(1)+f(-1)-1-1= 0

f(3 )= f(2+1)= f(2)+f(1)-2.1-1= -2

f(n+1) = f(n) +f(1) – n – 1 = f(n)- n< f(n) Ans:- (c) 𝐸 2 = 1 + 𝑎 +

OBJECTIVE QUESTIONS & which is the required result.

1. 𝒂𝟏 = 𝒂𝟐 = 𝟏, 𝒂𝟑 = −𝟏, 𝒂𝒏 = a+b = 𝜆, then the max. Value of a and b is

+1, +1, −1, −1, −1, 1, −1 ,

Multiplying the given equation by 4, we 5. The great common divisor (gcd) of

Giving 6 ordered pair solutions (m, n) viz (1, (without factorial) is

(𝑥0 3 −1)(𝑥0 3 +1)

If our polynomial g has more than one zero, ⇒ a+ 6 ≡ 0 (mod 9)

Ans:- (b) 72 = 8× 9, and 8 and 9 are co 𝑎 0

Now 𝑠1 = {4, 8, 12, 16, 20, 24}= set of ⇒ 4+ a= 0

∴ a⃗ + 𝜆(b⃗ × 𝑐⃗) = 𝑏⃗⃗ + 𝜇(𝑐⃗ × 𝑎⃗)

26. Tangents and normal drawn to

4𝑛+1 𝜋2 Suppose ABCD is rectangle,

Also. 2(cos −1 𝑥)=

𝟏 𝒏 𝒏 𝒏 Ans:- (b) LHS= |3 − 3𝑥 | + |3𝑥 − 1| ≥

∴ given equation has no solution for any

⇒ 𝑥 2 + 𝑥 > 0 and 𝑥 2 + 𝑥 − 12 < 0 (iii) If 1 ≤ 𝑥 < 2, then |x-1 -1|+x ≤ 2

-log 2 𝑎+ 3> 0 and -log 2 𝑎 − 3 > 0 f″(x)

𝒅𝒚 𝟏 Case Total no. of ways

Let s =16902608 + 26081690 Case – II:- i= j≠ 𝑘

Let s′= 32608 + 41690 3 9 27 135

= 3× 27867 + 4 × 64563 12. The solution of the differential

∴ Hence remainder is 1. Ans:- (b) f(x)dy +f′(x)ydx = dx

For the requirement sum we have to remove (a) 2 (b) 4 (c) 6

Ans:- (b) Differentiable both sides, we get 𝟏

⇒ 𝐵 𝑇 = (𝐼 + 𝐴𝑇 )−1 (𝐼 + 𝐴𝑇 ) = (𝐼 − Taking –ve sign

Ans:- (b) z = 2 is the only solution. Ans:- (a) (𝑎 + 𝑏 + 𝑐)2 ≥ 0

So there is only one solution of the given ⇒ 𝑎2 + 𝑏 2 + 𝑐 2 ≥ −2(𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎)

(3n- r)= ½ [not possible] Ans:- (a) Let 1- a= x, 1- b= y, 1- c = z

For P= ±1, ±3, ±5, ±15 𝑦+𝑧 𝑧+𝑥 𝑦+𝑥