Escolar Documentos
Profissional Documentos
Cultura Documentos
Contents
Paper 1
Paper 2
38
Concluding Remarks
80
The year 2013 represented a drastic departure in the history of the JEE.
Till 2012, the selection of the entrants to the IITs was entirely left to the
IITs and for more than half a century they did this through the JEE which
acquired a world wide reputation as one of the most challenging tests for entry
to an engineering programme. Having cleared the JEE was often a passport
for many lucrative positions in all walks of life (many of them having little to
do with engineering). It is no exaggeration to say that the coveted positions
of the IITs was due largely to the JEE system which was renowned not
only for its academic standards, but also its meticulous punctuality and its
unimpeachable integrity.
The picture began to change since 2013. The Ministry of Human Resources decided to have a common examination for not only the IITs, but
all NITs and other engineering colleges who would want to come under its
umbrella. This common test would be conducted by the CBSE. Serious concerns were raised that this would result in a loss of autonomy of the IITs
and eventually of their reputation. Finally a compromise was reached that
the common entrance test conducted by the CBSE would be called the JEE
(Main) and a certain number of top rankers in this examination would have
a chance to appear for another test, to be called JEE (Advanced), which
would be conducted solely by the IITs, exactly as they conducted their JEE
in the past.
So, in effect, the JEE (Advanced) from 2013 took the role of the JEE in the
past except that the candidates appearing for it are selected by a procedure
over which the IITs have no control. So, this arrangement is not quite the
same as the JEE in two tiers which prevailed for a few years. It was hoped
that now that the number of candidates appearing for the JEE (Advanced)
is manageable enough to permit evaluation by humans, the classic practice
of requiring the candidates to give justifications for their answers would be
revived at least from 2014, if not from 2013 (when there might not have been
sufficient time to make the switch-over). But this did not happen in 2015
even after a change of regime at the Union Government and has not happened
for 2016 either. A slight improvement is the provision of some partial credit
where a candidate marks some but not all correct answers provided that
no incorrect is marked. Another welcome feature is that the total number
of questions has been reduced and, more importantly, matching pairs has
been dropped. This often resulted in increasing the number of questions
tremendously.
As in the past, unless otherwise stated, all the references made are to the
authors book Educative JEE (Mathematics) published by Universities Press,
Hyderabad. The third edition of this book is now available in the market.
Because of the multiple choice format and many other constraints in papersetting, interesting questions in mathematics are getting rarer. The continuation of these annual commentaries has been possible largely because of
the keen interest shown by the readers. These commentaries are prepared
single-handedly and hence are prone to mistakes of spelling, grammar and occasionally, wrong symbols (but, hopefully, not mistakes of reasoning!). Many
alert readers in the past had pointed out some such errors. They were corrected and the corrected versions were uploaded from time to time. But by
that time their immediate relevance was reduced.
As an experiment, last year, a draft version of the commentary on both the
papers was uploaded. Those readers who noticed any errors in it were invited
to send an email to the author at kdjoshi314@gmail.com or send an SMS
to the author at 9819961036. Alternate solutions and any other comments
were also solicited. This really paid off. So this year too, the experiment
is repeated. The readers may send their comments to the author by e-mail
(kdjoshi314@gmail.com) or by short mobile messages (9819961036).
As in the past, although all candidates have to answer the same questions,
multiple codes are generated by permuting them. So the answer keys have
to be prepared keeping in mind these codes. Since the present commentary
gives not only the answers but detailed solutions, the code hardly matters.
But for easy reference, Paper 1 is in Code 1 while Paper 2 is in Code 9.
2
PAPER 1
Contents
Section - 1 (Only One Answer Correct Type)
11
30
Q.37 Let
(A)
(C) 2 tan
(D) 0
(1)
(2)
A very straightforward problem, requiring only the quadratic formula and the trigonometric identity sec2 = tan2 + 1. The only catch
is to determine which of the roots is larger in each case and this requires
that since lies in the fourth quadrant, sec is positive and tan negative. Using periodicity of trigonometric functions, the problem could
have been made to demand a little more work by giving the coefficients
of x in the quadratics as, say 2 sec(3) and 2 tan(2) and giving to
lie in some other interval. But that would not change the spirit of the
problem. The four given options correspond to all possible choices of
the larger roots. So, a candidate who makes a wrong choice will not be
alerted.
Q.38 A debate club consists of 6 girls and 4 boys. A team of 4 members is
to be selected from this club including the selection of a captain (from
among these 4 members) for the team. If the team has to include at
most one boy, then the number of ways of selecting the team is
(A) 380 (B) 320 (C) 260 (D) 95
Answer and Comments: (A). Another very straightforward problem. Let us first form only the teams (without worrying about the
captain). There are two types of teams,!those with no boys and those
6
= 15 teams of the first type.
with only one boy. Clearly, there are
2
For the second type, the boy can be chosen in 4 ways and
! for each such
6
= 20 ways. So
choice, the three girls in the team can be picked in
3
there are 80 teams of this type. Together there are 95 teams. For each
such team, the captain can be chosen in 4 ways. So, in all there are
95 4 = 380 teams, where two teams with the same members but with
different captains are to be distinguished. This is perhaps the only
testing point in an otherwise dull problem. But in verbal problems,
there is sometimes a risk that the correct interpretation may not strike
to a candidate because of language deficiency.
There is an alternate way to do the problem. First fix the captain.
This can be done in 10 ways. Now ask the captain to choose the
remaining team members. If the captain is a boy, all three remaining
members are girls and so the number of teams with his captaincy is
4
6
= 20. As there are 4 boys, there are 80 teams with a male captain.
3
!
5
= 10
If the captain is a girl, she can choose either three girls in
3
!
5
4 = 40 ways. So, for every girl,
ways or two girls and one boy in
2
there are 50 possible teams where she is the captain. As there are 6
girls in all, the number of teams with a female captain is 300. So the
total count is 80 + 300 = 380, the same answer as before.
The second solution is a little more complicated. Although for a
simple problem like this such a comparison is not of much value, the
approach taken in the second solution deserves to be commented. In
essence, the problem involves selection at two stages, once the selection
of 4 members from 10 (subject to the given restrictions) and then a
second selection, viz., that of the captain from those selected at the
first round. The second solution reverses this order. More generally,
suppose we have n objects from which k objects are to be chosen in
the first round and then from these k chosen objects, r objects are to
be chosen at the second round, where we assume that
r
! n. Then
!
k
n
while by
n
k
n
k
=
r
r
nr
kr
(1)
(An algebraic proof is also possible by simply expanding both the sides.
But the combinatorial proof tells you the logic.)
An interesting special case of (1) arises when r = 1. (This is
also the case in our present problem, except that now there are some
restrictions on the selections.) In this case, we have
!
n1
n
=n
k
k1
k
(2)
n
. (See also the last solution to the JEE 1998 problem in
divide
k
Comment No. 5 of Chapter 4.)
7
9
(B)
2
9
(C) 0 (D)
5
9
3
1
and are familiar
If we divide both the sides by 2, and notice that
2
2
expressions in trigonometry, we get a clue to the solution. Indeed these
numbers are sin(/3) and sin(/6) respectively. So (2) reduces to
cos(x
) = cos 2x
3
(3)
)
3
(4)
3
2n
and x =
+
3
9
x = 2n
(5)
(6)
36
73
(B)
47
79
(C)
78
93
(D)
75
83
Answer and Comments: (C). The very words given that suggest
that this is a problem on conditional probability. The paper-setters
deserve to be congratulated for asking a probability problem which does
not involve drawing balls from urns or throwing dice. Instead, they have
posed the problem in a setting that would easily appeal to the young
generation. Superficial as these garbs are, a faulty computer is surely
far less deadly than a cancerous tumour or a poisonous mushroom!
One wishes, however, that the paper-setters were also careful in
giving the fake answers. A layman often thinks of probabilities in terms
of percentages and this can also be justified mathematically. So, let us
7
say, that 100 computers are produced by the factory, with 20 coming
from plant T1 and 80 from T2 . We are given that 7 out of these 100
computers are faulty. The computer chosen at random is among the
remaining 93 ones. Out of these some, say x are from T1 and y from T2 .
y
The desired answer then is the ratio
. As only one of the answers
93
has a denominator which divides 93, it must be the right one. So even
without calculating y, a clever candidate can identify the answer. To
preclude such a sneaky cakewalk, at least one of the fake answers should
have had a denominator like 31.
For an honest solution, one has to calculate y. Let p be the
percentage of faulty computers in T2 . Then the percentage of faulty
computers in T1 is given to be 10p. So the numbers of faulty computers
in T1 and T2 are, respectively, 200p and 80p respectively. The data gives
the equation
280p = 7
(1)
1
So we get p =
. We have y = 80 80p = 78. Hence the correct
40
78
answer is
.
93
In a systematic (albeit somewhat pedantic) approach, the solution
can be paraphrased using Bayes theorem on conditional probability.
Let T1 and T2 also denote the events that the computer comes from
plants T1 and T2 respectively. These are complementary events with
P (T1 ) = 1/5 and P (T2 ) = 4/5. Let F be the event that a computer
from the factory is faulty. We are given that P (F ) = 0.07. Let F
be the complementary event of F . Then P (F ) = 0.93, The desired
probability is P (T2 /F ). By Bayes theorem, we have
P (T2 F )
P (T2 F )
=
P (T2 /F ) =
P (F )
0.93
(2)
4
P (T2 F )
5
(3)
(4)
By Bayes theorem again and the given values of P (T1 ) and P (T2 ), this
becomes
P (F T1 )
10P (F T2 )
=
1/5
4/5
(5)
5
P (F T1 ) = P (F T2 )
2
(6)
i.e.
(7)
1
Thus we have finally obtained the value of P (F T2 ) as
. Putting
50
1
39
4
= . Putting this into (2),
this into (3) we get P (T2 F ) =
5 50
50
78
1
64
(B)
1
32
(C)
1
27
1
1, for all x > 0 is
x
(D)
1
25
very easy to understand and even to solve for a layman. The present
problem has a one line statement. But it takes some patient thinking
to understand what is asked.
1
As a starter, the requirement that 4x2 + 1 for all x > 0 is
x
1
equivalent to saying that the minimum value of the function 4x2 +
x
over the interval (0, ) be at least 1. This is hardly profound. But it
gives the comforting clue that this is essentially a problem of finding
the minimum of a function over an interval. The catch is that this is a
different function for every real and so its minimum may change as
changes. The problem asks us to find the least value of for which
this minimum is at least 1. Clearly, has to be positive. For < 0,
1
1
4x2 + is negative for large x. For = 0, the function is simply
x
x
which is less than 1 for x > 1. So we assume > 0.
Once this is understood, the problem is routine. Let f (x) be the
1
function f (x) = 4x2 + . Differentiation gives
x
f (x) = 8x
1
x2
(1)
1
which vanishes only when 8x3 = 1, i.e. when x = 1/3 . At this
2
point the derivative changes sign from negative to positive and so the
1
function f (x) has its minimum at x = 1/3 . We denote the minimum
2
value by M to stress that it depends on . As cube roots are involved,
in the calculation of M , it helps to rewrite f (x) as
f (x) =
4x3 + 1
x
(2)
By a direct calculation,
1
)
21/3
4
+1
8
1 1/3
M = f (
=
= 31/3
10
(3)
1
. So
The requirement that M 1 is satisfied if and only if 3
27
1
is the least value of for which the given condition holds.
27
As it often happens, the A.M.-G.M. inequality can give a purely
algebraic solution to the problem of minimising a sum of two positive
functions. But as pointed out at the end of Comment No. 6 of Chapter
6, to apply this inequality sometimes one has to recast the sum as the
sum of three functions instead of two. (See also the end of Comment
No. 11 of Chapter 13 for minimisation of 2 cos x + sec2 x.) So, in our
problem, after it is established that > 0, one can rewrite f (x) as
1
1
4x2 +
+
and then the A.M.-G.M. inequality gives that f (x)
2x 2x
1
1
i.e. when x = 1/3 . This
31/3 with equality holding when 4x2 =
2x
2
leads to a quicker, albeit trickier, calculation of M . (The problem is
shockingly similar to the one mentioned at the end of Comment No. 6,
Chapter 6.)
In essence there are two minimisation problems here. The first
one is a bit tedious and prone to numerical errors. The second one is
easy. Fortunately, if a good student (who has understood the problem
correctly) makes a mistake in the first part, it is unlikely that his answer
will tally with any of the given ones and he will be alerted. Unlike the
last problem, there is no sneaky way to guess the answer. Because
cube roots are involved, a clever student might make a wild guess that
the correct answer is a perfect cube. But the paper-setters have taken
the precaution to include a fake answer which is also a perfect cube.
So this is a rare problem where the multiple choice format helps the
sincere students without rewarding the insincere ones.
3
(B) the equation of the plane containing the triangle OQS is xy = 0
y
R
3
Q
3
P
12
3
3
(A), we can consider the vectors OQ= 3~i + 3~j and OS= ~i + ~j + 3~k
2
2
and find the angle between them by taking their dot product. But
it is much easier to do this by simple trigonometry. The angle, say
between OQ and OS is the same as the angle 6 SOT in the right
ST
3
ST
= 1
=
= 2.
angled triangle SOT . Hence tan =
OT
OQ
3 2/2
2
1
| OR OS |
2
~i ~j ~
k
1
=
0 3 0
2 3 3
3
2
2
1 ~ 9~
9
=
|9i k| =
5
2
2
4
13
(4)
9 9
27
3
+ +9=
=3
. By dividing 2 by
Next, we find RS =
4 4
2
2
RS we get
that
thesperpendicular distance of O from the line containing
9 5 2
15
=
RS is
. Hence (D) is true. An alternate approach is
2
2.3 3
to get the equations of the line RS. Since R = (0, 3, 0) and S =
(3/2, 3/2, 3), the parametric equations of the line RS are
y3
z0
x0
=
=
=t
3/2
3/2
3
(1)
(2)
for some t. We want t for which OX RS. Taking the dot product of
(1)
(2)
xy = x2 + c
(3)
c
x
(4)
The question asks which of the given four statements is(are) true for
this function. We tackle them one-by-one.
15
c
x2
(5)
1
for all x > 0. So f ( ) = 1 cx2 which tends to 1 as x tends to 0
x
1
1
from the right. So (A) is true. For (B), xf ( ) = x( + cx) = 1 + cx2
x
x
which tends to 1 as x 0+ . So (B) is false. In (C), x2 f (x) =
c
x2 (1 2 ) = x2 c which tends to c as x 0+ . As c 6= 0, (C) is
x
false. Finally for (D), from (4), the function f (x) is clearly unbounded
in a neighbourhood of 0. So (D) is false too.
The question is not difficult, but puzzling because its purpose is not
clear. It is a combination of two problems, solving a differential equation and then answering some arbitrary questions about the solution.
The first part is too familiar and the second is completely unrelated.
The problem would have been interesting if the properties of the function could be derived directly from the differential equation without
solving it. Combining two mediocre problems only results in a clumsy
and not in an interesting problem.
3 1 2
Q.44 Let P = 2 0
, where
3 5 0
such that P Q = kI where k IR, k
k
order 3. If q23 = and det(Q) =
8
(A) = 0, k = 8
(B) 4 k + 8 = 0
(1)
(2)
k2
and
2
(3)
(4)
(5)
(6)
(7)
and
k
adj(P )
12 + 20
(8)
the cofactor of the entry 5 in the third row. To obtain it, we delete
the third row and the second column
of#P , take the determinant of the
"
3 2
the resulting 2 2 submatrix
, and multiply by (1)3+2 , i.e.
2
k
by 1. This comes out to be 3 4. So the data q23 = translates
8
into
k
k
=
(3 4)
(9)
8
12 + 20
As k 6= 0, we get
2(3 + 4) = 3 + 5
(10)
This determines uniquely as 1 and shows that option (A) is incorrect. Putting = 1 into (4) gives k = 4. With these values we see
that (B) is true.
The remaining two options deal with the determinants of the adjoints
of P and Q. From (3) we know that det(P ) = 8. Since P adj(P ) = 8I,
k2
we get det(adj(P )) = 82 = 26 . Since Q has determinant
= 8, we get
2
that the determinant of the adjoint of Q is also 26 . So, both P adj(Q)
and Qadj(P ) have the same determinants, viz. 8 26 = 29 , showing
that (C) is true and (D) false.
Problems on adjoints of matrices are rarely asked. Computation of
the entire adjoint of an n n matrix is a laborious job even for n as low
as 3. The present problem requires the calculation of only one entry in
the adjoint and so the work is reasonable. However, some candidates
are likely to confuse adjoints with Hermitian adjoints of matrices, which
are totally unrelated to each other.
Knowledge of the adjoint of a matrix is essential in answering (C)
and (D) because the very statement of these options involves adjoints.
However, in answering (B), knowledge of the adjoint was only instrumental and not essential. A direct calculation of is possible by a
k
brute force method using the data that q23 = . Since q23 appears
8
in the third colum of Q, we calculate the third
column
of the product
of three equations in q13 , q23 , q33 (out of which q23 is already known as
k
), viz.
8
k
+ 2q33 = 0
8
2q13 + q33 = 0
5k
and 3q13 +
= k
8
3q13 +
(11)
(12)
(13)
k
k
. Putting this into (12) gives q33 = . Putting
8
4
these into (11) we get
From (13), q13 =
3k k
k
+
=0
8
8 2
(14)
(1)
can only determine the ratios of the sides to each other. That is, the triangle is uniquely determined upto similarity. And this is good enough
for answering (C) and (D). However, for (A) and (B) we need the additional piece of data that that the area of the incircle of the triangle is
8
which is a twisted way of saying that its inradius, generally denoted
3
s
8
. (Incidentally, area of a circle is the familiar but old
by r, equals
3
language. Nowadays, it is more customary to call it the area bounded
by a circle.)
Let us see first what we get by setting each of the ratio in (1) equal to
some k. Adding the three resulting equations we get 3s(x+y+z) = 9k
i.e. s = 9k. From this we get
x = 5k, y = 6k, z = 7k
(2)
This is sufficient to tackle (C) and (D) using some well-known formulas
for the sines and cosines of half the angles of a triangle in terms of its
sides. Specifically, for (C) we use
X
sin
=
2
(s y)(s z)
yz
(3)
Y
Z
and two similar formulas for sin and sin . If we multiply all these
2
2
three formulas, every factor in the numerator as well as in the denominator appears twice and so the radicals drop out. Also the k factor
cancels out. Thus
sin
X
Y
Z
sin sin
2
2
2
(s x)(s y)(s z)
xyz
432
=
567
4
=
35
=
20
(4)
X +Y
Z
= cos which,
2
2 s
s
s
s(s z)
92
3
by yet another well-known formula, equals
=
=
.
xy
56
5
Squaring, we see that (D) is also true.
8
3
(5)
r = (s x) tan
(s x)(s y)(s z)
s
(6)
(7)
With our present data, after squaring both the sides we have
8
4k 3k 2k
8
=
= k2
(8)
3
9k
3
which means k = 1. Hence we now have x = 5, y = 6, z = 7 and s = 9.
Herons formula for the area of a triangle, viz.
q
(9)
Finally, for (B), there are many formulas for the circumradius R
of a triangle. But as we already know the area , the best formula to
use is
xyz
(10)
R=
4
As all the values on the R.H.S. are known, we get
R =
567
35
=
46 6
4 6
21
(11)
So (B) is false.
The problem is a test of the knowledge of the umpteen number
of trigonometric formulas for a triangle. But more importantly, it is a
test of the ability to select the right formula when several formulas are
available.
Q.46 A solution curve of the differential equation
(x2 + xy + 4x + 2y + 4)
dy
y 2 = 0. x > 0
dx
passes through the point (1, 3). Then the solution curve
(A) intersects y = x + 2 exactly at one point
(B) intersects y = x + 2 exactly at two points
(C) intersects y = (x + 2)2
(D) does NOT intersect y = (x + 3)2
Answer and Comments: (A, D). The first three options all deal with
the curves involving x + 2. This is a built-in hint that the substitution
u = x+2 may simplify the problem. This is borne out by the coefficient
dy
of
in the given differential equation because it factors out as
dx
du
dy
dy
(x + 2)(x + 2 + y). Since
= 1,
is the same as
. So with this
dx
dx
du
substitution. the differential equation becomes
y2
dy
= 2
du
u + uy
(12)
The R.H.S. is the ratio of two homogeneous polynomials of equal degrees (viz. 2) and so we use the substitution y = vu.
dy
dv
=u +v
du
du
(13)
v 2 u2
v2
dv
+v = 2
=
du
u + u2 v
1+v
(14)
22
which simplifies to
u
dv
v2
v
=
v =
du
1+v
1+v
(15)
(16)
(17)
y
=c
u
(18)
y
= 1 + ln 3
u
(20)
We cannot solve this explicitly for y. So we have to resort to adhoc methods to test the various options. In (A) and (B), we have to
take the points of intersection of the curve (20) with the straight line
y = u. Solving simultaneously, we have ln y = ln 3, i.e. y = 3. So (20)
intersects the line y = u at the unique point (3, 3). Therefore (A) is
true and (B) is false. (The existence of the point of intersection was
already given in terms of the initial condition. But now we have proved
its uniqueness.)
23
(21)
(u + 1)2
= 1 + ln 3
u
(22)
1
= 1 + ln 3
u
(23)
which simplifies to
2 ln(u + 1) + u +
For u > 2, the first term is bigger than 2 ln 3 and hence than ln 3 (as ln 3
is positive). The two remaining terms of the L.H.S. are both positive
for u > 2 and hence certainly bigger than 1. So equality cannot hold
in (23) for u > 2. Hence the solution curve and the curve y = (u + 1)2
do not intersect. So (D) is true.
This problem is of the same spirit as Q.43 above. In both, the first
part was to solve a given differential equation and the second part was
to test the properties of the solution. But both the parts of the present
problem are considerably more complicated than their counterparts in
Q.43. It is ironic that both the questions are given the same credit.
Q.47 Let f : IR IR, g : IR IR and h : IR IR be differentiable
functions such that f (x) = x3 + 3x + 2, g(f (x)) = x and h(g(g(x))) = x
for all x IR. Then
(A) g (2) =
1
15
Answer and Comments: (B, C). The relationship g(f (x)) = x does
not automatically mean that the function g is the inverse function of
24
f . For this to happen, one must first show that the function f (x) =
x3 + 3x + 2 is one to one and onto. The first part follows by Lagranges
Mean Value Theorem, because f (x) = 3x2 + 3 > 0 for all x IR
which means that f (x) is strictly increasing and hence one to one on
IR. That it is onto follows from the fact that f (x) as x .
So, the function f indeed has an inverse function f 1 and the equality
g(f (x)) = x is sufficient to conclude that g = f 1 .
There is no easy explicit formula for g(x) because such a formula
would require solving the cubic equation x3 + 3x + 2 = y for every
y IR and there is no easy way to do this. However, by inspection we
see that f (0) = 2 and so g(2) = 0. We are asked g (2). From the chain
rule
g (f (0))f (0) = 1
(1)
1
= . So we see that (A) is false.
3
The remaining three statements are about the function h. Since g =
1
f it is a bijection (i.e. one-to-one and onto). Therefore the composite
function g g : IR IR is also a bijection. Since h(g(g(x))) = x for
all x IR, we get that h is the inverse function of g g. Since g 1 = f ,
by the formula for the inverse of a composite function we get
f (0)
h = (g g)1 = g 1 g 1 = f f
(2)
(3)
(4)
(5)
(6)
(B) R2 R3 = 4 6
26
C2
.Q
R2
Q3
C3
27
which touches them at P, R2 and R3 respectively with P = ( 2, 1).
This covers all the data but in a more succinct and systematic manner.
Now
point P can be easily identified
coming to the solution itself, the
2
as ( 2, 1) by solving the equations x + y 2 = 3 and x2 = 2y simultaneously and choosing the solution for which both
x, y are positive. The
equation of the tangent to C1 at this point ( 2, 1) is
2x + y = 3
(1)
If a circle with centre at a point (0, b) (say) on the y-axis and radius 2 3
is to touch this line, then equating the radius with the perpendicular
distance from this point, we get
b 3
3
=2 3
(2)
Hence (B) is true. Now that we know R1 R2 , to get the area of the
triangle OR2 R3 we only need the perpendicular distance of O from
R2 R2 . This distance is the radius of C1 because R2 R3 touches C1 and
C1 is centred at O. Therefore
1
area of OR2 R3 = 4 6 3 = 6 2
(4)
2
which shows that (C) is also correct.
Finally, for the triangle P Q2 Q3 too, we already know Q2 Q3 = 12.
We need the perpendicular distance of P from Q2 Q3 , But as the line
Q2 Q3 is the y-axis, this distance is simply the x-coordinate of P , viz.
2. Hence
1
(5)
area of P Q2 Q3 = 12 2 = 6 2
2
28
1 1
,
3 3
(B)
1 1
,
4 2
(C)
1
1
,
3
3
(D)
1 1
,
4 2
Answer and Comments: (A, C). Once again, a good diagram makes
you not only understand the
y
problem correctly but may also
inspire solutions. Take P as
(cos , sin ). Then the equaP
tions of the tangent and the
Q
E
normal to the circle at P are
x
S
O
R
x cos + y sin = 1 and y =
tan x respectively while the
tangent at S is simply the line
x = 1.
Solving x cos + y sin = 1 and x = 1 simultaneously, we get
Q = (1,
1 cos
) = (1, cosec cot )
sin
(1)
(2)
(3)
(4)
(5)
(6)
Answer and Comments: 2. Clearly the question is about the number of real solutions of a polynomial equation p(x) = 10 where the
polynomial p(x) is specified as a determinant, viz.
x x2
1 + x3
2
p(x) = 2x 4x 1 + 8x3
3x 9x2 1 + 27x3
30
(1)
(2)
where
1 1 1 + x3
q(x) = 2 4 1 + 8x3
3 9 1 + 27x3
(3)
Subtracting suitable multiples of the first row from the remaining rows,
q(x) =
1 1 1 + x3
0 2 6x3 1
0 6 24x3 2
= 48x3 4 36x3 + 6
= 12x3 + 2
(4)
(5)
Factoring the L.H.S. as (6x3 5)(x3 + 1) we see that the only solutions
5
are those where x3 = or x3 = 1. Each of these equations has only
6
one real solution, Hence the given equation has two real solutions.
A clever student can save some time by dispensing with the actual
roots of (5). Treating it as a quadratic in x3 , as the discriminant is
positive, there are two distinct real roots. Each of these has only one
real cube root and hence (5) has exactly 2 solutions.
The starting step in the expansion of the determinant (1) is too
simple to be missed by anybody. However, although the evaluation
of the determinant in (3) as given here is simple enough, an alternate
solution is to split the third column and write the determinant as a
sum of two determinants, viz.
1 1 1 1 1 x3
q(x) = 2 4 1 + 2 4 8x3
3 9 1 3 9 27x3
31
(6)
1 1 1
1 1 1
3
q(x) = 1 2 4 + 6x 1 2 4
1 3 9
1 3 9
(7)
These two Vandermonde determinants are the same and their common
value is (21)(31)(32) = 2. This gives an alternate derivation
of (4). But the direct derivation is faster.
A fairly simple problem on determinants.
Q.51 Let m be the smallest positive integer such that the coefficient of x2 in
the expansion of (1 + x)2 + (1 + x)3 + . . . + (1 + x)49 + (1 + mx)50 is
(3n + 1) 51 C3 for some positive integer n. Then the value of n is
Answer and Comments: 5. Combinatorial identities have faded out
from the JEE papers after the multiple choice format came in. But in
the present problem the paper-setters have managed to squeeze in one
such identity. The identity itself is not new. Indeed it is exactly the
same identity that appears as the first hint to the Main Problem of
Chapter 5, viz. that for any positive integers m and n with m n,
!
n+1
m
m+1
n2
n1
n
=
+
+ ...+
+
+
m+1
m
m
m
m
m
(1)
50
49
3
2
m2
+
+ ...+
+
S=
2
2
2
2
(2)
The last term in the sum is irregular. But the remaining terms can be
summed by writing them in the reverse order and applying (1) with
n = 49 and m = 2. Hence
!
50
50
m2
+
S=
2
3
32
(3)
51
50
50
m2 = (3n + 1)
+
3
2
3
(4)
m2
17
= (3n + 1)
2
2
(5)
m2 = 51n + 1
(6)
which reduces to
(7)
The problem now is to find the least positive integer n for which 51n
can be factored as the product of two numbers that differ from each
other by 2. If 51 had too many factors then the search would take a
lot of time. But fortunately 51 has only two prime factors, viz. 17 and
3. Rewriting 51n as 17 3n we see that n = 5 fits the table.
This is a good problem and an easy one once you hit upon the right
combinatorial identity to apply. In this respect the problem resembles
a trigonometric problem which unfolds itself once you pull the right
trigonometric identity. The difference is that the world of trigonometric
identities useful at the JEE level is limited and well trodden. That can
hardly be said of combinatorial identities. They are used less frequently
and so while it is reasonable to give the candidate a binomial identity
33
t2
dt = 2x 1
1 + t4
t2
dx 2x + 1
1 + t4
(8)
defined for x [0, 1]. Our job is to find out how many zeros f (x) has
in the interval (0, 1]. As in Q.50, our interest is only in the number
of zeros and not in identifying them. So there may be an easier way
without evaluating the integral explicitly. And indeed there is. Clearly
Z 1
t2
1 < 0 because the interval of
f (0) = 1 > 0 while f (1) =
0 1 + t4
integration has length 1 and the integrand is less than 1 at all its points.
As functions defined by integrals are continuous, f (x) is continuous.
Therefore by the Intermediate Value Property, f (x) vanishes at least
once in the interval (0, 1).
If we could prove that f (x) is strictly decreasing in the interval
[0, 1] that would mean that there are no more zeros. The most standard
method to test this is to check the sign of f (x). By the second form
of Fundamental Theorem of Calculus, we have
f (x) =
x2
2
1 + x4
(9)
As already noted, the first term is always less than 1 for all x [0, 1].
So f (x) < 0 throughout (0, 1) and hence by Lagranges Mean Value
Theorem, f (x) is strictly decreasing in (0, 1). Hence there cannot be
more than one zeros of f (x) in [0, 1]. As we already know that there is
at least one zero, the correct count is 1.
Problems where the number of zeros of a strictly monotonic function
have to be determined using Intermediate Value Property and the Lagrange Mean Value theorem are fairly common in JEE. The additional
34
0
Answer and Comments: 7. The limit in question is of the form.
0
So application of lHopitals rule is indicated. It gives
2x sin x + x2 cos x
x0
cos x
1 = lim
(1)
(2)
35
+ ...
3!
5!
For the ratio to tend to a finite non-zero limit, the dominating powers
in the denominator and the numerator must be the same. This forces
= 1, and, afterwards, the limit equals the ratio of the dominating
terms, which is 6.
A fairly simple problem. Although a rigorous justification is time
consuming, in a multiple choice format it is only the numerical work
that matters and the computations involved are light.
1 + 3i
where i = 1 and r, s {1, 2, 3}. Let P =
Q.54 Let z =
#2
"
(z)r z 2s
and I be the identity matrix of order 2. Then the total
z 2s
zr
number of ordered pairs (r, s) for which P 2 = I is
Answer and Comments: 1. It is more customary to denote z by .
It is called the complex cube root of unity and in the polar form it equals
e2i/3 . Because of the factorisation of z 3 1, it satisfies z 2 + z + 1 = 0.
Also powers of z recur with a cycle of 3. That is, z 1 = z 2 = z 5 = z 8 =
. . . etc. Most of the problems about complex cube roots of unity can
be handled with these two basic properties. (See Comment No. 12 in
Chapter 7 for a few such problems. Also see Part (C) of Q.59 in the
first paper of JEE Advanced 2015.)
In the present case, a direct computation gives
#"
P2 =
"
(z)r z 2s
z 2s
zr
"
z 2r + z 4s
(1)r z r+2s + z r+2s
(1)r z r+2s + z r+2s
z 4s + z 2r
36
(z)r z 2s
z 2s
zr
(1)
(2)
(3)
Since z and its powers are all non-zero, the second equation can hold
only when (1)r = 1, i.e. when r is odd. In the given set {1, 2, 3},
r has to be 1 or 3. We determine the possible values of s in each
case separately from the first equation.. When r = 1, we must have
1 + z 2 + z 4s = 0. This means z 4s = z. So, 4s 1 is divisible by 3. In
the set {1, 2, 3} this is possible only for s = 1. So (1, 1) is a possible
pair.
In the other possibility, viz. r = 3 we have z 2r = z 6 = 1 and so by
equation (2) above z 4s = 2. But this is not possible for any s because
|z| = 1 and so all powers of z are also of absolute value 1.
So there is only one pair. The problem is much simpler and hence
less interesting than last years problem referred above. Apparently
the question was motivated by a perceived compulsion to ask some
question about complex numbers.
37
PAPER 2
Contents
Section - 1 (Only One Correct Answer Type)
38
55
75
1 0 0
1 0 0
P = 4 1 0
16 4 1
1
0 0
8
1 0
=
16 + 32 8 1
P2
1
0 0
12
1 0
=
16 + 32 + 48 12 1
and P 3
(1)
1
0 0
4n
1 0
=
8n(n + 1) 4n 1
(2)
1 0 0
1
0 0
4n
1 0 4 1 0
=
16 4 1
8n(n + 1) 4n 1
1
0
0
4n + 4
1
0
=
8n(n + 1) + 16n + 16 4n + 4 1
1
0
0
4(n
+
1)
1
0
=
(3)
This completes the proof of the inductive step. Hence we have now
established that (2) holds for every positive integer n. Putting n = 50
we get
P 50
1
0 0
200
1 0
=
400 51 200 1
(4)
Q = [qij ] = P 50 + I
(5)
Mercifully, unlike matrix multiplication, matrix addition is done entrywise. To make the things even simpler, the entries of Q we are
interested in are all outside the diagonal and all non-diagonal entries
of the identity matrix are 0. So we simply read out the corresponding
entries of P 50 and get
q31 = 400 51
q32 = 200
and q21 = 200
(6)
q31 + q32
400 51 + 200
=
= 102 + 1 = 103.
q21
200
Another method of finding high powers of a matrix without brute
force is to relate it to some other matrices whose high powers are known
from definition or because of their relationship with some other entities
such as complex numbers (see Comment No. 20 of Chapter 2). Two
classes of such matrices are (i) nilpotent matrices and (ii) idempotent
matrices. By definition, an n n matrix A is nilpotent if Ar is the
zero matrix O for some positive integer r while it is called idempotent
if A2 = A. Note that if A is nilpotent then all powers of A after some
stage are O while if A is idempotent then all powers are equal to A
itself.
So, by sheer arithmetic,
0 0 0
is true of every n n matrix which has zero entries on and above its
main diagonal. But the proof is a bit tedious. An elegant proof can be
given using what are called linear transformations. But that is well
beyond our scope.)
Since P = I + A, P 50 = (I + A)50 . We have to be wary in hastily
expanding this by the binomial theorem. The binomial theorem is valid
for the power of a sum of two real (or complex) numbers because the
multiplication for real or complex numbers is commutative. In fact, the
most direct proof is by writing (a+ b)n as a sum of 2n terms of the form
x1 x2 . . . xn where each xi equals a or b and then grouping together the
like terms using the fact because of commutativity of multiplication,
every term in which exactly r factors are
! a and the remaining n r
n
terms of this type for every
are b equals ar bnr , there being in all
r
r = 0, 1, 2, . . . , n. But matrix multiplication is not commutative. So, if
A and B are two square matrices of the same order then we can expand
(A + B)2 only as (A + B)(A + B) = A2 + AB + BA + B 2 . However,
if A and B commute with each other, then we can write (A + B)2
as A2 + 2AB + B 2 . More generally, the binomial theorem holds for
(A + B)n for any positive integer n if the matrices A and B commute
with each other.
Coming back to P 50 = (I + A)50 , as the identity matrix commutes
with every matrix we can apply the binomial theorem to conclude
P
50
=I
50
50 48 2
50 49
I A + . . . + I nr Ar + . . . + A50
I A+
+
2
1
(7)
(8)
Q = P 50 + I = 2I + 50A + 1225A2
(9)
Hence
By a direct calculation,
0 0 0
0 0 0
0 0 0
A2 = 4 0 0 4 0 0 = 0 0 0
16 0 0
16 4 0
16 4 0
41
(10)
We substitute these in (9). As before, we get q31 , q32 and q21 by adding
the corresponding entries on the R.H.S. This gives q31 = 0 + 50.16 +
1225.16 = 1275.16 = 400 51, q32 = 0 + 50.4 + 0 = 200 and q21 =
0 + 50.4 = 200. These are the same values that we got in (6). So the
answer is the same.
A good problem about matrices. But a bit above the JEE level.
Nilpotent matrices are studied only in degree courses. So most candidates will be forced to try only the first approach and sadly one again,
the scrupulous candidates who not only guess but prove (2) by induction on n will lose in terms of time. The question therefore deserves a
better place in the conventional examination as a question on a proof
by induction.
In passing we mention two other instances where the high powers
of a matrix can be calculated without brute force. First, analougously
to (7), if P = I + A where A is an idempotent matrix, then from the
binomial theorem and the fact that Ar = A for all r 1, we get
P n = (I + A)n = I + (2n 1)A
(11)
"
x y
,
As the other example, if P is a 2 2 matrix of the form
y x
then P corresponds to the complex number z = x + iy. By writing z
as r e i, we get (using DeMoivres rule) that
n
P =r
"
cos n sin n
sin n cos n
(12)
1
6
(B)
4
3
(C)
3
2
|x + 3|, 5y x + 9 15} is
(D)
5
3
B
F
D
C
The present problem falls in the latter category. The upper boundary
of the region is the straight line (shown by L in the figure above)
5y = x + 9
(1)
|x + 3|
(2)
Because of the absolute values sign, we have to consider two cases: (i)
where x + 3 > 0, i.e. x 3 and (ii) where x + 3 < 0, i.e. x 3.
For (i), i.e. for x 3, (2) can be rewritten as
y2 = x + 3
(3)
upper half of (3) are (2, 1) and (9, 3). These are shown as B and H
in the figure below. Note that in between these two points, the line
lies below the parabola and so the portion between them is not inour
region. For x > 9, the line again lies above the parabola. This is true
for all x > 9 and would result in an unbounded region. But we are
specifically given that x + 6 < 15 and that precludes any part of this
unbounded region.
Summing up, the subregion for which x 3 shown as the shaded
part bounded by E B F E has area A1 where
A1
x+9
=
x + 3 dx
5
3
"
#
1
(x + 9)2 2
=
(x + 3)3/2
3
10
3
16
100 36 16
=
=
10
10
3
15
Z
(4)
(5)
which is the mirror image of the parabola (3). It has the same vertex,
viz. E = (3, 0). To find out where it cuts the line (1), we have to
solve the equation y + 5y = 6 which has two roots, 1 and 6. We ignore
the second value as it will give a point of intersection which lies on the
lower half of the parabola. The first value gives (4, 1) as the (unique)
point of intersection of the line (1) with the upper half of the parabola
(5). It is shown as D in the figure above. So, the area of the second
subregion, say A2 is
A2
x+9
x 3 dx
=
5
4
#
"
3
(x + 9)2 2
+ (x 3)3/2
=
4
10
3
36 25 2
13
=
=
10 10 3
30
Z
44
(6)
3
45
= .
30
2
The integration part of the problem is too straightforward. The real
task is to identify the region correctly. So essentially, this is a problem
in coordinate geometry. The paper-setters have been careful enough
to stipulate the condition x + 9 15 which may appear irrelevant at
first sight. (of course, it would have looked more natural to give this
condition as x 6.) Also even though square roots are involved in
the definition of the function, the numerical data has been carefully
chosen to avoid any surds in the answer. This reduces the chances of
numerical error.
Adding (4) and (6) we get the total area of the region as
13
X
k=1
(A) 3
1
sin
3 (B) 2(3
(k1)
6
sin
k
6
is equal to
So, we look for identities that have the product of two sines in the
denominator. One such identity is
cot + cot =
cos cos
sin( + )
+
=
sin
sin
sin sin
(1)
cos cos
sin( )
=
sin
sin
sin sin
(2)
(k1)
6
sin
k
6
= 2 cot (k 1)
2 cot k
6
6
(3)
The job is almost done. Now it is only a matter of adding these terms
for k = 1 to k = 13 and noting that the R.H.S. forms a telescopic series.
Thus if we denote the given sum by S, we have
S =
=
13
X
1
(k1)
6
k=1
sin
13
X
2 cot((k 1)
k=1
= 2 cot
4
= 2 cot
sin
k
6
+ ) 2 cot(k + )
6
4
6
4
13
2 cot
+
6
4
29
2 cot
12
(4)
To finish the solution we only need to calculate the values of these two
cotangents. The first one is 1. For the second one, we need to work a
29
little. First, since cot is periodic with period , cot
is the same as
12
46
5
cot . In terms of degrees, this equals cot 75 or equivalently, tan 15 .
12
This value is not needed as frequently as tan of some other angles such
as 30 or 45 . To calculate it, we let u = tan 15 . Then the identity for
tan 2 gives
1
2u
tan 30 = =
1 u2
3
(5)
u2 + 2 3u 1 = 0
(6)
Q.40 Let bi > 0 for i = 1, 2, . . . , 101. Suppose log b1 , log b2 , . . . , log b101 are in
Arithmetic Progression (A.P.) with common difference loge 2. Suppose
a1 , a2 , . . . , a101 are in A.P. such that a1 = b1 and a51 = b51 . If t =
b1 + b2 + . . . + b51 and s = a1 + a2 + . . . + a51 , then
(A) s > t and a101 > b101
(A) s < t and a101 > b101
know what is gained by giving this twist to the data. Or is it that the
paper-setters are allergic to geometric progressions?
Anyway, coming to the problem, the question is about the relative
rates of growths of geometric progressions and arithmetic progressions.
An A.P. is like a car which runs at a uniform speed, so that it covers equal distances in time intervals of equal durations. A geometric
progression (with common ratio greater than 1), on the other hand, is
like a car which keeps accelerating. Suppose we track two such cars,
A and B respectively by recording their positions at regular time intervals. Suppose that at the start both the cars are together. (That
does not mean that they are at rest. They are both moving but pass
the same roadmark simultaneously.) Suppose we notice that half an
hour later they are together again. What do we make out? Evidently,
their average speeds over this half hour are the same. But in the case
of A, this is also its uniform speed every moment. For B, on the other
hand, intially the speed is less than this average speed and so the car
is lagging behind A. But later its speed picks up and the distance between them begins to decrease and becomes 0 half an hour after the
start. Obviously, at this point the speed of B is much higher than that
of the (constant) speed of A. So, after this half an hour, B will beat A
throughout and the gap between them will go on increasing forever.
All this is clear by sheer common sense. And a candidate whose
common sense is sound can easily tell that (B) is the correct option. In
fact, he can predict that till n = 50, an > bn (the car B lagging behind
A). So not only s > t but even term by term, the summands of s are
bigger than the corresponding summands of t, except the first and the
last summands which are equal for both. In other words, s beats t not
only in the aggregate but in each term. And for all n > 51, an < bn
(car B is ahead of car A).
The present problem asks you to put this common sense into a
mathematical form. an and bn are like the positions of the cars at the
end of the n-th time interval (or to be fussy, at the end of the (n 1)th time time interval from the start, because the progressions begin
with a1 and b1 rather than with a0 and b0 which would have been more
natural). Let d be the common difference of the A.P. a1 , a2 , . . . , a100 .
(In terms of the analogy above d is like the uniform speed of the car
48
A.) Then
an = a1 + (n 1)d
while bn = b1 2n1 = a1 2n1
(2)
(3)
for all n = 1, 2, . . . , 101. Equating a51 with b51 gives the value of d as
d = a1
250 1
50
(4)
250 1
50
(5)
We now attempt to prove that an > bn for n < 51 while an < bn for all
n > 51. Since a1 > 0, it cancels out and these comparisons reduce to
showing that
250 1
2n1 1
>
for 2 n 50
50
n1
250 1
2n1 1
and
<
for n > 51
50
n1
(6)
(7)
Note that equality would hold in both (6) and (7) for n = 51. This is
a consequence of the data that a1 = b1 and a51 = b51 . If we can prove
these inequalities, that will surely imply (B) because s = a1 + a2 + . . . +
a50 + a51 while t = b1 + b2 + . . . + b51 .
Unfortunately, a direct proof of these inequalities is not easy. The
paper-setters have apparently realised this and made the problem less
ambitious by requiring to prove merely that s > t and a101 < b101 . This
is a lot easier because of the formulas for the sums of the terms in an
A.P. or G.P. Indeed, from the formula for the sum of the terms in an
A.P., we get
s = a1 + a2 + . . . + a51 = 51a1 +
250 1
25 51a1
= 51a1 +
50
250 + 1
= 51a1
2
49
50.51
d
2
(8)
As for t, it is the sum of the first 51 terms of a G.P. with common ratio
2 and the first term a1 . So
t = a1 (251 1)
(9)
Clearly, t < a1 251 while from (8), s > a1 249 51 > a1 251 because surely
51 > 4. Put together, s > t.
The comparison of a101 with b101 is much easier. Indeed, from (5),
a101 = a1 + 2a1 (250 1) = a1 (251 1) < a1 251 which is a lot smaller
than a1 2100 which is precisely b101 .
Although that completes the solution, one nagging question remains.
Why is it so difficult to prove the inequalities (6) and (7) when their
counterparts in the analogy given above are so obvious by common
sense, viz. that during the first half an hour, the accelerating car B
always lags behind the car A while thereafter B leads A?
The explanation is that there is a suble flaw in the analogy. The
motion of a car is continuous. Its position is a function of time t which
is a continuous variable. On the other hand, progressions, and more
generally all sequences are functions of a discrete variable n. As a
result, the speed of a moving car has no analogue for progressions,
since speed is defined in terms of derivatives and derivatives (and more
generally limits) are meaningless for functions of discrete variables. If
mangos are falling off a tree, the instantaneous rate of their fall has
no meaning. But if these mangos are squeezed and made into a pulp
and the pulp is pored from a jar then the instantaneous rate of flow
of the pulp is a well-defined entity. This happens because the number
of mangos fallen is a discrete variable while the volume of the mango
pulp is a continuous variable.
However, sometimes we can extend a discrete variable by allowing it to assume all real values (or all non-negative real values) when
the nature of a function is such that it makes sense for a continuous
variable as well. Doing so allows us to apply the powerful machinery
of continuous mathematics such as theorems like the Lagranges Mean
Value Theorem. And then it may be possible to prove some results
about sequences which would not be easy to prove directly.
We illustrate this technique by giving a proof of the inequality
(6). The proof of (7) is similar and left to the reader. Let us first get
50
(10)
(11)
/2
/2
x2 cos x
dx equals
1 + ex
2
2
2 (B)
+ 2 (C) 2 e/2
4
4
(D) 2 e/2
(1)
I =
/2
52
(2)
Further simplification would be possible if the sum inside the parentheses can be simplified. This is indeed possible, because a straight
2 + ex + ex
computation shows that this sum equals
which is
(1 + ex )(1 + ex )
simply 1 because the denominator expands to 1 + ex + ex + 1 thanks
to the fact that ex ex = 1.
We have now removed the troublesome part of I and have reduced
it to a manageable integral, viz.
I=
/2
x2 cos x dx
(3)
i /2
x2 sin x
/2
0
2x sin x dx
/2
2
+ (2x cos x)
=
0
4
2
/2
=
+ 0 (2 sin x)
0
4
2
2
=
4
/2
2 cos x dx
(4)
(B) 3x + z = 0
(D) 2x y = 0
53
(1)
for some real number . To find its value, we note that the midpoint of
(3)
In the second part of the problem, we have to find the equation of the
y
z
x
plane passing through this point P and containing the line = = .
1
2
1
For this we need a vector n perpendicular to this plane. This vector
i j
k
1 5 3
2 3 2
= i 4j + 7k
(4)
i.e. x 4y + 7z = 0.
(5)
Then
nn (x + n)(x + n2 ) . . . (x + nn )
2
2
n!(x2 + n2 )(x2 + n4 ) . . . (x2 + nn2 )
1
(A) f ( ) f (1)
2
(C) f (2) 0
!x/n
1
2
(B) f ( ) f ( )
3
3
f (3)
f (2)
(D)
f (3)
f (2)
Answer and Comments: (B, C). The very sight of the function f (x)
is frightening. The first simplification we do is to take ln f (x) and apply
the fact that the limit of the log of a function is the log of the limit of
that function. (The justification for this comes from the continuity of
the logarithm function. But that is hardly expected at the JEE level.)
x
ln gn (x)
n n
ln f (x) = lim
(1)
nn (x + n)(x + n2 ) . . . (x + nn )
2
2
n!(x2 + n2 )(x2 + n4 ) . . . (x2 + nn2 )
(2)
where
gn (x) =
Note that here x is a fixed positive real number and the limit in (1) is
taken as the variable n tends to . As x is independent of n we can
pull it out in the R.H.S. of (1) and write
ln f (x) = x lim
1
ln gn (x)
n
(3)
1
in (3) gives a clue.
n
1
is the
If the interval [0, 1] is partitioned into n equal parts, then
n
width of each subinterval and the points of subdivision are of the form
r
for r = 0, 1, 2, . . . , n. Therefore if we could recast ln gn (x) in the
n
n
X
r
h( ) for some suitable function h(t) of a variable t (which is
form
n
r=1
independent of x), then the coefficient of x in the R.H.S. of (3) will
be the limit of a Riemann sum of h(t) over this partition as the mesh
Although this is hardly profound, the coefficient
56
1
0
h(t)dt
and that will take us into familiar waters. (We deliberately choose t
rather than x as the independent variable for the function h because
x is already booked. Of course any other variable such as y, z, u etc.
except x itself will do. Note alsoZthat the function h(t) may have x as
1
r
u( ) we first ignore the
n
r=1
leading factors nn and n! in the numerator and the denominator of
gn (x) respectively and work with the ratio of their r-th factors, viz.
1
)
(x +
n
(x + r )
(r/n)
. If the
for a typical r. We rewrite this as
2
1
(x2 + nr2 )
(x2 +
)
(r/n)2
n
nagging factors n and n!, which we have ignored so far were not there,
(x + 1t )
then we could take u(t) as 2 1 .
(x + t2 )
To recast gn (x) in the desired form
But we cant simply ignore these factors nn and n!, however inconvenient they may be. So we need to do some further recasting so
that these unwanted factors will get cancelled out. This is done by one
more rewriting. Multiplying both the numerator and the denominator
57
by (r/n)2 , we get
1
)
1 + x(r/n) r
(r/n)
=
1
1 + x2 (r/n)2 n
)
(x2 +
(r/n)2
(x +
(4)
n
Y
1 + x(r/n)
2
2
r=1 1 + x (r/n)
(5)
Taking logarithms,
n
X
1 + x(r/n)
ln
ln gn (x) =
1 + x2 (r/n)2
r=1
(6)
We now let
h(t) = ln
1 + xt
1 + x2 t2
(7)
Then
ln gn (x) =
n
X
r
h( )
n
r=1
(8)
n
X
1 r
h( )
n
r=1 n
(9)
Z
1 + xt
ln
1 + x2 t2
58
dt
(10)
1 + tx
ln
1 + t2 x2
d
dt + x
dx
Z
1 + xt
dt
ln
1 + x2 t2
(11)
1+u
ln
1 + u2
du
(12)
(13)
We are now ready to dispose off the given options. Note that f (x) > 0
(as otherwise
ln f (x) is undefined). So the sign of f (x) is also the sign
1+x
2
of ln 1+x
2 . This is positive when 1 + x > 1 + x , i.e. when 0 < x < 1
59
credit for it. Also people would talk about such problems and keep a
count of how many candidates answered them fully correctly. There
have been problems for which the numbers of such complete solvers
were single digit numbers. And for the second part of the 1992 JEE
problem given in Comment No. 10 of Chapter 10, nobody got it! Such
discussions and statistics would provide valuable guidance to future
paper-setters and that made the JEE a sort of tradition. With the
multiple choice format all we know is how many candidates answered
a particular question correctly. But there is no way to tell how many
got it through real hard work, how many got it through clever sneaky
work, how many got it by fluke and for how many it was a shot in the
dark.
Q.45 Let f : IR (0, ) and g : IR IR be twice differentiable functions
such that f and g are continuous functions on IR. Suppose f (2) =
f (x)g(x)
g(2) =, f (2) 6= 0 and g (2) 6= 0. If lim
= 1, then
x2 f (x)g (x)
(A) f has a local minimum at x = 2
(B) f has a local maximum at x = 2
(C) f (2) > f (2)
(D) f (x) f (x) = 0 for at least one x IR
Answer and Comments: (A, D). The paper-setters have not given
the functions f (x) and g(x) explicitly. Instead, thet have given as
data a few properties of them from which some conclusions are to be
drawn. When a function is given explicitly, it has so many properties
and a candidate may get lost in deciding which of them are relevant.
(Sometimes, this is the very thing to test, as was the case in Q.43
above.)
Because of the data that g(2) and f (2) both vanish, the limit
f (x)g(x)
0
lim
is
of
the
indeterminate
form
. The most standard (and
x2 f (x)g (x)
0
popular) method to evaluate such limits is to apply lHopitals rule. So
from the last piece of data, we get
f (x)g(x) + f (x)g (x)
=1
x2 f (x)g (x) + f (x)g (x)
lim
61
(1)
Because of continuity of the functions and their first and second derivatives, this limit can be obtained by mere substitution provided it is not
0
of the
form. This is so, because with the substitution x = 2, the
0
denominator becomes f (2)g (2) which is non-zero from the data. So
f (2)
the limit is simply
which is given to be 1. So, f (2) = f (2).
f (2)
This immediately implies that (C) is false and (D) is true. Since f is
given to take only non-negative values, f (2) and hence f (2) are both
positive. So at x = 2, f vanishes while f > 0, Therefore f has a
(strict) local minimum at 2 and cannot have a local maximum at 2.
An extremely simple problem. In total contrast with the last
one. But the paper-setters do not have the freedom to allot credit
proportional to the degree of difficulty. So a mediocre student who
strategically omits problems like the last one and comfortably answers
questions like the present one is at an advantage over an intelligent
student who spends considerable time in solving the last problem partly
but later gives up. That makes JEE a game of strategy.
1
(1)
w
(
u ~v ) = 1
(2)
and
62
As both |w|
= 1 and |
u ~v | = 1, the only way (2) can hold is when
the angle between w and u ~v is 0, whence they are equal too (as they
have equal lengths. So we get
w = u ~v
(3)
u and w are unit vectors. Also by (3) they are perpendicular to each
other. So there exists a unique unit vector a such that the triple
(
u, w,
a
) forms an orthonormal, right-handed system. (In fact, a
has to
be u w.)
We are looking for all vectors ~v (not necessarily of length
1) such that (1) and (3) hold. Since u (a) = a u = w,
we see that
~v may be taken as a. But as it is not required to be a unit vector,
~v = a +
u will also fit the table for any real . So there are infinitely
many choices for ~v. Thus, (B) is correct and (A) is false.
For the remaining two options we express u ~v in terms of the
components. Thus
i j k
u ~v =
u1 u2 u3
v1 v2 v3
= (u2 v3 u3 v2 )i + (u3 v1 u1 v3 )j + (u1 v2 u2 v1 )k
(4)
and
1
u2 v3 u3 v2 =
6
1
u3 v1 u1 v3 =
6
2
u1 v2 u2 v1 =
6
(5)
(6)
(7)
u ~v = w.
They are precisely vectors of the form w u +
u for any
real . But then. such questions are suitable only for conventional
examinations.
Q.47 Let P be the point on the parabola y 2 = 4x which is at the shortest
distance from the centre S of the circle x2 + y 2 4x 16y + 64 = 0. Let
Q be the point on the circle dividing the line segment SP internally.
Then
(A) SP = 2 5
(B) SQ : QP = ( 5 + 1) : 2
(C) the x-intercept of the normal to the parabola at P is 6
1
(D) the slope of the tangent to the circle at Q is
2
Answer and Comments: (A, C, D). Another bunch of problems of
different types, clubbed together with a common data. Reminds one
of passengers sitting in the waiting room at a railway station. Their
destinations are different and they have little relationship with each
other. But just to kill time, they talk on some common theme (usually,
sky-rocketing prices and rampant corruption)!
y
.S
C2
X
P
(1)
dy/dt
2
8 2t
. Equating these two slopes we get
so has slope
2 t2
8 2t
= t
2 t2
(2)
(3)
Let us call this as f (t). Then f (t) = 4t3 32 which vanishes only at
t = 2. Also, it changes sign from + to as t passes through 2. Hence
the distance of P from S is minimum when t = 2, i.e. when P = (4, 4),
the same answer as before.
The use of the parametric coordinates considerably simplified the
determination of P . To stress this, let us also try to find P without
65
them, i.e. directly from the equation of the parabola y 2 = 4x. Let the
point P be (x0 , y0 ). Then the equation of the tangent to it at P is
yy0 = 2(x + x0 )
(4)
2
and hence that
y0
y0
of the normal at P is
. Hence this is also the slope of the line SP
2
because the radius through P is normal to the tangent to the circle C2
at P . Therefore we get
y0
y0 8
=
2
x0 2
(5)
This gives one equation in the unknowns x0 and y0 . The other equation
is y02 = 4x0 . Solving these two equations simultaneously we can get the
values of x0 and y0 . We do not do this. We mention it just to illustrate
that when a particular approach which is quite direct to start with,
later leads to complicated equations, it is time to pause and look for
an alternative. With parametric equations, we had to solve only one
equation in one unknown (viz. t) and that is surely easier than solving
a system of two equations in two unknowns.
A direct computation now gives
SP =
(4 2)2 + (4 8)2 =
4 + 16 = 2 5
(6)
(7)
QP = SP SQ = 2 5 2 = 2( 5 1)
Hence
SQ : QP =
After rationalisation, this becomes
66
1
51
5+1
. So (B) is false.
4
(8)
For (C), note that the normal to the parabola at P is also the
normal to the circle C2 at P as C2 and the parabola touch each other
at P . Indeed this is how we found P to begin with. Moreover, the
normal to C2 at P is the line SP whose equation is
y4=
4
(x 4)
2
(9)
1
, t IR, t 6= 0 , where i = 1. If z = x+iy
S = z C| : z =
a + ibt
and z S, then (x, y) lies on
1
1
and centre
, 0 for a > 0, b 6= 0
2a
2a
1
1
and centre , 0 for a < 0, b 6= 0
(B) the circle with radius
2a
2a
(C) the x-axis for a 6= 0, b = 0
1
a ibt
a ibt
=
= 2
a + ibt
(a + ibt)(a ibt)
a + b2 t2
(1)
equating the real and imaginary parts of the two sides we get
a
a2 + b2 t2
bt
and y = 2
a + b2 t2
x =
(2)
(3)
(4)
ay
. (Note that we are assuming that b 6= 0.) We can
bx
put this either in (2) or in (3). Obviously, the first oprion is better and
gives
which gives t =
x=
a
ax2
=
a2 + (a2 y 2 /x2 )
a2 (x2 + y 2)
(5)
(6)
1 2
1
) + y2 = 2
2a
4a
68
(7)
1
regardless of whether a > 0 or a < 0. So
2a
1
(B) is wrong. As for (A) the radius is
as a > 0. So (A) is correct.
2a
There is not much about complex numbers in this problem except fining the real and imaginary parts of the reciprocal of a complex
number. As mentiomed earlier, (C) and (D) can be answered without
doing any computation. And this may prove beneficial in view of the
new policy of giving credit for each correct answer if the other parts
are not answered. But there is a catch in (B). A candidate might think
that since (B) is obtained from (A) by replacing a by a, whenever
(A) is true, so is (B). But while this is indeed so for the radius of the
circle, it is not so for the centre. And this mistake will prove costly,
because then the credit earned by answering (C) and (D) correctly will
be washed out.
This is a circle centred at
Answer and Comments: (B, C, D). The problem comes under the
theory of solutions of systems of linear equations discussed in Comments 15 to 17 of Chapter 2. But in the present problem, as the
number of unknowns as well as the number of equations is only 2, a
direct approach is possible and indeed, preferable, except possibly for
(B). Note that we are not actually asked to find the solutions, but only
whether they exist and how many of them exist. The determinant, say
69
a 2
of the coefficient matrix, viz.
is 2(a + 3). In (B), this
3 2
comes out to be non-zero and hence the system has a unique solution
regardless of what and are. (It is not hard to identify the solution.
But that is not asked.)
In all other options, vanishes. Evidently, truth of (A) will imply
that of (C). A clever student knows that generally when this happens,
the weaker statement is true and the stronger one false. And, in the
present case the gamble will pay off. Still, for an honest answer, when
a = 3, adding the two equations gives + = 0. So, if at all there
exists a solution, then + must vanish. This rules out (A) and also
establishes (D) (by taking contrapositive). As for (C), when = ,
the two equations are multiples of each other and have the same set of
solutions. But each equation has infinitely many solutions, because x
can be given any real value and then y can be determined from it. So,
in (C), the system has infinitely many solutions.
The problem is too trivial to comment upon. Still, it is worthwhile
to look at it geometrically. If x and y denote the cartesian coordinates
of a point in the plane, then each equation represents a straight line.
And a solution of the system is a point common to both the lines. In
(B), the lines are neither identical, nor parallel and hence they intersect
at a unique point. In (C), the lines are identical and so all points on
them are common to both. In (D), on the other hand, they are parallel
and hence have no point in common.
The problem could have been made less trivial by giving a system of
three equations in three unknowns, say x, y, z. In that case the solution
sets would be subsets of IR3 . Q.22 of Paper 1 of JEE 2007 is an excellent
example of an imaginative problem of this type.
Q.50 Let f : [1/2, 2] IR and g : [1/2, 2] IR be the functions
defined by f (x) = [x2 3] and g(x) = |x|f (x) + |4x 7|f (x), where [y]
denotes the greatest integer less than or equal to y for y IR. Then
(A) f is discontinuous exactly at three points in [/2, 2]
(B) f is discontinuous exactly at four points in [1/2, 2]
(C) g is NOT differentiable at exactly four points in (1/2, 2)
70
end point of the domain interval should have been given as an integer
to test this point.
For (C) and (D), the end-points of the interval are carefully excluded.
The function g(x) factors as
g(x) = (|x| + |4x 7|)f (x)
(1)
1
4
(B) (A)
5
12
(C) (A)
1
2
(D) (A)
7
12
ought to. The paper-setters could have withheld one of these probabilities and forced the candidate to find it out. In fact, that would be
more in order in a paragraph type question.
Let W1 , D1 and L1 be the events of the first team winning, drawing
and losing the first game. Let W2 , D2 and L2 denote the corresponding
events for the second game. We are given that each of the first three
events is independent of each of the last three. Further it is given that
1
2
1
P (D1 ) = P (D2 ) =
6
1
P (L1 ) = P (L2 ) =
3
P (W1 ) = P (W2 ) =
(1)
(2)
(3)
The outcome of the match is one of the nine events of the form A B
where A {W1 , D1 , L1 } and B {W2 , D2 , L2 }. These nine events are
mutually exclusive. The total score X of T1 will exceed Y only in the
cases W1 W2 , W1 D2 and D1 W2 , because in order that T1 beats
T2 , it has to win at least one game.
Because of independence of the ecvents, P (A B) = P (A)P (B) for all
A, B. Therefore, adding the three probabilities,
P (X > Y ) = P (W1 )P (W2 ) + +P (W1 )P (D2 ) + P (D1 )P (W2)
1
1
1
+
+
=
4 12 12
5
=
(4)
12
Q.52 P (X = Y ) is
(A)
11
36
(B)
1
3
(C)
13
36
(A)
1
2
2
1
=
+
6
13
=
36
1 1 1 1 1
+ +
3 3 2 6 6
1
1
+
6 36
(5)
9
,0
10
(B)
2
,0
3
(C)
9
,0
10
(D)
2
, 6
3
(1)
y 2 = 4x
(2)
1
and hence F1 = (1, 0) and F2 = (1, 0). As the
3
focus of the parabola is at (1, 0) and its vertex at (0, 0), its equation is
which gives e as
75
(3)
q
9
+ 9. We
i.e. x2 + x 9 = 0. This is a quadratic with roots 94 81
16
2
discard the negative root as the parabola lies entirely on the right of
15 9
3
the y-axis. The positive root is
= . Hence the points M and
4
4
2
N are
3
, 6
M =
2
3
, 6
and N =
2
(4)
(5)
F2
3
5
6 = (x )
2
2 6
76
(6)
3
12
5
3
It intersects the x-axis when 6 = (x which gives x =
2
2 5
2 6
3 12
9
9
and hence x =
= . So the orthocentre is at , 0 .
2
5
10
10
A long, and essentially arbitrary chain of mediocre problems.
Q.54 If the tangents to the ellipse at M and N meet at R and the normal
to the parabola at M meets the x-axis at Q, then the ratio of the area
of the triangle MQR to the area of the quadrilateral MF1 NF2 is
(A) 3 : 4 (B) 4 : 5 (C) 5 : 8 (D) 2 : 3
Answer and Comments: (C). A continuation of the journey in the
last problem. The only intelligent part is that since both the parabola
and the ellipse are symmetric about the x-axis, so are the tangents to
the ellipse at M and N and therefore, to find R it suffices to find either
one of them and see where it cuts the x-axis.
y
F2
3
The equation of the tangent to the ellipse at the point M = ( , 6) is
2
x
6
+
=1
(7)
6
8
When y = 0, x = 6. So we get
R = (6, 0)
77
(8)
6
. Then the slope of
parametrically as x = t2 , y = 2t and taking t =
2
6
. Hence its equation is
the normal is t =
2
6
3
y 6=
(x )
(9)
2
2
When y = 0, x = 2 +
7
3
= . Therefore
2
2
7
Q = ( , 0)
2
(10)
We are asked the ratio of the area of the triangle MQR to that of the
quadrilateral MF1 NF2 . We can do this without actually calculating
these areas. By symmetry about the x-axis, the area of the quadrilateral MF1 NF2 is twice that of the triangle MF1 F2 . Now the triangles
MQR and MF1 F2 have the same altitude. So the ratio of their areas is
the same as the ratio of their bases QR and F1 F2 . From (8) and (10),
5
7
QR = 6 = . Also F1 F2 = 2. So
2
2
MQR : MF1 F2 =
5
:2=5:4
2
(11)
Since the area of the quadrilateral MF1 NF2 is twice the area of the
triangle MF1 MF2 , the desired ratio is 5 : 8.
Not a very exciting problem, except for the short cut at the end.
The paper-setters have carefully arranged the numerical data in such
a way that even though square roots appear in the slopes sometimes,
the answers to both the problems in this paragraph come in terms of
whole numbers or simple fractions. This really helps the candidate in
a severely time limited test.
But the real objection to paragraph type questions voiced in the
past holds this year too. Such questions are meant to test if a candidate
can understand some unseen material. Instead what we see is a bunch
78
79
CONCLUDING REMARKS
As mentioned at the beginning, there are some welcome changes this year.
The number of questions has been reduced to a reasonable level. Matching
the pairs which often resulted in clubbing together a large number of unrelated questions has been dropped. Further, in questions where more than
one options may be correct, candidates can get some partial credit unlike in
the past.
The paper-setters have also generally been careful in designing the numerical data to make the calculations simple. Some questions seem to be
designed to reward candidates who can take intelligent short cuts.
By far, the question that stands out as the best question is Q. 40 of Paper
2 about the relative growth of geometric and arithmetic progressions. Also
noteworthy are a few problems which seem to be designed with a specific
purpose. These include Q.42 of Paper 1 (about a pyramid) which tests the
ability to visualise solid geometric data and also the ability to quickly get an
answer using pure geometry rather than the drudgery of coordinates, Q.47
of Paper 1 (about composite functions and inverse functions) which tests the
ability to handle functions as entities in their own rights instead of being
0
tied down to formulas, Q.53 of Paper 1 (about a limit of the form) which
0
tests the ability to compare orders of magnitude, Q.37 of Paper 2 (about the
fiftieth power of a matrix) which tests the ability to experiment and recognise
patterns), Q.43 of Paper 2 (about the continuity and differentiability of a
linear combination of two functions) which tests the ability to focus on the
relevant part of the data, Q.47 of Paper 2 (which tests the ability to take
short cuts) and Q.50 of Paper 2 (about the differentiability of the product
of two functions) which tests the ability to keenly study what happens at an
irregular point).
As regards the distribution of topics, the paper-setters have revived combinatorial identities within the limits of a multiple choice question and also
paid a lip service to number theory in Q.51 of Paper 1. The problems about
combinatorics (Q.38 of Paper 1) and probability (Q. 40 of Paper 1 and Paragraph 1 of Paper 2) are too simple as compared with many problems in the
past few years (even after the JEE became totally MCQ). So are the problems
on complex numbers (Q. 54 of Paper 1 and Q.48 of Paper 2). Inequalities
figure in only indirectly. The trick of recasting a trigonometric series as a
telescopic series has been pulled in Q.39 of Paper 2.
80
81