7

PERMUTATIONS AND
COMBINATIONS
12. Number of words each containing 3 consonants and 2 vowels
CONCEPT TYPE QUESTIONS
that can be formed out of 5 consonants and 4 vowels is
Directions : This section contains multiple choice questions. Each (a) 3600 (b) 7200 (c) 6728 (d) 2703
question has four choices (a), (b), (c) and (d), out of which only 13. Every body in a room shakes hands with every body else. If
one is correct. total number of hand-shaken is 66, then the number of
1. If 56Pr + 6 : 54Pr + 3 = 30800 : 1, then the value of r is persons in the room is
(a) 41 (b) 14 (c) 10 (d) 51 (a) 11 (b) 10 (c) 12 (d) 19
2. If n + 2C8 : n – 2P4 = 57 : 16, then the value of n is: 14. Number of different seven digit numbers that can be written
(a) 20 (b) 19 (c) 18 (d) 17 using only the three digits 1, 2 and 3 with the condition that
3. If 30Cr + 2 = 30Cr – 2, then r equals: the digit 2 occurs twice in each number is
(a) 8 (b) 15 (c) 30 (d) 32 (a) 652 (b) 650 (c) 651 (d) 640
4 . The sum of the digits in the unit place of all the numbers 15. Total number of eight digit numbers in which all digits are
formed with the help of 3, 4, 5, 6 taken all at a time is different is
(a) 432 (b) 108 (c) 36 (d) 18 8.7! 5.8! 8.9! 9.9!
(a) (b) (c) (d)
5. In an examination, there are three multiple choice questions 3 3 2 2
and each question has 4 choices. Number of ways in which 16. Number of words from the letters of the words BHARAT in
a student can fail to get all answers correct is : which B and H will never come together is
(a) 11 (b) 12 (c) 27 (d) 63 (a) 210 (b) 240 (c) 422 (d) 400
6. How many arrangements can be made out of the letters of 17. Four couples (husband and wife) decide to form a committee
the word “ MOTHER” taken four at a time so that each of four members, then the number of different committees
arrangement contains the letter ´M´? that can be formed in which no couple finds a place is
(a) 240 (b) 120 (c) 60 (d) 360 (a) 15 (b) 16 (c) 20 (d) 21
7. In how many ways can a bowler take four wickets in a single 18. Number of different ways in which 8 persons can stand in a
6-ball over ? row so that between two particular person A and B there are
(a) 6 (b) 15 (c) 20 (d) 30 always two person is
8. There are four chairs with two chairs in each row. In how (a) 11 (b) 13 (c) 15 (d) 16
many ways can four persons be seated on the chairs, so 19. Total number of four digit odd numbers that can be formed
that no chair remains unoccupied ? using 0, 1, 2, 3, 5, 7 (using repetition allowed) are
(a) 6 (b) 12 (c) 24 (d) 48 (a) 216 (b) 375 (c) 400 (d) 720
9. If a secretary and a joint secretary are to be selected from a 20. If the letters of the word SACHIN are arranged in all possible
committee of 11 members, then in how many ways can they ways and these words are written out as in dictionary, then
be selected ? the word SACHIN appears at serial number
(a) 110 (b) 55 (c) 22 (d) 11 (a) 601 (b) 600 (c) 603 (d) 602
10. A bag contains 3 black, 4 white and 2 red balls, all the balls 21. How many different words can be formed by jumbling the
being different. Number of selections of atmost 6 balls letters in the word MISSISSIPPI in which no two S are
containing balls of all the colours is adjacent?
(a) 1008 (b) 1080 (c) 1204 (d) 1130 (a) 8. 6C4. 7C4 (b) 6.7. 8C4
11. Number of ways in which 20 different pearls of two colours (c) 6. 8. 7C4. (d) 7. 6C4. 8C4
can be set alternately on a necklace, there being 10 pearls of
22. How many different nine digit numbers can be formed from
each colour.
the number 223355888 by rearranging its digits so that the
(a) 6 × (9!)2 (b) 12!
odd digits occupy even positions ?
(c) 4 × (8!)2 (d) 5 × (9!)2
(a) 16 (b) 36 (c) 60 (d) 180
 118 PERMUTATIONS AND COMBINATIONS
23. The number of ways in which four letters of the word 32. The number of ways in which 3 prizes can be distributed
MATHEMATICS can be arranged is given by to 4 children, so that no child gets all the three prizes, are
(a) 136 (b) 192 (c) 1680 (d) 2454 (a) 64 (b) 62 (c) 60 (d) None of these
24. In how many ways can this diagram be coloured subject 33. If the letters of the word RACHIT are arranged in all
to the following two conditions? possible ways as listed in dictionary. Then, what is the
(i) Each of the smaller triangle is to be painted with one rank of the word RACHIT?
of three colours: red, blue or green. (a) 479 (b) 480 (c) 481 (d) 482
(ii) No two adjacent regions have the same colour. 34. The number of chords that can be drawn through 21
points on a circle, is
(a) 200 (b) 190 (c) 210 (d) None of these
35. The number of ways a student can choose a programme
out of 5 courses, if 9 courses are available and 2 specific
courses are compulsory for every student is
(a) 20 (b) 24 (c) 28 (d) 30 (a) 35 (b) 40 (c) 24 (d) 120
25. There are four bus routes between A and B; and three bus 36. The number of ways in which we can choose a committee
routes between B and C. A man can travel round-trip in
from four men and six women so that the committee
number of ways by bus from A to C via B. If he does not
include at least two men and exactly twice as many
want to use a bus route more than once, in how many
women as men is
ways can he make round trip?
(a) 94 (b) 126 (c) 128 (d) None of these
(a) 72 (b) 144 (c) 14 (d) 19
26. In how many ways 3 mathematics books, 4 history books, 37. A father with 8 children takes them 3 at a time to the
3 chemistry books and 2 biology books can be arranged on zoological garden, as often as he can without taking the
a shelf so that all books of the same subjects are together? same 3 children together more than once. The number of
(a) 41472 (b) 41470 (c) 41400 (d) 41274 times he will go to the garden is
27. The number of ways of distributing 50 identical things (a) 56 (b) 100 (c) 112 (d) None of these
among 8 persons in such a way that three of them get 38. 4 buses runs between Bhopal and Gwalior. If a man goes
8 things each, two of them get 7 things each, and from Gwalior to Bhopal by a bus and comes back to
remaining 3 get 4 things each, is equal to Gwalior by another bus, then the total possible ways are
50! 8! (a) 12 (b) 16 (c) 4 (d) 8
(a) 3 2 2 3 39. Six identical coins are arranged in a row. The number of
8! 3! 7! 4! 2!
ways in which the number of tails is equal to the number
50! 8!
(b) of heads is
3 3 3
8! 7! 4! (a) 20 (b) 9 (c) 120 (d) 40
50! 40. The figures 4, 5, 6, 7, 8 are written in every possible order.
(c) 3 2 3 The number of numbers greater than 56000 is
8! 7! 4!
(a) 72 (b) 96 (c) 90 (d) 98
8!
(d) 41. There are 5 roads leading to a town from a village.
2
3! 2! The number of different ways in which a villager can go
28. If eleven members of a committee sit at a round table so to the town and return back, is
that the President and Secretary always sit together, then (a) 25 (b) 20 (c) 10 (d) 5
the number of arrangements is 42. The number of numbers that can be formed with the help
(a) 10! × 2 (b) 10! (c) 9! × 2 (d) 11! × 2! of the digits 1, 2, 3, 4, 3, 2, 1 so that odd digits always
29. ABC is a triangle. 4, 5, 6 points are marked on the sides occupy odd places, is
AB, BC, CA, respectively, the number of triangles on (a) 24 (b) 18 (c) 12 (d) 30
different side is 43. In a circus, there are ten cages for accommodating ten
(a) (4 + 5 + 6)! (b) (4 – 1) (5 – 1) (6 – 1) animals. Out of these, four cages are so small that five out
(c) 5! 4! 6! (d) 4 × 5 × 6 of 10 animals cannot enter into them. In how many ways will
30. Total number of words formed by 2 vowels and it be possible to accommodate ten animals in these ten cages?
3 consonants taken from 4 vowels and 5 consonants is (a) 66400 (b) 86400 (c) 96400 (d) None of these
equal to 44. On the occasion of Deepawali festival, each student of a
(a) 60 (b) 120 (c) 7200 (d) 720 class sends greeting cards to the others. If there are
31. The number of parallelograms that can be formed from a 20 students in the class, then the total number of greeting
set of four parallel lines intersecting another set of three cards exchanged by the students is
parallel lines is (a) 20C2 (b) 2 . 20C2
(a) 6 (b) 18 (c) 12 (d) 9 (c) 2 P2. 20 (d) None of these
PERMUTATIONS AND COMBINATIONS 119
45. To fill 12 vacancies, there are 25 candidates of which five (a) Only I is true. (b) Only II is true.
are from scheduled caste. If 3 of the vacancies are (c) Both are true. (d) Both are false.
reserved for scheduled caste candidates while the rest are 52. Consider the following statements.
open to all, then the number of ways in which the I. Value of 15C8 + 15C9 – 15C6 – 15C7 is zero.
selection can be made II. The total number of 9 digit numbers which have all
(a) 5C3 × 22C9 (b) 22C9 – 5C3
22 5 different digits is 9!
(c) C3 + C3 (d) None of these
Choose the correct option.
46. 12 persons are to be arranged to a round table. If two
particular persons among them are not to be side by side, (a) Only I is true (b) Only II is true.
the total number of arrangements is (c) Both are true. (d) Both are false.
(a) 9(10!) (b) 2(10!) (c) 45(8!) (d) 10! 53. Consider the following statements.
I. Three letters can be posted in five letter boxes in 35
STATEMENT TYPE QUESTIONS ways.
II. In the permutations of n things, r taken together, the
Directions : Read the following statements and choose the correct
number of permutations in which m particular things
option from the given below four options.
occur together is n–mPr–m rPm .
47. The number of 3 letters words, with or without meaning
which can be formed out of the letters of the word Choose the correct option.
‘NUMBER’. (a) Only I is false. (b) Only II is false.
Statement I : When repetition of letters is not allowed (c) Both are false. (d) Both are true.
is 120. 54. Consider the following statements.
Statement II : When repetition of letters is allowed is 216. I. If some or all n objects are taken at a time, the number
Choose the correct option. of combinations is 2n – 1.
(a) Only Statement I is correct II. An arrangement in a definite order which can be
(b) Only Statement II is correct made by taking some or all of a number of things
(c) Both I and II are correct is called a permutation.
(d) Both I and II are false Choose the correct option.
48. The number of 4 letter words that can be formed from (a) Only I is true. (b) Only II is true.
letters of the word ‘PART’, when: (c) Both are true. (d) Both are false.
Statement I : Repetition is not allowed is 24. 55. Consider the following statements.
Statement II : Repetition is allowed is 256. I. If there are n different objects, then nCr = nCn–r,
Which of the above statement(s) is/are true? 0 r n.
(a) Only I (b) Only II II. If there are n different objects, then nCr + nCr–1
(c) Both I and II (d) Neither I nor II = n+1Cr, 0 r n
49. Consider the following statements: Choose the correct option.
Statement I : The number of diagonals of n-sided (a) Both are false. (b) Both are true.
polygon is nC2 – n. (c) Only I is true. (d) Only II is true.
Statement II : A polygon has 44 diagonals. The number 56. Consider the following statements.
of its sides are 10. I. If nPr = nPr+1 and nCr = nCr–1, then the values of
Choose the correct option from the choices given below. n and r are 3 and 2 respectively.
(a) Only I is true (b) Only II is true II. From a class of 32 students, 4 are to be chosen for
(c) Both I and II are true (d) Both I and II are false a competition. This can be done in 32C2 ways.
50. A committee of 7 has to be formed from 9 boys and 4 girls. Choose the correct option.
I. In 504 ways, this can be done, when the committee (a) Only I is true. (b) Only II is true.
consists of exactly 3 girls. (c) Both are false. (d) Both are true.
II. In 588 ways, this can be done, when the committee 57. Consider the following statements.
consists of at least 3 girls. I. If n is an even natural number, then the greatest
Choose the correct option. among nC0, nC1 , nC2, …, nCn is nCn/2.
(a) Only I is true. (b) Only II is true. II. If n is an odd natural number, then the greatest
(c) Both are true. (d) Both are false.
n
51. Consider the following statements. Cn
among nC0, nC1, nC2 …, nCn is 1 or n C n 1 .
n n n n 2 2
I. Cr 2 Cr 1 Cr 2 Cr 2
Choose the correct option.
n n
II. Cp Cq p q or p q n (a) Only I is false. (b) Only II is true.
Choose the correct option. (c) Both are true. (d) Both are false.
 120 PERMUTATIONS AND COMBINATIONS
58. Consider the following statements. 62. Column - I Column -II
If n is a natural number and r is non-negative integer such (A) Value of n, if (1) 5
that 0 r n, then (n+2)! = 2550 n!, is
I. nCr + nCr–1 = n+1Cr (B) Value of n, if (2) 121
n n 1 (n+1)! = 12 (n–1)!, is
II. nCr = Cr 1 (C) Value of x, if (3) 2730
r
Choose the correct option. 1 1 x
, is
(a) Only I is true. (b) Only II is true. 9! 10! 11!
(c) Both are true. (d) Both are false. (D) Value of P(15, 3) (4) 49
59. Consider the following statements. is
I. The continued product of first n natural numbers is (E) Value of n, if (5) 3
called the permutation. 2. P(5, 3) = P(n, 4), is
II. L.C.M of 4!, 5! and 6! is 720. Codes
Choose the correct option. A B C D E
(a) Only I is true. (b) Only II is true. (a) 4 5 2 3 1
(c) Both are true. (d) Both are false. (b) 1 3 5 2 4
(c) 4 2 5 3 1
MATCHING TYPE QUESTIONS (d) 1 5 3 2 4
63. Column-I Column-II
Directions : Match the terms given in column-I with the terms
(A) If P(n, 4) = 20 . P(n, 2) (1) 28
given in column-II and choose the correct option from the codes
then the value of n is
given below.
(B) 5Pr = 2 6Pr – 1 (2) 4
60. Column - I Column - II (C) 5Pr = 6Pr – 1 (3) 7
7! 8!
A. equals 1. 28
5! (D) Value of is (4) 3
6! 2!
12!
B. equals 2. 42 Codes
10! 2! A B C D
8! (a) 4 3 2 1
C. equals 3. 66
6! 2! (b) 3 4 1 2
(c) 4 2 3 1
Codes:
(d) 3 4 2 1
A B C 64. Column - I Column - II
(a) 1 2 3 (A) If nC8 = nC2. Find nC2. (1) 5
(b) 1 3 2
(B) Determine n if (2) 91
(c) 3 2 1 2nC : nC = 12 : 1
(d) 2 3 1 3 2
(C) Determine n if (3) 6
61. Using the digits 1, 2, 3, 4, 5, 6, 7, a number of 4 different 2nC : nC = 11 : 1
digits is formed. Find : 3 3
(D) If nC8 = nC6, then (4) 45
Column - I Column - II the value of nC2 is
A. How many numbers are formed? 1. 840 Codes
B. How many numbers are exactly 2. 200 A B C D
divisible by 2? (a) 4 3 1 2
C. How many numbers are exactly 3. 360 (b) 4 1 3 2
divisible by 25? (c) 2 1 3 4
D. How many of these are exactly 4. 40 (d) 2 3 1 4
65. Column - I Column - II
divisible by 4?
(A) If nPr = 720 and (1) 3
Match the questions in column-I with column-II and nC = 120, then the
r
choose the correct option from the codes given below. value of ‘r’ is
Codes: (B) If 2nC3 : nC3 = 11 : 1, (2) 4950
A B C D then the value of ‘n’ is
(a) 1 2 3 4 n 2
(b) 3 1 4 2 (C) If C8 : n 2P4 = 57 : 16, (3) 19
(c) 1 3 4 2 then the value of ‘n’ is
(d) 4 2 3 1 (D) Value of 100C98 is (4) 6
PERMUTATIONS AND COMBINATIONS 121
Codes 76. The number of values of r satisfying the equation
A B C D 39 39 39 39
C3r 1 C C C3r is
(a) 1 4 3 2 r2 r2 1
(b) 1 3 4 2 (a) 1 (b) 2 (c) 3 (d) 4
(c) 2 4 3 1 77. What is the value of nP0?
(d) 2 3 4 1 1
66. How many words (with or without dictionary meaning) (a) 0 (b) 1 (c) (d)
2
can be made from the letters of the word MONDAY,
78. What is the value of nCn?
assuming that no letter is repeated, if
(a) 0 (b) (c) r (d) 1
Column - I Column - II 79. What is the value of nC0?
A. 4 letters are used at a time 1. 720 (a) 0 (b)
B. All letters are used at a time 2. 240 (c) 1 (d) None of these
C. All letters are used but the first 3. 360 80. If nC9 = nC8, what is the value of nC17 ?
is a vowel (a) 1 (b) 0 (c) 3 (d) 17
Match the statements in column-I with column-II and 81. If 10Cx= 10Cx + 4, then the value of x is
choose the correct options from the codes given below. (a) 5 (b) 4 (c) 3 (d) 2
Codes: 82. If the ratio 2nC3 : nC3 is equal to 11 : 1, n equals
A B C (a) 2 (b) 6 (c) 8 (d) 9
(a) 1 2 3 83. The number of combinations of 4 different objects A, B, C,
(b) 3 1 2 D taken 2 at a time is
(c) 2 1 3 (a) 4 (b) 6 (c) 8 (d) 7
(d) 3 2 1 84. If 12Pr = 11P6 + 6. 11P5, then r is equal to:
(a) 6 (b) 5
INTEGER TYPE QUESTIONS (c) 7 (d) None of these
85. (8C1 – 8C2 + 8C3 – 8C4 + 8C5 – 8C6 + 8C7 – 8C8) equals:
Directions : This section contains integer type questions. The
answer to each of the question is a single digit integer, ranging (a) 0 (b) 1 (c) 70 (d) 256
from 0 to 9. Choose the correct option.
67. If nC9 = nC8, what is the value of nC17 ? ASSERTION - REASON TYPE QUESTIONS
(a) 1 (b) 0 (c) 3 (d) 17 Directions : Each of these questions contains two statements,
68. If 10Cx= 10Cx + 4, then the value of x is Assertion and Reason. Each of these questions also has four
(a) 5 (b) 4 (c) 3 (d) 2
alternative choices, only one of which is the correct answer. You
69. Let Tn denote the number of triangles which can be formed
have to select one of the codes (a), (b), (c) and (d) given below.
using the vertices of a regular polygon of n sides. If
Tn + 1 Tn = 21, then n equals` (a) Assertion is correct, reason is correct; reason is a correct
(a) 5 (b) 7 (c) 6 (d) 4 explanation for assertion.
70. Total number of ways of selecting five letters from letters of (b) Assertion is correct, reason is correct; reason is not a
the word INDEPENDENT is correct explanation for assertion
(a) 70 (b) 72 (c) 75 (d) 80 (c) Assertion is correct, reason is incorrect
(d) Assertion is incorrect, reason is correct.
1 1 x
71. If , then the value of x = 2m. The value of m is 86. Assertion : If the letters W, I, F, E are arranged in a row
6! 7! 8! in all possible ways and the words (with or without
(a) 2 (b) 4 (c) 6 (d) 5 meaning) so formed are written as in a dictionary, then the
word WIFE occurs in the 24th position.
n!
72. Value of (n r)! when n = 6, r = 2 is 5 m. The value of m is Reason : The number of ways of arranging four distinct
objects taken all at a time is C(4, 4).
(a) 2 (b) 4 (c) 6 (d) 5 87. Assertion : A number of four different digits is formed
73. Find n if n – 1P3 : nP4= 1 : 9 with the help of the digits 1, 2, 3, 4, 5, 6, 7 in all possible
(a) 2 (b) 6 (c) 8 (d) 9 ways. Then, number of ways which are exactly divisible
by 4 is 200.
74. Determine n if 2nC3 : nC2 = 12 : 1
Reason : A number divisible by 4, if unit place digit is
(a) 5 (b) 3 (c) 4 (d) 1
divisible by 4.
75. Let Tn denote the number of triangles which can be formed 88. Assertion : Product of five consecutive natural numbers
using the vertices of a regular polygon of n sides. is divisible by 4!.
If Tn + 1 Tn = 21, then n equals` Reason : Product of n consecutive natural numbers is
(a) 5 (b) 7 (c) 6 (d) 4 divisible by (n + 1)!
 122 PERMUTATIONS AND COMBINATIONS
89. Assertion : The number of ways of distributing (n 2)! (n 1)!(n 1)!
10 identical balls in 4 distinct boxes such that no box is 99. What is equal to ?
(n 1)!(n 1)!
empty is 9C3.
(a) 1 (b) Always an odd integer
Reason : The number of ways of choosing any (c) A perfect square (d) None of these
3 places, from 9 different places is 9C3. 100. The number of numbers of 9 different non-zero digits such
90. Assertion : A five digit number divisible by 3 is to be formed that all the digits in the first four places are less than the
using the digits 0, 1, 2, 3, 4 and 5 with repetition. The total digit in the middle and all the digits in the last four places
number formed are 216. are greater than the digit in the middle is
Reason : If sum of digits of any number is divisible by 3 then (a) 2 (4 !) (b) (4 !) 2
the number must be divisible by 3. (c) 8 ! (d) None of these
101. Number of 6 digit numbers that can be made with the digits
CRITICALTHINKING TYPE QUESTIONS 1, 2, 3 and 4 and having exactly two pairs of digits is
(a) 978 (b) 1801 (c) 1080 (d) 789
Directions : This section contains multiple choice questions.
102. Number of 5 digit numbers that can be made using the digits
Each question has four choices (a), (b), (c) and (d), out of which 1 and 2 and in which at least one digit is different.
only one is correct. (a) 30 (b) 25 (c) 28 (d) 31
91. nCr + 2 nCr–1 + nCr–2 is equal to: 103. Five balls of different colours are to be placed in three boxes
(a) n+2Cr (b) nCr+1 of different sizes. Each box can hold all five balls, Number or
(c) n–1 Cr+1 (d) None of these ways in which we can place the balls in the boxes (order is
not considered in the box) so that no box remains empty is
92. If nCr denotes the number of combination of n things taken (a) 150 (b) 160 (c) 12 (d) 19
n
104. In an examination, there are three multiple choice questions
r at a time, then the expression C r 1 nC r 1 2 n C r and each question has 4 choices. Number of ways in
equals which a student can fail to get all answers correct is
(a) 11 (b) 12 (c) 27 (d) 63
(a) n 1 (b) n 2
Cr 1 Cr 105. Given 4 flags of different colours, how many different
n 2
signals can be generated, if a signal requires the use of
(c) Cr 1 (d) n 1Cr 2 flags one below the other?
93. Given 12 points in a plane, no three of which are collinear. (a) 12 (b) 13 (c) 14 (d) 15
Then number of line segments can be determined, are: 106. Four writers must write a book containing 17 chapters.
(a) 76 (b) 66 (c) 60 (d) 80 The first and third writer must write 5 chapters each,
94. There are 10 true-false questions in a examination. Then the second writer must write 4 chapters and fourth writer
must write three chapters. The number of ways that can
these questions can be answered in:
be found to divide the book between four writers, is
(a) 100 ways (b) 20 ways
(c) 512 ways (d) 1024 ways 17! 17!
(a) 2
(b)
95. The total number of ways of selecting six coins out of 20 5! 4! 3! 2! 5! 4!3! 2!
one rupee coins, 10 fifty paise coins and 7 twenty five paise 17! 17!
coins is: (c) 2
(d) 2
5! 4!3! 5! 4 3
(a) 37C6 (b) 56 (c) 28 (d) 29
107. A student has to answer 10 questions, choosing at least
96. In a chess tournament where the participants were to play
4 from each of parts A and B. If there are 6 questions in
one game with one another, two players fell ill having played Part A and 7 in Part B, in how many ways can the student
6 games each, without playing among themselves. If the choose 10 questions?
total number of games is 117, then the number of participants (a) 266 (b) 260 (c) 256 (d) 270
at the beginning was : 108. In a small village, there are 87 families, of which
(a) 15 (b) 16 (c) 17 (d) 18 52 families have at most 2 children. In a rural development
97. In how many ways can 10 lion and 6 tigers be arranged in a programme 20 families are to be chosen for assistance,
row so that no two tigers are together? of which at least 18 families must have at most 2 children.
(a) 10! × 11P6 (b) 10! × 10P6 In how many ways can the choice be made?
(c) 6! × P7
10
(d) 6! × 10P6 (a) 52C18 35C2
98. In how many ways can the letters of the word (b) 52
C18 × 35C2 + 52C19 × 35C1 + 52C20
CORPORATION be arranged so that vowels always occupy 52
even places ? (c) C18 + 35C2 + 52C19
52
(a) 120 (b) 2700 (c) 720 (d) 7200 (d) C18 × 35C2 + 35C1 × 52C19
PERMUTATIONS AND COMBINATIONS 123
109. A boy has 3 library tickets and 8 books of his interest in 117. The number of 4-digit numbers that can be formed with
the library. Of these 8, he does not want to borrow the digits 1, 2, 3, 4 and 5 in which at least 2 digits are
Mathematics Part II, unless Mathematics Part I is also identical, is
borrowed. In how many ways can he choose the three (a) 505 (b) 45 – 5!
books to be borrowed? (c) 600 (d) None of these
(a) 40 (b) 45 (c) 42 (d) 41 118. If the letters of the word KRISNA are arranged in all
110. There were two women participants in a chess tournament. possible ways and these words are written out as in a
The number of games the men played between themselves dictionary, then the rank of the word KRISNA is
exceeded by 52 the number of games they played with (a) 324 (b) 341
women. If each player played one game with each other, (c) 359 (d) None of these
the number of men in the tournament, was
119. How many numbers lying between 999 and 10000 can be
(a) 10 (b) 11 (c) 12 (d) 13
formed with the help of the digits 0, 2, 3, 6, 7, 8, when the
111. For a game in which two partners play against two other
digits are not repeated?
partners, six persons are available. If every possible pair
must play with every other possible pair, then the total (a) 100 (b) 200
number of games played is (c) 300 (d) 400
(a) 90 (b) 45 (c) 30 (d) 60 120. Eighteen guests are to be seated, half on each side of a
112. A house master in a vegetarian boarding school takes long table. Four particular guests desire to sit on one
3 children from his house to the nearby dhaba for particular side and three others on the other side of the
non-vegetarian food at a time as often as he can, but he table. The number of ways in which the seating
does not take the same three children more than once. arrangement can be done equals
He finds that he goes to the dhaba (road side hotel) (a) 11C4 (9!)2 (b) 11C6 (9!)2
84 times more than a particular child goes with him. (c) 6P0 × 5P0 (d) None of these
Then the number of children taking non-vegetarian food
121. At an election, a voter may vote for any number of
in his hostel, is
candidates not greater than the number to be elected.
(a) 15 (b) 5 (c) 20 (d) 10
There are 10 candidates and 4 are to be elected. If a voter
113. The number of circles that can be drawn out of 10 points
votes for at least one candidate, then the number of ways
of which 7 are collinear, is
in which he can vote, is
(a) 120 (b) 113
(a) 6210 (b) 385
(c) 85 (d) 86
(c) 1110 (d) 5040
114. Five balls of different colours are to be placed in three
122. A student is to answer 10 out of 13 questions in an
boxes of different sizes. Each box can hold all five balls.
examination such that he must choose at least 4 from the
In how many ways can we place the balls so that no box
first five questions. The number of choices available to
remains empty?
him is
(a) 50 (b) 100
(a) 140 (b) 196
(c) 150 (d) 200
(c) 280 (d) 346
115. The number of ways of dividing 52 cards amongst four
123. Ten persons, amongst whom are A, B and C to speak at
players so that three players have 17 cards each and the
a function. The number of ways in which it can be done
fourth player have just one card, is
if A wants to speak before B and B wants to speak before
52! C is
(a) 3 (b) 52!
17! 10!
52! (a) (b) 3! 7!
6
(c) (d) None of these 10 .
17! (c) P3 7! (d) None of these
116. The number of 3 digit numbers having at least one of their 124. A car will hold 2 in the front seat and 1 in the rear seat.
digit as 5 are If among 6 persons 2 can drive, then the number of ways
(a) 250 (b) 251 in which the car can be filled is
(c) 252 (d) 253 (a) 10 (b) 20
(c) 30 (d) None of these
 124 PERMUTATIONS AND COMBINATIONS

CONCEPT TYPE QUESTIONS 5. (d) Student has 4 choices to answer the question.
Total no. of ways to answer the question
56! 54! = 4 × 4 × 4 = 64 total choices = 4)
1. (a) 30800
(50 – r )! (51 – r )! But out of these there is only one way such that all
30800 answers are correct.
56 ×55
51 r Required number of ways of (student can fail to get
30800 all answers correct = 1 – 64 = 63.
51 – r = 51 – r = 10 41 = r
56 55 6. (a) There are six letters in MOTHER, all different,
2. (b) Given n 2 n 2 i.e. arrangement can be made out of the letters of the
C8 : P4 57 :16
word MOTHER taken four at a time with M present in
n n!
n 2
C8 Cr every arrangement.
57 r!(n r)!
n 2 n! So, rest 3 letters can be arrangement from 5 letters
P4 16 n
and Pr
(n r)! So, total number of ways = 4 × 5P3

(n 2)! (n 2 4)! 57 5! 4 5 4 3 2 = 240

4
8!(n 2 8)! (n 2)! 16 (5 – 3)! 2
7. (b) There are 6 balls in one over and 4 wickets are to be
(n 2)(n 1)n.(n 1) 57
taken. So, 4 balls are to succeed. This can be done in
8.7.6.5.4.3.2.1 16
6C ways.
(n + 2) (n + 1) n (n – 1) = 143640 4
(n2 + n – 2) (n 2 + n) = 143640 Required number of ways = 6 C4
(n2 + n)2 – 2(n2 + n) + 1 = 143640 + 1 6! 6 5
15
(n2 + n – 1)2 = (379)2 4!2! 2
n2 + n – 1 = 379 [ n2 + n – 1 > 0] 8. (c) First chair can be occupied in 4 ways and second chair
2
n + n – 1 – 379 = 0 can be occupied in 3 ways, third chair can be occupied
n2 + n – 380 = 0 in 2 ways and last chair can be occupied in one way
(n + 20) (n – 19) = 0 only. So total number of ways = 4 × 3 × 2 × 1 = 24.
n = – 20, n = 19 9. (b) Selection of 2 members out of 11 has 11C2 number of
n is not negative. ways
n = 19 So, 11C2 = 55
3. (b) Let 30C r + 2 = 30C r – 2 ...(i) 10. (a) The required number of selections
n n = 3C1 × 4C1 × 2C1 (6C3 + 6C2 + 6C0) = 42 × 4! = 1008
We know, If Cr1 Cr2 , then r1 + r2 = n
1
11. (d) Ten pearls of one colour can be arranged in .(10 – 1)!
In above given equation (i), we have 2
ways. The number of arrangements of 10 pearls of the
n = 30, r1 = r + 2, r – 2 = r2
other colour in 10 places between the pearls of the first
r1 + r2 = r + 2 + r – 2 = 2r colour = 10!
and n = 30 1
Required number of ways = × 9! × 10! = 5 (9!)2
2r = 30 r = 15 2
4. (b) The total number of numbers that can be formed with 12. (b) 3 consonants and 2 vowels from 5 consonants and 4
the digits 3, 4, 5, 6 taken all at a time = 4P4 = 4! = 24. vowels can be selected in 5C3 × 4C2 = 60 ways. But
Consider the digits at the unit places in all these total number of words with 3 + 2 = 5 letters = 5! ways = 120
number. Each of the digits 3, 4, 5, 6 occurs in 3! = 6 The required number of words = 60 × 120 = 7200
times in unit's place. So, total of the digits at the unit 13. (c) If number of persons = n.
places Then total number of hand-shaken = nC2 = 66
= (3 + 4 + 5 + 6) 6 = 108. n (n–1) =132
(n + 11) ( n – 12) = 0
[Similary, the sum of the digits in the other places will
n =12 ( n – 11)
also be 108]
PERMUTATIONS AND COMBINATIONS 125
14. (a) Other than 2 numbers, remaining five places are filled 22. (c) X - X - X - X - X. The four digits 3, 3, 5,5 can be
by 1 and 3 and for each place there is two conditions. 4!
No. of ways for five places = 2 × 2 × 2 × 2 × 2 = 2 5 arranged at (-) places in = 6 ways.
2!2!
For 2 numbers, selecting 2 places out of 7 = 7C2 The five digits 2, 2, 8, 8, 8 can be arranged at (X) places
Required no. of ways = 7C2. 25 = 652 5!
15. (d) There are ten digits 0, 1, 2, .........., 9. Permutations of in ways = 10 ways
2!3!
these digits taken eight at a time = 10P8 which includes Total no. of arrangements = 6 10 60 ways
permutations having 0 at the first. When 0 is fixed at 23. (d) Two pairs of identical letters can be arranged in 3C2
the first place, then number of such permutations
4!
= 9P7. ways. Two identical letters and two different
2! 2!
So, required number
10! 9! 9. 9! 4!
= 10P8 – 9P7 = letters can be arranged in 3C1 × 7C2 × ways. All
2 2 2 2!
16. (b) There are 6 letters in the word BHARAT, 2 of them are different letters can be arranged in 8P4 ways
identical. Hence total number of words = 6!/2! = 360 Total no. of arrangements
Number of words in which B and H come together 4! 4! 8!
5!2! = 3C2 2 ! 2 ! + 3C1 × 7C2 × + = 2454.
= = 120 2! 4!
2! 24. (b) These conditions are satisfied exactly when we do as
The required number of words = 360 – 120 = 240 follows: First paint the central triangle in any one of
17. (b) The number of committees of 4 gentlemen = 4C4 = 1 the three colours. Next, paint the remaining 3 triangles,
The number of committees of 3 gentlemen, 1 wife with any one of the remaining two colours. By the
= 4C3 × 1C1 fundamental principle of counting, this can be done
( after selecting 3 gentlemen only 1 wife is left who in 3 × 2 × 2 × 2 = 24 ways.
can be included) 25. (a) In the following figure :
The number of committees of 2 gentlemen, 2 wives
= 4C2 × 2C2 A B C
The number of committees of 1 gentleman, 3 wives
= 4C1 × 3C3 There are 4 bus routes from A to B and 3 routes from
The number of committees of 4 wives = 1 B to C. Therefore, there are 4 × 3 = 12 ways to go
The required number of committees = 1 + 4 + 6 + 4 + 1 from A to C. It is round trip so the man will travel
= 16 back from C to A via B. It is restricted that man
18. (d) The number of 4 persons including A and B = 6C2 cannot use same bus routes from C to B and B to A
Considering these four as a group, number of more than once. Thus, there are 2 × 3 = 6 routes for
arrangements with the other four = 5! return journey. Therefore, the required number of
But in each group the number of arrangements = 2! × 2! ways = 12 × 6 = 72.
Required number of ways = 6C2 × 5! × 2! × 2! + 1 = 16 26. (a) First, we take books of a particular subject as one
19. (d) Required number of numbers unit. Thus, there are 4 units which can be arranged
= 5 6 6 4 = 36 20 = 720. in 4! = 24 ways. Now, in each of the arrangements,
20. (a) Alphabetical order is mathematics books can be arranged in 3! ways,
A, C, H, I, N, S history books in 4! ways, chemistry books in 3! ways
No. of words starting with A = 5! and biology books in 2! ways. Thus, the total number
No. of words starting with C = 5! of ways = 4! × 3! × 4! × 3! × 2! = 41472.
No. of words starting with H = 5! 27. (d) Number of ways of dividing 8 persons in three
groups, first having 3 persons, second having 2
No. of words starting with I = 5!
8!
No. of words starting with N = 5! persons and third having 3 persons = . Since
SACHIN – 1 3! 2!3!
all the 50 things are identical.
Sachin appears at serial no. 601
21. (d) First let us arrange M, I, I, I, I, P, P 8!
So, required number = 2
7! 3! 2!
Which can be done in ways
4!2! 28. (c) Since, out of eleven members, two members sit
Now 4 S can be kept at any of the ticked places in
8C ways so that no two S are adjacent. together, then the number of arrangements = 9! × 2
4 ( two members can sit in two ways).
Total required ways
29. (d) Required number of such triangles
7! 8 7! 8 6 8 = 4C1 × 5C1 × 6C1 = 4 × 5 × 6
= C4 = C4 = 7 C4 C4
4!2! 4!2!
 126 PERMUTATIONS AND COMBINATIONS
30. (c) Given 4 vowels and 5 consonants 41. (a) The man can go in 5 ways and he can return in 5
Total number of words = 4C2 × 5C3 × 5! ways. Hence, total number of ways are 5 × 5 = 25.
= 6 × 10 × 120 = 7200. 42. (b) The 4 odd digits 1, 3, 3, 1 can be arranged in the
31. (b) Total number of parallelograms formed 4!
= 4C2 × 3C2 = 6 × 3 = 18 4 odd places in = 6 ways and 3 even digits
2! 2!
32. (c) Each of the three prizes can be given to any of the 3!
four children. 2, 4, 2 can be arranged in the three even places in
2!
Total number of ways of distributing prizes
= 4 × 4 × 4 = 64 = 3 ways
Number of ways in which one child gets all prizes = 4 Hence, the required number of ways = 6 × 3 = 18.
Number of ways in which no child gets all the 43. (b) At first, we have to accommodate those 5 animals in
three prizes = 64 – 4 = 60 cages which cannot enter in 4 small cages, therefore
33. (c) In the word ‘RACHIT’, the number of words beginning number of ways are 6P5. Now, after accommodating
with A, C, H, I is 5! and the next word we get RACHIT.
5 animals we left with 5 cages and 5 animals,
Required number of words
= 4 × 5! + 1 = 4 × 120 + 1 = 481 therefore, number of ways are 5!. Hence, required
34. (c) Number of chords that can be drawn through 21 number of ways = 6P5 × 5! = 86400.
points on circle = Number of ways of selecting 2 44. (b) 2 . 20C2 {Since two students can exchange cards each
points from 21 points on circle other in two ways}.
21 20 45. (a) The selection can be made in 5C3 × 22C9 ways.
= 21C2 = = 210 {Since 3 vacancies filled from 5 candidates in 5C3
2 1
35. (a) Total number of available courses = 9 ways and now remaining candidates are 22 and
Out of these, 5 courses have to be chosen. But it is remaining seats are 9}.
given that 2 courses are compulsory for every student, 46. (a) 12 persons can be seated around a round table in
i.e. you have to choose only 3 courses, out of 7. 11! ways. The total number of ways in which 2
particular persons sit side by side is 10! × 2!.
7 6 5
It can be done in 7C3 ways = = 35 ways. Hence, the required number of arrangements
6 = 11! – 10! × 2! = 9 × 10!.
36. (a) There are two possibilities :
Men Women STATEMENT TYPE QUESTIONS
(i) 2 4
(ii) 3 6 47. (c) I. Number of 3 letter words (repetition not allowed)
(i) Number of ways of choosing a committee of = 6 × 5 × 4 = 120
2 men and 4 women = 4C2 × 6C4 (as first place can be filled in 6 different ways,
second place can be filled in 5 different ways and
4 3 6 5
= = 90 third place can be filled in 4 different ways)
2 1 2 1 II. Number of 3 letter words (repetition is allowed)
(ii) Number of ways of choosing a committee of = 6 × 6 × 6 = 216
3 men and 6 women = 4C3 × 6C6 (as each of the place can be filled in 6 different ways)
=4×1=4 48. (c) I. Number of 4 letter words that can be formed from
Required number of ways = 94 alphabets of the word ‘PART’
37. (a) Number of times he will go to garden = 4P4 = 4! = 24
= Number of ways of selecting 3 children from
8 children II. Number of 4 letter words that can be formed when
repetition is allowed = 44 = 256
8 7 6
= 8C3 = = 56 49. (a) I. In n-sided polygon, the number of vertices = n
3 2
Number of lines that can be formed using n
38. (a) Since the man can go in 4 ways and can
back in 3 ways. points = nC2.
Therefore, total number of ways are 4 × 3 = 12 ways. Out of these, nC2 lines, n lines from the polygon.
6! 720 Number of diagonals = nC2 – n
39. (a) Required number of ways = 3! 3! 6 6 = 20 II. Let the number of sides of a polygon = n
[Number of heads = 3, number of tails = 3 and coins Number of diagonal = Number of line segment joining
are identical] any two vertices of polygon – Number of sides
40. (c) Required number of ways = 5! – 4! – 3! = nC2 – n
= 120 – 24 – 6 = 90 n n –1 n n–3
= –n
[Number will be less than 56000 only if either 4 2 2
occurs on the first place or 5, 4 occurs on the first n n–3
two places]. Now, = 44
2
PERMUTATIONS AND COMBINATIONS 127
n2 – 3n – 88 = 0 On solving (i) and (ii), we get
(n – 11) (n + 8) = 0 n = 3 and r = 2
n = 11 32!
II. Required no. of ways = 32C4 =
or n = –8 rejected. 4! 28!
50. (c) (I) A committee consisting of 3 girls and 4 boys can 57. (c) Both are true.
be formed in 4C3 × 9C4 ways 58. (c) Both statements are true.
4 9 8 7 6 59. (b) I. The continued product of first n natural numbers
= 4C1 × 9C4 = ways is called the ‘n factorial’.
1 1.2.3.4
II. 5! = 5 4!
= 504 ways
6! = 6 5 4!
(II) A committee having at least 3 girls will consists of
L.C.M. of 4!, 5!, 6! = L.C.M. [4!, 5 4!, 6 5 4!]
(a) 3 girls 4 boys, (b) 4 girls 3 boys = 4! 5 6 = 6! = 720
This can be done in 4 C3 9
C4 4
C4 9
C3 ways
MATCHING TYPE QUESTIONS
4 9 8 7 6 9 8 7 7! 7 6 5!
1 ways
1 1 2 3 4 1 2 3 60. (d) A. = 42
5! 5!
= 504 + 84 ways = 588 ways 12! 12 11 10!
B. = 66
51. (c) (I) n
Cr 2 nCr 1 n
Cr 2 10! 2! 10! 2 1
8! 8 7 6!
n
Cr n
Cr n
Cr n
Cr C. = 28
1 1 2 6! 2! 6! 2 1
n 1 n 1 n 2 61. (c) A. The number of 4 different digits = 7P4
Cr Cr 1 Cr .
7!
=
(II) If nC p n
Cq n
Cp n
Cn q
7–4 !
= 7 × 6 × 5 × 4 = 840
p q or p n q n
Cr n
Cn B. The numbers exactly divisible by 2
r
= Number of ways of filling first 3 places
52. (a) I. 15C + 15C – 15C – 15C
8 9 6 7 × Number of ways of filling unit’s place
= 15C7 + 15C6 – 15C6 – 15C7 =0 = 6P3 × 3
II. Total number = 10! – 9! = 9 9!
6! 6!
53. (c) Both are false = 3 3
6–3! 3!
I. Correct is 53.
( each one of the three letters can be posted in = 6 × 5 × 4 × 3 = 360
C. Number of 4-digit numbers divisible by 25
anyone of the five letter boxes.)
= Numbers ending with 25 or 75
II. Statement will be true if m particular things always
5 4 25 or 75
occur.
54. (c) Both are true statements. =
55. (b) Both are true statements. = 5 × 4 × 2 = 40
( when numbers end with 25 or 75, the other
n! n!
I. nC = two places can be filled in 5 and 4 ways)
r r !(n r)! (n r)! [n (n r)]! D. Number of 4-digit numbers divisible by 4
= nCn–r = Numbers ending with 12, 16, 24, 32, 36, 64, 72,
76, 52, 56
n! n! Now, number ending with 12
II. nC + nCr–1 =
r r !(n r)! (r 1)! (n r 1)!
= = 20
n! 1 1 4 5 1 1
= (r 1)!(n r)! r Similarly, numbers ending with other number
n r 1
(16, 24, .....) = 20 each
Required numbers = 10 × 20 = 200
n! n r 1 r (n 1)! 62. (a) (A) (n + 2) (n + 1) n! = 2550 n!
= (r 1)!(n r)! r n r 1 r !(n 1 r)! n2 + 3n – 2548 = 0
nP (n + 52) (n – 49) = 0
56. (a) I. = nPr+1
r n = 49
n–r=1 …(i) (B) (n+1) n (n– 1)! = 12(n – 1)!
and nCr = nCr–1 n2 + n – 12 = 0 (n + 4) (n – 3) = 0
n–r+1=r n – 2r = – 1 …(ii) n=3
128 PERMUTATIONS AND COMBINATIONS
1 1 x 1 8! 8 7 6 5 4 3 2 1
(C) 1 = (D)
9! 10 11 10 9! 6! 2! 6 5 4 3 2 1 2 1
11 x 8 7
= x = 11 11 = 121 28
10 11 10 2 1
15! 15 14 13 12! 64. (b) (A) We have
(D) P(15, 3) = = 2730 nC = nC
12! 12! r n–r
(E) P(n, 4) = 2. P(5, 3) nC = nC
2 n–2
nC = nC n – 2 = 8 or n = 10
n! 5! 8 n–2
=2 10 9
(n 4)! (5 3)! nC
2 = 10C2 45
2(5!) 1 2
n(n – 1) (n – 2 ) (n – 3) = (B) 2nC3 : nC2 = 12 : 1
2!
n(n–1) (n–2)(n–3) = 5 4 3 2 1 2 n(2 n 1) (2 n 2) n ( n 1) 12
n(n–1) (n–2) (n–3) = 5 (5–1) (5–2) (5–3) 1.2.3 1.2 1
n=5 n n ( n 1)......(n r 1)
Cr
n! n! 1.2.3........n
63. (d) (A) (n 4)! 20 (n 2)! 2n(2n 1)2(n 1) 2 12
or
(n – 2)! = 20 (n – 4)! 6 n(n 1) 1
(n–2) (n–3) = 5 4 4n(2n 1)(n 1) 1
n–3=4 n=7 or 12
3 n(n 1)
(B) We have, 2 n – 1 = 9, 2n = 10 or n = 5
5P = 2 6P 2nC : nC = 11 : 1
r r–1 (C) 3 3
5! 6! 2n(2n 1)(2 n 2) n( n 1)( n 2) 11
or 2
(5 r )! (6 r 1)! or
1.2.3 1.2.3 1
5! 6 5! 4n(n 1)(2n 1) 6 11
or 2 or
(5 r )! (7 r )! 6 n(n 1)(n 2) 1
1 12 4(2 n 1)
or or 11
(5 r )! (7 r )(6 r )(5 r )! n 2
or (7 – r) (6 – r) = 12 4(2n – 1) = 11(n – 2) or 8n – 4 = 11n – 22
or 42 – 7r – 6 r + r 2 = 12 or 3n = 18 n=6
(D) nC = nC n = 8 + 6 = 14
or r2 – 13 r + 30 = 0 8 6
or r2 – 10 r – 3 r + 30 = 0 nC = 14C = C
or r (r – 10) – 3 (r – 10) = 0 2 2
or (r – 10) (r – 3) = 0
= 1 91
or r = 10 or r = 3
Hence, r=3
5P which is meaningless] 720
[r = 10 10 65. (a) (A) 120 = r! = 6 r! = 3! r=3
(C) We have, r!
5P = 6P
r r–1 (2 n)! (n 3)! 11
5! 6! (B)
or 2 (2 n 3)! n! 1
(5 r )! [6 ( r 1)]!
5! 6 5! (2 n) (2 n 1) (2 n 2) 11
or n (n 1) (n 2) 1
(5 r )! (6 r 1)!
5! 6 5! 4(2 n 1) 11
or 3n = 18 n=6
(5 r )! (7 r )! n 2 1
5! 6 5!
or (n 2)! (n 6)! 57
(5 r )! (7 r )(6 r )(5 r )! (C)
or (7 – r) (6 – r) = 6 8!(n 6)! (n 2)! 16
or r2 – 13 r + 36 = 0
57
or r = 4, 9 (n + 2) (n + 1) (n) (n – 1) = 8!
or r = 4 16
[r = 9 5P which is meaningless] (n – 1) n (n +1 ) (n + 2) = 18 19 20 21
r
n –1 = 18 n = 19
PERMUTATIONS AND COMBINATIONS 129
100 100 100 74. ( a) 2nC : nC = 12 : 1
(D) C98 = C100–98 = C2 3 2
2n(2n 1) (2 n 2) n( n 1) 12
100 99 98 n n n 1
= C0 Cr Cr 1 1.2.3 1.2 1
2 1 r
n n ( n 1)......( n r 1)
= 4950 Cr
1.2.3........n
66. (b) A. Number of words using 4 letters out of 6 letters
2n(2n 1)2( n 1) 2 12
6! or
= 6P4 = = 6 × 5 × 4 × 3 = 360 6 n(n 1) 1
2!
B. Number of words using all letters 4n(2n 1)(n 1) 1
or 12
= 6P6 = 6! = 720 3 n(n 1)
C. Number of words starting with vowel 2 n – 1 = 9, 2n = 10 or n = 5
= Number of ways of choosing first letter (out 75. (b) n + 1C3 nC3 = 21
nC + nC n + 1C
of O and A) × Number of ways of arranging r r–1 = r
nC = 21 n=7
5 alphabets 2
= 2 × 5! = 2 × 120 = 240 39 39 39 39
76. (b) C3r 1 C C C3r
r2 r2 1
INTEGER TYPE QUESTIONS 39
C3r 1 39
C3r 39
C 39
C
r2 1 r2
n! n! 40
C3r 40
C
67. (a) r2
9!(n 9)! 8! (n 8)!
1 1 r 2 3r or r 2 40 3r r 0, 3 or – 8, 5
9 8 !(n 9)! 8! ( n 8)( n 9)! 3 and 5 are the values as the given equation is not defined
by r = 0 and r = –8. Hence, the number of values of r is 2.
1 1 n! n!
9=n–8
9 (n 8) 77. (b) nP 0 1
(n 0)! n!
9+8=n n = 17 n! n!
nC = 17C = 1 n!
17 17 [ nCn = 1] 78. (d) nCn 1
10 10 n!(n n)! n! 0! n!
68. (c) We have Cx= Cx + 4
x + x + 4 = 10 2x = 6 x=3 n! n! n!
79. (c) nC0 1
69. (b) n + 1C
3
nC = 21
3
nC + nC
r r–1 =
n + 1C
r
0!(n 0) 0! n! n!
nC = 21 n=7
2 n 17 n
70. (b) There are 11 letters in the given word which are as C17 C17 1 Cn 1
follows (NNN) (EEE) (DD)IPT n! n!
Five letters can be selected in the following manners : 80. (a)
9!(n 9)! 8! ( n 8)!
(i) All letters different : 6C5 = 6
(ii) Two similar and three different : 3C1. 5C3 = 30 1! 1!
(iii) Three similar and two different : 2C1. 5C2 = 20 9 8 !(n 9)! 8! ( n 8)( n 9)!
(iv) Three similar and two similar : 2C1. 2C1 = 4 1 1
(v) Two similar, two similar and one different : 9=n–8
3C . 4C = 12
9 (n 8)
2 1 9+8=n n = 17
Total selections = 6 + 30 + 20 + 4 + 12 = 72 nC = 17C = 1 [ nCn = 1]
17 17
1 1 1 1 x 10
81. (c) We have Cx= Cx + 410
71. (d)
6! 7! 6! 7.6! 8.7.6.! x + x + 4 = 10 2x = 6 x=3
1 1 x 82. (b ) We have,
1 2nC : nC = 11 : 1
6! 7 8.7.6! 3 3
8 x (2 n)!
x 64 2n
C3 11
7 8.7 (2n 3)!3! 11
n 1 n!
C3 1
72. (c) n = 6, r = 2 (n 3)!(3!)
n! 6! 6! (2n)! (n 3)! 11
= =6 5
(n r)! (6 2)! 4! (2n 3)! n! 1
n 1 n 1 (2n)(2n 1)(2 n 2)(2n 3)!
P3 1 P3 1
73. (d ) n
P4 9 n 1
n. P3 9 (2n 3)!
1 1 (n 3)! 11
or n = 9 n(n 1)(n 2)(n 3)! 1
n 9
 130 PERMUTATIONS AND COMBINATIONS

(2n)(2n 1)(2n 2) 11 at least one object is same as the number of ways of

n(n 1)(n 2) 1 selecting (r – 1) places out of (n – 1) different places,
4(2n 1) 11 i.e. n – 1Cr – 1.
n 2 1
8n 4 11n 22 3n 18 n 6 90. (d) Number form by using 1, 2, 3, 4, 5 = 5! = 120
83. (b) The combination will be AB, AC, AD, BC, BD and CD. Number formed by using 0, 1, 2, 4, 5
84. (a) Given: 12Pr = 11P6 + 6.11P5
4 4 3 2 1 = 4.4.3.2.1 = 96
We know that
n–1P + r . n–1P n
r r–1 = r! Cr Total number formed, divisible by 3 (taking numbers
11P + 6. 11P = 6! 12C
6 5 6 without repetition) = 216
12P = 6! 12C
6 6 Statement 1 is false and statement 2 is true.
12! 12!
6! which are equal CRITICALTHINKING TYPE QUESTIONS
6! 6!6!
r=6 91. (a) Let A = nCr + 2nCr–1 + nCr–2
85. (b) Let n! 2n! n!
+
A = 8C1 – 8C2 + 8C3 – 8C4 + 8C5 – 8C6 + 8C7 – 8C8 r!(n r)! (r 1)!(n r 1)! (r 2)!(n r 2)!
8! 8! 8! 8! 8! 8! 8! 8! n![(n r 2.n r 1) 2(n r 2)r r(r 1)]
=
1!7! 2!6! 3!5! 4!4! 5!3! 6!2! 7!1! 0!8! r!(n r 2)!
n! n![(n 2 nr n nr r 2
Note: n Cr r 2n 2r 2
r !(n r)! 2 2
Thus, 2nr 2r 4r r r]
8 7 8 7 6 8 7 6 5 r!(n r 2)!
A=8–
2 3 2 4 3 2 1 (n 2 3n 2)n! (n 1)(n 2)n!
8 7 6 8 7 r!(n r 2)! r!(n r 2)!
+ +8–1
3 2 2 (n 2)!
And A= 8 – 28 + 56 – 70 + 56 – 28 + 8 – 1 = 1 = n+2Cr.
r!(n 2 r)!
ASSERTION - REASON TYPE QUESTIONS 92. (c) n n
Cr 1 Cr 1 2 n Cr
86. (c) Number of ways of arranging four distinct objects in n n n n
Cr 1 Cr Cr Cr 1
a line is 4P4 = 4! = 24.
n 1 n 1 n 2
Hence, Statement II is false. Cr Cr 1 Cr 1
Again, when W, I, F, E are arranged in all possible 93. (b) To find number of line segment we will have to draw the
ways, then number of words formed is 4! = 24 and line segments joining two points. If n is the number of
WIFE occurs last of all as its letters are against such lines segments, then
alphabetical order. 12! 12 11 10!
87. (c) For the number exactly divisible by 4, then last two n = 12C2 = = = 66.
2!(12 2)! 2 10!
digits must be divisible by 4, the last two digits are
viz. 94. (d) There are 10 questions with options of false/ true. It
12, 16, 24, 32, 36, 52, 56, 64, 72, 76 means each question has two options. Thus the number
Total 10 ways. Now, the remaining two first places on of ways that these questions can be answered
the left of 4-digit numbers are to be filled from the = 210 = 1024 ways.
remaining 5-digits and this can be done in 5P2 95. (c) Since we know that the total number of selections of r
= 20 ways. things from n things where each thing can be repeated
as many times as one can, is n + r – 1Cr
Required number of ways = 20 × 10 = 200.
Here r = 6 ( we have to select 6 coins)
88. (c) Product of n consecutive natural numbers
and n = 3 ( it is repeated 3 times)
= (m + 1) (m + 2) (m + 3) ..... (m + n), m whole Required number = 3+6–1C6 = 28
number 96. (a) Let the no. of participants at the beginning was n.
m n ! m n ! Now, we have 6 games and each participant will play 2
= n!
m! m! n! games.
m+n
= n! × Cm Total no. of games played by 2 persons
Product is divisible by n!, then it is always divisible = 6 × 2 = 12
by (n – 1)! but not by (n + 1)! Since, two players fell ill having played 6 games each,
89. (a) Let the number of ways of distributing n identical without playing among them selves and total no. of
objects among r persons such that each person gets games = 117
PERMUTATIONS AND COMBINATIONS 131

n(n 1) 104. (d) There are three multiple choice questions, each has
117 12 four possible answers. Therefore, the total number of
2
n (n– 1) = 2(105) = 210 possible answers will be 4 × 4 × 4 = 64. Out of these,
n2 – n – 210 = 0 possible answers only one will be correct and hence
n2 – 15n + 14n – 210 = 0 the number of ways in which a student can fail to get
all correct answers is 64 – 1 = 63.
n(n – 15) + 14(n – 15) = 0
105. (a) There will be as many signals as there are ways of
n = – 14, 15
But no. of participants can not be –ve filling in 2 vacant places in succession by the
n = 15. 4 flags of different colours. The upper vacant place
97. (a) There are 10 lions and there is no restrictions on can be filled in 4 different ways by anyone of the
arranging lions. They can be arranged in 10! ways. But 4 flags; following which, the lower vacant place can
there is a restriction in arrangements of tigers that no be filled in 3 different ways by anyone of the
two tigers come together. So two tiger are to be arranged remaining 3 different flags. Hence, by the
on the either side of a lion. This gives 11 places for multiplication principle, the required number of signals
tigers and there are 6 tigers. So, tigers can be arranged = 4 × 3 = 12.
in 11P6 ways. 106. (c) Evidently, (c) is correct option because we have to
So, total arrangemns are 10! ×11P6 divide 17 into four groups each distinguishable into
98. (d) In the word CORPORATION, there are 11 positions, groups of 5, 5, 4 and 3.
there are 3 vowels O, A and I and they can occupy even 107. (a) The possibilities are:
places only (2nd 4th, 6th, 8th and 10th positions), total 5 4 from Part A and 6 from Part B
positions : This can be done in 5C3 ways. or 5 from Part A and 5 from Part B
There are remaining 6 positions for odd numbered places or 6 from Part A and 4 from Part B
Therefore, the required number of ways is
(i.e. 1, 3, 5, 7, 9, 11) and these are be occupied by 5
= 6C4 × 7C6 + 6C5 × 7C5 + 6C6 × 7C4
consonants, namely, C, R, P, T, N.
= 105 + 126 + 35 = 266.
This can be done in 6C5 ways.
Total number of ways = 5C3 × 6C5 = 7200 108. (b) The following are the number of possible choices:
52
99. (c) Given expression is : C18 × 35C2 (18 families having atmost 2 children and
(n 2)! (n 1)!(n 1)! 2 selected from other type of families)
x (let) 52
(n 1)!(n 1)! C19 × 35C1 (19 families having atmost 2 children and
(n 2)(n 1)n(n 1)! (n 1)(n 1)! 1 selected from other type of families)
x 52
(n 1)(n 1)! C20 (All selected 20 families having atmost
= (n + 2)n + 1= n2 + 2n + 1 = (n + 1)2 2 children). Hence, the total number of possible
Which is a perfect square.
choices is : = 52C18 × 35C2 + 52C19 × 35C1 + 52C20
100. (b) x1 x2 x3 x4 x5 x6 x7 x8 x9. Under the given situation x5 109. (d) Let us make the following cases :
can be 5 only. The selection for x1, x2, x3, x4 must be Case I : Boy borrows Mathematics Part II, then he
from 1, 2, 3, 4, so they can be arranged 4 ! ways. Again borrows Mathematics Part I also. So, the number of
the selection of x6, x7, x8, x9 must be from 6, 7, 8, 9 so
they can be arranged in 4! ways. possible choices is 6C1 = 6.
Desired number of ways = (4!) (4!) = (4!)2 Case II : Boy does not borrow Mathematics Part II,
101. (c) The number will have 2 pairs and 2 different digits. then the number of possible choices is 7C3 = 35.
The number of selections = 4C2 × 2C2, and for each Hence, the total number of possible choices is
6!
selection, number of arrangements = . = 35 + 6 = 41.
2!2!
110. (d) Let there were n men playing in the tournament with
6! 2 women. According to the given condition,
Thus, the required number = 4C2 × 2C2 × = 1080 n
2!2! C2 – nC1 × 2C1 = 52
102. (a) Total number of numbers without restriction = 25 n n –1
Two numbers have all the digits equal. So, – 2n = 52
2
The required number = 25 – 2 = 30 2
n – n – 4n = 104
103. (a) One possible arrangement = 2 2 1 n2 – 5n – 104 = 0
Three such arrangements are possible. Therefore, the n = 13.
number of ways = (5C2)(3C2)(1C1)(3) = 90 111. (b) For one game four persons are required.
This can be done in 6C4 = 15 ways.
The other possible arrangements = 1 1 3 Once a set of 4 persons are selected, number of
Three such arrangements are possible. 4
C2
Thus, the number of ways = (5C1)(4C1)(3C3)(3) = 60 games possible will be = 3 games.
Hence, the total number of ways = 90 + 60 = 150. 2
Total number of possible games = 3 × 15 = 45.
 132 PERMUTATIONS AND COMBINATIONS
112. (d) The number of times the house master goes to dhaba 118. (a) The number of words starting from A are 5! = 120
The number of words starting from I are 5! = 120
is nC3. Let n be the number of children taking
The number of words starting from KA are 4! = 24
non-vegetarian food. The number of words starting from KI are 4! = 24
Now, nC3 – n – 1C2 = 84 The number of words starting from KN are 4! = 24
n n –1 n – 2 n –1 n – 2 The number of words starting from KRA are 3! = 6
– = 84 The number of words starting from KRIA are 2! = 2
6 2 The number of words starting from KRIN are 2! = 2
n 1 The number of words starting from KRISA are 1! = 1
(n – 1) (n – 2) – = 84
6 2 The number of words starting from KRISNA are 1! = 1
(n – 1) (n – 2) (n – 3) = 6 × 6 × 14 Hence, rank of word ‘KRISNA
(n – 1) (n – 2) (n – 3) = 3 × 2 × 3 × 2 × 7 × 2 = 2(120) + 3(24) + 6 + 2(2) + 2(1) = 324
=7×8×9 119. (c) The numbers between 999 and 10000 are all 4-digit
(n – 1) = 9 n = 10. numbers. The number of 4-digit numbers formed by
113. (c) Required number digits 0, 2, 3, 6, 7, 8 is 6P4 = 360.
= 3C3 + 3C2 × 7C1 + 7C2 × 3C1 But here those numbers are also involved which
= 1 + 3 × 7 + 21 × 3 = 1 + 21 + 63 = 85. begin from 0. So, we take those numbers as three-
114. (c) Let the boxes be marked as A, B and C. We have to digit numbers.
ensure that no box remains empty and all five balls
Taking initial digit 0, the number of ways to fill
have to put in. There will be two possibilities :
(i) Any two box containing one ball each and 3rd remaining 3 places from five digits 2, 3, 6, 7, 8 are 5P3
box containing 3 balls. Number of ways = 60
= A(1) B(1) C(3) So, the required numbers = 360 – 60 = 300.
= 5C1 . 4C1 . 3C3 = 5 . 4 . 1 = 20 120. (b) After sending 4 to one side and 3 to other side.
(ii) Any two box containing 2 balls each and third We have to select 5 for one side and 6 for other side
containing 1 ball, the number of ways from remaining.
= A(2) B(2) C(1) = 5C2 . 3C2 . 1C1 This can be done in 11C5 × 6C6 ways = 11C5
= 10 × 3 × 1 = 30 Now, there are 9 on each side of the long table and
Since, the box containing 1 ball could be any of the each can be arranged in 9! ways.
three boxes A, B, C. Hence, the required number of Required number of ways = 11C5 × 9! × 9!
ways = 30 × 3 = 90. = 11C6 × (9!)2 [ nCr = nCn – r]
Hence, total number of ways = 60 + 90 = 150. 121. (b) Total number of ways
115. (a) For the first player, distribute the cards in 52C17 ways. = 10C1 + 10C2 + 10C3 + 10C4
= 10 + 45 + 120 + 210 = 385
Now, out of 35 cards left, 17 cards can be put for
122. (b) The number of choices available to him
second player in 35C17 ways. Similarly, for third = 5C4 × 8C6 + 5C5 × 8C5
player put them in 18C17 ways. One card for the last 5! 8! 5! 8!
player can be put in 1C1 way. Therefore, the required =
4! 1! 6! 2! 5! 0! 5! 3!
number of ways for the proper distribution 8 7 8 7 6
= 52C17 × 35C17 × 18C17 × 1C1 =5× +1×
2 3 2
52! 35! 18! 52! =5×4×7+8×7
= 1! .
35!17! 18!17! 17!1! 17!
3 = 140 + 56 = 196
116. (c) Total number of 3-digit numbers having at least one 123. (a) For A, B, C to speak in order of alphabets, 3 places
of their digits as 5 = Total number of 3-digit numbers out of 10 may be chosen first in 10C3 ways.
– (Total number of 3-digit numbers in which 5 does The remaining 7 persons can speak in 7! ways.
not appear at all) Hence, the number of ways in which all the 10
= 9 × 10 × 10 – 8 × 9 × 9 10! 10!
persons can speak is 10C3 . 7! = .
= 900 – 648 = 252 3! 6
117. (a) Total number of 4-digit numbers = 5 × 5 × 5 × 5 = 625 124. (d) Since 2 persons can drive the car, therefore we have
(as each place can be filled by anyone of the to select 1 from these two. This can be done in 2C1
numbers 1, 2, 3, 4 and 5) ways. Now from the remaining 5 persons we have to
Numbers in which no two digits are identical select 2 which can be done in 5C2 ways. But the front
= 5 × 4 × 3 × 2 = 120 (i.e. repetition not allowed) seat and the rear seat person can interchange among
(as 1st place can be filled in 5 different ways, 2nd place
themselves. Therefore, the required number of ways
can be filled in 4 different ways and so on)
Number of 4-digits numbers in which at least 2 digits in which the car can be filled is 5C2 × 2C1 × 2!
are identical = 625 – 120 = 505 = 20 × 2 = 40.
 8
BINOMIAL THEOREM

(a) equal
CONCEPT TYPE QUESTIONS
(b) equal with opposite signs
Directions : This section contains multiple choice questions. (c) reciprocal of each other
Each question has four choices (a), (b), (c) and (d), out of which (d) None of these
only one is correct. 10. If tr is the rth term in the expansion of (1+ x)101, then the
1. How many terms are present in the expansion of t 20
11
ratio t equal to
2 19
x2 ? 20x 83x
x2 (a) (b) 83 x (c) 19 x (d)
19 19
(a) 11 (b) 12 (c) 10 (d) 11! 11. r and n are positive integers r > 1, n > 2 and coefficient of
2. The total number of terms in the expansion of (r+2)th term and 3rth term in the expansion of (1 + x)2n are
(x + a)51 – (x – a)51 after simplification is equal, then n equals
(a) 102 (b) 25 (c) 26 (d) None of these (a) 3r (b) 3r + 1 (c) 2r (d) 2r + 1
9
1 15
3. The term independent of x in the expansion of 2 x 2
3x 2 12. In the expansion of x , the term independent of x
is x2
is :
(a) 2nd (b) 3rd (c) 4th (d) 5th
15 15
10 (a) C6 .26 (b) C5 .25
x 3
4. In the expansion of 3 , x > 0, the constant term (c) 15 C4 .24 (d) None of these
3 x
13. The formula
is
(a) –70 (b) 70 (c) 210 (d) –210 m m(m 1) m 2
a b am ma m 1b a b ... holds when
20 1.2
y (a) b < a (b) a < b
5. The coefficient of x–12 in the expansion of x 3 is (c) | a | < | b | (d) | b | < | a |
x
(a) 20C (b) 20C y8 (c) 20C (d) 20C y12 1
8 8 12 12 14. can be expanded by binomial theorem, if
6. In the binomial expansion of (a – b)n, n 5 the sum of the 5 4x
5th and 6th terms is zero. Then a/b equals : (a) x < 1 (b) | x | < 1
5 4
n 5 n 4 5 6 (c) | x | < (d) | x | <
(a) (b) (c) (d) 4 5
6 5 n 4 n 5 1
x
n 15. The expansion of by binomial theorem will be
7. If the coefficients of x7 and x8 in 2 are equal, then n (4 3x)1/ 2
3 valid, if
is (a) x < 1 (b) | x | < 1
(a) 56 (b) 55 (c) 45 (d) 15 2 2
(c) x (d) None of these
8. The coefficient of the term independent of x in the expansion 3 3
10 16. If the coefficients of 2 , 3 and the 4th terms in the expansion
nd rd
x 3
of is of (1 + x)n are in A.P., then value of n is
3 2x2 (a) 3 (b) 7 (c) 11 (d) 14
(a) 5/4 (b) 7/4 (c) 9/4 (d) None of these 17. If in the binomial expansion of (1 + x)n where n is a natural
9. The coefficient of xp and xq (p and q are positive integers) number, the coefficients of the 5th, 6th and 7th terms are in
in the expansion of (1 + x)p + q are A.P., then n is equal to:
(a) 7 or 13 (b) 7 or 14 (c) 7 or 15 (d) 7 or 17