ASSIGNMENT

Fundamental concept and Permutations without repetition

Basic Level

1. (n − r + 1) n Pr −1 =
n −1 n +1 n n
(a) Pr (b) Pr (c) Pr (d) Pr −1

2. If 5 Pr = 120 , then the value of r is

(a) 2 (b) 3+ (c) 5 (d) 4
3. If P5 : P3 = 2 : 1 , then the value of n is
n n
[Rajasthan PET 1989]

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

n −1
4. The value of n. Pr −1 is [DCE 1998]
n n −1 n +1 n −1
(a) Pr (b) Pr −1 (c) Pr +1 (d) Pr
m +n m −n
5. If P2 = 56 and P2 = 12 , then m, n are equal to
(a) 5, 1 (b) 6, 2 (c) 7, 3 (d) 9, 6
K +5 11 (K − 1) K +3
6. If PK +1 = PK then the values of K are
2
(a) 2 and 6 (b) 2 and 11 (c) 7 and 11 (d) 6 and 7
7. There are 5 roads leading to a town from a village. The number of different ways in which a villager can go to the town and
return back, is [MP PET 1996]
(a) 25 (b) 20 (c) 10 (d) 5
8. How many words can be formed from the letters of the word BHOPAL
(a) 124 (b) 240 (c) 360 (d) 720
9. How many numbers can be formed from the digits1, 2, 3, 4 when the repetition is not allowed
(a) 4
P4 (b) 4
P3 (c) 4
P1 + 4 P2 + 4 P3 (d) 4
P1 + 4 P2 + 4 P3 + 4 P4
10. How many numbers lying between 500 and 600 can be formed with the help of the digits 1, 2, 3, 4, 5, 6 when the digits are not
to be repeated
(a) 20 (b) 40 (c) 60 (d) 80
11. 4 buses runs between Bhopal and Gwalior. If a man goes from Gwalior to Bhopal by a bus and comes back to Gwalior by
another bus, then the total possible ways are
(a) 12 (b) 16 (c) 4 (d) 8
12. In how many ways can 10 true-false questions be replied
(a) 20 (b) 100 (c) 512 (d) 1024
13. There are 8 gates in a hall. In how many ways a person can enter in the hall and come out from a different gate
(a) 7 (b) 8 × 8 (c) 8 + 7 (d) 8 × 7
14. P, Q, R and S have to give lectures to an audience. The organiser can arrange the order of their presentation in
[BIT Ranchi 1991; Pb. CET 1991]
(a) 4 ways (b) 12 ways (c) 256 ways (d) 24 ways
15. The product of any r consecutive natural numbers is always divisible by
(a) r ! (b) r 2 (c) r n (d) None of these
16. The number of ways in which first, second and third prizes can be given to 5 competitors is
(a) 10 (b) 60 (c) 15 (d) 125
17. In a railway compartment there are 6 seats. The number of ways in which 6 passengers can occupy these 6 seats is
 [Karnataka CET 2001]
(a) 36 (b) 30 (c) 720 (d) 120
18. If any number of flags are used, how many signals can be given with the help of 6 flags of different colours
(a) 1956 (b) 1958 (c) 720 (d) None of these
19. The number of ways of painting the faces of a cube with six different colours is
(a) 1 (b) 6 (c) 6 ! (d) None of these

Advance Level

20. The value of 2 n {1 .3 .5 .....( 2n − 3 )(2 n − 1)} is

(2 n)! (2 n)! n!
(a) (b) (c) (d) None of these
n! 2n (2 n)!

21. If 56
Pr + 6 : 54 Pr + 3 = 30800 : 1, then r = [Roorkee 1983; Kurukshetra CEE 1998]

(a) 31 (b) 41 (c) 51 (d) None of these

n
22. The value of Pr is equal to [IIT 1971; MP PET 1993]
n −1 n −1 n −1 n −1 n −1 n −1 n −1
(a) Pr + r Pr −1 (b) n. Pr + Pr −1 (c) n( Pr + Pr −1 ) (d) Pr −1 + n −1 Pr
23. The exponent of 3 in 100 ! is
(a) 33 (b) 44 (c) 48 (d) 52
24. The number of positive integral solutions of abc = 30 is [UPSEAT 2001]
(a) 30 (b) 27 (c) 8 (d) None of these
25. The number of 4 digit even numbers that can be formed using 0, 1, 2, 3, 4, 5, 6 without repetition is
(a) 120 (b) 300 (c) 420 (d) 20
26. The number of five digits numbers that can be formed without any restriction is
(a) 990000 (b) 100000 (c) 90000 (d) None of these
27. How many numbers less than 1000 can be made from the digits 1, 2, 3, 4, 5, 6 (repetition is not allowed)
(a) 156 (b) 160 (c) 150 (d) None of these
28. How many even numbers of 3 different digits can be formed from the digits 1, 2, 3, 4, 5, 6, 7, 8, 9 (repetition is not allowed)
(a) 224 (b) 280 (c) 324 (d) None of these
29. A five digit number divisible by 3 has to 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
30. In a circus there are ten cages for accommodating ten animals. Out of these four cages are so small that five out of 10 animals
cannot enter into them. In how many ways will it be possible to accommodate ten animals in these ten cages
(a) 66400 (b) 86400 (c) 96400 (d) None of these
31. How many numbers can be made with the digits 3, 4, 5, 6, 7, 8 lying between 3000 and 4000 which are divisible by 5 while
repetition of any digit is not allowed in any number [Rajasthan PET 1990]
(a) 60 (b) 12 (c) 120 (d) 24
32. All possible four digit numbers are formed using the digits 0, 1, 2, 3 so that no number has repeated digits. The number of
even numbers among them is
(a) 9 (b) 18 (c) 10 (d) None of these
33. The total number of seven digit numbers the sum of whose digits is even is
(a) 9000000 (b) 4500000 (c) 8100000 (d) None of these
34. The sum of all 4 digit numbers that can be formed by using the digits 2, 4, 6, 8 (repetition of digits not allowed) is
(a) 133320 (b) 533280 (c) 53328 (d) None of these
35. How many numbers greater than 24000 can be formed by using digits 1, 2, 3, 4, 5 when no digit is repeated [Rajasthan PET 1999]
(a) 36 (b) 60 (c) 84 (d) 120
36. How many numbers greater than hundred and divisible by 5 can be made from the digits 3, 4, 5, 6, if no digit is repeated [AMU 1999]
 (a) 6 (b) 12 (c) 24 (d) 30
37. The sum of all numbers greater than 1000 formed by using the digits 1, 3, 5, 7 no digit is repeated in any number is [AMU 1997]
(a) 106656 (b) 101276 (c) 117312 (d) 811273
38. 3 copies each of 4 different books are available. The number of ways in which these can be arranged on the shelf is
[Karnataka CET 1996]
12 ! 12 !
(a) 12 ! (b) (c) (d) 369,000
3 !4 ! (3 ! ) 4
39. Eleven books consisting of 5 Mathematics, 4 Physics and 2 Chemistry are placed on a shelf. The number of possible ways of
arranging them on the assumption that the books of the same subject are all together is [AMU 2002]
(a) 4 ! 2! (b) 11! (c) 5! 4! 3! 2! (d) None of these
40. The number of positive integers which can be formed by using any number of digits from 0, 1, 2, 3, 4, 5 but using each digit
not more than once in each number is
(a) 1200 (b) 1500 (c) 1600 (d) 1630
41. Let A be a set of n(≥ 3) distinct elements. The number of triplets (x, y, z) of the elements of A in which at least two coordinates
are equal is
(a) n
P3 (b) n 3 − n P3 (c) 3n 2 − 2n (d) 3n 2 (n − 1)
p
42. The number of distinct rational numbers x such that 0 < x < 1 and x = , where p, q ∈ {1, 2, 3, 4 , 5 , 6 } is
q
(a) 15 (b) 13 (c) 12 (d) 11
43. The total number of 5 digit numbers of different digits in which the digit in the middle is the largest is
9
(a) ∑
n=4
n
P4 (b) 33 (3!) (c) 30 (3 !) (d) None of these

44. Two teams are to play a series of 5 matches between them. A match ends in a win or loss or draw for a team. A number of
people forecast the result of each match and no two people make the same forecast for the series of matches. The smallest
group of people in which one person forecasts correctly for all matches will contain n people, where n is
(a) 81 (b) 243 (c) 486 (d) None of these

Number of Permutations with Repetition

Basic Level

45. The number of permutations of the letters x 2 y 4 z 3 will be

9! 9! 9!
(a) (b) (c) (d) 9!
2! 4 ! 2 ! 4 ! 3! 4 ! 3!
46. How many numbers consisting of 5 digits can be formed in which the digits 3, 4 and 7 are used only once and the digit 5 is
used twice
(a) 30 (b) 60 (c) 45 (d) 90
47. The number of different arrangements which can be made from the letters of the word SERIES taken all together is
6! 6!
(a) (b) (c) 6 ! (d) None of these
2!2! 4!
48. How many words can be formed with the letters of the word MATHEMATICS by rearranging them
11 ! 11 ! 11 !
(a) (b) (c) (d) 11 !
2 ! 2! 2! 2 ! 2! 2!
49. How many words can be made out from the letters of the word INDEPENDENCE, in which vowels always come together
[Roorkee 1989]
(a) 16800 (b) 16630 (c) 1663200 (d) None of these
50. In how many ways 5 red, 4 blue and 1 green balls can be arranged in a row
(a) 1260 (b) 2880 (c) 9 ! (d) 10 !
51. Using 5 conveyances, the number of ways of making 3 journeys is
(a) 3 × 5 (b) 3 5 (c) 5 3 (d) 5 3 − 1
52. The total number of permutations of the letters of the word “BANANA” is [Rajasthan PET 1997, 2000]
(a) 60 (b) 120 (c) 720 (d) 24
53. The number of 7 digit numbers which can be formed using the digits 1, 2, 3, 2, 3, 3, 4 is [Pb. CET 1999]
(a) 420 (b) 840 (c) 2520 (d) 5040
54. The number of 3 digit odd numbers, that can be formed by using the digits 1, 2, 3, 4, 5, 6 when the repetition is allowed, is
[Pb. CET 1999]
(a) 60 (b) 108 (c) 36 (d) 30
55. How many different nine-digit numbers can be formed from the digits of the number 223355888 by rearrangement of the
digits so that the odd digits occupy even places [IIT Screening 2000; Karnataka CET 2002]
(a) 16 (b) 36 (c) 60 (d) 180
56. Using all digits 2, 3, 4, 5, 6 how many even numbers can be formed
(a) 24 (b) 48 (c) 72 (d) 120
57. Let S be the set of all functions from the set A to the set A. If n( A) = k then n(S ) is
(a) k ! (b) k k (c) 2 k − 1 (d) 2k
58. The number of ways in which 6 rings can be worn on the four fingers of one hand is [AMU 1983]
6 6 4
(a) 4 (b) C4 (c) 6 (d) None of these
59. In how many ways can 4 prizes be distributed among 3 students, if each student can get all the 4 prizes
(a) 4 ! (b) 3 4 (c) 3 4 − 1 (d) 3 3
60. In how many ways 3 letters can be posted in 4 letter-boxes, if all the letters are not posted in the same letter-box
(a) 63 (b) 60 (c) 77 (d) 81
61. There are 4 parcels and 5 post-offices. In how many different ways the registration of parcel can be made
(a) 20 (b) 4 5 (c) 54 (d) 5 4 − 4 5

Advance Level

62. How many numbers lying between 10 and 1000 can be formed from the digits 1, 2, 3, 4, 5, 6, 7, 8, 9 (repetition is allowed)
(a) 1024 (b) 810 (c) 2346 (d) None of these
63. Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Then the number of
words which have at least one letter repeated is [IIT 1980; MNR 1998, 99; DCE 2001]
(a) 69760 (b) 30240 (c) 99748 (d) None of these
64. Six identical coins are arranged in a row. The number of ways in which the number of tails is equal to the number of heads is
(a) 20 (b) 9 (c) 120 (d) 40
65. The total number of permutations of n(> 1) different things taken not more than r at a time, when each thing may be repeated
any number of times is
n (n n − 1 ) nr − 1 n(n r − 1)
(a) (b) (c) (d) None of these
n −1 n −1 n −1
66. How many number less than 10000 can be made with the eight digits 1, 2, 3, 4, 5, 6, 7, 0 (digits may repeat)
(a) 256 (b) 4095 (c) 4096 (d) 4680
67. The total number of natural numbers of six digits that can be made with digits 1, 2, 3, 4, if the all digits are to appear in the
same number at least once, is
(a) 1560 (b) 840 (c) 1080 (d) 480
68. A library has a copies of one book, b copies of each of two books, c copies of each of three books and single copies of d
books. The total number of ways in which these books can be distributed is
(a + b + c + d )! (a + 2b + 3 c + d ) ! (a + 2b + 3 c + d ) !
(a) (b) 2 3
(c) (d) None of these
a!b !c ! a!(b !) (c !) a!b !c !
69. The number of ways of arranging 2m white counters and 2n red counters in a straight line so that the arrangement is
symmetrical with respect to a central mark
 (m + n)! 2 (m + n)!
(a) (m + n)! (b) (c) (d) None of these
m !n! m !n!
70. Total number of four digit odd numbers that can be formed using 0, 1, 2, 3, 5, 7 are [AIEEE 2002]
(a) 216 (b) 375 (c) 400 (d) 720
71. The number of ways of arranging the letter AAAAA BBB CCC D EE F in a row when no two C’s are together is
13
15 ! 15 ! 13 ! 12 ! P3 12 !
(a) − 3! (b) − (c) × (d) × 13 P3
5 !3 !3 !2 ! 5 ! 3 ! 3 ! 2 ! 5 ! 3! 2! 5 !3 !2 ! 3 ! 5 !3 ! 2 !
72. The number of 4 digit numbers that can be made with the digits 1, 2, 3, 4 and 5 in which at least two digits are identical, is
(a) 4 5 − 5! (b) 505 (c) 600 (d) None of these

Conditional Permutations

Basic Level

73. The number of words which can be formed from the letters of the word MAXIMUM, if two consonants cannot occur together,
is
(a) 4 ! (b) 3 ! × 4 ! (c) 7 ! (d) None of these
74. The number of ways in which the letters of the word TRIANGLE can be arranged such that two vowels do not occur together
is
(a) 1200 (b) 2400 (c) 14400 (d) None of these
75. How many words can be formed form the letters of the word COURTESY, whose first letter is C and the last letter is Y
(a) 6 ! (b) 8 ! (c) 2 (6) ! (d) 2 (7) !
76. How many words can be made from the letters of the word DELHI, if L comes in the middle in every word
(a) 12 (b) 24 (c) 60 (d) 6
77. The number of ways in which the letters of the word ARRANGE can be arranged such that both R do not come together is
[MP PET 1993]
(a) 360 (b) 900 (c) 1260 (d) 1620
78. How many words can be made from the letters of the word BHARAT in which B and H never come together [IIT 1977]
(a) 360 (b) 300 (c) 240 (d) 120
79. How many words can be made from the letters of the word INSURANCE, if all vowels come together
(a) 18270 (b) 17280 (c) 12780 (d) None of these
80. There are three girls in a class of 10 students. The number of different ways in which they can be seated in a row such that
no two of the three girls are together is
10 !
(a) 7 !× 6 P3 (b) 7 !× 8 P3 (c) 7 !× 3 ! (d)
3 !7 !
81. In how many ways can 5 boys and 5 girls stand in a row so that no two girls may be together [Rajasthan PET 1997]
(a) (5 !)2 (b) 5 ! × 4 ! (c) 5 ! × 6! (d) 6 × 5 !
82. The number of arrangements of the letters of the word BANANA in which two N's do not appear adjacently is [IIT Screening 2002]
(a) 40 (b) 60 (c) 80 (d) 100
83. The number of ways in which 5 boys and 3 girls can be seated in a row so that each girl in between two boys [Kerala (Engg.)2002]
(a) 2880 (b) 1880 (c) 3800 (d) 2800
84. The number of words that can be formed out of the letters of the word ARTICLE so that the vowels occupy even places is
[Karnataka CET 2003]
(a) 36 (b) 574 (c) 144 (d) 754
85. The number of ways in which three students of a class may be assigned a grade of A, B, C or D so that no two students
receive the same grade, is
4 4
(a) 34 (b) 4 3 (c) P3 (d) C3
86. The number of ways lawn tennis mixed double can be made up from seven married couples if no husband and wife play in the
same set is
 (a) 210 (b) 420 (c) 840 (d) None of these

Advance Level

87. How many numbers greater 40000 can be formed from the digits 2, 4, 5, 5, 7
(a) 12 (b) 24 (c) 36 (d) 48
88. In how many ways n books can be arranged in a row so that two specified books are not together
(a) n !−(n − 2)! (b) (n − 1)!(n − 2) (c) n !−2(n − 1) (d) (n − 2) n!
89. How many numbers between 5000 and 10,000 can be formed using the digits 1, 2, 3, 4, 5, 6, 7, 8, 9 each digit appearing not
more than once in each number
(a) 5 ×8 P3 (b) 5 ×8 C3 (c) 5 !× 8 P3 (d) 5 !× 8 C 3
90. Find the total number of 9 digit numbers which have all the digits different [IIT 1982]
(a) 9 × 9 ! (b) 9 ! (c) 10 ! (d) None of these
91. Four dice (six faced) are rolled. The number of possible outcomes in which at least one die shows 2 is
(a) 1296 (b) 625 (c) 671 (d) None of these
92. How many numbers, lying between 99 and 1000 be made from the digits 2, 3, 7, 0, 8, 6 when the digits occur only once in
each number [MP PET 1984]
(a) 100 (b) 90 (c) 120 (d) 80
93. The sum of the digits in the unit place of all numbers formed with the help of 3, 4, 5, 6 taken all at a time is [Pb. CET 1990]
(a) 18 (b) 432 (c) 108 (d) 144
94. All letters of the word AGAIN are permuted in all possible ways and the words so formed (with or without meaning) are
written as in dictionary, then the 50th word is
(a) NAAGI (b) IAANG (c) NAAIG (d) INAGA
95. Eight chairs are numbered 1 to 8. Two women and three men wish to occupy one chair each. First the women choose the
chairs from amongst the chairs marked 1 to 4 and then men select the chairs from amongst the remaining. The number of
possible arrangements is [IIT 1982, 89; Pb. CET
2000]

(a) 6
C3 × 4 C 2 (b) 4
C 2 × 4 P3 (c) 4
P2 × 4 P3 (d) None of these
96. If a denotes the number of permutations of x + 2 things taken all at a time, b the number of permutations of x things taken 11
at a time and c the number of permutations of x − 11 things taken all at a time such that a = 182 bc , then the value of x is
(a) 15 (b) 12 (c) 10 (d) 18
97. The number of ways in which ten candidates A1 , A2 , ......, A10 can be ranked such that A1 is always above A10 is
1
(a) 5 ! (b) 2 (5 !) (c) 10 ! (d) (10 !)
2
98. A dictionary is printed consisting of 7 lettered words only that can be made with a letter of the word CRICKET. If the words
are printed at the alphabetical order, as in an ordinary dictionary, the number of word before the word CRICKET is
(a) 530 (b) 480 (c) 531 (d) 481
99. Seven different lecturers are to deliver lectures in seven periods of a class on a particular day. A, B and C are three of the
lecturers. The number of ways in which a routine for the day can be made such that A delivers his lecture before B, and B
before C, is
(a) 420 (b) 120 (c) 210 (d) None of these
100. Let A = { x : x is a prime number and x < 30 } . The number of different rational numbers whose numerator and denominator
belong to A is
(a) 90 (b) 180 (c) 91 (d) None of these
101. The number of numbers of 9 different non-zero digits such that all the digits in the first four places are less than the digit in
the middle and all the digits in the last four places are greater than that in the middle is
(a) 2 (4 !) (b) (4 !)2 (c) 8 ! (d) None of these
102. How many ways are there to arrange the letters in the word GARDEN with the vowels in alphabetical order [AIEEE 2004]
(a) 480 (b) 240 (c) 360 (d) 120

Circular Permutations

Basic Level

103. If eleven members of a committee sit at a round table so that the president and secretary always sit together, then the number
of arrangement is
(a) 10 ! × 2 (b) 10 ! (c) 9 ! × 2 (d) None of these
104. In how many ways can 5 keys be put in a ring
4! 5!
(a) (b) (c) 4 ! (d) 5!
2 2
105. In how many ways can 12 gentlemen sit around a round table so that three specified gentlemen are always together
(a) 9 ! (b) 10 ! (c) 3 ! 10! (d) 3!9!
106. n gentlemen can be made to sit on a round table in [MP PET 1982]
1 1
(a) (n + 1)! ways (b) (n − 1)! ways (c) (n − 1)! ways (d) (n + 1)! ways
2 2
107. In how many ways 7 men and 7 women can be seated around a round table such that no two women can sit together
[EAMCET 1990; MP PET 2001; DCE 2001; UPSEAT 2002]

(a) (7! ) 2
(b) 7 !× 6 ! (c) (6! ) 2
(d) 7 !
108. The number of circular permutations of n different objects is [Kerala (Engg.) 2001]
(a) n ! (b) n (c) (n − 2)! (d) (n − 1)!

Advance Level

109. In how many ways can 15 members of a council sit along a circular table, when the Secretary is to sit on one side of the
Chairman and the Deputy secretary on the other side
(a) 2 × 12 ! (b) 24 (c) 2 × 15 ! (d) None of these
110. 20 persons are invited for a party. In how many different ways can they and the host be seated at a circular table, if the two
particular persons are to be seated on either side of the host [IIT 1977]
(a) 20! (b) 2 . 18 ! (c) 18 ! (d) None of these
111. 12 persons are to be arranged to a round table. If two particular persons among them are not to be side by side, the total
number of arrangements is [EAMCET 1994]
(a) 9(10 !) (b) 2 (10 !) (c) 45 (8 !) (d) 10 !
112. The number of ways that 8 beads of different colours be string as a necklace is [EAMCET 2002]
(a) 2520 (b) 2880 (c) 5040 (d) 4320
113. The number of ways in which 6 men and 5 women can dine at a round table if no two women are to sit together is given by
[AIEEE 2003; Rajasthan PET 2003]
(a) 6 ! × 5 ! (b) 30 (c) 5 ! × 4 ! (d) 7!×5!
114. In how many ways can 10 persons sit, when 6 persons sit on one round table and 4 sit on the other round table
10 10
(a) 5 ! × 3 ! (b) 10 × 5! × 3 ! (c) C6 × 5 !× 3! (d) C6 × 5! × 3! × 2!
115. There are 20 persons among whom two are brothers . The number of ways in which we can arrange them round a circle so
that there is exactly one person between the two brothers , is
(a) 18 ! (b) 2 (18!) (c) 2 (19 !) (d) None of these
116. A family has 8 members. Four members take food two times a day on two identical round tables. For how many months 8
members can take food by sitting in different orders (1 month = 30 days)
 21
(a) 42 months (b) 21 months (c) months (d) None of these
2

Fundamental concept and Number of Combinations without Repetition

Basic Level

117. If n is even and the value of n Cr is maximum, then r =

n n +1 n −1
(a) (b) (c) (d) None of these
2 2 2
5
118. 47
C4 + ∑ r =1
52 −r
C3 = [IIT 1980; Rajasthan PET 2002; UPSEAT 2000]

47 52 52
(a) C6 (b) C5 (c) C4 (d) None of these

119. If C3 = 220 , then n =

n

(a) 10 (b) 12 (c) 15 (d) 8

n−2
120. If 2 × C5 = 9 ×
n
C5 , then the value of n will be
(a) 7 (b) 10 (c) 9 (d) 5
121. The number of combinations of n different objects taken r at a time will be
n
n n Pr
(a) Pr (b) Pr r! (c) (d) None of these
r!
n 2 −n 2
−n
122. C 2 =n C10 , then n =
(a) 12 (b) 4 only (c) – 3 only (d) 4 or – 3
123. n
Cr + Cr −1 is equal to
n
[MP PET 1984; Kerala (Engg.) 2002]
n +1 n n +1 n −1
(a) Cr (b) Cr +1 (c) Cr +1 (d) Cr −1

124. If Cr = Cr + 2 , then the value of C2 is

8 8 r
[MP PET 1984; Rajasthan PET 1987]

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

125. If 20
Cn + 2 = C16 , then the value of n is
n
[MP PET 1984]

(a) 7 (b) 10 (c) 13 (d) No value

126. The value of 15
C 3 + C13 is
15
[MP PET 1983]
16 30 15 15
(a) C3 (b) C16 (c) C10 (d) C15

127. If 10
Cr = Cr + 2 , then Cr equals
10 5
[Rajasthan PET 1996]

(a) 120 (b) 10 (c) 360 (d) 5

128. If Cr = 84 , Cr −1 = 36 and Cr +1 = 126 , then n equals
n n n
[Rajasthan PET 1997; MP PET 2001]

(a) 8 (b) 9 (c) 10 (d) 5

n +1
129. If C 3 + C 4 >
n n
C 3 , then [Rajasthan PET 1999]

(a) n>6 (b) n > 7 (c) n<6 (d) None of these

130. Value of r for which 15
Cr + 3 = C 2 r − 6 is
15
[Pb. CET 1999]

(a) 2 (b) 4 (c) 6 (d) – 9

n  n   n 
131. For 2 ≤ r ≤ n,   + 2   +   is equal to [IIT Screening 2000]
 
r r − 1 r − 2
n + 1  n + 1 n + 2  n + 2 
(a)   (b) 2   (c) 2   (d)  
r −1  r + 1  r   r 
 n −1
132. C 3 + n −1 C 4 > n C 3 then the value of n is [Rajasthan PET 2000]

(a) 7 (b) < 7 (c) > 7 (d) None of these

 n   n 
133.   +   , whenever 0 ≤ r ≤ n − 1 is equal to [AMU 2000]
n − r   r + 1
 n  n   n  n + 1
(a)   (b)   (c)   (d)  
r − 1 r r + 1 r +1
134. If 43
C r − 6 = 43 C 3 r + 1 , then the value of r is [Kerala (Engg.) 2002]

(a) 12 (b) 8 (c) 6 (d) 10

135. The least value of natural number n satisfying C(n, 5 ) + C(n,6 ) > C(n + 1, 5 ) is [EAMCET 2002]

(a) 11 (b) 10 (c) 12 (d) 13

136. If Cr denotes the number of combinations of n things taken r at a time, then the expression Cr +1 + n Cr −1 + 2 × n Cr , equals
n n

[AIEEE 2003]
n+2 n+2 n +1 n +1
(a) Cr (b) C r +1 (c) Cr (d) C r +1

137. 5
C1 + 5 C 2 + 5 C3 + 5 C4 + 5 C5 is equal to [Rajasthan PET 1989]

(a) 30 (b) 31 (c) 32 (d) 33

138. If C (n, 12 ) = C (n, 8 ) , then the value of C(22 , n) is [Rajasthan PET 1993]

(a) 924 (b) 308 (c) 462 (d) 231

139. If 20
Cr = Cr −10 , then
20 18
Cr is equal to [Rajasthan PET 1988]

(a) 816 (b) 1632 (c) 4896 (d) None of these

n n n
140. If C4 , C5 , C6 are in A.P. then the value of n is [AMU 1989]

(a) 14 or 7 (b) 11 (c) 17 (d) 8

141. There are 12 volleyball players in all in a college, out of which a team of 9 players is to be formed. If the captain always
remains the same, then in how many ways can the team be formed
(a) 36 (b) 108 (c) 99 (d) 165
142. There are 16 vacancies for clerks in a certain office, 20 applications are received. In how many ways can the clerks be
appointed
(a) 3800 (b) 3876 (c) 969 (d) 4845
143. In how many ways a committee of 5 members can be formed out of 8 gentlemen and 4 ladies, if one particular lady is always to be
taken
(a) 140 (b) 330 (c) 560 (d) None of these
144. How many words can be formed by taking 3 consonants and 2 vowels out of 5 consonants and 4 vowels
5
C3 × 4 C 2
(a) 5
C 3 × 4 C2 (b) (c) 5
C 3 ×4 C 3 (d) (5 C3 × 4 C 2 )(5 )!
5
145. A male and a female typist are needed in an institution. If 10 ladies and 15 gentlemen apply, then in how many ways can the
selection be made
(a) 125 (b) 145 (c) 150 (d) None of these
146. Everybody in a room shakes hand with everybody else. The total number of hand shakes is 66. The total number of persons
in the room is [MNR 1991; Kurukshetra CEE 1998; Kerala (Engg.) 2001]
(a) 11 (b) 12 (c) 13 (d) 14
147. There are 9 chairs in a room on which 6 persons are to be seated, out of which one is guest with one specific chair. In how
many ways they can sit [MP PET 1987]
(a) 6720 (b) 60480 (c) 30 (d) 346
148. On the occasion of Deepawali festival each student of a class sends greeting cards to the others. If there are 20 students in
the class, then the total number of greeting cards exchanged by the students is
 20
(a) C2 (b) 2 . 20 C 2 (c) 2 . 20 P2 (d) None of these
149. A father with 8 children takes them 3 at a time to the Zoological gardens, as often as he can without taking the same 3
children together more than once. The number of times he will go to the garden is
(a) 336 (b) 112 (c) 56 (d) None of these
150. In how many ways can 5 red and 4 white balls be drawn from a bag containing 10 red and 8 white balls
[EAMCET 1991; Pb. CET 2000]
(a) 8
C 5 × C4 10
(b) 10
C5 × C4 8
(c) 18
C9 (d) None of these
151. There are 15 persons in a party and each person shake hand with another, then total number of hand shakes is [Rajasthan PET 2002]
15 15
(a) P2 (b) C2 (c) 15 ! (d) 2 (15 !)
152. A fruit basket contains 4 oranges, 5 apples and 6 mangoes. The number of ways person make selection of fruits from among
the fruits in the basket is [Bihar JEE 1983]
(a) 210 (b) 209 (c) 208 (d) None of these
153. In a cricket championship there are 36 matches. The number of teams if each plays one match with other are [Karnataka CET 1997]
(a) 8 (b) 9 (c) 10 (d) None of these

Advance Level

154. If 2n
C 3 : n C 2 = 44 : 3 , then for which of the following values of r, the values of n Cr will be 15 [MP PET 1981]

(a) r=3 (b) r = 4 (c) r=6 (d) r = 5

n −1
155. n
Cr + Cr + ...... + Cr =
r
[AMU 2002]
n +1 n +1 n +2
(a) Cr (b) Cr + 1 (c) Cr (d) 2 n

156. The solution set of 10

C x −1 > 2 . 10
C x is
(a) {1, 2, 3} (b) {4, 5, 6} (c) {8, 9, 10} (d) {9, 10, 11}
m
157. ∑
r =0
n+r
Cn =

n + m +1 n +m + 2 n +m + 3
(a) Cn + 1 (b) Cn (c) Cn −1 (d) None of these

158. If α = m C 2 , then α C 2 is equal to

m +1 m −1
(a) C4 (b) C4 (c) 3 m + 2C4 (d) 3 m +1C 4
4
159. 14
C4 + ∑j =1
18 − j
C3 is equal to

18 18 14
(a) C3 (b) C4 (c) C7 (d) None of these
n n

∑ ∑
1 r
160. If an = n
then n
equals [IIT 1998]
r =0
Cr r =0
Cr

1
(a) (n − 1)an (b) na n (c) na n (d) None of these
2
161. In a football championship, there were played 153 matches. Every team played one match with each other. The number of
teams participating in the championship is [West Bengal JEE 1992; Kurukshetra CEE 1998]
(a) 17 (b) 18 (c) 9 (d) 13
162. Ten persons, amongst whom are A, B and C to speak at a function. The number of ways in which it can be done if A wants to
speak before B and B wants to speak before C is
10 ! 10
(a) (b) 3 ! 7 ! (c) P3 . 7! (d) None of these
6
163. The number of times the digit 5 will be written when listing the integers from 1 to 1000 is
(a) 271 (b) 272 (c) 300 (d) None of these
164. All possible two factors products are formed from numbers 1, 2, 3, 4....., 200. The number of factors out of the total obtained
which are multiples of 5 is
(a) 5040 (b) 7180 (c) 8150 (d) None of these
165. A car will hold 2 in the front seat and 1 in the rear seat. If among 6 persons 2 can drive, then the number of ways in which the
car can be filled is
(a) 10 (b) 20 (c) 30 (d) None of these
n +1
166. The expression C2 + 2( C 2 + C 2 + ..... + C 2 ) can be reduced to
2 3 n

n(n + 1) n (n − 1) n (n + 1)(2 n + 1) n (2 n + 1)
(a) (b) (c) (d)
2 2 6 3
167. The value of (7 C0 +7 C1 ) + (7 C1 + 7 C 2 ) + ...... + (7 C6 + 7 C7 ) is [AMU 1990, 92]

(a) 27 − 1 (b) 2 8 − 2 (c) 28 − 1 (d) 2 8

168. The expression n Cr + 4 .n Cr −1 + 6 .n Cr − 2 + 4 .n Cr − 3 + n Cr − 4 equals [AMU 1993, 91]
n+4
(a) Cr (b) 2 .n + 4 Cr −1 (c) 4 .n Cr (d) 11 .n Cr

Number of Combinations with Repetition and All possible Selections

Basic Level

169. Ramesh has 6 friends. In how many ways can he invite one or more of them at a dinner [Rajasthan PET 1994]
(a) 61 (b) 62 (c) 63 (d) 64
170. Out of 10 white, 9 black and 7 red balls, the number of ways in which selection of one or more balls can be made, is
(a) 881 (b) 891 (c) 879 (d) 892
171. Out of 6 books, in how many ways can a set of one or more books be chosen [MP PET 1984]
(a) 64 (b) 63 (c) 62 (d) 65
172. In an examination there are three multiple choice questions and each question has 4 choices. Number of ways in which a
student can fail to get all answers correct, is [Pb. CET 1990; UPSEAT
2001]
(a) 11 (b) 12 (c) 27 (d) 63
173. The total number of different combinations of one or more letters which can be made from the letters of the word
‘MISSISSIPPI’ is
(a) 150 (b) 148 (c) 149 (d) None of these
174. The total number of ways of selecting six coins out of 20 one rupee coins, 10 fifty paise coins and 7 twenty five paise coins is
37
(a) 28 (b) 56 (c) C6 (d) None of these

Advance Level

175. In an election there are 8 candidates, out of which 5 are to be chosen. If a voter may vote for any number of candidates but
not greater then the number to be chosen, then in how many ways can a voter vote
(a) 216 (b) 114 (c) 218 (d) None of these
176. In an election the number of candidates is 1 greater than the persons to be elected. If a voter can vote in 254 ways, then the
number of candidates is
(a) 7 (b) 10 (c) 8 (d) 6
177. The number of ways of dividing 52 cards amongst four players so that three players have 17 cards each and the fourth player
just one card, is [IIT 1979]
 52 ! 52 !
(a) (b) 52 ! (c) (d) None of these
(17 !)3 17 !
178. 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
(a) 2 32 (b) (32 )2 − 1 (c) 2 32 − 1 (d) 2 32 −1
179. The number of ways in which four letters of the word ‘MATHEMATICS’ can be arranged is given by
[Kurukshetra CEE 1996; Pb. CET 1995]
(a) 136 (b) 192 (c) 1680 (d) 2454
180. A person is permitted to select at least one and at most n coins from a collection of 2 n + 1 (distinct) coins. If the total number
of ways in which he can select coins is 255, then n equals [AMU 2002]
(a) 4 (b) 8 (c) 16 (d) 32
181. The total number of ways of selecting five letters from the letters of the word ‘INDEPENDENT‘ is
(a) 70 (b) 3320 (c) 120 (d) None of these
182. There are n different books and p copies of each in a library. The number of ways in which one or more books can be selected
is
(a) pn + 1 (b) ( p + 1)n − 1 (c) ( p + 1)n − p (d) pn

Conditional Combinations, Derangement, Division into groups

Basic Level

183. In how many ways can 21 English and 19 Hindi books be placed in a row so that no two Hindi books are together
(a) 1540 (b) 1450 (c) 1504 (d) 1405
184. The number of ways in which five identical balls can be distributed among ten identical boxes such that no box contains
more than one ball, is [IIT 1973]
10 ! 10 !
(a) 10 ! (b) (c) (d) None of these
5! (5 !)2
185. In how many ways can two balls of the same colour be selected out of 4 black and 3 white balls
(a) 5 (b) 6 (c) 9 (d) 8
186. Ten persons are arranged in a row. The number of ways of selecting four persons so that no two persons sitting next to each
other are selected is
(a) 34 (b) 36 (c) 35 (d) None of these
187. In a touring cricket team there are 16 players in all including 5 bowlers and 2 wicket-keepers. How many teams of 11 players
from these, can be chosen, so as to include three bowlers and one wicket-keeper [MP PET 1984]
(a) 650 (b) 720 (c) 750 (d) 800
188. A total number of words which can be formed out of the letters a, b, c, d, e, f taken 3 together such that each word contains at
least one vowel, is
(a) 72 (b) 48 (c) 96 (d) None of these
189. Out of 6 boys and 4 girls, a group of 7 is to be formed. In how many ways can this be done if the group is to have a majority
of boys
[MP PET 1994]
(a) 120 (b) 90 (c) 100 (d) 80
190. Let A be a set containing 10 distinct elements. Then the total number of distinct functions from A to A, is
(a) 10 ! (b) 10 10 (c) 210 (d) 210 − 1
191. A lady gives a dinner party for six guests. The number of ways in which they may be selected from among ten friends, if two
of the friends will not attend the party together is [DCE 2001]
(a) 112 (b) 140 (c) 164 (d) None of these
192. The number of ways in which mn students can be distributed equally among n sections is
 (mn )! mn mn
(a) (mn )n (b) (c) (d)
(m !)n m! m !n!
193. There are 3 candidates for a post and one is to be selected by the votes of 7 men. The number of ways in which votes can be
given is
(a) 7 3 (b) 3 7 (c) 7
C3 (d) None of these
194. In how many ways can 10 balls be divided between two boys, one receiving two and the other eight balls
(a) 45 (b) 75 (c) 90 (d) None of these
195. The number of ways in which thirty five apples can be distributed among 3 boys so that each can have any number of apples,
is
(a) 1332 (b) 666 (c) 333 (d) None of these
196. The number of ways in which six different prizes can be distributed among three children each receiving at least one prize is
[JMIEEE 1997]
(a) 270 (b) 540 (c) 1080 (d) 2160

Advance Level

197. In how many ways can Rs. 16 be divided into 4 person when none of them get less than Rs. 3
(a) 70 (b) 35 (c) 64 (d) 192
198. Two packs of 52 cards are shuffled together. The number of ways in which a man can be dealt 26 cards so that he does not
get two cards of the same suit and same denomination is
52
(a) C 26 . 2 26 (b) 104
C 26 (c) 2 .52 C26 (d) None of these
199. Choose the correct number of ways in which 15 different books can be divided into five heaps of equal number of books
[MP PET 1982]
15 ! 15 ! 15 15
(a) (b) (c) C5 (d) P5
5 !(3 !)5 (3 !)5
200. There were two women participating in a chess tournament. Every participant played two games with the other participants.
The number of games that the men played between themselves proved to exceed by 66 the number of games that the men
played with the women. The number of participants is
(a) 6 (b) 11 (c) 13 (d) None of these
201. Five balls of different colours are to be placed in three boxes of different sizes. Each box can hold all five balls. In how many
ways can we place the balls so that no box remains empty [IIT 1981]
(a) 50 (b) 100 (c) 150 (d) 200
202. A box contains two white balls, three black balls and four red balls. In how many ways can three balls be drawn from the box
if at least one black ball is to be included in the draw [IIT 1986; DCE 1994]
(a) 64 (b) 45 (c) 46 (d) None of these
203. In how many ways can a committee be formed of 5 members from 6 men and 4 women if the committee has at least one
women
[Rajasthan PET 1987; IIT 1968]
(a) 186 (b) 246 (c) 252 (d) None of these
204. Six ‘+’ and four ‘–’ signs are to placed in a straight line so that no two ‘–’ signs come together, then the total number of ways
are
[IIT 1988]
(a) 15 (b) 18 (c) 35 (d) 42
205. The number of groups that can be made from 5 different green balls, 4 different blue balls and 3 different red balls, if at least
1 green and 1 blue ball is to be included
(a) 3700 (b) 3720 (c) 4340 (d) None of these
206. In an election there are 5 candidates and three vacancies. A voter can vote maximum to three candidates, then in how many
ways can he vote [MP PET 1987]
(a) 125 (b) 60 (c) 10 (d) 25
207. A committee of 12 is to be formed from 9 women and 8 men in which at least 5 women have to be included in a committee.
Then the number of committees in which the women are in majority and men are in majority are respectively
(a) 4784, 1008 (b) 2702, 3360 (c) 6062, 2702 (d) 2702, 1008
208. The number of ways in which 10 persons can go in two boats so that there may be 5 on each boat, supposing that two
particular persons will not go in the same boat is [Pb. CET 1999]
1 10 1 8
(a) ( C5 ) (b) 2(8 C4 ) (c) ( C5 ) (d) None of these
2 2
209. 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
8 7 7 7
(a) P5 (b) P5 (c) C3 (4 !) (d) C3 (5 !)
210. The number of ways in which we can select three numbers from 1 to 30 so as to exclude every selection of all even numbers
is
(a) 4060 (b) 3605 (c) 455 (d) None of these
211. In a steamer there are stalls for 12 animals and there are horses, cows and calves (not less than 12 each) ready to be shipped.
They can be loaded in
(a) 312 − 1 (b) 3 12 (c) (12 )3 − 1 (d) None of these
212. There are (n + 1) white and (n + 1) black balls each set numbered 1 to n + 1 . The number of ways in which the balls can be
arranged in a row so that the adjacent balls are of different colours is
(a) (2n + 2)! (b) (2n + 2)! × 2 (c) (n + 1) ! × 2 (d) 2{(n + 1)!}2
213. Sixteen men compete with one another in running, swimming and riding. How many prize lists could be made if there were
altogether 6 prizes of different values one for running, 2 for swimming and 3 for riding
(a) 16 3 × 15 × 14 2 (b) 16 3 × 15 2 × 14 (c) 16 × 15 × 14 (d) None of these
214. The number of ways in which a committee of 6 members can be formed from 8 gentlemen and 4 ladies so that the committee
contains at least 3 ladies is [Kerala (Engg.) 2002]
(a) 252 (b) 672 (c) 444 (d) 420
215. 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 [AIEEE 2003]
(a) 140 (b) 196 (c) 280 (d) 346
216. The number of ways of distributing 8 identical balls in 3 distinct boxes so that none of the boxes is empty is [AIEEE 2004]
8
(a) C3 (b) 21 (c) 38 (d) 5
217. In the next World Cup of cricket there will be 12 teams, divided equally in two groups. Teams of each group will play a match
against each other. From each group 3 top teams will qualify for the next round. In this round each team will play against
others once. Four top teams of this round will qualify for the semifinal round, where each team will play against the others
once. Two top teams of this round will go to the final round, where they will play the best of three matches. The minimum
number of matches in the next World Cup will be
(a) 54 (b) 53 (c) 38 (d) None of these
218. ˆ ˆ ˆ ˆ ˆ
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
(a) 12
C9 − 1 (b) 12
C3 (c) 12
C9 (d) None of these
219. A man has 7 relatives, 4 women and 3 men. His wife also has 7 relatives, 3 women and 4 men. In how many ways can they
invite 3 women and 3 men so that 3 of them are the man’s relatives and 3 his wife's [IIT 1985]
(a) 485 (b) 484
(c) 468 (d) None of these
220. A person wishes to make up as many different parties as he can out of his 20 friends such that each party consists of the
same number of persons. The number of friends he should invite at a time is
(a) 5 (b) 10 (c) 8 (d) None of these

Geometrical Problems

Basic Level

221. The number of triangles that can be formed by 5 points in a line and 3 points on a parallel line is
(a) 8
C3 (b) 8
C 3 −5 C 3 (c) 8
C 3 −5 C 3 − 1 (d) None of these
222. The maximum number of points of intersection of 20 straight lines will be
(a) 190 (b) 220 (c) 200 (d) None of these
223. If a polygon has 44 diagonals, then the number of its sides are [MP PET 1998; Pb. CET 1996]
(a) 7 (b) 11 (c) 8 (d) None of these
224. How many triangles can be drawn by means of 9 non-collinear points
(a) 84 (b) 72 (c) 144 (d) 126
225. The number of diagonals in a polygon of m sides is [BIT Ranchi 1992; MP PET 1999; UPSEAT 1999; DCE 1999]
1 1 1 1
(a) m (m − 5 ) (b) m (m − 1) (c) m (m − 3) (d) m (m − 2)
2! 2! 2! 2!
226. In a plane there are 10 points out of which 4 are collinear, then the number of triangles that can be formed by joining these
points are
[Rajasthan PET 1990]
(a) 60 (b) 116 (c) 120 (d) None of these
227. There are 16 points in a plane out of which 6 are collinear, then how many lines can be drawn by joining these points
[Rajasthan PET 1986; MP PET 1987]
(a) 106 (b) 105 (c) 60 (d) 55
228. The number of parallelograms that can be formed from a set of four parallel lines intersecting another set of three parallel
lines is
[West Bengal JEE 1993; Rajasthan PET 2001]
(a) 6 (b) 18 (c) 12 (d) 9
229. The greatest possible number of points of intersection of 8 straight lines and 4 circles is
(a) 32 (b) 64 (c) 76 (d) 104
230. 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 [Kurukshetra CEE 1996, 98]
(a) 504 (b) 552 (c) 560 (d) 1120
231. 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 [IIT Screening 2001]
(a) 5 (b) 7 (c) 6 (d) 4
232. Out of 10 points in a plane 6 are in a straight line. The number of triangles formed by joining these points are [Rajasthan PET 2000]
(a) 100 (b) 150 (c) 120 (d) None of these
233. The number of straight lines that can be formed by joining 20 points no three of which are in the same straight line except 4
of them which are in the same line
(a) 183 (b) 186 (c) 197 (d) 185
234. There are n distinct points on the circumference of a circle. The number of pentagons that can be formed with these points as
vertices is equal to the number of possible triangles. Then the value of n is
(a) 7 (b) 8 (c) 15 (d) 30
235. Given six line segments of lengths 2, 3, 4, 5, 6, 7 units, the number of triangle that can be formed by these lines is [AMU 2002]
(a) 6
C3 − 7 (b) 6
C3 − 6 (c) 6
C3 − 5 (d) 6
C3 − 4
236. A polygon has 35 diagonals, then the number of its sides is [AMU 2002]
(a) 8 (b) 9 (c) 10 (d) 11
237. If 5 parallel straight lines are intersected by 4 parallel straight lines, then the number of parallelograms thus formed is
[Kurukshetra CEE 1999]
(a) 20 (b) 60 (c) 101 (d) 126
238. The maximum number of points of intersection of 8 circles, is
(a) 16 (b) 24 (c) 28 (d) 56
239. There are 10 points in a plane of which no three points are collinear and 4 points are concyclic. The number of different
circles that can be drawn through at least 3 points of these points is
(a) 116 (b) 120 (c) 117 (d) None of these

Advance Level
240. The sides AB, BC, CA of a triangle ABC have respectively 3, 4 and 5 points lying on them. The number of triangles that can
be constructed using these points as vertices is [IIT 1984]
(a) 205 (b) 220 (c) 210 (d) None of these
241. Six ‘×’s have to be placed in the square of the figure such that each row contains at least one ×. In how many different ways
can this be done [IIT 1978, 89]

(a) 28 (b) 27 (c) 26 (d) None of these

242. The straight lines I1 , I 2 , I3 are parallel and lie in the same plane. A total number of m points are taken on I1 , n points on I 2 , k
points on I 3 . The maximum number of triangles formed with vertices at these points are [IIT 1993; UPSEAT 2001]
m +n+k m +n+k
(a) C3 (b) C3 − C3 − C3 − C3
m n k
(c) m
C3 + C3 + C3
n k
(d) None of these
243. Six points in a plane be joined in all possible ways by indefinite straight lines, and if no two of them be coincident or parallel,
and no three pass through the same point (with the exception of the original 6 points). The number of distinct points of
intersection is equal to
(a) 105 (b) 45 (c) 51 (d) None of these
244. There are m points on a straight line AB and n points on another line AC, none of them being the point A. Triangles are
formed from these points as vertices when (i) A is excluded (ii) A is included. Then the ratio of the number of triangles in
these two cases is
m +n−2 m +n−2 m +n−2
(a) (b) (c) (d) None of these
m +n 2 m +n+2
245. There are n straight lines in a plane, no two of which are parallel and no three pass through the same point. Their points of
intersection are joined. Then the number of fresh lines thus obtained is
n(n − 1)(n − 2) n (n − 1)(n − 2)(n − 3 ) n(n − 1)(n − 2)(n − 3 )
(a) (b) (c) (d) None of these
8 6 8
246. A parallelogram is cut by two sets of m lines parallel to its sides. The number of parallelograms thus formed is [Karnataka CET 1992]
(a) (m C 2 )2 (b) (m +1 C 2 )2 (c) (m + 2 C 2 )2 (d) None of these
247. In a plane there are 37 straight lines of which 13 pass through the point A and 11 pass through the point B. Besides no three
lines pass through one point, no line passes through both points A and B and no two are parallel. Then the number of
intersection points the lines have is equal to
(a) 535 (b) 601 (c) 728 (d) None of these
248. There are n points in a plane of which p points are collinear. How many lines can be formed from these points[Karnataka CET 2002]
(a) (n− p )
C2 (b) n
C2 − pC2 (c) n
C2 − pC2 + 1 (d) n
C2 − pC2 − 1
249. ABCD is a convex quadrilateral. 3, 4, 5 and 6 points are marked on the sides AB, BC, CD and DA respectively. The number of
triangles with vertices on different sides is
(a) 270 (b) 220 (c) 282 (d) 342
250. The number of triangles that can be formed joining the angular points of decagon, is
(a) 30 (b) 45 (c) 90 (d) 120
251. The number of triangles whose vertices are at the vertices of an octagon but none of whose sides happen to come from the
sides of the octagon is
(a) 24 (b) 52 (c) 48 (d) 16
252. In a polygon no three diagonals are concurrent. If the total number of points of intersection of diagonals interior to the
polygon be 70, then the number of diagonals of the polygon is
(a) 20 (b) 28 (c) 8 (d) None of these
253. There are n(> 2) points in each of two parallel lines. Every point on one line is joined to every point on the other line by a line
segment drawn within the lines. The number of points (between the lines) in which these segments intersect is
(a) 2n
C 2 − 2 .n C1 + 2 (b) 2n
C 2 − 2 .n C2 (c) n
C 2 × nC 2 (d) None of these
254. m parallel lines in a plane are intersected by a family of n parallel lines. The total number of parallelograms so formed is
 (m − 1)(n − 1) mn m (m − 1) n(n − 1) mn (m − 1)(n − 1)
(a) (b) (c) (d)
4 4 2 4
255. There are three coplanar parallel lines. If any p points are taken on each of the lines, the maximum number of triangles with
vertices at these points
(a) 3 p 2 ( p − 1) + 1 (b) 3 p 2 ( p − 1) (c) p 2 (4 p − 3) (d) None of these

Multinomial Theorem, Number of Divisors and Miscellaneous problems

Basic Level

n
256. If Pr = 720. n C r , then r is equal to [Kerala (Engg.) 2001]

(a) 6 (b) 5 (c) 4 (d) 7

257. If P4 = 24 . C 5 , then the value of n is
n n
[Karnataka CET 2001]

(a) 10 (b) 15 (c) 9 (d) 5

258. If P3 + Cn − 2 = 14 n , then n =
n n

(a) 5 (b) 6 (c) 8 (d) 10

259. If n P4 = 30 n C5 , then n = [MP PET 1995]

(a) 6 (b) 7 (c) 8 (d) 9

260. If n Pr = 840 , n Cr = 35 , then n is equal to [EAMCET 1986]

(a) 1 (b) 3 (c) 5 (d) 7

261. If Cr = Cr −1 and Pr = Pr + 1 , then the value of n is
n n n n

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

262. n
Pr ÷ C r =
n
[MP PET 1984]
1
(a) n ! (b) (n − r)! (c) (d) r !
r!
2 2
263. If a, b, c, d, e are prime integers, then the number of divisors of ab c de excluding 1 as a factor, is
(a) 94 (b) 72 (c) 36 (d) 71
264. The number of proper divisors of 1800 which are also divisible by 10, is
(a) 18 (b) 34 (c) 27 (d) None of these
p m n
265. The number of odd proper divisors of 3 . 6 . 21 is
(a) ( p + 1) (m + 1) (n + 1) − 2 (b) ( p + m + n + 1) (n + 1) − 1 (c) ( p + 1)(m + 1)(n + 1) − 1 (d) None of these

266. The number of proper divisors of 2 p . 6 q . 15 r is

(a) ( p + q + 1)(q + r + 1) (r + 1) (b) ( p + q + 1)(q + r + 1)(r + 1) − 2
(c) ( p + q)(q + r) r − 2 (d) None of these
267. The number of even proper divisors of 1008 is
(a) 23 (b) 24 (c) 22 (d) None of these

Advance Level

268. The number of numbers of 4 digits which are not divisible by 5 are
(a) 7200 (b) 3600 (c) 14400 (d) 1800
269. 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

270. 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
 21 30 21
(a) C7 (b) C16 (c) C16 (d) None of these
271. In a certain test ai students gave wrong answers to at least i questions where i = 1, 2 3, ..... k . No student gave more than k
wrong answers. The total numbers of wrong answers given is [IIT 1982]
(a) a1 + 2a 2 + 3 a3 + ..... + ka k (b) a1 + a 2 + a3 + ..... + ak
(c) Zero (d) None of these
272. Number of ways of selection of 8 letters from 24 letters of which 8 are a, 8 are b and the rest unlike is given by
(a) 27 (b) 8 .2 8 (c) 10 .2 7 (d) None of these
273. The number of ordered triplets of positive integers which are solutions of the equation x + y + z = 100 is
(a) 6005 (b) 4851 (c) 5081 (d) None of these
274. A person goes in for an examination in which there are four papers with a maximum of m marks from each paper. The
number of ways in which one can get 2m marks is
2m + 3 1 1
(a) C3 (b) (m + 1)(2m 2 + 4 m + 1) (c) (m + 1)(2m 2 + 4 m + 3) (d) None of these
3 3

 10   20   
m
p
275. The sum ∑  i   m − i  ,  where  q  = 0 if p < q  , is maximum when m is
i=0
[IIT Screening 2002]

(a) 5 (b) 15 (c) 10 (d) 20

276. The number of divisors of the form 4 n + 2 (n ≥ 0 ) of the integer 240 is
(a) 4 (b) 8 (c) 10 (d) 3

ANSWERS

Permutations and Combinations

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

c c d a b d a d d a a d d d a b c a a a

21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

b a c b c c a a a b b c b a c b a c c d

41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60

c d d b b b a c a a c a a b c c b a b b

61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80

c b a a c c a b b d c b a c a b b c d b

81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100

c a a c c b d b a a c a c c d b d a d c

101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120

b c c a d b b d a b a a a c b b a c b b

121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140

c d a b d a d b a c d c d a a b b d a a

141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160

d d b d c b a b c b b b b b b c a d b c
161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180

b a c b b c b a c c b d c a c c a c d a

181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200

a b a c c c b c c b b b b c b b b a a c

201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220

c a b c b d d b d b b d b a b b b b,c a b

221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240

c a b a c b a b d a b a d b b c b d c a

241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260

c b c a c c a c d d d a c d c a c a c d

261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276

a d d a b b a a d a b c b c b a