Professional Documents
Culture Documents
Directions for questions 1 to 8: Answer the 4. In how many distinct ways can the sessions
questions on the basis of the following information. be scheduled for two consecutive days if both
the teachers have to have equal number of
In a class of 12 students, 7 are boys and 5 are girls. sessions?
The class has 4 sessions each day, one each of (a) 576 (b) 9,216 (c) 40,320
(d) 73,728 (e) 384
arithmetic, algebra, geometry and probability. These
classes are to be held one after the other in 4 distinct 5. If the sequence of class has to be arithmetic,
time slots and can be in any sequence (unless algebra, geometry and probability in this
otherwise stated in a question). Further there are particular order itself, then the number of
2 teachers available and they can teach any topic distinct ways in which the sessions can be
(unless otherwise stated in a question). For all the planned for an entire week of 6 working days
is
following questions a ‘session’ refers to a particular
(a) 242 (b) 624 (c) 246
combination of topic and a teacher at a particular (d) 2 24 (e) 220
time slot.
6. The entire class of 12 students is divided
1. In how many distinct ways can the sessions equally into two different divisions and then
be scheduled for two consecutive days? the sessions are scheduled for these two
(a) 384 (b) 576 (c) 9,216 divisions with classes being held
(d) 1,47,456 (e) 192 simultaneously in two classrooms. In how
many ways can the sessions be planned for
2. In how many distinct ways can the sessions these two divisions for a particular day?
be scheduled for a particular day if one teacher (a) 576 (b) 576 × 28 (c) 576 × 82
could teach only arithmetic and algebra (d) 9216 (e) 576 × 8
whereas the other teacher could teach only
geometry and probability? 7. In question 6, in how many ways can the
(a) 24 (b) 48 (c) 384 class be divided into two equal divisions?
(d) 576 (e) 192 12
(a) C6 × 6C6
3. In how many distinct ways can the sessions (b) 12 × 11 × 10 × 9 × 8 × 7
be scheduled for a particular day if one faculty
12!
could not teach arithmetic and the other (c)
faculty could not teach probability? (6! )2
(a) 24 (b) 96 (c) 384 12
(d) 576 (e) 192 12! C6
(d) (e)
(2!) 6 2!
12 12! 12!
(a) C2 (b) 6
(c) 6!
(2! ) (2! )6
12!
(d) (e) 12!
2!10!
E S E
A D A D
9. How many distinct shortest routes are
possible if one has to travel from A to B? (a) 791 (b) 1
14! (c) 188 (d) 792
(a) 2 (b) 6! 8! (e) None of these
(c) 214 (d) 792
13. The number of distinct shortest route if one
(e) None of these
has to travel from A to D and then to C and
then to B is
10. How many distinct shortest routes are
possible if one has to travel from A to B via E? 14!
(a) 6! 8! (b) 2
11! 3!
(a) 378 (b) 6! 5! × 2!
(c) 192 (d) 792
(c) 4 (d) 192 (e) None of these
(e) None of these
(a) −1
3
4 4 (b) (c) 1
(a) (10n + 1) (b) (102n – 1) 2 2 2
9 9
(d) −3 (e) 0
4
(c) (10n – 1)
9
2 n
(
(d) 10 – 1
9
) 2
(e) None of these 27. If the coefficient of 5th, 6th and 7th terms in
the expansion of (1 + x)n are in AP, then the
22. For all integers x and y, f(x, y) is defined as
value of n can be
below: f(0, y) = 2y + 1 and f(x + 2, 0) =
(a) 7 only (b) 14 only (c) 7 or 14
f(x + 1, 1). If f(x + 2, y + 1) = f(x, f(x + 1, y)),
(d) 10 (e) None of these
find the value of f(2, 1).
(a) 5 (b) 6 (c) 7
(d) 8 (e) 4 28. Find the term which is independent of x in
the expansion of (x – 2x–1)2n .
23. Let, (a) (n + 1)th (b) nth (c) (n – 1)th
1 1+ 2 1 + 2 + ... + n n
th
Sn = + + ... + 3 ; (d) (e) None of these
13 13 + 23 1 + 23 + ... + n3 2
n = 1, 2, 3, ... . Find the value of S35.
−1 + 3 − 1 2 + 2 + 5 1
Sol. a Centroid G ≡ , = 3 , 3 .
E.g. Find the excenter opposite to vertex A of a
3 3 triangle whose vertices are A(–1, 2), B(3, 2)
and C(–1, 5).
Incenter of a triangle: (a) (3, 3) (b) (5, 3)
Incenter of a triangle formed by the points (c) (3, 8) (d) (5, 8)
L A(x1,y1 ), B(x 2 ,y 2 ) and C(x 3 ,y 3 ) be I, then
Sol. d a = 5, b = 3 and c = 4
ax + bx 2 + cx 3 ay1 + by 2 + cy 3 Excenter
I≡( 1 , )
a+b+c a+b+c −5 × −1 + 3 × 3 + 4 × −1 −5 × 2 + 3 × 2 + 4 × 5
IA ≡ ,
Where a is the length of the side opposite to A, b −5 + 3 + 4 −5 + 3 + 4
is the length of the side opposite to B, and c is the = (5, 8).
length of the side opposite to C.
1. d Lets find the number of distinct ways of scheduling 7. e 12 students can be divided into two equal groups in
sessions for a particular day. Consider each time slot 12
as a particular box where a particular topic has to be C6 × 6C6
= 3,32,640.
assigned (topics cannot be repeated) and also a 2!
particular faculty is to be assigned (faculty can be
repeated). The number of ways topics can be 8. e A googly ! Just consider it as 12 distinct places and 12
sequenced is 4! = 24. For each of these topics and distinct students, so the number, of distinct ways of
time slot, there are two faculty available. Thus the sitting is 12!.
number of distinct ways of scheduling the session for
one day is 24 × 24 = 384. Thus for two days it will be 9. d The shortest route will be to continuously move
384 × 384 = 1,47,456. northwards or eastwards. It will not be only A-D-B
and A-C-B. Even a zig-zag path of moving north and
2. a The number of ways in which the topics can be eastwards means travelling 12 roads segments. Any
sequenced is 4! = 24. Now we have just one faculty shortest path will involve moving 5 horizontal and 7
for the sessions as only one faculty can teach the vertical road segments. The total number of ways will
topics. Thus total number of ways of scheduling the be the number of ways of arranging hhhhhvvvvvvv.
session is 24.
12!
This can be done in ways. (hhvvvhvvhvhv
3. b The number of ways the topics can be sequenced is 5! 7!
4! = 24. For the session on algebra and geometry, we means first going two roads segments to east, next
have option of either of the two faculty, but for three roads segments to north and so on and will be
arithmetic and probability, only one faculty is available. one of the shortest routes).
Thus total number of distinct ways of scheduling the
session is 24 × 22 = 96. 12! 8 × 9 × 10 × 11× 12
= = 792.
5! 7! 2×3× 4×5
4. c The topics can be sequenced in 4! ways for a day and
hence in 24 × 24 = 576 ways for two days. Now there 10. a From A to E one has to move four horizontal road
are 8 sessions over the two days that have to be segments and five vertical road segments and the
divided equally among the two faculty. This can be
9!
done in 8 number of distinct shortest routes will be = 126
C 4 ways, i.e. in 70 ways. Thus the total 4! 5!
number of schedules = 576 × 70 = 40,320 ways. From E to B, the number of shortest routes will
6. d For one particular division, the topics can be 11. b The required number of routes
sequenced in 24 ways. Similarly, for the other division = Total number of routes – Number of routes passing
they can be sequenced in 24 ways. Thus the total through E
number of ways of sequencing the topics for both the = 792 – 378 = 414.
division are 24 × 24 = 576. Now for a particular time
slot, there are two ways of assigning the two faculty. 12. a There will be only one shortest route from A to B
Thus for 4 time slots, there are 2 4 = 16 ways of passing through C.
assigning the sessions faculty. Thus total number of Thus, the number of shortest routes from A to B if C
ways of scheduling = 576 × 16 = 9216. did not exist = 792 – 1 = 791.
FG
2 3
IJ ex − 1j + 1
20
H x K + 20
20
FG1 − 1 IJ
4 36 16 6 64 2
= x
= 3×
H ×
10 100
+3× × +
100 10 1000 K ex − 1j x
2 2
H xK 2
784
= = 0.784. x 20 − 1 x 22 + 1
1000 = 2 20 + 20.
x −1 x
Short cut: 2 1 1
P(A occurring at least once) = 1 – P (A not occurring in 19. b If a, b and c are in HP, then = + .
b a c
any trial) = 1 – 0.6 × 0.6 × 0.6 = 0.784.
FG 1 + 1 − 1 IJ FG 1 + 1 − 1IJ = FG 3 − 2 IJ FG 1IJ = 3 2
15. c (i) For arbitrary events A, B
P(A ∪ B) = P(A) + P(B) – P(A ∩ B) ... (i)
∴
H b c aKH c a bK H b aKH bK b 2
−
ab
Since the probability of an event is less than or Hence (c) is incorrect.
equal to 1. Again,
∴ P(A ∪ B) ≤ 1.
FG 1 + 1 − 1 IJ FG 1 + 1 − 1IJ = FG 2 − 1IJ FG 1IJ = 2 − 1
∴ P(A) + P(B) – P(A ∩ B) ≤ 1 [From (i)] or
P(A ∩ B) ≥ P(A) + P(B) – 1. H b c a K H c a b K H c b K H b K bc b 2
16. c The total number of functions from A to itself is nn and 20. d Given, f(x + 2) + f(5x + 6) = 2x – 1
the total number of bijections from A to itself is n!. At, x + 2 = 5x + 6 ⇒ x = −1
(Since A is a finite set, therefore every injective mapping
−3
from A to itself is bijective also.) ⇒ f(1) + f(1) = –3 ⇒ f(1) = .
2
n! (n − 1)!
∴ The required probability = = n −1 .
nn n 21. b (666...6) = 6 + 60 + 600 + 6000 + ... + 600000...0
n digits n digits
17. a S = (√2 + 1) + 1 + (√2 – 1) +...∞ 2
= 6 + 6.10 + 6.102 + ... + 6.10n –1 = (10n – 1).
1 3
Here a = (√2 + 1), and the common ratio r = . ∴ (666...6)2 = 4/9 (10n – 1)2.
2 +1
8
Similarly, (888...8) = (10n – 1).
a 2 +1 3+2 2 9
∴S = =
1− r
=
1−
1 2
.
9
( 2 8
9
)
∴(66...6 )2 + (888 ...8 ) = 10n – 1 + 10n – 1
4
( )
2 +1 n digits n digits
4
= (102n – 1).
9
n(n + 1)
1 + 2+...+n 2 FG
1 1 IJ Tr + 1 = 2nCr x 2n – r –2x –1(
r
)
H K
an = = 2 = =2 −
FG IJ
28. a
3 3
1 + 2 +...+n 3
n(n + 1)
2 n(n + 1) n n+1
H 2 K = 2n Cr x2n − r – r (–2)r
FG 1 − 1IJ + 2FG 1 − 1 IJ + = 2n – 2r = 0 ⇒ r = n
∴ Sn = 2
H 1 2K H 2 3 K i.e. Tn + 1 is independent of x.
F 1 1 I F 1 1 IJ = 2FG1 − 1 IJ = 2 − 2 < 2 .
2G − J +...+2G −
29. d Tr+1 = 9Cr (ax4)9 – r (–bx)r
H 3 4 K H n n + 1K H n + 1K n + 1 ⇒ 36 – 4r + r = 18 ⇒ r = 6
∴ Coefficient = 9C6 (a3) (–b)6 = 84a3b6.
2 35 15
∴ S35 = 2 − = . 4 1
36 18 30. c x – 3
x
24. e Let mth term of the first sequence be equal to the nth r –1
( )
15–r +1 –1
term of the second sequence. Then, Tr = 15Cr –1 x 4 3
17 + 4(m – 1) = 16 + 5(n – 1) ⇒ 4m + 13 = 5n + 11 x
⇒ 4m + 2 = 5n
= 15Cr –1 ( –1) = 15Cr –1 ( –1)
r –1 64– 4r –3r + 3 r –1 67–7r
x x
1
⇒ n = m – (m – 2). Since n is an integer, m – 2 must
5 x –17 occurs in rth term
be a multiple of 5, i.e. m must be of the form 5k + 2, with
k ≥ 0. Then n = 4k + 2. The first sequence has 101 67 + 17 84
⇒ 67 − 7r = −17 ⇒ r = = = 12.
terms and the second has 91 terms. 7 7
∴ 0 ≤ 5k + 2 < 101 and 0 ≤ 4k + 2 ≤ 91 ⇒ 0 ≤ k ≤ 19.
∴ r = 12.
Hence, the given sequences have 20 common terms.
−1 −1 1
⇒ 4f = 2 ⇒ f = . (1– x )n = nC0 + nC1 ( –x ) + nC2 ( –x )2 + ...
2 2 2
n (n – 1)
= 1 – nx + x 2 ...
26. a f(g(x)) = 2 – 3x and g(f(x)) = 1 + 3x 2
g[f(g(x))] = 1 + 3g(x)
⇒ g(2 – 3x) = 1 + 3g(x) m (m – 1) 2
(1 + x )m (1 – x )n = 1 + mx + x + ...
1 2
At x =
2
1 1 1 −1 n (n – 1) 2
⇒ g = 1 + 3g ⇒ g = × 1 – nx + x ...
2 2 2 2 2
m (m – 1) n (n – 1)
+ – mn = –6 1 π
2 2 ∴ sin x = ⇒x= .
2 6
⇒ m(m – 1) + n(n – 1) – 2mn = –12
∴ m(m – 1) + (m – 3)(m – 4) – 2m(m – 3) = –12 35. a Rotation of axes does not affect the perpendicular
⇒ m2 – m + m2 – 7m + 12 – 2m2 + 6m = –12 distance of the line from origin. If the equations of lines
⇒ 2m = 24 ⇒ m = 12. x y x' y'
in two cases are + = 1 and + = 1 , then
a b p q
10 10
1 1 1
32. b 2 + 35 = 22 + 35
0 + 0 −1 0 + 0 −1 1 1 1 1
= or 2 + 2 = 2 + 2 .
1 1 1 1 a b p q
10 – r r + +
Tr +1 = 10Cr 2 2 .3 5 be a rational term a2 b2 p2 q2
⇒ r is a multiple of 5 and as 0 ≤ r ≤ 10
36. d S = x2 + y2 + 2x – 4y + 4
r = 0, 5 or 10
S|x=–1, y = 2 =1 + 4 – 2 – 8 + 4 = –1
10 – r S|x = –1, y = 2 < 0, therefore the point (–1, 2) lies inside the
is also an integer ⇒ r ≠ 5
2 circle, therefore no tangents can be drawn.
⇒ r = 0 or 10
37. c
Rational terms in its expansion are first and last, all
other terms contain irrational parts.
Q (3 , 4 )
∴ Sum of rational terms
R (– 4, 3)
10 10
1 1
C0 2 2 C10 3 5
5 2
= 2 + 3 = 32 + 9 = 41.
10 10
= +
O
1 sin(∠QPR) 1
=
1 − ( − sin x ) 1 − cos 2x 1 − sin x 2sin2 x QR 2R
34. a = ⇒ =
1 1 + cos 2x 1 + sin x 2cos2 x
QR 72 + 12 1
1 − sin x ⇒ sin(∠QPR) = = =
2R 10 2
2sin2 x π
= , provided |sin x| < 1 ⇒ ∠QPR =
2 − 2sin2 x 4
xm
C1C2= a2 + b2 , since, they touch each other, therefore
C
60°
a2 − c + b2 − c = a2 + b2 (assume external
45°
A B
touching) 100 m
1 − tan2 θ −1 2 tan θ π
−4 cos−1 2 + 2 tan 1 − tan2 θ = 3
1 + tan θ
π
⇒ 3 sin−1(sin2θ) − 4cos−1(cos 2θ) + 2 tan−1(tan2θ) =
3
π π
⇒ 3 (2θ) − 4 (2θ) + 2 (2θ) = ⇒ 6θ − 8θ + 4θ =
3 3
π π π 1
⇒ θ= ⇒ tan−1 x = ⇒ x = tan = .
6 6 6 3