CPP: P & C 1 FACULTY ID: MNJ

SINGLE CHOICE CORRECT

15
1. If t n  n(n !) , then t
n 1
n is equal to

(a) 15 ! – 1 (b) 15 ! + 1 (c) 16 ! – 1 (d) none of these

( n  2)!  ( n  3)!
2. The value of lim is equal to
n (n  1)!  ( n  3)!
(a) 1 (b) 1 (c) 0 (d) none of these
3. The ten’s digit of 1! + 2! + 3! + … + 49! is
(a) 1 (b) 2 (c) 3 (d) 4
4. If 12 Pr  11
P6  6 . 11 P5 , then r is equal to
(a) 6 (b) 5 (c) 7 (d) none of these
5. If C 3 r  C r 3 , then the value of r is
15 15

(a) 3 (b) 4 (c) 5 (d) 8

6. If n C r 1  36, n C r  84 and n C r 1  126, then the value of r is
(a) 1 (b) 2 (c) 3 (d) none of these
7. If n 1C 3  n 1C 4  n C 3 , then n is greater than
(a) 6 (b) 7 (c) 5 (d) 4
8. In a city, no two persons have identical set of teeth and there is no person without a tooth.
Also, no person has more than 32 teeth. If we disregard the shape and size of tooth and
consider only the positioning of the teeth, then the maximum population of the city is
(b) 32  1 (d) 2 321
2
(a) 2 32 (c) 2 32  1

9. The number of ways in which n distinct objects can be put into two different boxes so that no
box remains empty, is
(a) 2n  1 (b) n2  1 (c) 2n  2 (d) n2  2

10. A servant has to post 5 letters and there are 4 letter boxes. In how many ways can he post the
letters?
5!
(a) 5 P4 (b) (c) 5 4 (d) 45
4!

11. The number of ways in which 8 distinct toys can be distributed among 5 children is
(a) 58 (b) 85 (c) 8P5 (d) 40
12. The number of five-digit telephone numbers having at least one of their digits repeated is
(a) 90000 (b) 100000 (c) 30240 (d) 69760
13. In a dinner party, there are 10 Indians, 5 Americans and 5 Englishmen. In how many ways can
they be arranged in a row so that all persons of the same nationality sit together?
(a) 10 ! 5 ! 5 ! (b) 3 ! 10 ! 5 ! 5 ! (c) 3 ! 10 ! (d) 10 ! 5 !
14. In a class of 10 students, there are 3 girls. In how many different ways can they be arranged in
a row such that no two of the three girls are consecutive?
(a) 336  7 ! (b) 336  10 ! (c) 336  8 ! (d) none of these

15. In a class of students, there are 4 girls and 6 boys. In how many ways can they be seated in a
row so that all the four girls are not together?
10 7
(a) 10 ! – 7 ! 4 ! (b) P4 (c) P4 (d) 6 ! 4 !
CPP: P & C 1 FACULTY ID: MNJ

16. m men and w women are to be seated in a row so that no two women sit together. If m  w,
then the number of ways in which they can be seated is
m! m  1 ! m w
(a) (b) m
C m w ( m  w)! (c) Cm ( m  w)! (d) none of these
(m  w  1)!
17. A library has 5 copies of one book, 4 copies of each of 2 books, 6 copies of each of 3 books
and single copies of 8 books. In how many ways can all books be arranged so that copies of
the same book are always together?
(a) 5 ! (b) 14 ! (c) 8 ! (d) 6 !

18. The number of different words that can be formed from the letters of the word PENCIL so that
no two vowels are together, is
(a) 120 (b) 260 (c) 240 (d) 480
19. The number of words which can be made out of the letters of the word MOBILE such that the
consonants always occupy odd places, is
(a) 20 (b) 36 (c) 30 (d) 720
20. The total number of different numbers lying between 999 and 10000 that can be formed with
the help of the digits 0, 2, 3, 6, 7, 8 when the digits are not to be repeated, is
(a) 100 (b) 200 (c) 300 (d) 400
21. How many four-digit numbers divisible by 5 can be formed with the digits 0, 4, 5, 6, 7 if
repetition of digits is not allowed?
(a) 40 (b) 44 (c) 42 (d) 36
22. A five digit number divisible by 3 is to be formed using the numerals 0, 1, 2, 3, 4, and 5 without
repetition. The total number of ways in which this can be done is
(a) 216 (b) 240 (c) 600 (d) 3125
23. The number of 5-digit numbers that contain 7 exactly once is
(a) 41 9 3  (b) 37 9 3   
(c) 7  9 4  
(d) 41 9 4
24. Nine hundred distinct n-digit numbers are to be formed using only the digits 2, 5 and 7. The
smallest value of n for which this is possible is
(a) 6 (b) 7 (c) 8 (d) 9
25. How many 5-digit numbers divisible by 25 can be made with the digits 0, 1, 2, 3, 4, 5, 6 and
7 if repetition is not allowed?
(a) 200 (b) 320 (c) 120 (d) 360
26. The number of four-digit numbers greater than 4321 that can be formed from the digits 0, 1, 2,
3, 4, 5, is
(a) 310 (b) 360 (c) 288 (d) none of these
27. The number of arrangements of the letters of the word “Delhi” if ‘e’ comes before ‘i’ is
(a) 40 (b) 30 (c) 60 (d) 20
28. Three ladies came along with their one child (each) for admission to a school. The head of the
school wishes to interview the six people one by one, taking care that no child is interviewed
before his/her mother. The number of different ways of arranging the interviews is
(a) 90 (b) 36 (c) 72 (d) none of these
29. At an election, a voter may vote for any number of candidates, not greater than the number to
be elected. There are 10 candidates and 4 are to be elected. If a voter votes for at least one
candidate, then the number of ways in which he can vote is
(a) 6210 (b) 385 (c) 1110 (d) 5040
CPP: P & C 1 FACULTY ID: MNJ

30. There are 10 persons named A, B, , J . We have the capacity to accommodate only 5. In
how many ways can we arrange them in a line if A is must and G and H must not be included
in the team of 5?
(a) 8 P5 (b) 7 P5 (c) 7 C 3 4 ! (d) 7 C 3 5 !

31. Out of 6 boys and 4 girls, a group of 7 with the majority of boys is to be formed. The total
number of ways of forming such groups is
(a) 120 (b) 90 (c) 100 (d) 180

32. A student is to answer 10 out of 13 questions in an examination such that he must choose at
least 4 from the first five questions. The number of choices available to him is
(a) 196 (b) 280 (c) 346 (d) 140

33. A question paper consists of two sections having 3 and 5 questions, respectively. The
number of ways in which a candidate can select the questions if one question from each
section is compulsory, is
(a) 218 (b) 219 (c) 217 (d) 220

34. All possible two-factor products are formed from the numbers 1, 2, …, 100. The number of
factors out of the total obtained which are multiple of 3 is
(a) 2211 (b) 4950 (c) 2739 (d) none of these
35. A polygon has 44 diagonals. The number of sides is equal to
(a) 9 (b) 8 (c) 7 (d) 11
36. The greatest possible number of points of intersection of 8 straight lines and 4 circles in a
plane is
(a) 32 (b) 64 (c) 76 (d) 104
37. There are 16 points in a plane, no three of which are in a straight line except 8 which are all in
a straight line. The number of triangles that can be formed by joining them equals
(a) 504 (b) 552 (c) 560 (d) 1120
38. The number of parallelograms that can be formed from a set of m parallel lines intersecting
another set of n parallel lines is
m  m  1 n  n  1
(a) mn (b)
4
m  m  1 n  n  1 mn
(c) (d)
4 4
39. The sides AB, BC, CA of a triangle ABC have 3, 4 and 5 interior points, respectively, on them.
The total number of triangles that can be constructed by using these points as vertices is
(a) 220 (b) 204 (c) 205 (d) 195
40. Let Tn denote the number of triangles which can be formed using the vertices of a regular
polygon of n sides. If Tn 1  Tn  21, then n equals
(a) 4 (b) 5 (c) 6 (d) 7
41. The number of triangles, whose vertices are at the vertices of an octagon but none of whose
sides happens to be common with the sides of the octagon, is
(a) 24 (b) 52 (c) 48 (d) 16
42. The number of rectangles that you can find on a chess board is
(a) 144 (b) 1296 (c) 256 (d) 1600
43. There are n stations on a railway line. If the number of kinds of tickets printed (no return
tickets) is 105, then the number of stations is
(a) 15 (b) 10 (c) 12 (d) 9
CPP: P & C 1 FACULTY ID: MNJ

44. A student is allowed to select at most n books from a collection of 2n  1 books. If the total
number of ways in which he can select at least one book is 63, then the value of n is
(a) 5 (b) 7 (c) 3 (d) none of these
45. A set contains ( 2n  1) elements. The number of subsets of the set which contain at most n
elements is
(a) 2 n (b) 2 n1 (c) 2 n 1 (d) 2 2 n

46. The number of times the digit 3 will be written when listing the integers from 1 to 1000 is
(a) 269 (b) 300 (c) 271 (d) 302
47. The sum of all the numbers greater than 1000 formed by using the digits 1, 3, 5, 7, if no digit is
repeated in any number, is
(a) 72215 (b) 83911 (c) 106656 (d) 114712

48. The sum of all the numbers which can be formed by using the digits 1, 3, 5, 7, 9 all at a time
and which have no digit repeated, is
(a) 25  4 ! (b) 11111  4 !
(c) 25  11111  4 ! (d) 25  11111  5 !

49. The sum of all the 4-digit numbers formed with the digits 1, 3, 3, 0 is
(a) 22544 (b) 25544 (c) 22554 (d) 25454

50. If the letters of the word SACHIN are arranged in all possible ways and these words are
written out as in a dictionary, then the word SACHIN appears at the serial number
(a) 603 (b) 602 (c) 601 (d) 600
51. A dictionary is printed consisting of 7 lettered words only that can be made with the letters of
the word CRICKET. The number of words before the word CRICKET in the dictionary is
(a) 530 (b) 480 (c) 531 (d) 481
52. How many different words can be formed with the letters of the word MATHEMATICS?
11 ! 11 ! 11 ! 2 ! 7 ! 4!
(a) (b) 11 ! (c) (d)
2 !  3
2!  2 ! 6
53. The number of arrangements of the letters of the word SALOON, if the two O’s do not come
together, is
(a) 360 (b) 720 (c) 240 (d) 120
54. The number of arrangements of the letters of the word BANANA in which the two N’s do not
appear adjacently is
(a) 40 (b) 60 (c) 80 (d) 100

55. All the letters of the word ‘EAMCET’ are arranged in all possible ways. The number of such
arrangements in which two vowels are not adjacent to each other is
(a) 360 (b) 114 (c) 72 (d) 54
56. The number of numbers that can be formed with the digits 1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1 so that
odd digits are in the odd places is
11! 11! 6!5! 6!5!
(a) (b) (c) (d)
5!.6! (2!) 6 (2!) 6 (2!)5

57. The number of ways in which six ‘+’ and four ‘–‘ signs can be arranged in a line such that no
two ‘–‘ signs occur together, is
(a) 24 (b) 35 (c) 30 (d) none of these
CPP: P & C 1 FACULTY ID: MNJ

58. The number of ways in which an arrangement of 4 letters of the word PROPORTION can be
made is
(a) 700 (b) 750 (c) 758 (d) 800
59. 7 men and 4 women are to be seated at a round table. If all the women have to sit together,
then the number of ways is
(a) 7 ! . 4 ! (b) 6 ! . 3 ! (c) 10 ! – 7 ! . 4 ! (d) none of these
60. 20 persons are invited for a party. The total number of different ways in which they can be
seated around a circular table, if two particular persons are to be seated on either side of the
host, is
(a) 20 ! (b) 2 . 18 ! (c) 18 ! (d) none of these
61. In how many ways can 7 Englishmen and 6 Indians sit around a table so that no two Indians
are together?
(a) 6 ! × 6 ! (b) 7 ! × 7 ! (c) 6 !  7 P6 (d) 6 !
62. From 5 apples, 4 oranges and 3 mangoes, how many selections of fruits can be made?
(a) 119 (b) 120 (c) 59 (d) 60
63. If r, s, t are prime numbers and p, q are positive integers such that the LCM of p, q is r 2t 4 s 2 ,
then the number of ordered pairs (p, q) is
(a) 252 (b) 254 (c) 225 (d) 224
64. The number of zeros at the end of 100! is
(a) 12 (b) 48 (c) 24 (d) none of these
65. The total number of ways in which 2n persons can be divided into n couples is

(a)
 2n  ! (b)
 2n  ! (c)
 2n  ! (d) none of these
n! n!  2!n n !  2!
n

66. In how many ways can 12 different books be distributed equally among 4 persons?
12! 12 ! 12 !
(a) (b) (c) 12 ! (d)
4 !  3 !
4
3 !
3!

67. The set S = {1, 2, 3, …, 12} is to be partitioned into three sets A, B, C of equal size such that
A  B  C  S , A  B  B  C  C  A   . The number of ways to partition S is
12 ! 12 ! 12 ! 12 !
(a) (b) (c) (d)
3 ! 4 ! 3 ! 3 ! 4 !3 3 !4
3 4

68. The number of ways in which 6 different toys may be distributed among 4 children so that
each child gets at least one toy is
(a) 6P4  24 (b) 6C4  24 (c) 1560 (d) none of these
69. 4 identical notes of Rs. 100 each and 5 notes in which first is of Re. 1, second is of Rs. 2, third
is of Rs. 5, fourth is of Rs. 20 and fifth is of Rs. 50 are distributed among 3 children such that
each child receive at least one note of Rs. 100. The total number of ways of distribution is
(a) 3×53 (b) 5×35 (c) 36 (d) none of these
70. The total n um ber of poss ib le or dered tr iplets of pos itiv e integ ers satisf yi ng the
equat ion x + y + z = 100, is
(a) 5081 (b) 6005 (c) 4851 (d) none of these

71. The number of ways of distributing 8 identical balls in 3 distinct boxes so that none of the
boxes is empty, is
(a) 5 (b) 21 (c) 38 (d) 8C3
CPP: P & C 1 FACULTY ID: MNJ

72. The number of integral solutions of x  y  z  0 with x, y , z  5 is

(a) 120 (b) 136 (c) 144 (d) none of these
73. The number of integral solutions of x  y  z  t  29, where x  1, y  1, z  3 and t  0 , is
26 26 32 32
(a) C3 (b) C4 (c) C3 (d) C4
74. If a, b, c, d are odd natural numbers such that a + b + c + d = 20, then the number of
possible ordered quadruplets (a, b, c, d) is
(a) 165 (b) 310 (c) 295 (d) 398
    
75. Let a  iˆ  ˆj  kˆ and r be a variable vector such that r . iˆ, r . ˆj and r . kˆ are positive
  
integers. If r . a  12 , then the number of values of r is
12 12 12 12
(a) C3 (b) C4 (c) C5 (d) C6
76. The number of positive integral solutions of abc = 30 is
(a) 30 (b) 27 (c) 8 (d) none of these
77. The number of integral solutions of abc = 30 is
(a) 8 (b) 27 (c) 108 (d) 216
78. The number of ways in which an examiner can assign 30 marks to 8 questions, awarding not
less than 2 marks to any question, is
(a) 21 C 7 (b) 30 C16 (c) 21 C16 (d) none of these

79. The number of integers between 1 and 1000000 which have the sum of the digits equal to 18,
is
(a) 23 C5 (b) 23 C5 13C5
23 22
(c) C5  6 13C5 (d) C5
80. A person goes in for an examination in which there are four papers with a maximum of m
marks for each paper. The number of ways in which one can get 2m marks, is
(a) 2 m 3
C3 (b)
1
3

m  1 2m 2  4m  1 
(c)
1
3

m  1 2m 2  4m  3  (d) none of these

81. There are 4 letters and 4 directed envelopes. The number of ways in which all the letters are
put into the wrong envelopes is
(a) 8 (b) 9 (c) 16 (d) none of these

82. There are seven greeting cards, each of different color, and seven envelopes of the same
seven colors. The number of ways in which the cards can be put in the envelopes, so that
exactly four of the cards go into the envelopes of the right colors, is
(a) 35 (b) 70 (c) 140 (d) none of these
CPP: P & C 1 FACULTY ID: MNJ

ONE OR MORE THAN ONE CHOICE CORRECT

1. 2n
Pn 
(a)  n  1 n  2  2n (b) 2n 1 3 5  2n  1
(c)  2 610  4n  2 (d) n !  2n
Cn

2. There are n married couples at a party. Each person shakes hand with every person other
than her or his spouse. The total number of handshakes is
(a) 2n
C2  n (b) 2n
C 2  n  1 (c) 2n n  1 (d) 2n
C2

3. The kindergarten teacher has 25 kids in her class. She takes 5 of them at a time to zoological
garden as often as she can, without taking the same 5 kids more than once. The number of
visits the teacher makes to the garden exceeds that of a kid by
(a) 25 C5  24 C4 (b) 24 C5 (c) 25 C5  24 C5 (d) 24 C4

4. There are 12 points in a plane of which 5 are collinear. The number of distinct quadrilaterals
which can be formed with vertices at these points is
(a) 2  7 P3 (b) 7
P3 (c) 10  7 C3 (d) 420

5. The number of ways of arranging the letters AAAAA, BBB, CCC, D, EE and F in a row if no
two C’s are together, is
12! 13! 14! 13!
(a) 13
C3  (b) (c) (d) 11 
5!3!2! 5!3!3!2! 3!3!2! 6!
6. There are 5 mangoes and 4 apples. The number of ways of selecting at least one fruit in which
(a) fruits of the same kind are different = 2 9  1
(b) fruits of the same kind are different = 2 9
(c) fruits of the same kind are identical = 29
(d) fruits of the same kind are identical = 30

7. If N = 37800,
(a) the total number of factors of N is 96
(b) the total number of factors of N is 92
(c) the sum of odd proper divisors of N is 9919
(d) the sum of odd proper divisors of N is 9918

8. Mark the wrong statements among those given below.

(a) The number of arrangements of 10 different flowers in a garland is 9 !.
(b) The number of ways in which 13 cards can be given to each of four players from a pack of
52!
52 playing cards is .
13! 4
n
Cr nr
(c) n
 (d) If n Pr  120 n C r , then r = 6.
C r 1 r
CPP: P & C 1 FACULTY ID: MNJ

9. The number of ways in which 200 different things can be divided into 100 pairs is
200!  101  102   103   200 
(a) (b) 
     
2100 2  2  2   2 
200!
(c) (d) 1.3.5199
2 100!
100

10. If n is the number of positive integral solutions of x1 x2 x3 x4  210 , then

(a) n must be divisible by 3 distinct primes (b) n must be a perfect square
(c) n must be a perfect 4th power (d) n must be a perfect 8th power

11. The number of ways of choosing triplets (x, y, z) such that z  maxx, y  and
x, y , z  1, 2, ..., n is
1
(a) n 1
C 3  n  2C 3 (b) n  n  1 n  2
6
(c) 12  2 2  ...  n 2  
(d) 2 n  2 C 3  n 1C 2

12. For the equation x  y  z  w  19 , the number of positive integral solutions is equal to
(a) the number of ways in which 15 identical things can be distributed among 4 persons
(b) the number of ways in which 19 identical things can be distributed among 4 persons
 
4
(c) the coefficient of x 19 in x 0  x1  x 2  ...  x19

in  x  x 
4
(d) the coefficient of x 19 2
 x 3  ...  x16
CPP: P & C 1 FACULTY ID: MNJ

ANSWERS
SINGLE CHOICE CORRECT

1. (c) 2. (b) 3. (a) 4. (a) 5. (a)

6. (c) 7. (b) 8. (c) 9. (c) 10. (d)

11. (a) 12. (d) 13. (b) 14. (a) 15. (a)

16. (a) 17. (b) 18. (d) 19. (b) 20. (c)

21. (c) 22. (a) 23. (a) 24. (b) 25. (b)

26. (a) 27. (c) 28. (a) 29. (b) 30. (d)

31. (c) 32. (a) 33. (c) 34. (c) 35. (d)

36. (d) 37. (a) 38. (b) 39. (c) 40. (d)

41. (d) 42. (b) 43. (a) 44. (c) 45. (d)

46. (b) 47. (c) 48. (c) 49. (c) 50. (c)

51. (a) 52. (a) 53. (c) 54. (a) 55. (c)

56. (d) 57. (b) 58. (c) 59. (a) 60. (b)

61. (c) 62. (a) 63. (c) 64. (c) 65. (c)

66. (b) 67. (c) 68. (c) 69. (c) 70. (c)

71. (b) 72. (b) 73. (a) 74. (a) 75. (a)

76. (b) 77. (c) 78. (a) 79. (c) 80. (c)

81. (b) 82. (b) 83. () 84. () 85. ()

ONE OR MORE THAN ONE CHOICE CORRECT

1. (abcd) 2. (ac) 3. (ab) 4. (ad) 5. (ad)

6. (ac) 7. (ac) 8. (acd) 9. (bcd) 10. (bcd)

11. (acd) 12. (ad) 13. () 14. () 15. ()