Multiple Choice - I: /Z. Every One of The 10 Available Lamps Can Be
Multiple Choice - I: /Z. Every One of The 10 Available Lamps Can Be
MULTIPLE CHOICE - I
Each question in this part has four choices out of which just one is correct. Indicate your choice of correct
answer for each question by writing one of the letters a, b, c, d whichever is appropriate.
1. When simplified, the expression ^ykti- If 7 points out of 12 lie on the same straight
5 line than the number of triangles thus
47
c4+ n z= 1 52 - n C 3 equals
formed, is
(a) 19 (b) 185
(a ) 4 7 C 5 (b)49c4 (c) 201 (d) 205
( d ) 5 2 C4
vX
52
(c) C5 The total number of ways in which 9
2. If "Cr_, = 10, nCr= 45 and nCr+, = 120 then different toys can be distributed among three
different children so that the youngest gets 4,
r equals
the middle gets 3 and the oldest gets 2, is
(a) 1 (b)2
(a) 137 (b) 236
(c)3 (d)4
(c) 1240 (d) 1260
3. The least positive integral value of x .which
\Z. Every one of the 10 available lamps can be
satisfies the inequality
switched on to illuminate certain Hall. The
10 10
C,.,>2. Cj is total number of ways in which the hall can be
(a) 7 (b)8 illuminated, is
(c) 9 (d) 10 (a) 55 (b) 1023
^ J k f The number of diagonals that can be drawn (c) 2 1 0 (d) 10 !
in an octagon is 13. The number of ways in which 7 persons can
(a) 16 (b) 20 be seated at a round table if two particular
(c) 28 (d) 40 persons are not to sit together, is :
The number of triangles that can be formed (a) 120 (b) 480
joining the angular points of decagon, is (c) 600 (d) 720
(a) 30 (b) 45 14. The number of ways in which r letters can be
(c) 90 (d) 120 posted in n letter boxes in a town, is :
6. If n is an integer between 0 and 21, then the (a)n (b) r
minimum value of n ! (21 - n) ! is (c) "Pr (d) "C r
(a) 9 ! 2 ! (b) 10 1 1 1 ! 15. The number of ways in which three students
(c) 20 ! (d) 21 ! of a class may be assigned a grade of A, B, C
^T^The maximum number of points of or D so that no two students receive the same
intersection of 8 circles, is grade, i s :
(a) 16 (b) 24 (a) 3* (b) 4
(c) 28 (d) 56 (C) 4 P 3 (d) 4 C 3
The maximum number of points of intersection 1 6 / T h e number of ways in which the letters of
of 8 straight lines, is ^ the word A R R A N G E can be made such that
(a) 8 (b) 16 both R ' s do not come together is :
Ac) 28 (d) 56 (a) 900 (b) 1080
v/9. The maximum number of points into which 4 (c) 1260 (d) 1620
circles and 4 straight lines intersect, is 17. Six identical coins are arranged in a row. The
(a) 26 (b) 50 total number of ways in which the number of
(c) 56 (d) 72 heads is equal to the number of tails, is
40 Objective Mathematics
constructed using these interior points as A car will hold 2 persons in the front seat and
vertices, is 1 in the rear seat. If among 6 persons only 2
(a) 205 (b) 208 can drive, the number of ways, in which the
(c) 220 (d) 380 car can be filled, is
Total number of words formed by using 2 (a) 10 (b) 18
vowels and 3 consonents taken from 4 (c) 20 (d) 40
vowels and 5 consonents is equal to In an examination there are three multiple
(a) 60 (b) 120 J * choice questions and each question has 4
(c) 720 (d) None of these choices of answers in which only one is
Ten different letters of an alphabet are given. correct. The total number of ways in which
J *
Words with five letters (not necessarily an examinee can fail to get all answers
meaningful or pronounceable) are formed correct is
from these letters. The total number of words (a) 11 (b) 12
which have atleast one letter repeated, is (c) 27 (d) 63
(a) 21672 (b) 30240 30 The sum of the digits in the unit's place of all
(c) 69760 (d) 99748 the numbers formed with the digits 5, 6, 7, 8
23. A 5-digit number divisible by 3 is to be when taken all at a time, is
formed using the numbers 0, 1, 2, 3, 4 and 5 (a) 104 (b) 126
without repetition. The total number of ways, (c) 127 (d) 156
this can be done, is
31. Two straight lines intersect at a point O.
(a) 216 (b) 240
Points A|, A2,.., An are taken on one line and
(c) 600 (d) 720
points B\, B2,..., Bn on the other. If the point
24. Twenty eight matches were played in a O is not to be used, the number of triangles
football tournament. Each team met its that can be drawn using these points as
opponent only once. The number of teams vertices, i s :
that took part in the tournament, is
(a)n(n-l) (b)n(n-l)2
(a)7 (b) 8
(c) 14 (d) None of these (c) n (n - 1) (d) n ( « - l) 2
25. Everybody in a room shakes hand with 32. How many different nine digit numbers can
everybody else. The total numebr of be formed from the number 22 33 55 888 by
Permutations and Combinations 41
rearranging its digits so that the odd digits 40. In a plane there are 37 straight lines, of
occupy even positions ? which 13 pass through the point A and 11
(a) 16 (b) 36 pass through the point B. Besides, no three
(c) 60 (d) 180 lines pass through one point, no lines passes
/ \ r \ r \
n n through both points A and B, and no two are
33. For 2 < r < n, + 2 + " J
r - 1 r ~ 2 ; parallel, then the number of intersection
V K / J ,
' n + P points the lines have is equal to
(a) (b) 2
r- 1 r+ 1 (a) 535 (b) 601
f n+ , r ( n^ +, 2T A (c) 728 (d) 963
(c)2 (d)
r r 41. We are required to form different words with
v /
34. The number of positive integers satisfying the help of the letters of the word INTEGER.
the inequality Let tii\ be the number of words in which
tl + \ s-i n + \ /-< - , r\r\ •
/ and N are never together and m2 be the
Cn _ 2 - Cn _ ! < 1 0 0 I S
number of words which being with / and end
(a) Nine (b) Eight with R, then m]/m2 is given by
(c) Five (d) None of these
(a) 42 (b) 30
35. A class has 21 students. The class teacher has
(c) 6 (d) 1/30
been asked to make n groupsof r students
each and go to zoo taking one group at a 42. If a denotes the number of permutations of
time. The size of group (i.e., the value of r) x + 2 things taken all at a time, b the number
for which the teacher goes to the maximum of permutations of JC things taken 11 at a time
number of times is (no group can go to the and c the number of permutations of JC — 11
zoo twice) things taken all at a time such that
(a) 9 or 10 (b) 10 or 11 a = 182 be, then the value of JC is
(c) 11 or 12 (d) 12 or 13 (a) 15 (b) 12
36. The number of ways in which a score of 11 (c) 10 (d) 18
can be made from a through by three persons, 43. There are n points in a plane of which no
each throwing a single die once, is three arc in a straight line e x c e p t ' m ' which
(a) 45 (b) 18 arc all in a straight line. Then the number of
(c) 27 (d) 68 different quadrilaterals, that can be formed
37. The number of positive integers with the with the given points as vertices, is
property that they can be expressed as the n-m+I
(a) " C 4 - m C 3 ' Ci — Ca
sum of the cubes of 2 positive integers in two
(b)"C4- '4
different way is
(a) 1 (b) 100 (c) n m m n
C4- C3( - C,)- "rc 4
(c) infinite (d) 0 (d) C 4 + C 3 . Ci
38. The number of triangles whose vertices are 44. The number of ordered triples of positive
the vertices of an octagon but none of whose integers which are solutions of the equation
sides happen to come from the octagon is JC + y + z = 100 is
(a) 16 (b) 28 (a) 5081 (b) 6005
(c) 56 (d) 70 (c) 4851 (d) 4987
39. There are n different books and p copies of 45. The number of numbers less than 1000 that
each in a library. The number of ways in can be formed out of the digits 0, 1, 2, 4 and
which one or more than one book can be
5, no digit being repeated, is
selected is
(a) 69 (b) 68
(a) p" + 1 (b)(p+l)"-l (c) 130 (d) None of these
(c)(p+\)n-p (<l)pn
42 Objective Mathematics
46. A is a set containing n elements. A subset P, 53. The letters of the word SURITI are written in
is chosen, and A is reconstructed by replacing all possible orders and these words are
the elements of Px. The same process is written out as in a dictionary. Then the rank
repeated for subsets P\,P2, ... Pm with m > 1. of the word SURITI is
The number of ways of choosing (a) 236 (b) 245
P , , P 2 , ...,Pm so that P , u P 2 u ... uPm = A (c) 307 (d) 315
is 54. The total number of seven-digit numbers
m mn then sum of whose digits is even is
(a) ( 2 - \) (b) (2n — 1 )m
+ (a) 9 x 106 (b) 45 x 105
( c ) ' " "Cm (d) None of these
(c) 81 x 10 5 (d) 9 x 105
47. On a railway there are 20 stations. The
number of different tickets required in order 55. In a steamer there are stalls for 12 animals
that it may be possible to travel from every and there are cows, horses and calves (not
station to every station is less than 12 of each) ready to be shipped; the
(a) 210 (b) 225 total number of ways in which the shipload
can be made is
(c) 196 (d) 105
12
(a) 3 (b) 12
48. A set containing n elements. A subset P of A
is chosen. The set A is reconstructed by (O ,2P3 (d) ,2
C3
replacing the element of P. A subset Q of A 56. The number of non-negative integral solution
is again chosen. The number of ways of of X] + x2 + x3 + 4x 4 = 20 is
choosing P and Q so that P n Q = (j) is
(a) 530 (b) 532
(a) 2 2 " - 2"C„ (b) 2" (c) 534 (d) 536
(c) 2" - 1 (d) 3" 57. The number of six digit numbers that can be
49. A father with 8 children takes 3 at a time to formed from the digits 1, 2, 3, 4, 5, 6 and 7
the zoological Gardens, as often as he can so that digits do not repeat and the terminal
without taking the same 3 children together digits are even is
more than once. The number of times he will (a) 144 (b) 72
go to the garden is (c) 288 (d) 720
(a) 336 (b) 112 58. Given that n is the odd, the number of ways
(c) 56 (d) None of these in which three numbers in A.P. can be
50. If the (n + 1) numbers a, b, c, d,.., be all selected from 1, 2, 3 , 4 , . . , n is
different and each of them a prime number, (w-ir (n+lT
(a) (b)
then the number of different factors (other
than 1) of am. b. c. d ... is
(a) m - 2" (b) (m+ 1) 2"
(c) (m + 1) 2" - 1 (d) None of these 59. A is a set containing n elements. A subset P
51. The numebr of selections of four letters from of A is chosen. The set A is reconstructed by
the letters of the word ASSASSINATION is replacing the elements of P. A subset Q of A
(a) 72 (b) 71 is again chosen. The number of ways of
(c) 66 (d) 52 choosing P and Q so that P r\Q contains
52. The number of divisors a number 38808 can exactly two elements is
have, excluding 1 and the number itself is : (a) 9. nC2 (b) 3" - "C 2
(a) 70 (b)72 (c) 2. "Cn (d) None of these
(c) 71 (d) None of these
Permutations and Combinations 43
60. The number of times the digit 5 will be (a) 271 (b) 272
written when listing the integers from 1 to (c) 300 (d) None of these
1000 is
MULTIPLE CHOICE - I I
Each question, in this part, has one or more than one correct answers). for each question, write the letters
a, b, c, d corresponding to the correct answer(s).
61. Eight straight lines are drawn in the plane 67. There are n seats round a table marked 1, 2,
such that no two lines are parallel and no three 3, ..., n. The number of ways in which
lines are concurrent. The number of parts into m (< n) persons can take seats is
which these lines divide the plane, is (a )nPm (b) nCm x (m - 1) !
(a) 29 (b) 32
(c)"Cmxm! ( d ) j
(c) 36 (d) 37
68. If a, b, c, d are odd natural numbers such that
62. The number of ways of painting the faces of
a + b + c + d = 20 then the number of values
a cube with six different glours is
of the ordered quadruplet (a, b, c, d) is
(a) 1 (b) 6 (a) 165 (b) 310
(c) 6 ! (d)6C6 (c) 295 (d) 398
63. Number of divisors of the form 4n + 2 (n> 0) 69. The numebr of rectangles excluding squares
of the integer 240 is from a rectangle of size 15 x 10 is :
(a) 4 (b)8 (a) 3940 (b) 4940
(c) 5940 (d) 6940
(c) 10 (d) 3
70 In a certain test, there are n questions. In this
64. An n-digit number is a positive number with
test 2 n~' students gave wrong answers to at
exactly n digits. Nine hundred distinct n-digit
least i questions, where i= 1, 2, 3,.., n. If the
numbers are to be formed using only the
total number of wrong answers given is
three digits 2, 5 & 7. The smallest value of n
2047, then n is equal to
for which this is possible is : (a) 10 (b) 11
(a)6 (b)7 (c) 12 (d) 13
(c)8 (d)9
71. The exponent of 3 in 100 ! is
65. The position vector of a point P is (a) 12 (b) 24
v=x'i+yj + zh when x,y,zeN and (c) 48 (d) 96
a = 1 + j + %. If r . a = 1 0 , The number of 72. The number of integral solutions of
possible position of P is x\+x2 + x?l = 0 w i t h X j > - 5 is
(a) 36 (b) 72 (a) 34 (b) 68
(c) 136 (d) 500
(c) 66 (d) 9 C 2
73. The number of ways in which 10 candidates
66. Sanjay has 10 friends among whom two are
Ai,A2,—,Al0 can be ranked so that A, is
married to each other. She wishes to invite 5
always above A2 is
of the them for a party. If the married couple
refuse to attend separately then the number of 10 !
(a) (b) 8 ! x WC2
different ways in which she can invite five
friends is (c) > 2 (d) '°C2
75. In a class tournament when the participants 80. Seven different lecturers are to deliver
were to play one game with another, two lectures in seven periods of a class on a
class players fell ill, having played 3 games particular day. A, B and C are three of the
each. If the total numebr of games played is lectures. The number of ways in which a
84, the number of participants at the routine for the day can be made such that A
beggining was delivers his lecture before B, and B before C,
(a) 15 (b) 30 is
6
(a) 210 (b) 420
(C) C2 (d) 4 8
(c) 840 (d) None of these
76. The number of ways of distributing 10
81. If 33 ! is divisible by 2" then the maximum
different books among 4 students (Si - S 4 )
value of n =
such that and S2 get 2 books each and (a) 33 (b) 32 (c)31 (d) 30
S 3 and S 4 get 3 books each is
82. The number of zeros at the end of 100 ! is
(a) 12600 (b) 25200 (a) 54 (b) 58
/ \ 10/" /n 10 ! (c) 24 (d) 47
(C) Q
2 ! 2 !3 !3 ! 83. The maximum number of different
77. The number of different ways the letters of permutations of 4 letters of the word
the word VECTOR can be placed in the 8 EARTHQUAKE is
boxes of the given below such that no row (a) 1045 (b) 2190
empty is equal to (c) 4380 (d) 2348
84. In a city no persons have identical set of teeth
and there is no person without a tooth. Also
no person has more than 32 teeth. If we
(a) 26 (b) 26 x 6 ! disregard the shape and size of tooth and
(c) 6 ! (d) 2 ! x 6 ! consider only the positioning of the teeth,
78. In the next world cup of cricket there will be then the maximum population of the city is
12 teams, divided equally in two groups. (a) 2 3 2 (b) 2 3 2 - 1
Teams of each group will play a match 32
(c) 2 - 2 (d) 2 3 2 - 3
against each other. From each group 3 top
teams will qualify for the next round. In this 85. Ten persons, amongst whom are A, B & C
round each team will play against others are speak at a function. The number of ways
once. Four top teams of this round will in which it can be done if A wants to speak
qualify for the semifinal round, when each before B, and B wants to speak before C is
team will play against the others once. Two 10 '
top teams of this round will go to the final (a)— (b) 21870
b
round, where they will play the best of three
matches. The minimum number of matches (c)f^ (d) > 7
in the next world cup will be
86. The number of ways in which a mixed
(a) 54 (b) 53
double game can be arranged from amongst 9
(c) 52 (d) None of these
married couples if no husband and wife play
79. Two lines intersect at O. Points AUA2, ..,A„ in the same game is
are taken on one of them and B\, B2,.., Bn on (a) 756 (b) 1512
the other the number of triangles that can be (c) 3024 (d) None of these
drawn with the help of these (2n + 1) points is
87. In a college examination, a candidate is
(a) n (b) n 2 required to answer 6 out of 10 questions
(c) n (d) ;/4 which are divided into two sections each
containing 5 questions, further the candidate
Permutations and Combinations 45
(A) There are 10 parts in this question. Each part has one or more than one correct answer(s).
[10 x 2 = 20]
1. The number of points (x,y, z) is space,
whose each co-ordinate is a negative 6. The number of ways in which we can choose
integer such that x + ; y + z + 1 2 = 0 is 2 distinct integers from 1 to 100 such that
(a) 385 (b) 55 difference between them is at most 10 is
(c) 110 (d) None of these (a) 1 0 C 2 (b) 72
The number of divisors of 2 2 . 3 3 . 5 3 . 7 5 of (c) 1 0 0 C 2
90,
(d) None of these
the form 4n + 1, n e N is 7. Number of points having position vector
(a) 46 (b) 47 a i + b j +c % where a, b, c e (1, 2, 3, 4, 5}
(c) 96 (d) 94
such that 2a + 3 6 + 5° is divisible by 4 is
3. The number of ways in which 30 coins of (a) 70 (b) 140
one rupee each be given to six persons so
(c) 210 (d) 280
that none of them receives less than 4
rupees is 8. If a be an element of the set
A = (1, 2, 3, 5, 6, 10, 15, 30| and a, (3, y are
(a) 231 (b) 462
integers such that cxpy = a, then the number
(c) 693 (d) 924 of positive integral solutions of aPy = a is
4. The number of integral solutions of the (a) 32 (b) 48
equation 2x + 2y + z = 20 where x > 0, y > 0 (c) 64 (d) 80
and z > 0 is
9. If n objects are arranged in a row, then the
(a) 132 (b) 11 number of ways of selecting three of these
(c) 33 (d) 66 objects so that no two of them are next to
5. The number of ways to select 2 numbers each other is
from (0, 1, 2, 3, 4) such that the sum of the (a) ( " - 2 ) ( n - 3 ) ( r a - 4 ) (fe) n - 2Q
squares of the selected numbers is divisible 6
by 5 are (repitition of digits is allowed).
(C)"~3C3+"~3C2 (d) None of these
(a) 9 Ci (b) 9 P 8 10. Number of positive integral solutions of
(c)9 (d)7 abc = 30 is
(a) 9 (b) 27
(c) 81 (d) 243