2 - Permutations and Combinations
Uploaded by
Study Lover2 - Permutations and Combinations
Uploaded by
Study Lover“HARI OM” “HARI OM”
SURESH DANI AND SONS CLASSES
PERMUTATIONS AND COMBINATIONS
FUNDAMENTAL PRINCIPLES OF COUNTING EXTENDED ADDITION PRINCIPLE :
1. TREE DIAGRAM: Suppose there are three independent things. If one thing
In set theory, subsets of a set can be represented in can be done in m different ways, second thing can be
the form of a Venn diagram. If these subsets are done in n different ways and third thing can be done in r
disjoint, then they can be represented by tree different ways, then either of the three things can be dojie
diagram. in m + n + r ways.
The concept of a tree diagram can be understood
with the help of following example : 3. MULTIPLICATION PRINCIPLE:
The games which students play at school are of If one thing can be done in m different ways and
two types (i) Indoor games and (ii) Outdoor games. when it has been done in any of these m ways,
Available indoor games in school are chess, second thing can be done in n different ways, then
carrom, table tennis etc. While outdoor games in both the things in succession can be done in m n
school are kho kho, kabadi, cricket etc. Such ways.
information is represented with the help of tree The multiplication rule is associated with 'and'.
diagram as given in figure 3.1
For example :
In a class of 8 boys and 6 girls, the teacher can
select a boy among 8 boys in 8 ways and can select
a girl among 6 girls in 6 ways.
Hence by the fundamental principle of
Diagram of this nature is called a tree diagram. multiplication, the teacher can select a boy and a
A tree diagram shows the division, of a set into girl in 8 6 = 48 ways.
disjoint subsets.
The fundamental principles of counting provide an EXTENDED MULTIPLICATION PRINCIPLE :
efficient way of finding the number of different
ways to carry out two or more activities, either Suppose there are three independent things. If one thing
simultaneously or successively (i.e. one after can be done in m different ways, second thing can be
another). done in n different ways and third thing can be done in r
different ways, then total number of things in succession
2. ADDITION PRINCIPLE: can be done in m x n x r ways.
If one thing can be done in m different ways and
another thing independent of the first, can be done 4. INVARIANCE PRINCIPLE:
in n different ways, then either of the two things The result of counting objects in a set does not
can be done in m + n ways. depend on the order in which these objects are
The addition rule is associated with 'or'. counted or on the method used for counting these
For example : objects.
In a class of 8 boys and 6 girls, the teacher can For example :
select a boy among 8 boys in 8 ways and can select In earlier example of addition principle of selecting
a girl among 6 girls in 6 ways. a boy from 8 boys, then selecting a girl from 6 girls
Hence by the fundamental principle of addition, is same as first selecting a girl from 6 girls, then a
the teacher can select either a boy or a girl in boy from 8 boys.
8 + 6 = 14 ways. In earlier example of multiplication principle of
selecting a boy from 8 boys, then selecting a girl
Permutations and Combinations 41
SURESH DANI AND SONS CLASSES
from 6 girls is same as first selecting a girl from 6 Thus three out of four letters a, b, c, d can be arranged in
girls and, then a boy from 8 boys. 24 different ways. This arrangement of three letters taken
three at a time is known as permutation of three letters
FACTORIAL NOTATION taken three at a time.
A permutation is an arrangement, in a definite order of a
The continued product of first n natural numbers is called number of objects, taken some or all at a time.
the 'n factorial' and is denoted by n !.
n ! = 1 2 3 4 ... (n 1) n DEFINITION :
n! = n((n 1)!)
n ! is defined for positive integers only. Permutation of n different objects taken r at a time is the
n ! is defined only for whole numbers. total number of ways in which 11 objects can be arranged
0! = l at r places in a line.
Factorials of proper fractions or negative integers It is denoted by nPr or P (n, r).
can not be defined.
For example :
PERMUTATION Let a, b, c, d, e be five given objects. Then the
arrangement of any two objects out of five objects is ab,
Suppose we have four letters a, b, c, d. We arrange three ac, ad, ae, be, bd, be, ba, cd, ce, ca, cb, de, da, db, dc, ea,
letters out of four in following ways as shown in figure eb, ec, ed.
The arrangement of any 2 objects out of 5 given objects
is done in 20 ways.
5
P2 = 20
PERMUTATION WHEN ALL THE OBJECTS.ARE
DISTINCT
The number of permutations or arrangements of n
different objects taken r (r n) at a time, when repetition
of the objects is not allowed is
n (n 1) (n 2) ... (n r + 1).
n!
n
Pr , for r n
(n r)!
If all n objects are placed in a row i.e. r = n, then nPn = n !
The number of permutations or arrangements of n
different objects taken r at a time, when repetition of the
objects is allowed is nr.
The number of permutations of n different objects taken
all at a time, when m specified objects always come
together is m ! (n m + 1) !.
The number of permutations or arrangements of n
different objects taken all at a time, when 2 specified
objects always together is 2 (h 1) !.
The number of permutations or arrangements of n
different objects taken all at a time, when 2 specified
objects never come together is (n 2) (n 1)!.
42 Permutations and Combinations
SURESH DANI AND SONS CLASSES
The number of permutations of n different objects taken r COMBINATION
at a time, when particular object is to be always included
in each arrangement is r (n 1)P(r 1). Suppose we want to select three persons out of four
The number of permutations of n different objects taken r persons A, B, C and D. We may choose them as A, B, C;
at a time, when particular object is never included in each A, B, D; A, C, D or B, C, D. In this selection the order in
arrangement is (n 1)Pr. which objects are arranged is immaterial.
PERMUTATION WHEN SOME OBJECTS ARE DEFINITION :
IDENTICAL
A combination of n different objects taken r (1 r n) at
The number of permutations of n things taken all at a a time is a selection of r objects out of given n objects.
time, of which p are of one kind, q are of second kind and n
It is denoted by "Cr or C (n, r) or .
n! r
r are of third kind such that p + q + r = n is .
p!q!r!
For example :
CIRCULAR PERMUTATIONS Let a, b, c, d, e be five given objects. Then the selection
of any two objects out of five objects is ab, ac, ad, ae, be,
If the position of any one object is fixed and remaining bd, be, cd, ce, de.
objects are arranged in all possible ways, then the The selection of any two objects out of five given objects
number of distinct circular arrangements of ,n objects are is done in 10 ways.
(n 1)! 5
C2 = 10
If the arrangements of n objects are made with respect to Total number of combinations or selections of n different
the table, then the number of ways in which n objects can objects, taken r at a time is given by
be arranged around the table are n ! n n!
Cr , r n.
Circular arrangements can be made in two ways r!(n r)!
(i) Clockwise direction
(ii) Anti-clockwise direction PROPERTIES OF COMBINATIONS
If clockwise and anti-clockwise direction are not
distinguished, then the number of circular arrangements 1. n
C0 = l
(n 1)! 2. n
C1 = n
of n objects are .
2 3. n
Cn = 1
The number of ways in which n objects of which p are n
n Pr
alike, can be arranged in a circular order where clockwise 4. Cr
r!
and anti-clockwise directions are not distinguished are n(n 1)(n 2)...(n r 1)
n
(n 1)! 5. Cr
.. 1 2 3...r
p!
6. n
Cr = Cn r, for 0 r n.
n
The number of circular arrangements of n different 7. n
Cr + nCrx = n + 1Cr, for 1 r n.
objects taken r at a time, where clockwise and anti- This is known as Pascal's Rule
n
Pr 8. n
C0 + nC1 + ... + nCn = 2n.
clockwise directions are taken as different are
.
r 9. n
C0 + nC2 + nC4 + ... = nC1 + nC3 + nC5 + ... = 2n 1.
The number of circular arrangements of n different 10. Number of ways of selecting one or more things
objects taken rat a time, where clockwise and anti- from n different things is given by 2n 1.
n
Pr 11. If nCx = nCy, then either x = y or x = n y.
clockwise directions are not distinguished are .
n
Cr (n 1) C(r 1)
2r n
12.
r
n n 1 (n 2)
C(r 2) ...
r r 1
Permutations and Combinations 43
SURESH DANI AND SONS CLASSES
n
13. Cr has maximum value if r
n
when n is even.
2
n 1 n 1
14. n
Cr has maximum value if r or r
2 2
when n is odd.
44 Permutations and Combinations
SURESH DANI AND SONS CLASSES
MULTIPLE CHOICE QUESTIONS : 8. 5 chocolates of different type are distributed
among 4 children and there is no condition on how
1. A college offers 5 courses in the morning and 3 in many chocolates a child can get (including zero).
evening. The number of ways a student can select The number of diffrent ways of doing this are
exactly one course, either in the morning or in the (a) 2048 (b) 1024
evening (c) 256 (d) 512
(a) 5 (b) 3
(c) 8 (d) 15 9. A letter lock has 3 rings and each ring has 5 letters.
The maximum number of trials which are required
2. A school has three gates and four staircases from to open the lock are
the first floor to the second floor. The number of (a) 120 (b) 100
ways in which a student will go from outside the (c) 124 (d) 125
school to his classroom on the second floor are
(a) 12 (b) 16 10. In a test, 5 questions are of the form 'state, true or
(c) 9 (d) 11 false'. No student has got all answers correct. Also,
the answer of every student is different. The
3. A college has 7 courses in the morning and 3 in number of students appeared for the test are
evening. The possible number of choices with the (a) 17 (b) 16
student if he wants to study one course in the (c) 31 (d) 32
morning and one in the evening is
(a) 21 (b) 4 11. The number of even numbers so formed using the
(c) 42 (d) 10 digits 2, 3, 7, 8 so that the number is less than 1000
are
4. The number of three digit numbers so formed from (a) 2 (b) 8
the digits 0, 1, 3, 5, 6, if repetition of the digits is (c) 32 (d) 42
allowed are
(a) 24 (b) 48 12. The number of numbers so formed with the digits
(c) 50 (d) 100 0, 1, 2, 5, 7, 8 which fall between 13 and 1000, if
digits can be repeated are
5. The number of three digit numbers so formed from (a) 208 (b) 218
the digits 0, 1, 3, 5, 6, if repetition of the digits is (c) 228 (d) 207
not allowed are
(a) 24 (b) 48 13. The number of numbers between 100 and 1000
(c) 50 (d) 100 which have the digit 7 exactly once are
(a) 225 (b) 216
6. The number of numbers between 100 and 1000 (c) 243 (d) 236
having 4 in the units place are
(a) 100 (b) 90 14. If numbers are formed using digits 2, 3, 4, 5, 6
(c) 1000 (d) 900 without repetition, then the number of numbers
from them which exceed 400 are
7. The number of four digit numbers which will not (a) 288 (b) 276
exceed 7432 if they formed using the digits 2, 3, 4, (c) 448 (d) 480
7 without repetition are
(a) 64 (b) 96 15. The number of five digit numbers so formed using
(c) 48 (d) 24 the digits 0, 1, 3, 4, 5 which are divisible by 5, if
digits are not repeated are
(a) 120 (b) 240
(c) 216 (d) 96
Permutations and Combinations 45
SURESH DANI AND SONS CLASSES
16. 10 ! = 12! 12!
26.
(a) 3628800 (b) 362880 5!7! 6!6!
(c) 1814400 (d) 181440 12! 12!
(a) (b)
6!6! 6!7!
17. (10 6) ! = (c)
13!
(d)
13!
(a) 96 (b) 72 6!6! 6!7!
(c) 24 (d) 48
27. The factorials of 5 10 15 20 is
18. (3 2) ! = (a) 54 4! (b) 54 5!
(a) 720 (b) 1440 (c) 53 4! (d) 53 20!
(c) 360 (d) 2880
28. The factorials of 3 6 9 12 15 is
12 (a) 35 3! (b) 35 5!
19. ! (c) 34 3! (d) 34 5!
6
(a) 665280 (b) 332640
(c) 4 (d) 2 29. The factorials of 6 7 8 9 is
9 9
(a) (b) !
20. 10! 6! = 5! 5
(a) 3628080 (b) 3628800 9! 9!
(c) (d)
(c) 362808 (d) 362880 5 5!
3! 2! = n!
21. 30. If n = 12, r = 12, then
(a) 24 (b) 48 r!(n r)!
(c) 6 (d) 12 (a) 0 (b) 1
(c) 12! (d) 12
12!
22.
6! n!
31. If n = 15, r = 10, then
(a) 332640 (b) 665280 r!(n r)!
(c) 720 (d) 1440 (a) 3003 (b) 2002
(c) 4004 (d) 1001
6! 4!
23.
4! (2n)!
32.
(a) 30 (b) 29 n!
(c) 31 (d) 32 (a) 2n (2n 1) (2n 3) ... 5 3 1
(b) 2n (2n 1) (2n + 3) ... 5 3 1
24.
9!
(c) 2n (2n + 1) (2n 3) ... 5 3 1
3! 6! (d) 2n (2n + 1) (2n + 3) ... 5 3 1
(a) 126 (b) 42
(c) 84 (d) 168 (2n 2)!
33.
(2n)!
9! 9! (a) (n + 1) (2n + 1) (b) (n + 2) (2n + 1)
25.
3!6! 4!5! (c) 2 (n + 1) (2n + 1) (d) 2(n + 2) (2n + 1)
9! 10!
(a) (b)
5!6! 5!6! (n 3)
9! 10! 34.
2
(c) (d) (n 4)(n 1)!
4!6! 4!6!
46 Permutations and Combinations
SURESH DANI AND SONS CLASSES
n3 n3 n! n!
(a) (b) 41.
n 1 n2 r!(n r)! (r r)!(n r 1)!
n3 n3 (n 1)! (n 1)!
(c) (d) (a) (b)
n 1 n2 r!(n r 1)! r!(n r 1)!
(n 1)! (n 1)!
35. n (n! + (n 1)!) + n2 (n 1)! + (n + 1)! = (c) (d)
r!(n r 1)! r!(n r 1)!
(a) (3n + 1) n ! (b) (3n + 2) n !
(c) (2n + 1) n ! (d) (2n + 3) n !
42. If (n + 1)! = 42 (n 1) !, then n =
(a) 6 (b) 7
n 2 3n 1
36. (c) 42 (d) 21
n! (n 1)!
n2 1 n2 2 43. If (n + 3)! = 110 x (n + 1) !, then n =
(a) (b)
(n 1)! (n 1)! (a) 3 (b) 2
n2 1 n2 2 (c) 7 (d) 8
(c) (d)
n! n!
44. If (n + 6) ! = 56(n + 4) !, thenn =
1 1 n (a) 2 (b) 8
37.
(n 1)! (n 1)! (c) 7 (d) 4
n2 2 n2 1
(a) (b) (15 n)!
(n 1)! (n 1)! 45. If 12 , then n =
(13 n)!
n2 2 n2 1
(c) (d) (a) 13 (b) 10
n! n!
(c) 12 (d) 11
1 1 1
38. n 3 1!
n! (n 1)! (n 2)! 46. If , then n =
8! 6! 4!
1 n 1 n (a) 924 (b) 1848
(a) (b)
n(n 2)! n(n 1)! (c) 1232 (d) 3696
1 n 1 n
(c) (d)
n(n 2)! n(n 1)! 47. If
n 4 3
, then n =
6! 8! 6!
29 39
1 3 n 2 10 (a) (b)
39. 7 14
n! (n 1)! (n 2)!
43 43
1 2 (c) (d)
(a) (b) 7 14
(n 2)! (n 2)!
3 6 1! 1! 4
(c)
(n 2)!
(d)
(n 2)! 48. If , then n =
n! 4! 5!
(a) 5! (b) 5
2
n 9 6 1 (c) 6! (d) 6
40.
(n 3) (n 2)! (n 1)!
n! n!
(a)
1
(b)
1 49. If : 1: 6 , then n =
(n 2)! (n 3)! 3!(n 3)! 5!(n 7)!
2 3 (a) 8 (b) 9
(c) (d) (c) 10 (d) 11
(n 2)! (n 3)!
Permutations and Combinations 47
SURESH DANI AND SONS CLASSES
(2n)! n! 59. The number of ways in which 5 letters can be
50. If : 24 :1 , then n =
7!(2n 7)! 4!(n 4)! posted in 3 post boxes, if any number of letters can
(a) 6 (b) 12 be posted in a post box are
(c) 5 (d) 10 (a) 625 (b) 125
(c) 729 (d) 243
51. (n r + 1) (n + 1)Pr =
(a) (n 1) (n 1)Pr (b) (n + 1) (n + 1)Pr 60. In how many ways 4 boys and 3 girls can be seated
(c) (n 1) nPr (d) (n + l) nPr in a row so that they are alternate ?
(a) 12 (b) 288
52. If nP5 = 42 nP3, then n = (c) 144 (d) 256
(a) 15 (b) 8
(c) 10 (d) 16 61. The number of ways in which 3 brothers and 5
sisters is to be arranged for a photograph so that all
53. If nP6 : nP3 = 120 : 1, then n = brothers sit together are
(a) 8 (b) 11 (a) 7200 (b) 14400
(c) 9 (d) 10 (c) 2160 (d) 4320
54. If 56Pr + 5 : 54Pr + 3 = 30800 : 1, then r = 62. The number of ways in which 3 brothers and 5
(a) 41 (b) 42 sisters is to be arranged for a photograph so that no
(c) 43 (d) 44 two brothers sit together are
(a) 7200 (b) 14400
55. If (m + n)P2 = 56 and (m n)P2 = 12, then (c) 2160 (d) 4320
(a) m = 6, n = 3 (b) m = 3, n = 6
(c) m = 6, n = 2 (d) m = 2, n = 6 63. In a group photograph, 6 teachers and principal are
in the first row and 18 students are in the second
56. A code word should consist of two distinct english row. There are 12 boys and 6 girls among the
capital alphabets followed by two distinct digits students. If the middle position is reserved for the
from 1 to 9 e.g. MH 24 is a code word. The principal and if no two girls are together, then the
number of such code words are number of arrangements are
(a) 46800 (b) 20800 12! 13! 12! 13!
(a) (b)
(c) 23400 (d) 10400 6 7
12! 13! 12! 13!
(c) (d)
57. A code word should consist of two distinct english 6! 7!
capital alphabets followed by two distinct digits
from 1 to 9 e.g. MH 24 is a code word. The 64. The number of arranging 11 distinct objects taken
number of such code words which end with an 4 at a time so that a specified object always occurs
even integer are are
(a) 46800 (b) 20800 (a) 5040 (b) 2520
(c) 23400 (d) 10400 (c) 2880 (d) 1440
58. A hall has 12 lamps and every lamp can be 65. The number of arranging 11 distinct objects taken
switched on independently. The number of ways of 4 at a time so that a specified object never occur
illuminating the hall are are
(a) 4097 (b) 4094 (a) 5040 (b) 2520
(c) 4096 (d) 4095 (c) 2880 (d) 1440
48 Permutations and Combinations
SURESH DANI AND SONS CLASSES
66. A teacher has 2 different books on English, 3 (c) 720 (d) 240
different books on Physics and 4 different books
on Mathematics. If these books are arranged in a 74. The number of 6 digit numbers using the digits 3,
shelf so that all books on any one subject are 4, 5, 6, 7, 8 without repetition so that these are not
together, then the number of different divisible by 5 are
arrangements are (a) 120 (b) 600
(a) 2592 (b) 864 (c) 720 (d) 240
(c) 3456 (d) 1728
75. Capital English alphabet has 11 symmetric letters
67. A question paper has 6 questions. The number of that appears same when looked at in a mirror.
ways in which a student can answer if he wants to These letters are A, H, I, M, O, T, U, V, W, X and
solve at least one question are Y. The number of symmetric three letter passwords
(a) 65 (b) 63 that can be formed using these letters are
(c) 64 (d) 62 (a) 1480 (b) 495
(c) 990 (d) 1980
68. In how many ways can 10 examination papers be
arranged so that the best and worst papers never 76. The number of different arrangements that can be
come together ? made, with the letters of the word WORLD are
(a) 9 8 ! (b) 8 8 ! (a) 24 (b) 60
(c) 9 9 ! (d) 8 9 ! (c) 120 (d) 48
69. The number of ways in which 7 examination 77. The number of different arrangements that begin
papers can be arranged so that papers 6 and 7 are with the letter R of the word WORLD arc
never together are (a) 24 (b) 60
(a) 3600 (b) 7200 (c) 120 (d) 48
(c) 1800 (d) 900
78. The number of different arrangements that can be
70. The number of distinct numbers formed using the made using three letters of the word WORLD are
digits 3, 4, 5, 6, 7, 8, 9 so that odd positions are (a) 24 (b) 60
occupied by odd digits are (c) 120 (d) 48
(a) 288 (b) 144
(c) 72 (d) 244 79. The number of words that can be formed using all
the letters of the word REMAIN are
71. The number of numbers so formed using the digits (a) 1440 (b) 720
0, 1, 2, 3, 4, 5 without repetition so that resulting (c) 360 (d) 440
numbers are between 100 and 1000 are
(a) 200 (b) 100 80. The different words are formed using all the letters
(c) 50 (d) 25 of the word REMAIN. If these words are written as
in a dictionary, then the 40th word is
72. The number of 6 digit numbers using the digits (a) AINMRE (b) AINMER
3, 4, 5, 6, 7, 8 without repetition are (c) AIMNRE (d) AIMNER
(a) 120 (b) 600
(c) 720 (d) 240 81. The letters of the word BRONZE are written in all
possible orders. If these words are written out in a
73. The number of 6 digits using the digits 3, 4, 5, 6, 7, dictionary order, then the rank of the word
8 without repetition so that these are divisible by 5 BRONZE is
are (a) 44 (b) 43
(a) 120 (b) 600 (c) 88 (d) 87
Permutations and Combinations 49
SURESH DANI AND SONS CLASSES
82. The number of ways so that letters of the word 90. The number of different words so formed if the
HISTORY can be arranged such that Y and T letter R is used thrice and letters S and T are used
aretogether are twice each are
(a) 1440 (b) 2880 (a) 105 (b) 330
(c) 720 (d) 360 (c) 210 (d) 420
83. The number of ways so that letters of the word 91. The number of different words that can be formed
HISTORY can be arranged such that Y is next to T with the letters of the INDIA such that two I's are
are always together are
(a) 360 (b) 120 (a) 120 (b) 60
(c) 720 (d) 600 (c) 48 (d) 24
84. The number of ways so that letters of the word 92. The number of different words that can be formed
HISTORY can be arranged such that there is no with the letters of the INDIA such that N and A are
restriction are always together are
(a) 120 (b) 2515 (a) 24 (b) 48
(c) 240 (d) 5040 (c) 60 (d) 120
85. The number of ways so that letters of the word 93. If the words of the letter AGAIN are written as in a
HISTORY can be arranged such that arrangement dictionary, then the 50th word is
begin and end with vowel are (a) NAAIG (b) NAAGI
(a) 2515 (b) 120 (c) NAIAG (d) NGAAI
(c) 240 (d) 5040
94. The number of arrangements of letters in the word
86. The number of ways so that letters of the word MUMBAI so that the letter B is always next to A
HISTORY can be arranged such that arrangement are
end in ST are (a) 60 (b) 120
(a) 2515 (b) 120 (c) 180 (d) 240
(c) 240 (d) 5030
95. The number of distinct words that can be formed
87. The number of ways so that letters of the word from the letters of the INDIAN are
HISTORY can be arranged such that arrangement (a) 60 (b) 90
begin with S and end with T are (c) 120 (d) 180
(a) 120 (b) 2515
(c) 240 (d) 5040 96. The number of distinct words that can be formed
from the letters of the INDIAN are such that they
88. The number of arrangements of the letters in the do not have the two N's together are
word SOTAPUR so that consonants and vowels (a) 60 (b) 90
are placed alternately are (c) 120 (d) 180
(a) 72 (b) 216
(c) 144 (d) 288 97. The number of different ways of arranging letters
in the word ARRANGE are
89. The number of permutations of letters of the word (a) 1230 (b) 1260
COMBINE are . - (c) 2460 (d) 2520
(a) 10080 (b) 5040
(c) 8080 (d) 2520
50 Permutations and Combinations
SURESH DANI AND SONS CLASSES
98. The number of different ways of arranging letters (a) 45 (b) 90
in the word ARRANGE such that the arrangements (c) 180 (d) 360
do not have the two Rs nor two A's together are
(a) 1230 (b) 1260 106. The number of different 6 digit numbers that can
(c) 2460 (d) 2520 be formed using digits in the number 659942 are
(a) 240 (b) 180
99. The number of different ways of arranging letters (c) 120 (d) 360
in the word PLATOON if the two O's are never
together are 107. The number of different 6 digit numbers that can
(a) 72 (b) 1800 be formed using digits in the number 659942
(c) 360 (d) 900 which are divisible by 4 are
(a) 240 (b) 180
100. The number of different ways of arranging letters (c) 120 (d) 360
in the word PLATOON if consonants and vowels
occupy alternate positions are 108. The number of numbers formed using the digits 3,
(a) 72 (b) 1800 2, 0, 4; 3, 2, 3 exceed one million are
(c) 360 (d) 900 (a) 720 (b) 360
(c) 480 (d) 420
101. The number of different arrangements of letters of
the word MAHARASHTRA are 109. In how many ways can 8 Indians, 4 Americans and
(a) 44100 (b) 88200 4 Englishman can be seated in a row so that all
11! 8! person of the same nationality sit together ?
(c) (d)
4! 2! 2! 2! 2! (a) 3 ! 8 ! (b) 3 ! 4 ! 8 ! 4 !
(c) 4 ! 4 ! (d) 8 ! 4 ! 4 !
102. The number of different arrangements of letters of
the word MAHARASHTRA such that letters R and 110. A bag has 5 red, 4 blue and 4 green marbles. If all
H never together are are drawn one by one and their colour are
(a) 44100 (b) 88200 recorded, the number of different arrangements are
11! 8! 12! 13!
(c) (d) (a) (b)
4! 2! 2! 2! 2! 5! 4! 5! 4! 4!
12! 13!
(c) (d)
103. The number of different arrangements of letters of 4! 4! 4! 4! 4! 4!
the word MAHARASHTRA such that all vowels
together are 111. A coin is tossed 8 times. The number of ways in
(a) 44100 which we obtain 4 heads and 4 tails are
(b) 88200 (a) 35 (b) 70
11! 8! (c) 105 (d) 140
(c) (d)
4! 2! 2! 2! 2!
112. A coin is tossed 8 times. The number of ways in
104. The number of arrangements of letters in the word which we obtain at least 6 heads are
CONSTITUTION that begin and end with N are (a) 37 (b) 36
12! 12! (c) 74 (d) 72
(a) (b)
2! 3! 2! 2! 2! 3!
10! 10! 113. A committee of 10 members sits around a table.
(c) (d)
2! 3! 2! 2! 2! 3! 2! The number of arrangements that have the
president and vice president together are
(a) 8 ! 2 (b) 9 ! 2
105. The number of distinct 5 digit numbers that can be
(c) 8 ! 2 ! (d) 9 ! 2 !
formed using the digits 3, 2, 3, 2, 4, 5 are
Permutations and Combinations 51
SURESH DANI AND SONS CLASSES
114. Eight men and six women sit around a table. The 121. Delegates from 24 countries participates in a round
number of seating arrangements will have no two table discussion. The number of seating
women together are arrangements where two specified delegates never
(a) 8 ! 8P6 (b) 7 ! 8P6 together are
(c) 8 ! 9P6 (d) 7 ! 9P6 (a) 2 22 ! (b) 21 ! 2 !
(c) 21 22 ! (d) 22 ! 2 !
115. The number of seating arrangements for 3 men and
3 women to sit around a table so that exactly two 122. Five men, two women and a child sit at a round
women are together, are table. The number of arrangements where the child
(a) 48 (b) 72 is seated between the two women are
(c) 120 (d) 168 (a) 240 (b) 480
(c) 4800 (d) 2400
116. Four objects in a set of ten objects are alike. The
number of ways of arranging them in a circular 123. Five men, two women and a child sit at a round
order are table. The number of arrangements where the child
10! 9! is seated between two men are
(a) (b)
4! 4! (a) 240 (b) 480
(c) 10 ! 4 ! (d) 9 ! 4 ! (c) 4800 (d) 2400
117. Fifteen persons sit around a table. The number of 124. The number of ways can 8 students be arranged at
arrangements that have two specified persons not a round table so that 2 particular students are
sitting side by side are together, if students are arranged with respect to
(a) 13 12 ! (b) 12 13 ! each other are
(c) 15 12 ! (d) 12 15 ! (a) 2880 (b) 1440
(c) 5040 (d) 10080
118. A party has 20 participants. The number of distinct
ways for the host to sit with them around a circular 125. The number of ways can 8 students be arranged at
table are a round table so that 2 particular students are
(a) 20 ! 2 ! (b) 18 ! 2 ! together, if students are arranged with respect to
(c) 21 ! (d) 20 ! table are
(a) 2880 (b) 1440
119. A party has 20 participants. The number of distinct (c) 5040 (d) 10080
ways have two specified persons oneither side of
the host around a circular table are 126. 6 gentlemen and 6 ladies sit around a table. If there
(a) 20 ! 2 ! (b) 18 ! 2 ! is no restriction, the number of such arrangements
(c) 21 ! (d) 20 ! are
(a) 6 ! 6 ! (b) 5 ! 6 !
120. Delegates from 24 countries participates in a round (c) 11 ! (d) 12 !
table discussion. The number of seating
arrangements where two specified delegates 127. 6 gentlemen and 6 ladies sit around a table. If no
always together are two ladies sit side by side, the number of such
(a) 2 22 ! (b) 21 ! 2 ! arrangements are
(c) 21 22 ! (d) 22 ! 2 ! (a) 6 ! 6 ! (b) 5! 6!
(c) 11 ! (d) 12 !
52 Permutations and Combinations
SURESH DANI AND SONS CLASSES
128. The number of ways for 15 people to sit around the 138. If nPr = 1814400 and nCr = 45, then n + 4Cr + 3 =
table so that no two arrangements have the same (a) 364 (b) 728
neighbors are (c) 546 (d) 1092
14! 15!
(a) (b)
2 2 139. If nCr x = 6435, nCr = 5005, nCr + x = 3003, then
r
(c) 14 ! (d) 15 ! C5 =
(a) 250 (b) 252
129. The number of ways in which 12 different flowers (c) 126 (d) 125
can be arranged in a garland so that 4 particular
flowers are always together are 140. If nC4 + nC5 + 12C6 + 13C7 = 14Cr, then r =
(a) 483840 (b) 967680 (a) 7 (b) 8
(c) 241920 (d) 120960 (c) 6 (d) 5
130. The number of necklaces of 12 bead each, can be 141. If 16C4 + 16C5 + 17C6 + 18C7 = 19Cr, then r =
made from 18 beads of different colours are (a) 7 (b) 12
1 18 1 18 (c) 15 (d) 7 or 12
(a) P12 (b) P12
2 12
1 18 1 18 142. If 2nC3 : nC2 = 52 : 3, then n =
(c) P12 (d) P12
24 48 (a) 8 (b) 7
(c) 15 (d) 14
131. 20
C16 19C19 =
(a) 19C4 (b) 19
C5 143. If 14C2r : 10C2r 4 = 143 : 10, then r =
(c) 20C4 (d) 20
C5 (a) 3 (b) 4
(c) 6 (d) 8
15
132. C4 + 15C5 =
(a) 15C5 (b) 15
C4 144. If nCr 1 : nCr : nCr + 1 = 14 : 8 : 3, then
(c) 16C5 (d) 16
C4 (a) n = 12, r = 6 (b) n = 12, r = 7
(c) n = 10, r = 6 (d) n = 10, r = 7
133. If nCn 2 = 15, then n =
(a) 7 (b) 6 145. The differences between the greatest values of 14Cr
(c) 5 (d) 4 and 12Cr is
(a) 2508 (b) 4356
134. If nPr = x nCr, then x = (c) 2580 (d) 4365
(a) (r 1) ! (b) 2r !
(c) (r + 1) ! (d) r! 146. The differences between the greatest values of 15Cr
and 11Cr is
135. If nC8 = nC6, then n = (a) 6897 (b) 5973
(a) 2 (b) 14 (c) 6898 (d) 5974
(c) 8 (d) 6
147. The differences between the greatest values of 11Cr
23 23
136. If C3n = C2n + 3, then n = and 8Cr is
(a) 6 (b) 7 (a) 382 (b) 392
(c) 4 (d) 5 (c) 522 (d) 532
137. If 21C6n = 21Cn2 + 5, then n = 148. The number of diagonals of an n-sided polygon are
(a) 4 (b) 2 (a) nC2 n (b) nC2 2n
(c) 3 (d) 1 (c) nC2 + n (d) nC2 + 2n
Permutations and Combinations 53
SURESH DANI AND SONS CLASSES
149. If 20 points marked on a circle, then the number of (c) n
C2 pC2 1 (d) n
C2 pC2 + 1
chords which can be drawn are
(a) 192 (b) 202 157. The number of triangles which can be formed by
(c) 190 (d) 200 joining the angular points of a polygon of 8 sides
as vertices are
150. There are 20 straight lines in a plane so that no two (a) 16 (b) 56
lines are parallel and no three lines are concurrent. (c) 24 (d) 8
The number of points of intersection are
(a) 200 (b) 400 158. There are n points in a plane. The number of
(c) 190 (d) 380 triangles obtained by joining these points if no
three points are collinear are
151. Ten points are plotted on a plane. The number of (a) pC3 (b) nC3
straight lines obtained by joining these points if no (c) pC3 pC3 (d) nC3 + pC3
three points are collinear are
(a) 45 (b) 46 159. There are n points in a plane. The number of
(c) 43 (d) 40 triangles lines obtained by joining these points if p-
points are collinear are
152. Ten points are plotted on a plane. The number of (a) pC3 (b) nC3
straight lines obtained by joining these points if (c) pC3 pC3 (d) nC3 + pC3
four points are collinear are
(a) 45 (b) 46 160. The number of triangles formed by joining 12
(c) 43 (d) 40 points, if no three points are collinear are
(a) 216 (b) 220
153. There are 12 distinct paints A, B. C, ..., L, ... in (c) 224 (d) 228
order, on a circle. Lines are drawn passing through
each pair of points. The total number of lines are 161. The number of triangles formed by joining 12
(a) 11 (b) 66 points, if four points are collinear are
(c) 220 (d) 55 (a) 216 (b) 220
(c) 224 (d) 228
154. There are 12 distinct points A, B. C, ..., L, ... in
order, on a circle. Lines are drawn passing through 162. There are 12 distinct points A, B. C, ..., L, ... in
each pair of points. The number of lines passing order, on a circle. Lines are drawn passing through
through D are each pair of points. The number of triangles
(a) 11 (b) 66 determined by lines are
(c) 220 (d) 55 (a) 11 (b) 66
(c) 220 (d) 55
155. There are n points in a plane. The number of
straight lines obtained by joining these points ifno 163. There are 12 distinct points A, B. C, ..., L, ... in
three points are collinear are order, on a circle. Lines are drawn passing through
(a) pC2 (b) nC2 each pair of points. The number of triangles having
(c) nC2 pC2 1 (d) nC2 pC2 + 1 vertex on C are
(a) 11 (b) 66
156. There are n points in a plane. The number of (c) 220 (d) 55
straight lines obtained by joining these points if
p-points are collinear are
(a) pC2 (b) nC2
54 Permutations and Combinations
SURESH DANI AND SONS CLASSES
164. Four parallel lines intersect another set of five (a) 52
C4 13C4 (b) 52
C4 + 13C4
parallel lines. The number of distinct (c) 52
C4 39C4 (d) 52
C4 + 39C4
parallelograms formed are
(a) 75 (b) 70 172. Four cards are drawn from a pack of 52 playing
(c) 80 (d) 60 cards. The number of ways in which three kings
and one queen can be drawn are
165. After a meeting, every participant shakes hands (a) 16 (b) 32
with every other participants. If the number of (c) 8 (d) 4
handshakes are 66, then the number of participants
in the meeting are 173. Four cards are drawn from a pack of 52 playing
(a) 12 (b) 11 cards. The number of ways in which three black
(c) 13 (d) 10 and one red cards can be drawn are
(a) 26C3 (b) 3 26C3
166. There are 20 stations from C.S.T. to THANE. The (c) 26
C3 C1
26
(d) 26C2 26C2
number of different types of second class monthly
season tickets must be printed in order that a 174. A word has 8 consonants and 3 vowels. The
passenger can purchase season ticket from any one number of distinct words that can be formed, if 4
station to another are consonants and 2 vowels are chosen, are
(a) 190 (b) 360 (a) 15120 (b) 30240
(c) 380 (d) 760 (c) 151200 (d) 302400
167. The number of arrangements of the letters of the 175. The number of quadratic equations that can be
word BANANA in which two N's do not appear formed using the numbers from 0, 2, 4, 5 as
adjacently. coefficients, if a coefficient can be repeated in an
(a) 80 (b) 60 equation are
(c) 40 (d) 100 (a) 96 (b) 48
(c) 64 (d) 24
168. Four cards are drawn from a pack of 52 playing
cards. The number of ways in which exactly one 176. The number of quadratic equations that can be
card of each suit can be drawn are formed with the coefficients 0, 5, 7, 9
(a) 133 (b) 134 (coefficientsmay be repeated in a quadratic
(c) 132 (d) 13 equation) are
(a) 48 (b) 24
169. Four cards are drawn from a pack of 52 playing (c) 16 (d) 12
cards. The number of ways in which all cards of
same suit can be drawn are 177. The number of five digit telephone numbers that
(a) 13C4 (b) 2 13C4 can be formed with the digits 0, 1, 2, ..., 9, if each
(c) 3 C413
(d) 4 13C4 number's first two digits are 35 and no digit
appears more than once are
170. Four cards are drawn from a pack of 52 playing (a) 168 (b) 336
cards. The number of ways in which all club cards (c) 56 (d) 42
can be drawn are
(a) 715 (b) 725 178. The number of six digit telephone numbers that
(c) 705 (d) 720 can be formed if first two digits are 45 and no digit
can appears more than once are
171. Four cards are drawn from a pack of 52 playing (a) 420 (b) 840
cards. The number of ways in which atleast one (c) 1680 (d) 3360
club card can be drawn are
Permutations and Combinations 55
SURESH DANI AND SONS CLASSES
179. Ten students are to be selected for a project from a 186. A question paper has two parts, A and B, each
class of 30 students. There are 4 students who want containing 10 questions. Student has to choose 8
to be together either in the project or not in the from part A and 5 from part B. In how many ways
project. The number of possible selections are can he choose the questions ?
(a) 230230 (b) 5081505 (a) 320 (b) 750
(c) 5311735 (d) 5541965 (c) 40 (d) 11340
180. A student finds 7 books of his interest, but can 187. The number of ways in which 5 male and 2 female
borrow only three books. He wants to borrow members of a committee can be seated arond a
Chemistry part II book only if Chemistry part I can round table so that two females are not seated
also be borrowed. The number of ways in which he together is
can choose three books that he wants to borrow are (a) 840 (b) 600
(a) 5 (b) 10 (c) 720 (d) 480
(c) 15 (d) 20
188. The number of ways of drawing 9 balls from a bag
181. From a class of 25 students 10 are to be chosen for that has 6 red balls, 8 green balls and 7 blue balls
a project work. There are 3 students who decide so that 3 balls of every colour are drawn are
that either all of them will join or none will join. (a) 32900 (b) 39200
The number of ways they can be chosen are (c) 31900 (d) 39100
(a) 22C7 (b) 22C10
(c) 22C7 22C10 (d) 22C7 + 22C10 189. The number of ways of dividing 20 objects in three
groups of sizes 8, 7 and 5 are
182. The number of ways can a boy invite his 5 friends 20! 20!
(a) (b)
to a party so that at least three join the party are 8! 7! 5! 7! 7! 5!
(a) 22 (b) 26 20! 20!
(c) (d)
(c) 10 (d) 16 8! 7! 6! 7! 7! 6!
183. The number of ways in which a can man invite 6 190. 30 objects are to be divided in three groups
friends to a party so that two or more of them containing 7, 10, 13 objects. The number of
remain present are distinct ways for doing so are
(a) 30 (b) 57 30! 30!
(a) (b)
(c) 20 (d) 7 7!10!13! 7!12!13!
30! 30!
184. A student passes an examination if he secure a (c) (d)
7!10!15! 7!12!15!
minimum in each of the 7 subjects. The number of
ways a student can fail are
191. A committee of 12 persons is to be formed from 9
(a) 147 (b) 294
women and 8 men. The number of ways in which
(c) 127 (d) 254
the committee has the majority of women are
(a) 2702 (b) 1134
185. The number of ways of selecting a team of 3 boys
(c) 1351 (d) 567
and 2 girls selected from 6 boys and 4 girls are
(a) 70 (b) 60
192. A committee of 12 persons is to be forrned from 9
(c) 170 (d) 120
women and 8 men. The number of ways in which
the committee has the majority of men are
(a) 2702 (b) 1.134
(c) 1351 (d) 567
56 Permutations and Combinations
SURESH DANI AND SONS CLASSES
193. A question paper has two sections. Section I and 199. A committee of 10 persons is to be formed from a
has 5 questions and section II has 6 questions. A group of 10 women and 8 men. The number of
student must answer at least two question from possible committees which have at least 5 women
each section among 6 questions he answers. The are
number of different choices does the student have (a) 6885 (b) 36873
in choosing questions are (c) 6895 (d) 36837
(a) 428 (b) 422
(c) 430 (d) 425 200. A committee of 10 persons is to be formed from a
group of 10 women and 8 men. The number of
194. There are 3 wicketkeeprs and 5 bowlers among 22 possible committees which have men in majority
cricket players. A team of 11 players is to be are
selected so that there is exactly one wicketkeeper (a) 6885 (b) 36873
and at least 4 bowlers in the team. The number of (c) 6895 (d) 36837
different team which can be formed are
(a) 51052 (b) 51051
(c) 51025 (d) 51015
195. Eight persons decided to go for a picnic into two
groups, one group to go by car and the other group
by train. The number of ways can this be done if
there must be at least 3 persons in each group are
(a) 182 (b) 126
(c) 112 (d) 70
196. A group consists of 9 men and 6 women. A team
of 6 is to be selected. The number of possible
selections in which there are at least 3 women are
(a) 2225 (b) 2325
(c) 2275 (d) 2375
197. There are 4 doctors and 8 lawyers in a panel. The
number of ways for selecting a team of 6, if at least
one doctor mujst be in the group are
(a) 888 (b) 886
(c) 898 (d) 896
198. Nine friends decide to go for a picnic in two
groups. One group decides to go by car and the
other group decides to go by train. The number of
different ways of doing so if there must be at least
3 -friends in each group are
(a) 9C3 + 9C4 + 9C5 + 9C6
(b) 9C2 + 9C3 + 9C4 + 9C5
(c) 9C4 + 9C5 + 9C6 + 9C7
(d) 8C3 + 8C4 + 8C5 + 8C6
Permutations and Combinations 57
SURESH DANI AND SONS CLASSES
ANSWERS 171 C 172 A 173 C 174 C 175 B
176 A 177 B 178 C 179 D 180 C
1 C 2 A 3 A 4 D 5 B
181 D 182 D 183 B 184 C 185 D
6 B 7 D 8 B 9 C 10 C
186 D 187 D 188 B 189 A 190 A
11 D 12 D 13 A 14 B 15 C
191 A 192 B 193 D 194 B 195 A
16 A 17 C 18 A 19 D 20 A
196 C 197 D 198 A 199 B 200 A
21 D 22 B 23 B 24 C 25 D
26 D 27 A 28 B 29 D 30 B
31 A 32 A 33 C 34 D 35 B
36 A 37 B 38 C 39 D 40 A
41 B 42 A 43 D 44 A 45 D
46 B 47 D 48 B 49 A 50 C
51 D 52 C 53 C 54 A 55 C
56 A 57 B 58 D 59 D 60 C
61 D 62 B 63 B 64 C 65 A
66 D 67 B 68 D 69 A 70 B
71 B 72 C 73 A 74 B 75 C
76 C 77 A 78 B 79 B 80 A
81 C 82 A 83 C 84 D 85 C
86 B 87 A 88 C 89 B 90 C
91 D 92 A 93 A 94 A 95 A
96 D 97 B 98 A 99 B 100 A
101 C 102 B 103 D 104 D 105 C
106 D 107 C 108 B 109 B 110 B
111 B 112 A 113 C 114 B 115 B
116 B 117 B 118 D 119 B 120 D
121 C 122 A 123 D 124 B 125 D
126 C 127 B 128 A 129 A 130 C
131 A 132 C 133 B 134 D 135 B
136 C 137 B 138 A 139 C 140 A
141 D 142 B 143 B 144 D 145 A
146 B 147 B 148 A 149 C 150 C
151 A 152 D 153 B 154 A 155 B
156 D 157 B 158 B 159 C 160 B
161 A 162 C 163 D 164 D 165 A
166 C 167 C 168 B 169 D 170 A
58 Permutations and Combinations
SURESH DANI AND SONS CLASSES
HINTS & SOLUTIONS : The tens place can be filled from any one of the
number from 0, 1, 2, ... 9 in 10 ways.
1. A student can select morning course in 5 ways. At units place there must be 4 and this is possible
A student can select evening course in 3 ways. in only one way.
The number of ways a student can select exactly Total number of numbers between 100 and 1000
one course, either in the morning or in the evening having 4 in the units place = 9 10 1 = 90
=5+3=8
7. Given digits are 2, 3, 4, 7.
2. Number of gates = 3. Between these given digits, the greatest number is
Number of stair cases from first floor to second possible when the digits are arranged in descending
floor = 4. order.
A student can enter to school in 3 ways. 7432 is the greatest number, formed from the digits
A student can go to class room on second floor in 4 2, 3, 4, 7.
ways. If repetition of digits is not allowed, then
Total required number of ways = 4 3 = 12 The thousands place can be filled from four digits
in 4 ways.
3. A student can select morning course in 7 ways. The hundreds place can be filled from remaining
A student can select evening course in 3 ways. three digits in 3 ways.
The number of ways a student can select exactly The tens place can be filled from remaining two
one course in the morning and one in the evening = digits in 2 ways.
7 3 = 21 The units place can be filled from remaining one
digits in 1 ways.
4. (d) Total required numbers = 4 3 2 1 = 24
5. Given digits are 0, 1, 3, 5, 6. 8. Total number of chocolates = 5
For a three digit number its hundreds place must be Total number of children = 4
free from digit 0. The first chocolate can be given to any of four
The hundreds place can be filled from any one of children in 4 different ways.
digit from 1, 3, 5, 6 in 4 ways. Similarly the remaining chocolates can be given.
After hundreds place is filled, then for units place 0 The total number of required ways
is added in the group. = 4 4 4 4 4 = 45 = 1024
If repetition of digits is allowed, then the units
place can be filled from all given 5 digits in 5 9. A letter lock contains 3 rings.
ways, the tens place can be filled from all given 5 Each ring contains 5 different letters.
digits in 5 ways. A lock can be opened in only one way.
The required numbers = 4 5 5 = 100 Total number of ways if repetition of letters is
If repetition of digit is not allowed, then the units allowed, then each of the 3 rings can be adjusted in
place from remaining 4 digit can be filled in 4 5 ways.
ways, the tens place from remaining 3 digit can be Maximum number of trials required to open the
filled in 3 ways. lock = 5 5 5 1 = 125 1 = 124
The required numbers = 4 4 3 = 48
10. True / false, type question can be answered in 2
6. Numbers between 100 and 1000 are three digit ways either by stating it true or false.
numbers. There are 2 ways of answering each of the 5
For a three digit number its hundreds place must be questions.
free from 0. Total number of different sequences of answers
The hundreds place can be filled from any one of = 2 2 2 2 2 = 32
the number from 1, 2, 3, ..., 9 in 9 ways.
Permutations and Combinations 59
SURESH DANI AND SONS CLASSES
Out of these 32 sequences of answers there is only (c) A three digit number using the digits 0, 1, 2, 5, 7, 8
one sequence of answering all the five questions with repetition.
correctly. The hundreds place can be filled from 1, 2, 5, 7, 8
But no student has stated all the correct answers in 5 ways.
and different students have given different The tens place and units place can be filled from 0,
sequence of answers. 1, 2, 5, 7, 8 in 6 ways each.
Total number of student appeared for the test Total required numbers = 5 6 6 = 180
= 32 1 = 31 Total required numbers = 3 + 24 + 180 = 207
11. Given digits are 2, 3, 7, 8. 13. Numbers between 100 and 1000 are three digit
Number less than 1000 which is even can be number.
formed in three different ways. For a three digit number its hundreds place must be
A one digit even number can be formed using free from 0.
digits 2 or 8 in 2 ways. To form a three digit numbers having exactly one
Total required numbers = 2 of the digit as 7, there are three different types
A two digit even number with 2 or 8 at its units
place. (a) Numbers in which 7 in units place but not in any
The units place can be filled with 2 or 8 in 2 way. other place.
The tens place can be filled from four digits in 4 In these numbers
ways. The hundreds place can be filled from digits 1 to 9
Total required numbers = 2 4 = 8 except 7 in 8 ways.
A three digit even number with 2 or 8 at its units The tens place can be filled from digits 0 to 9
place. except 7 in 9 ways.
The units place can be filled with 2 or 8 in 2 way. The units place have 7 in 1 way.
The tens place and hundreds place can be filled Total required numbers = 8 9 1 = 72
from four digits in 4 way each.
Total required numbers = 2 4 4 = 32 (b) Numbers in which 7 in tens place but not in any
Total required numbers = 2 + 8 + 32 = 42 other place.
In these numbers
12. Given digits are 0, 1, 2, 5, 7, 8. The hundreds place can be filled from digits 1 to 9
Numbers between 13 and 1000 are of three types, except 7 in 8 ways.
(a) A two digit number greater than 13 but less than The tens place have 7 in 1 ways.
20. The units place can be filled from digits 0 to 9
In these numbers, the tens place can be filled in 1 except 7 in 9 ways.
way, the units place can be filled from 5, 7, 8 in 3 Total required numbers = 8 1 9 = 72
ways.
Total required numbers = 1 3 = 3 (c) Numbers in which 7 in hundreds place but not in
any other place.
(b) A two digit number greater than 20 using the digits In these numbers
0, 1, 2, 5, 7, 8. The hundreds place have 7 in 1 way.
In these numbers the tens place can be filled from The tens place can be filled from digits 0 to 9
2, 5, 7, 8 in 4 ways, the units place can be filled except 7 in 9 ways.
from 0, 1, 2, 5, 7, 8 in 6 ways. The units place can be filled from digits 0 to 9
Total required numbers = 4 6 = 24 except 7 in 9 ways.
Total required numbers = 1 9 9 = 81
60 Permutations and Combinations
SURESH DANI AND SONS CLASSES
The total required type of numbers = 72 + 72 + 81 15. Given digits are 0, 1, 2, 3, 4, 5.
= 225 A five digit number divisible by 5 can be formed in
two different ways.
14. Given digits are 2, 3, 4, 5, 6.
Numbers greater than 400 can be 'formed in (a) A five digit number divisible by 5 with 0 at units
following different ways. place.
The units place can be filled with 0 in 1 way.
(a) A five digit using the digits 2, 3, 4, 5, 6. The ten thousands place can be filled from 1, 2, 3,
If repetition of digits is not allowed, then the units 4, 5 in 5 ways.
place can be filled from the digits 2, 3, 4, 5, 6 in 5 The thousands place can be filled from remaining 4
ways, the tens place can be filled from remaining 4 digits in 4 ways.
digits in 4 ways, the hundreds place can be filled The hundreds place can be filled from remaining 3
from remaining 3 digits in 3 ways, the thousands digits in 3 ways.
place can be filled from remaining 2 digits in 2 The tens place can be filled from remaining 2
ways and the ten thousands can be filled in 1 way. digits in 2 ways.
Total required numbers = 1 2 3 4 5 = 120 Total required numbers = 5 4 3 2 1 = 120
(b) A four digit using the digits 2, 3, 4, 5, 6. (b) A five digit number divisible by 5 with 5 at units
If repetition of digits is not allowed, then the units place.
place can be filled from the digits 2, 3, 4, 5, 6 in 5 The units-place can be filled with 5 in 1 way. The
ways, the tens place can be filled from remaining 4 ten thousands place can be filled from 1, 2, 3, 4 in
number in 4 ways, the hundreds place can be filled 4 ways.
from remaining 3 number in 3 ways and the After filling ten thousands place, digits remaining
thousands place can be filled from remaining 2 are three in which one more digit 0 is added.
number in 2 ways. The thousands place can be filled from 4 digits in 4
Total required numbers = 2 3 4 5 = 120 ways.
The hundreds place can be filled from remaining 3
(c) A three digit number greater than 400 using the digits in 3 ways.
digits 2, 3, 4, 5, 6 with 4 at hundreds place. The tens place can be filled from remaining 2
The hundreds place can be filled in 1 way. digits in 2 ways.
The tens place can be filled from the digits 2, 3, 5, Total required numbers = 4 4 3 2 1 = 96
6 in 4 ways. Total required numbers = 120 + 96 = 216
The units place can be filled from the remaining
three digits out of 2, 3, 5, 6 in 3 way. 16. 10! = 10 9 8 7 6 5 4 3 2 1 =
Total required numbers = 1 4 3 = 12 3628800
(d) A three digit number greater than 500 using the 17. (10 6)! = 4! = 4 3 2 1 = 24
digits 2, 3, 4, 5, 6.
The hundreds place can be filled from digits 5 or 6 18. (3 2)! = 6! = 6 5 4 3 2 1 = 720
in 2 ways.
The tens place can be filled from remaining 4 digit 12
19. ! 2! 2 1 2
in 4 ways. 6
The units place can be filled from remaining 3 digit
in 3 ways. 20. 10! 6! = (10 9 8 7 6 5 4 3 2 1)
Total required numbers = 2 4 3 = 24 (6 5 4 3 2 1)
Total required numbers = 120 + 120 + 12 + 24 = = 3628800 720 = 3628080
276
21. 3 ! 2 ! = (3 2 1) (2 1) = (6) (2) = 12
Permutations and Combinations 61
SURESH DANI AND SONS CLASSES
12! 12 11 10 9 8 7 6! (1 3 5...(2n 1))(1 2 3...n)(2n )
22. 665280
6! 6! n!
(1 3 5...(2n 1))(n!)(2n )
6! 4! 6 5 4! 4! 4!(6 5 1)
23. 30 10 n!
4! 4! 4!
= 2n (2n 1) (2n 3) … 5 3 1
9! 9 8 7 6!
24. 84 (2n 2)! (2n 2)(2n 1)(2n)!
3! 6! (3 2 1) 6! 33. (2n 2)(2n 1)
(2n)! (2n)!
= 2 (n + 1) (2n + 1)
9! 9! 9! 9!
25.
3! 6! 4! 5! 3! 6! 4! 5! (n 3)! (n 3)(n 2)(n 1)! n 3
9! 4 9! 6 9! 4 9! 6 34.
2
(n 4)(n 1)! (n 2)(n 2)(n 1)! n 2
4 3! 6! 4! 6 5! 4! 6! 4! 6!
(4 6) 9! 10 9! 10! 10!
35. n (n! + (n 1) !) + n2 (n 1) ! + (n + 1) !
4! 6! 4! 6! 4! 6! 4! 6!
= n (n (n 1) ! + (n 1) !) + n2 (n 1) ! + (n + 1) !
= n (n 1) ! (n + 1) + n2 (n 1) ! + (n + 1) !
12! 12! 12! 12! = n (n 1) ! (n + 1) + n2 (n 1) !
26.
5! 7! 6! 6! 5! 7! 6! 6! + (n + 1) n (n 1) !
12! 12! 12! 1 1 = n (n 1) ! (n + 1 + n + n + 1) = n ! (3n + 2)
5! 7 6! 6 5! 6! 5! 6! 7 6
(6 7) 12! 13 12! 13! 13! n 2 3n 1 n 2 3n 1
36.
6 5! 7 6! 6! 7! 6! 7! 6! 7! n! (n 1)! n! (n 1)(n)!
(n 1)(n 2) (3n 1) n 2 n 2n 2 3n 1
27. 5 10 15 20 = 5 1 5 2 5 3 5 4 (n 1)(n)! (n 1)!
= 54 1 2 3 4 = 54 4 ! n2 1
(n 1)!
28. 3 6 9 12 15
=3132333435
1 1 n 1 1 n
= 35 1 2 3 4 5 = 35 5 ! 37.
(n 1)! (n 1)! (n 1)! (n 1)(n)(n 1)!
1 2 3 4 5 6 7 8 9 9! n(n 1) 1 n n2 n 1 n n2 1
29. 6 7 89
1 2 3 4 5 5! (n 1)(n)(n 1)! (n 1)! (n 1)!
n! 12! 1 1 1 1 1
30. 1 38.
r!(n r)! 12! (12 12)! 0! 1 n! (n 1)! (n 2)!
1 1 1
31.
n!
15!
15! n(n 1)(n 2)! (n 1)(n 2)! (n 2)!
r!(n r)! 10! )! 10! 5! 1 1 1
15 14 13 12 11 10! 1
7 13 3 11 3003 (n 2)! n(n 1) n 1
10! 1 2 3 4 5
1 1 n n(n 1 1 n n 2 n
(n 2)! n(n 1) n(n 1)(n 2)!
(2n)! 1 2 3 4 5 6...(2n 1)(2n)
32. 1 n2 (1 n)(1) 1 n
n! n!
(1 3 5...(2n 1))(2 4 6...2n) n(n 1)(n 2)! n(1 n)(n 2)! n(n 2)!
n!
62 Permutations and Combinations
SURESH DANI AND SONS CLASSES
1 3 n 2 10 (15 n)! (15 n)(14 n)(13 n)!
39. 45. 12 12
n! (n 1)! (n 2)! (13 n)! (13 n)!
1 3 n 2 10 (15 n) (14 n) = 4 3
(15 n) (14 n) = (15 11) (14 11)
n! (n 1)(n)! (n 2)(n 1)(n)!
n = 11
(n 2)(n 1) 3(n 2) n 2 10
(n 2)(n 1)(n)! n 3 1! n 3 1
46.
2 2
n n 2n 2 2 3n 6 n 10 6 8! 6! 4! 8 7 6 5 4! 6 5 4! 4!
(n 2)! (n 2)! n 1 1 1
1
8 7 3 10 4! 4! 10
n2 9 n 1 11
40.
6
1
(4 3)! (n 2)! (n 1)! 8 7 3 10 10
n = 11 8 7 3 = 1848
n2 9 6 1
(n 3)(n 2)(n 1)! (n 2)(n 1)! (n 1)! n 4 3 4 3 1
2 47. 3
n 9 6(n 3) (n 3)(n 2) 6! 8! 6! 8 7 6! 6! 6! 14
(n 3)(n 2)(n 1)! 43
n
n 2 9 6n 18 n 2 2n 3n 6 14
(n 3)(n 2)(n 1)!
1! 1! 4
n 3 1 1 48.
n! 4! 5!
(n 3)(n 2)(n 1)! (n 2)(n 1)! (n 2)!
n 5 4 5 4 54 1
n! 5 4! 5! 5! 5! 5! 5!
n! n! n!=5!n=5
41.
r!(n r)! (r 1)!(n r 1)!
n!
n! n! 5!(n 7)! 1
49.
r(r 1)!(n r)! (r 1)!(n r 1)(n r)! 3!(n 3)1 n! 6
n!(n r 1 r) 5 4 3!(n 7)! 1
r(r 1)!(n r 1)(n r)! 3!(n 3)(n 4)(n 5)(n 6)(n 7)! 6
(n!)(n 1) (n 1)! 5 4 1
(r 1)!r(n r)!(n r 1) r!(n r 1)! (n 3)(n 4)(n 5)(n 6) 6
6 5 4 = (n 3) (n 4) (n 5) (n 6)
42. (n + 1) ! = 42 (n 1) ! (n 3) (n 4) (n 5) (n 6) = 5 4 3 2
(n + 1) (n) (n 1) ! = 42 (n 1) ! = (8 3) (5 4) (5 5) (5 6)
n (n + 1) = 42 = 6 7 = 6 (6 + 1) n=8
n=6
(2n)! 4!(n 4)!
50. 24
43. (n + 3) ! = 110 (n + 1) ! 7!(2n 7)! n!
(n + 3) (n + 2) (n + 1) ! = 110 (n + 1) ! (2n)(2n 1)(2n 2)(2n 3)(2n 4)
(n + 3) (n + 2) = 110 = 11 10 = (8 + 3) (8 + 2) (2n 5)(2n 6)(2n 7)!
n=8
7 6 5 4!(2n 7)!
(4!)(n 4)!
44. (n + 6) ! = 56 (n + 4) ! 24
n(n 1)(n 2)(n 3)(n 4)!
(n + 6) (n + 5) (n + 4) ! = 56 (n + 4) !
(2n)(2n 1)(2(n 1))(2n 3)
(n + 6) (n + 5) = 8 7 = (2 + 6) (2 + 5)
(2(n 2))(2n 5)(2(n 3))
n=2
765
Permutations and Combinations 63
SURESH DANI AND SONS CLASSES
1 Let m + n = x and m n = y
24
n(n 1)(n 2)(n 3) x
P2 = 56 and yP2 = 12
(2)(2n 1)(2)(2n 3)(2)(2n 5)(2)
x!
56 and
y!
12
24
765 (x 2)! (y 2)!
16 (2n 1) (2n 3) (2n 5) = 24 7 6 5 x(x 1)(x 2)! y(y 1)(y 2)!
56 and 12
(2n 1) (2n 3) (2n 5) = 3 7 3 5 (x 2)! (y 2)!
=975 x (x 1) = 56 and y (y 1) = 12
= (10 1) (10 3) (10 5) x (x 1) = 8 7 and y (y 1) = 4 3
2n = 10 n = 5 x (x 1) = 8 (8 1) and y (y 1) = 4 (4 1)
x = 8 and y = 4
(n 1)!
51. (n r 1) (n 1) Pr (n 1 r) m+n=8 ... (i)
(n 1 r)! mn=4 ... (ii)
(n 1)(n!) n! Adding (i) and (ii), we get
(n r 1) (n 1)
(n r 1)(n r)! (n r)! m + n = m n = 8 + 4 2m = 12 m = 6
= (n + 1) nPr From (i), we get
6+n=8n=2
n n! n!
52. P5 42 n P3 42
(n 5)! (n 3)! 56. (a)
1 42
(n 5)! (n 3)(n 4)(n 5)! 57. Total English alphabets = 26
(n 3) (n 4) = 7 6 = (10 3) (10 4) Number of digits = 9
n = 10 In a code, first place is filled from 26 alphabets in
26 ways, second place is filled from 25 alphabets
n in 25 ways, third place is filled from 9 digits in 9
P6 120
53. n P6 120 n P3 ways and fourth place is filled from 8 digits in 8
n 1
P3
ways.
n! n!
120 (n 3)! 120(n 6)! Total number of such codes
(n 6)! (n 3)! = 26 25 9 8 = 46800
(n 3) (n 4) (n 5) (n 6) ! = 120 (n 6) ! A code end with an even integer if its fourth place
(n 3) (n 4) (n 5) = 6 5 4 have even integer
= (9 3) (9 4) (9 5) Fourth place is filled from even integers 2, 4, 6, 8
n=9 in 4 ways
Third place is filled from remaining 8 integers in 8
56
Pr 6 30800 ways
54. 56
Pr 6 : 54Pr 3 30800 :1
54 1 First place and second place are filled in 26 and 25
Pr 3
ways respectively
56 54
Pr 6 30800( Pr 3 )
Total number of such codes
56! 54!
30800 = 26 25 8 4 = 20800
(65 r 6)! (54 r 3)!
56 55 54! 54!
30800 58. Total number of lamps = 12
(50 r)! (51 r)! Hall is not illuminated if all lamps are off.
1 10 Total number of ways in which the hall is
(50 r)! (51 r)(50 r)! illuminated = 212 1 = 4096 1 = 4095
51 r = 10 r = 41
59. Number of letters = 5, Number of post boxes = 3
(m + n) (m n)
55. Here P2 = 56 and P2 = 12
64 Permutations and Combinations
SURESH DANI AND SONS CLASSES
As each box is eligible to have 5 letters, then each 12 boys can be arranged in 12 places in 12P12 ways.
5 letters can be posted in 3 different boxes. 6 girls can be arranged in any 6 out of 13 places in
Number of required ways = 35 = 243 13
P6 ways.
Total number of arrangements
60. 4 boys and 3 girls can be seated in a row so that = 1 ! 6P6 12P12 13P6
they are alternate as B G B G B G B 13! 6! 12! 13! 12!
1 6! 12!
4 boys can seat in 4 places in 4 ! ways. 7 6! 7
3 girls can seat in 3 places in 3 ! ways.
Required number of arrangements 64. (c)
= 4 ! 3 ! = 24 6 = 144
65. Total number of distinct objects = 11
61. (d) One specified object always occur in 4 places in 4
ways.
62. Total number of brothers = 3 Remaining 3 objects out of 10 occurs in 10P3 ways.
Total number of sisters = 5 Total number of required arrangements
3 brothers which are always together form a single 10!
4 10 P3 4 4 10 9 8 2880
set. 7!
This single unit and 5 sisters form 1 + 5 = 6 If one specified object never occur, then the 4
different units. objects out of 10 occurs in 10P4 ways.
These 6 units can be arranged themselves in 6P6 Total number of required arrangements
ways. 10!
10 P4 10 9 8 7 5040
3 brothers can be arranged themselves in 3P3 ways. 6!
Total number of ways arranging 3 brothers always
together with 5 sisters 66. Number of English books = 2, Number of Physics
= 6P6 3P3 = 6 ! 3 ! = 720 6 = 4320 books = 3, Number of Mathematics books = 4
If no 2 brothers are never together, then there are 6 English books can be arranged themselves in 2P9 =
places for them to arrange, 4 places between the 5 2 ! = 2 ways.
sisters and 2 at each end. Physics books can be arranged themselves in
3
5 sisters can be arranged themselves in 5P5 ways. P3 = 3 ! = 6 ways.
3 brothers can be arranged in 6P3 ways. Mathematics books can be arranged themselves in
4
Total number of such arrangements P4 = 4 ! = 24 ways.
6! Books of three subject can be arranged themselves
= 5P5 6P3 = 5 ! 6P3 = 120 = 120 120
3! in 3P3 = 3 ! = 6 ways.
= 14400 The number required numbers = 2 6 24 6
= 1728
63. Total number of teachers = 6,
Total number of boys = 12, 67. Total number of questions = 6
Total number of girls = 6 Every question is solved or not solved.
All teachers and the principal are to be seated in Total number of required ways
first row. = 26 1 = 64 1 = 63
All students are to be seated in second row.
The middle sit of first row is reserved for the 68. 8 examination papers not including the best and
principal which is arranged in 1 ! way. worst papers can be arranged in 8 ! ways
6 teachers can seat in 6 places in 6P6 ways. There are 9 places for the best and worst papers.
Seating arrangement of students is done in such a The best and worst papers" can be arranged in
way that no two girls are together. these 9 places in 9P2 ways
There are 11 places available for 6 girls between Required number of arrangements
12 boys and 2 places at two ends. = 8! 9P2 = 8! 9 8 = 9! 8
Permutations and Combinations 65
SURESH DANI AND SONS CLASSES
69. Total number of examination papers = 7 75. Total number of symmetric letters = 11
If papers 6 and 7 are never together, then there are Total number of passwords that can be formed by
6 places for them to arrange, 4 places between the choosing any 3 letters from 11 symmetric letters =
5 papers and 2 at each end. 11
P3 = 11 10 9 = 990
5 papers can be arranged themselves in 5P5 ways.
Papers 6 and 7 can be arranged in 6P2 ways. 76. (c)
Total number of such arrangements
77. (a)
5P5 6 P2 5! 6 P2 120 120 30 3600
78. Given word is WORLD which has 5 different
70. Given digits are 3, 4, 5, 6, 7, 8, 9. letters.
Odd digits are 3, 5, 7, 9 which are 4. The number of different arrangements of the word
Even digits are 4, 6, 8 which are 3. WORLD = 5P2 = 5 ! = 120
The odd places are 1st, 3rd, 5th, 7th. The first letter R can be arranged in 1 way while
4 odd digits occupy odd places in 4 ! = 24 ways. remaing four letters can be arranged themselves in
4
3 even digits occupy even places in 3 ! = 6 ways. P4 ways
Total number of required arrangements The number of different arrangements of the word
= 24 6 = 144 WORLD which begin with the letter R
= 1 4P4 = 1 4 ! = 24
71. Given digits are 0, 1, 2, 3, 4, 5 Three letters out of five can be arranged in 5P3
Number of given digits = 6 ways
The numbers between 100 and 1000 have three The number of different arrangements made using
digits. three letters of the word WORLD
The hundreds place can be filled from digits other 5! 5 4 3 2!
5P3 60
than 0 in 5P1 ways. (5 3)! 2!
Now 5 digits are left including 0.
The Tens and units place are filled in 5P2 ways. 79. (b)
Total number of three digit numbers
5! 5 4 3!
5P1 5P2 5 5 5 5 4 100 80. Given word is REMAIN which has 6 distinct
3! 3! letters A, E, I, M, N, R.
Total number of words = 6P6 = 6 ! = 720
72. (c) The words beginning with AE are 4 ! = 24
The words beginning with AIE are 3 ! = 6
73. (a) The words beginning with AIM are 3 ! = 6
The words beginning with AINE are 2 ! = 2
74. Given digits are 3, 4, 5, 6, 7, 8. Total number of these words = 24 + 6 + 6 + 2 = 38
Number of given digits = 6 39th word is AINMER
The number of six digit numbers using given 6 40th word is AINMRE
digits = 6P6 = 6 ! = 720
Any number is divisible by 5 if its units place 81. The dictionary order of the word BRONZE is B, E,
have 5. N, O, R, Z
The units place is filled with 5 in 1 way. The words beginning with BE are 4 ! = 24
Remaining 4 digits are filled using remaining 5 The words beginning with BN are 4 ! = 24
digits in 5P5 ways. The words beginning with BO are 4 ! = 24
The numbers divisible by 5 = 1 5P5 The words beginning with BRE are 3 ! = 6
= 1 5! = 120 The words beginning with BRN are 3 ! = 6
The numbers not divisible by 5 = 720 120 = 600
66 Permutations and Combinations
SURESH DANI AND SONS CLASSES
The words beginning with BROE are 2 ! = 2 = 5P5 2P2 = 5 ! 2 ! = 120 2 = 240
The words beginning with BRONE are 1 ! = 1 If a word end in ST, then
Total number of these words The remaining first 5 letters can arranged
= 24 + 24 + 24 + 6 + 6 + 2 + 1 = 87 themselves in 5P5 ways.
The rank of the word BRONEZ Total number of such arrangements
= 87 + 1 = 88 = 5P5 = 5 ! = 120
If a word begin with S and end with T, then the
82. (a) remaining 5 letters between them can arranged
themselves in 5P5 ways.
83. (c) Total number of such arrangements
= 5P5 = 5 ! = 120
84. (d)
88. Given word is SOLAPUR which has 7 distinct
85. (c) letters.
The number of vowels (A, O, U) are 3.
86. (b) The number of consonants (S, L, P, R) are 4.
The relative positions of vowels and consonants
87. Given word is HISTORY which has 7 distinct are not changed means the vowels can take the
letters. place of vowels and consonants can take the place
The number of vowels (I, O) are 2. of consonants.
The number of consonants (H, S, T, R, Y) are 5. 3 vowels can be arranged among themselves in 3P3
Letters Y and T always together form a single set. ways.
This single unit and remaining 5 letters form 1 + 5 4 consonants can be arranged among themselves in
4
= 6 different units. P4 ways.
These 6 units can be arranged themselves in 6P6 The number of required arrangements
ways. = 3P3 4P4 = 4 ! 3 ! = 24 6 = 144
Letters Y and T can be arranged themselves in 2P2
ways. 89. Given word is COMBINE which has 7 distinct
Total number of ways arranging Y and T together letters.
with other 5 letters Number of permutations = 7P7 = 71 = 5040
= 6P6 2P2 = 6 ! 2 ! = 720 2 = 1440
There are seven places in a word. 90. Total number of letters = 3R + 2S + 2T = 7
If Y is always next to T, then consider TY as a Total number of words formed from these letters
single unit in which their position is fixed. 7! 7 6 5 4 3!
210
Remaining 5 letters and a unit of TY can be 3! 2! 2! 3! 2 1 2 1
arranged in 6P6 ways.
Total number of such arrangements 91. (d)
= 6P6 = 6 ! = 720
When there is no restriction, then the 7 letters can 92. Given word is INDIA which has 5 letters of which
be arranged themselves in 7P7 ways. 2 are I
Total number of such arrangements If two I's are together, then there are 5 2 + 1 = 4
= 7P7 = 7 i = 5040 letters
If a word begin and end with vowel, then These 4 letters can be arranged in 4 ! ways
The 2 vowels at the begining and end can arranged 2!
Two I's can be, arranged themselves in ways
themselves in 2P2 ways. 2!
5 consonants between the vowels can arranged Total number of different words formed so that 2
themselves in 5P5 ways
I's are together = 4! 24
Total number of such arrangements
Permutations and Combinations 67
SURESH DANI AND SONS CLASSES
If N and A are together, then there are 5 2 + 1 = 97. (b)
4 letters
4! 98. Given word is ARRANGE which has 7 letters of
These 4 letters can be arranged in ways
2! which 2 are A, 2 are R.
N and A can be arranged themselves in 2 ! ways Total number of arrangements
Total number of different words formed so that N 7! 7 6 5 4 3 2!
1260
4!
and A are together = 2! 24 2! 2! 2 1 2!
2! If 2 R and 2 A occur together, then there are 7 2
2 + 1 = 5 letters.
93. First we arrange the words which begin with A 5!
These 5 letters can be arranged in 30
There are 4 other letters, all distinct to follow A to 2! 2!
form different words. These can be arranged in 4 !
ways.
= 24 ways. Hence there are 24 words which begin
Total number of arrangements with two R's as well
with A
as two A's do not occur together
The words beginning with A will be followed by
= 1260 30 = 1230
those which begin with G. If G is fixed in first
place, there are four letter including 2 A's to be
99. (b)
4! 4 3 2!
arranged. These are arranged in 12
2! 2!
100. Given word is PLATOON which has 7 letters of
ways. Hence there are 12 words which begin with
which 2 are O.
G
Vowels are (A, O, O) 3.
As 24 words begin *with A and 12 begin with G,
Consonants are (P, L, T, N) 4.
then the 37th wordbegin with I. There are
If two O's are never together, then 5 (P, L, A, T, N)
4! 4 3 2!
12 words which begin with I can be arranged in 5 ! = 120 ways.
2! 2!
Two O's can be arranged in 6 places in 6P2 ways.
When the word beginning with I are written, there
Total number of way of arranging two O's
are 48 words in the list. The 49th word begin with 6
P2 6! 6 5 4!
N and is NAAGI and the 50th word is NAAIG 15
2! 4! 4! 2
94. Given word is MUMBAI which has 6 letter of Total number of words with no two O's together
which 2 are M. = 120 15 = 1800
If B is always next to A, then there are 6 2 + 1 = If consonants and vowels occupy alternate
5 letters. positions, then 4 consonants must occupy odd
5! 5 4 3 2! places and 3 vowels must occupy even places 3
Number of such words = 60
2! 2! 3!
vowels with 2 O's can be arranged in ways
2!
95. (a) 4 consonants can be arranged in 4P4 = 4 ! ways.
Total number of required words
3! 6
96. Given word is INDIAN which has 6 letters of 4! 24 72
which 2 are I and 2 are N. 2! 2
Total number of different words formed from these
6! 720 101. (c)
letters = 180
2! 2! 2 2
If two N's are together, then there are 6 2 + 1 = 5 102. (b)
letters.
5! 120 103. Given word is MAHARASHTRA which has 11
Total number of required words = 60 letters of which 4 are A and 2 are H, 2 are R.
2! 2
68 Permutations and Combinations
SURESH DANI AND SONS CLASSES
Total number words formed with these letters Any number is divisible by 4 if its last two digits
11! are 24, 52, 64, 92, 96
4! 2! 2! Total number of 6 digit numbers divisible by 4
Other than 2 R and 2 H there 7 letters which are 1 = 5 4 ! = 5 24 = 120
M, 4 A, 1 S, 1 T.
7! 108. Given digits 3, 2, 0, 4, 3, 2, 3 which are 7 of which
These 7 letters can be arranged in 210 ways.
4! two are 2, three are 3.
If R and H are never together, then there are 8 Any number greater than a million will contain all
places for them to arrange the seven digits.
Total number of such arrangements The number of ways of arranging these 7 digits
4! 7! 7 6 5 4 3!
8C4 420 420
2! 2! 2! 3! 2 1 3!
Total number of required words = 210 420 = These arrangements also include those numbers
88200 which contain 0 at the million place.
Total number of vowels = 4 (4 A) Keeping 0 fixed at the millionth place, we have 6
If all vowels are together, then there are 11 4 + 1 digits.
= 8 letters. The number of ways of arranging these 6 digits
These 8 letters can be arranged in 8 ! ways. 6! 6 5 4 3!
60
4! 2! 3! 2 1 3!
Vowels can be arranged themselves in 1 way.
4! The number of required numbers = 420 60 = 360
Total number of words with vowels always
8! 109. 8 Indians can seat in 8 places in 8 ! ways.
together =
2! 2! 4 Americans can seat in 4 places in 4 ! ways.
4 Englishman can seat in 4 places in 4 ! ways.
104. Given word is CONSTITUTION which has 12 These three groups can be arranged themselves in
letters of which 2 are O, 2 are N, 3 are T, 2 are I. 3 ! ways.
If a word start and end with letter N, then there are Required number of arrangements
10 letters to be arranged of which 2 are O, 3 are T, =8 ! 4 ! 4 ! 3 !
2 are I
10! 110. Total number of marbles = 5 Red + 4 Blue + 4
Total number of such arrangements =
2! 3! 3! Green = 13
The total number of arrangements of drawing all
105. Given digits are 3, 2, 3, 2, 4, 5 which are 6 of 13!
marbles =
which' 3 and 2 are occured twice. 5! 4! 4!
Total number of 6 digit distinct numbers
6! 6 5 4 3 2! 111. A coin is tossed 8 times
180
2! 2! 2 1 2! The number of ways of getting 4 heads and 4 tails
after tossing a coin 8 times
106. (d) 8! 8 7 6 5 4!
70
4! 4! 4 3 2 1 4!
107. Given number is 659942 which has 6 digits
Out of these even digits (6, 4, 2) are 3 and odd 112. A coin is tossed 8 times
digits (5, 9, 9) are 3. The number of ways of getting at least 6 heads
Digit 9 is occured twice. after tossing a coin 8 times
Total number of 6 digit numbers 8! 8! 8! 8 7 6! 8 7! 1
6! 6 5 4 3 2! 6! 2! 7! 1! 8! 0! 6! 2 1 7! 1 1
360
2! 2! = 28 + 8 + 1 = 37
Permutations and Combinations 69
SURESH DANI AND SONS CLASSES
113. Total number of members = 10 Two persons can be arranged side by side among
In these 10 members, there is one president and themselves in 2 ! ways.
one vice president. The number of ways in which two particular
If president and vice president sit together, then persons can be arranged side by side with
there are 9 members to be arranged. remaining 13 persons at a circular table = 2 ! 13 !
The number of ways in which these 9 members can The number of arrangements so that two particular
be arranged around a table = (9 1) ! = 8 ! persons amongst 15 are not to be side by side at a
The president and vice president can be arranged circular table = The number of ways in which 15
themselves in 2 ! ways. persons can be arranged at a circular table The
Total number of required arrangement = 8 ! 2 ! number of ways in which two particular persons
can be arranged side by side with remaining 13
114. Total number of men = 8 persons at a circular table
Total number of women = 6 = 14 ! 2 ! 13 ! = 14 13 ! 2 13 !
The number of ways in which 8 men can sit around = (14 2) 13 ! = 12 13 !
a table = (8 1) ! = 7 !
For no two women to sit together, then they have 8 118. (d)
places.
6 women can sit in 8 places in 8P6 ways 119. Number of persons invited by a host = 20
Total number of required arrangements = 7 ! 8P6 Total number of persons = 21
The number ways they can sit at a circular table
115. Number of men = 3, Number of women = 3 = (21 1) ! = 20 !
3 men around a table can sit in 2 ! ways. If two specified persons sit on either side of the
2 women out of 3 can sit in 3P2 ways. host, then the remaining 18 persons can be seated
A group of selected 2 women and one remaining in 18 ! ways.
women can be arranged in 3 gaps in 3P2 x 2 ! ways Two specified persons can sit among themselves in
The required number of ways 2 ! ways.
= 3 2! 3P2 2! = 3 2 6 2 = 72 Total number of required arrangements = 18 ! 2 !
116. Let the required number of arrangements be x. 120. (d)
Consider one of these x arrangements.
If in this arrangement, 4 alike objects are replaced 121. Total number of delegates = 24
by 4 different objects, then these 4 objects can be The number of ways in which these 24 delegates
arranged amongst themselves in 4 ! ways. can sit around a table = (24 1) ! = 23 !
As one arrangement will give rise to 4 ! If two specified delegates are always together, then
arrangements, then x arrangements will give rise to there are 22 delegates.
x (4 !) arrangements. The number of ways in which these 22 delegates
If all the 10 objects are different, then the number and a unit of two specified delegates can sit around
of circular arrangements are 9 ! a table
9! = (23 1) ! = 22 !
x (4!) 9! x
4! Two particular delegates can sit among themselves
in 2 ! ways.
117. Total number of persons = 15 Total number of ways of seating arrangements
The number of ways in which 15 persons can be such that two particular always together
arranged at a circular table = (15 1) ! = 14 ! = 22 ! 2 !
If two particular persons are side by side, then the Total number of seating arrangements such that
remaining 13 persons can be arranged in 13 ! ways. two particular delegates never together = Total
70 Permutations and Combinations
SURESH DANI AND SONS CLASSES
number o,f seating arrangements Total number 126. (c)
of seating arrangements with two particular
delegates always together 127. Total number of persons = 6 gentlemen + 6 ladies
= 23 ! 22 ! 2 ! = 23 22 ! 22 ! 2 = 12
= (23 2) 22 ! = 21 22 ! The number of arrangements of 12 persons around
a table without any restriction = (12 1) = 11 !
122. (a) The number of ways in which 6 gentlemen can be
seated around a table = (6 1) = 5 !
123. Total number of men = 5, Total number of women If no two ladies sit side by side, then there are 6
= 2, Total number of child = 1 places for 6 ladies when 6 gentlemen are arranged
The number of ways in which a group of women around a table.
and five men can sit at a circular table Corresponding to each seating arrangement for the
= (6 1) ! = 5 ! gentlemen, the 6 ladies can be seated in 6 ! ways.
Two women can sit among themselves in 2 ! ways. The required number of arrangements = 5 ! 6 !
A child can sit between two women in 1 ! way.
Total number of required arrangements 128. Total number of people = 15
= 5 ! 2 ! 1 ! = 120 2 = 240 As the people are not to have two neighbors
Two men can be selected from 5 men in 10 ways. clockwise and anticlockwise arrangements will be
Two men can sit on either side of child in 2 ! ways. treated identical.
A child and two men are considered as a unit. Total number of required arrangements
This unit can be arranged with remaining 3 men 1 14!
(15 1)!
and 2 women around a roundf table in (6 1) = 5 ! 2 2
ways.
Total number of required arrangements 129. Total number of flowers = 12
= 10 2 ! 5 ! = 10 2 120 = 2400 If four particular flowers are always together, then
there are 8 flowers.
124. (b) The number of ways in which these 8 flowers and
a unit of two particular flowers can be arranged in
125. Total number of students = 8 8 ! ways.
If two particular students are always together, then Four particular flowers can can be arranged in 4 !
there are 6 students. ways.
The number of ways in which these 6 students and Total number of required arrangements
a unit of two particular students can sit around a 1 1
8! 4!) (40320 ) 483840
table = (7 1) ! = 6 ! 2 2
Two particular students can sit among themselves
in 2 ! ways. 130. Total number of beads = 18
Total number of ways of seating arrangements Each necklace has 12 bead.
such that two particular students always together, if As clockwise and anticlockwise arrangements will
students are arranged with respect to each other = 6 be treated identical.
! 2 ! = 720 2 = 1440 Total number of required arrangements
The number of ways in which these 6 students and 1 18 1
P12 18P12
a unit of two particular students can be arranged in 2 12 24
7 ! ways.
20! 19
Total number of ways of seating arrangements 131. 20 C16 19C16
such that two particular students always together, if 16!(20 16)! 16!(19 16)!
students are arranged with respect to table = 7 ! 2 20! 19! 20 19 19! 19!
(5 1)
! = 5040 2 = 10080 16! 4! 16!3! 16!4 3! 16! 3! 16! 3!
Permutations and Combinations 71
SURESH DANI AND SONS CLASSES
n 4
19!
(4)
19!
19!
19! Cr 3 104C83 14C11
16 15! 3! 15! 4 3! 15! 4! 15! (19 15)! 14! 14! 14 13 12 11!
364
= 19C15 = 19C4 11!(14 11)! 11! 3! 11! 3 2 1
15
132. C4 + 15C5 = 15C5 + 15C4 = 15C5 + 15C5 1 n n
Cr 1 6435 Cr 1 9
= 15C5 + 15C4 = 15C4 + 15C5 = 16C5 139.
n 5005 n 7
Cr Cr
133. Cn 2 = 15 nCn (n 2) = 15 nCn n + 2 = 15
n 7 ( Cr 1) = 9 (nCr)
n
n! n(n 1)(n 2)! n! n!
n
C2 15 15 15 7 9
2!(n 2)! 2(n 2)! (r 1)!(n r 1)! r!(n r)!
n (n 1) = 30 = 6 5 = 6 (6 1)
7
9
n=6 (r 1)!(n r 1)(n r)! r(r 1)!(n r)!
7 9
7r = 9n 9r + 9
n n P n n r 1 r
134. Pr x Cr x r x r! 16r 9n = 9 … (i)
r!
n n
Cr 5005 Cr 5
135. Given nC8 = nC6 n 3003 n
Cr 1 Cr 1 3
Here x = 8, y = 6 and n = n 3(n Cr ) 5(n Cr 1 )
8 = 7x 6 14 = n
n! n!
3 5
r!(n r)! (r 1)!(n r 1)!
136. Given 23C3n = 23C2n + 3
3 5
Here x = 3n, y = 2n + 3 and n = 23
3n = 23 2n 3 5n = 20 n = 4 r!(n r)(n r 1)! (r 1)r!(n r 1)!
3 5
3r + 3 = 5n 5r
137. Given 21C6n 21Cn2 + 5 n r r 1
Here x = 6n, y = n2 + 5 and n = 21 8r 5n = 3 ... (ii)
6n = 21 n2 5 n2 + 6n 16 = 0 By (i) 2 (ii), we get
(n + 8) (n 2) = 0 n = 8 or n = 2 16r 9n 16r + 10n = 9 + 6 n = 15
But n N From (i), we get
n=2 16r 9 (15) = 9 16r 135 = 9 16r = 144
r=9
n n 9! 9! 9 8 7 6 5!
138. Pr = 1814400 and Cr = 45 r
C5 9C5
n! n! 5!(9 5)! 5! 4! 5!
1814400 and 45
(n r)! r!(n r)! = 126
1814400
45 40320 = r ! 8 ! = r ! r = 8
r! 140. 11C5 + 11C4 + 12C6 + 13C7 = 14Cr
n! 12
C5 + 12C6 + 13C7 = 14Cr
1814400 n ! = (1814400) (n 8)!
(n 8)! ( C6 + 12C5) + 13C7 = 14Cr
12
n (n 1) (n 2) (n 3) (n 4) (n 5) (n 6) 13
C6 + 13C7 = 14Cr 13C7 + 13C6 = 14Cr
(n 7) (n 8)! = (1814400) (n 8) ! 14C7 = 14Cr
n (n 1) (n 2) (n 3) (h 4) (n 5) r = 7 or r = 14 7 = 7 r = 7
(n 6) (n 7)
= 10 9 8 7 6 5 4 3 141. 16C5 + 16C4 + 17C6 + 18C7 = 19Cr
= 10 (10 1) (10 2) (10 3) (10 4) (10 5) 17
C5 + 17C6 + 18C7 = 19Cr
(10 6) (10 7) (17C6 + 17C5) + 18C7 = 19Cr
n = 10 18
C6 + 18C7 = 19C8 18C7 + 18C6 = 19Cr
72 Permutations and Combinations
SURESH DANI AND SONS CLASSES
19
C7 = 19Cr n! n!
3 8
r = 7 or r = 19 7 = 12 r!(n r)! (r 1)!(n r 1)!
3 8
2n
142. 2n C3 : n C2 52 : 3
C3
52 r!(n r)(n r 1)! (r 1)r!(n r 1)!
n 3
C2 3 8
3r + 3 = 8n 8r
2n
3 ( C3) = 52 ( C2) n n r r 1
(2n)! n! 11r 8n = 3 … (ii)
3 52
3!(2n 3)! 2!(n 2)!
Subtracting (ii) from (i), we get
11r 7n 11r + 8n = 7 + 3 n = 10
(2n)(2n 1)(2n 2)(2n 3)!
3 From (i), we get
6(2n 3)! 11r 7 (10) = 7 11r 70 = 7 11r = 77 r7
n(n 1)(n 2)!
52
2(n 2)! 14
145. Greatest value of 14Cr occurs at r 7
n (2n 1) (2 (n 1)) = 26n (n 1) 2
2n 1 = 13 2n = 14 n = 7 Greatest value of 14Cr = 14C7
12
Greatest value of 12Cr occurs at r 6
14 2
C2r 143
143. 14 C2r :10C2r 4 143:10 Greatest value of 12Cr = 12C6
10 10
C2r 4
The difference between the greatest values of 14Cr
10(14 C2r ) 143(10 C2r 4 ) and 12Cr = 14C7 12C6
14! 10! 14! 12! 14! 12!
10 143
(2r)!(14 2r)! (2r 4)!(10 2r 4)! 7!(14 7)! 6!(12 6)! 7!7! 6!6!
14 13 12 11 10! 14 13 12 11 10 9 8 7!
10
(2r)(2r 1)(2r 2)(2r 3)(2r 4)!(14 2r)! 7 6 5 4 3 2 1 7!
12 11 10 9 8 7 6!
10! 3432 924 2508
143 6 5 4 3 2 1 6!
(2r 4)!(14 2r)!
10 14 12
1 15 1
(2r)(2r 1)(2r 2)(2r 3) 146. Greatest value of 15Cr occurs at r 7 or at
2
252726 15 1
r 8
= (2r) (2r 1) (2r 2) (2r 3) 2
(2r) (2r 1) (2r 2) (2r 3) = 8 7 6 5 Greatest value of 15Cr = 15C8 = 15C7
= 8 (8 1) (8 2) (8 3) 11 1
Greatest value of Cr occurs at r
11
or at
2r = 8 r = 4 2
11 1
n n
r 6
Cr 1 14 Cr 1 7 2
144. Here
n
Cr 8 n
Cr 4 Greatest value of 11Cr = 11C5 = 11C6
The difference between the greatest values of 15
Cr
4 (nCr 1) = 7 (nCr)
and 11Cr = 15C7 11C5
n! n!
4 7 15! 11! 15! 11!
(r 1)!(n r 1)! r!(n r)!
7!(15 7)! 5!(11 5)! 7!8! 7!6!
4 7
15 14 13 12 11 10 9 8!
(r 1)!(n r 1)(n r)! r(r 1)!(n r)!
7 6 5
4 7
4r = 7n 7r + 7 11 10 9 8 7 6!
6435 462 5973
n r 1 r 5 4 32 1 6!
11r 7n = 7
n
Cr 8
Also 3 (nCr) = 8 (nCr + 1)
n 3
Cr 1
Permutations and Combinations 73
SURESH DANI AND SONS CLASSES
11 1 But 4 collinear points, when joined pairwise give
147. Greatest value of nCr occurs at r 5 or at
2 only one line.
11 1 Total number of required straight lines
r 6
2 = 45 6 + 1 = 40
Greatest value of 11Cr = 11C5 = 11C6
8 153. (b)
Greatest value of 8Cr occurs at r 4
2
8 8
Greatest value of Cr = C4 154. Total number of points = 12
The difference between the greatest values of 11
Cr To draw a line two points are required.
and 8C4 = 11C5 8C4 To draw a triangle three points are required.
= 462 70 = 392 Total number of lines
12! 12! 14 11 10!
12C2 66
148. A polygon of n sides has n vertices. 2!(12 2)! 2!10! 2 110!
If any two vertices of a polygon are joined, then 11 points are remaining except point D
either a side or a diagonals of a polygon is 11 lines pass through point D
obtained.
Number of line segments obtained by joining the 155. (b)
vertices of a n sided polygon taken 2 at a time =
Number of ways of selecting 2 out of n = nC9 156. Total number of points = n
Out of these lines, n lines are the sides of the The number of straight lines formed by joining n
polygon. points, if no three are collinear, taking 2 at a time
Total number of diagonals = nC2 n = nC2
The number of straight lines formed by joining the
149. Total number of points = 20 p-points, taking 2 at a time
A chord passes through two points. = nC2
Total number of chords = 20C2 But p collinear points, when joined pairwise give
20! 20! 20 19 18!
190 only one line.
2!(20 2)! 2!18! 1 2 18!
Total number of required straight lines
= nC2 pC2 + 1
150. Two lines can intersect at one point and every two
lines intersect at a point 157. A triangle has 3 vertices
The number of points of intersection Required number of triangles =
20! 20! 20 19 18! 8 7 6
20C2 190 8
C3 56
2!(20 2)! 2!18! 1 2 18! 1 2 3
151. (a) 158. (b)
152. Total number of points = 10 159. Total number of points = n
The number of straight lines formed by joining 10 The number of triangles formed by joining n
points, if no three are collinear, taking 2 at a time points, taking 3 at a time = nC3
10! 10! 10 9 8! The number of triangle formed by joining p-points,
10C2 5
2!(10 2)! 2! 8! 1 2 8! taken 3 at a time = pC3
The number of straight lines formed by joining the But p collinear points can not form a triangle when
four points, taking 2 at a time taken 3 at a time.
4! 4! 43 2! Total number of required triangle = nC3 pC3
4 C2 6
2!(4 2)! 2! 2! 2 1 2!
74 Permutations and Combinations
SURESH DANI AND SONS CLASSES
160. (b) n(n 1)(n 2)
66
2(n 2)!
161. Total number of points = 12 n (n 1) = 132 = 12 11 = 12 (12 1)
The number of triangles formed by joining 12 n = 12
points, taking 3 at a time
12! 12! 12 11 10 9! 166. For a season ticket, two stations are required
12C3 220
3!(12 3)! 3! 9! 3 2 1 9! For each pair of stations there are two tickets
The number of triangle formed by joining 4 points, possible for up direction and down direction
taken 3 at a time The number of possible tickets to be printed
4! 4! 4 3! 20!
= 4 C3 4 2 20C2 2
3!(4 3)! 3!1! 3! 1 2!(20 2)!
But 4 collinear points can not form a triangle when 20 19 18!
2 380
taken 3 at a time. 2 1 18!
Total number of required triangle = 220 4 = 216
4!
167. The letters B, A, A, A can be arranged in ways
162. (c) 3!
There are 5 places for 2 N.
163. Total number of points = 12 The 2 N can be filled in these 5 places in 5C2 ways
To draw a triangle three points are. required. 4!
Required number of ways = 5C2 4 10 40
Total number of triangles 3!
12! 12! 12 11 10 9!
12C3 220
3!(12 3)! 2! 9! 3 2 1 9! 168. There are 4 suits (club, heart, spade, diamond) in a
Total number of triangles with one vertex as C pack.
11! 11! 1110 9! In a suit there are 13 cards.
11C2 55 One club card can be drawn in 13C1 = 13 ways.
2!(11 2)! 2! 9! 2 1 9!
One heart card can be drawn in 13C1 = 13 ways.
One spade card can be drawn in 13C1 = 13 ways.
164. Each choice of a pair of horizontal lines and a pair
One diamond card can be drawn in 13C1 = 13 ways.
of vertical lines gives us a rectangle.
The number of required ways = 134
169. There are 4 suits (club, heart, spade, diamond) in a
pack.
Two horizontal lines out of four can be chosen in In a suit there are 13 cards.
4
C2 ways. Four club cards can be drawn in 13C4 ways.
Two vertical lines out of five, can be chosen in 5C2 Four heart cards can be drawn in 13C4 ways.
ways. Four spade cards can be drawn in 13C4 ways.
Total number of rectangles Four diamond cards can be drawn in 13C4 ways.
4! 5! 4! 5! The number of required ways = 4 13C4
4 C2 5 C2
2!(4 2)! 2!(5 2)! 2! 2! 2! 3!
4 3 2! 5 4 3! 170. There are 13 club cards.
6 10 60
2 1 2! 2 1 3! The number of required ways = 13C4
13! 13 12 11 10 9!
715
165. Let there are n number of participants in the 4!(13 4)! 4 3 2 1 9!
meeting.
For a handshake 2 participants are required. 171. There are 52 cards in a pack.
Total number of handshakes = 66 Four cards can be drawn in 52C4 ways.
n n! There are 13 club cards and 39 non-club cards.
C2 66 66
2!(n 2)! Four non-club cards can be drawn in 39C4 ways.
Permutations and Combinations 75
SURESH DANI AND SONS CLASSES
The number of required ways = 52C4 39C4 In a five digit number no digit is repeated
In a five digit number first digit is 3 which is
172. There are 4 king cards and 4 queen cards in a pack. selected in 1 way and second digit is 5 which is
Three king cards can be drawn in 4C3 = 4 ways. selected in 1 way
One queen card can be drawn in 4C1 = 4 ways. 3rd digit is selected from remaining 8 digits in 8C1
The number of required ways = 4 4 = 16 ways
4th digit is selected from remaining 7 digits in 7C1
173. There are 26 black and 26 red cards in a pack. ways
Three black cards can be drawn in 26C3 ways. 5th digit is selected from remaining 6 digits in 6C1
One red card can be drawn in 26CX ways. ways
The number of required ways = 26C3 26C1 Total number of telephone number
= 1 1 8C1 7C1 6C1 = 8 7 6 = 336
174. Total number of ways of choosing 4 consonants,
out of 8 consonants 178. Available digits are 0, 1, 2, ..., 9.
8! 8! 8 7 6 5 4! In a five digit number no digit is repeated.
8 C4 70
4!(8 4)! 4! 4! 4 3 2 1 4! In a five digit number first digit is 4 which is
Total number of ways of choosing 2 vowels, out of selected in 1 way and second digit is 5 which is
3 vowels = 3C2 = 3C2 = 3 selected in 1 way.
Total number of ways in which each combination 3rd digit is selected from remaining 8 digits in 8C1
of 6 letters can be arranged themselves ways.
= 6P6 = 6 ! = 720 4th digit is selected from remaining 7 digits in 7C1
Total number of words = 70 3 720 = 151200 ways.
5th digit is selected from remaining 6 digits in 6C1
175. Given digits are 0, 2, 4, 5 ways.
In a quadratic equation ax2 + bx + c = 0, a, b, c R 6th digit is selected from remaining 5 digits in 5C1
and a ≠ 0. ways.
Coefficient a is selected from the digits 2, 4, 5 in Total number of telephone number
3
C1 = 3 ways. = 1 1 8C1 7C1 6C1 5C1
Now 0 is included in 2, 4, 5 as digits may repeat, = 8 7 6 5 = 1680
then coefficients b and c are selected 4C1 = 4 ways
each. 179. Total number of students = 30
Total number of quadratic equations If 4 students decide to join the project work, then
= 3 4 4 = 48 remaining 6 students are selected from remaining
26 students in 26C6 ways.
176. Given digits are 0, 5, 7, 9 If 4 students decide not to join the project work,
In a quadratic equation ax2 + bx + c = 0, a, b, c R then all 10 students are selected from remaining 26
and a ≠ 0. students in 26C10 ways.
Coefficient a is selected from the digits 5, 7, 9, in Total number of required ways
3
C1 = 3 ways. = 26C6 + 26C10 = 230230 + 5311735 = 5541965
Now 0 is included in 5, 7, 9 as digits may repeat,
then coefficients b and c are selected 4C1 = 4 ways 180. Total number of books = 7
each. If a boy select Chemistry part II, then Chemistry
Total number of quadratic equations part I is also borrowed. Then the third book is
= 3 4 4 = 48 selected from the remaining 7 2 = 5 books.
The number of ways of selecting 3 books such that
177. Given digits are 0, 1, 2, ..., 9 Chemistry part II is selected = 5C1
76 Permutations and Combinations
SURESH DANI AND SONS CLASSES
If a boy does not select Chemistry part II, then he
has to select all 3 books from the remaining 7 2 = 185. Total number of ways of selecting 3 boys out of
5 books. 6 = 6C3
The number of ways of selecting 3 books such that Total number of ways of selecting 2 girls out of
Chemistry part II is not selected = 5C3 4 = 4C2
Total number of required ways Total number of ways of required selection
= 5C1 + 5C3 = 5C1 + 5C2 = 5 + 10 = 15 6! 4! 6! 4!
6C3 4C2
3!(6 3) 2!(4 2)! 3!3! 2! 2!
181. Total number of students = 25 65 4 3! 4 3 2!
20 6 120
If 3 students decide to join the project work, then 1 2 2!
remaining 7 students are selected from remaining
22 students in 22C7 ways 186. A student can select 8 question from 10 of A part
If 3 students decide not to join the project work, in 10C8 ways.
then all 10 students are selected from remaining 22 A student can select 5 question from 10 of B part
students in 22C10 ways in 10C5 ways.
Total number of required ways = 22C7 + 22C10 Required number of ways = 10C8 10C5
= 10C2 10C5 = 45 252 = 11340
182. A boy can invite 3 or 4 or 5 friends.
Total number of required ways 187. The number of ways in which 5 male can sit
= 5C3 + 5C4 + 5C5 = 5C2 + 5C1 + 1 = 5C2 + 5 + 1 around a table = 4 ! = 24
5! 5! 5 4 3! There are 5 places between males for 2 females.
6 6 6
2!(5 2)! 2! 3! 2 1 3! The 2 female can sit in these 5 places in 5C2 = 10
= 10 + 6 = 16 ways.
The 2 females can sit themselves in 2 ! = 2 ways.
183. A man can 'invite 2 or 3 or 4 or 5 or 6 friends. Required number of ways = 24 10 2 = = 480
Total number of required ways
= 6C2 + 6C3 + 6C4 + 6C5 + 6C6 188. Total number of ways of selecting 3 red balls out
= 6C2 + 6C3 + 6C2 + 6C1 + 1 = 2 (6C2) + 6C3 + 6 + 1 of 6 = 6C3
6! 6! Total number of ways of selecting 3 white balls out
2 7
2!(6 2)! 3!(6 3)! of 8 = 8C3
6! 6! Total number of ways of selecting 3 blue balls out
2 7
2! 4! 3! 3! of 7 = 7C3
6 5 4! 6 5 4 3! Total number of ways of required selection
2 7 30 20 7 57
2 1 4! 3 2 1 3! 6C3 8C3 7C3
6! 8! 7!
184. A student may fail in one, two, three, four, five, six 3!(6 3)! 3!(8 3) 3!(7 3)!
or all the seven subjects. 6! 8! 7!
Total number of ways in which a student can fail 3! 3! 3! 5! 3! 4!
= 7C1 + 7C2 + 7C3 + 7C4 + 7C5 + 7C6 + 7C7 6 5 4 3! 8 7 5! 7 6 5 4!
= 7C1 + 7C2 + 7C3 + 7C3 + 7C2 + 7C1 + 1
3 2 1 3! 3 2 2 1 5! 3 2 1 4!
= 2 (7C1) + 2 (7C1) + 2 (7C3) + 1 = 20 56 35 = 39200
7! 7!
27 2 2 1
2!(7 2)!3! 3!(7 3)! 189. Total number of objects = 20
7! 7! These objects are divided into three groups.
14 2 2 1
2! 5! 3! 4! In first group 8 objects can be selected from 20 in
7 6 5! 7 6 5 4! 20
C8 ways.
15 2 2
2 1 5! 3 2 1 4! After formation of first group, 12 objects are
= 15 + 2 21 + 2 35 = 15 + 42 + 70 = 127 remaining.
Permutations and Combinations 77
SURESH DANI AND SONS CLASSES
In second group 7 objects can be selected from 12 9! 81 9!
in 12C7 ways. 5! 4! 7!1! 4! 5!
In third group 5 things can be selected from 9 8 7 6 5! 8 7! 9 8 7 6 5!
remaining 5 in 5C5 ways. 5! 4 3 2 1 7! 1 4 3 2 1 5!
Total number of ways of formation of groups = 126 8 + 126 = 1008 + 126 = 1134
20! 12!
20C8 12C7 C5 1
8!(20 8)! 7!(12 7)! 193. Total number of questions in section I = 5
20! 12! 20! Total number of questions in section II = 6
8!12! 7! 5! 8! 7! 5! In a solution there are 6 questions, taking at least 2
questions from each section, then
190. Total number of objects = 30 Section I question = 2, Section II questions = 4 or
First group of 7 objects can be selected from 30 Section I questions = 3, Section II questions = 3 or
objects in 30C7 ways. Section I questions = 4, Section II questions = 2
Second group of 10 objects can be selected from Total number of required ways
remaining 23 objects in 23C10 ways. = 5C2 6C4 + 5C3 6C3 + 5C4 6C2
Third group of 13 objects can be selected from 5! 6! 5! 6!
remaining 13 objects in 13C13 ways. 2!(5 2)! 4!(6 4)! 3!(5 3)! 3!(6 3)!
Total number of ways = 30C7 23C10 13C13 5! 6!
4!(5 4)! 2!(6 2)!
191. (a) 5! 6! 5! 6! 5! 6!
2! 3! 4! 2! 3! 2! 3! 3! 4!1! 2! 4!
192. Total number of men = 8 5 4 3! 6 5 4! 5 4 3! 6 5 4 3!
Total number of women = 9
2 1 3! 4! 2 1 3! 2 1 3 2 1 3!
For majority of women in a committee, then their
5 4! 6 5 4!
must be at least 7 women
4! 2 1 4!
Total number of committees with majority of
women = 9C7 8C5 + 9C8 8C4 + 9C9 8C3 = 10 15 + 10 20 + 5 15 = 150 + 200 + 75
9! 8! 9! 8! = 425
7!(9 7)! 5!(8 5)! 8!(9 8)! 4!(8 4)!
194. Total number of cricketers = 22
8!
1 Total number of wicketkeeprs = 3
3!(8 3)!
Total number of bowlers = 5
9! 8! 9! 8! 8!
Total number of batsmans = 22 3 5 = 14
7! 2! 5! 3! 8!1! 4! 4! 3! 5!
If a team of 11 player include one wicketkeeper
9 8 7! 8 7 6 5! 9 8! 8 7 6 5 4!
and at least 4 bowlers, then in a team there are
7! 2 1 5! 3 2 1 8! 1 4! 1 wicketkeeper, 4 bowlers, 6 batsmens or
8 7 6 5! 1 wicketkeeper, 5 bowlers, 5 batsmens or
3 2 1 5! Total number of ways of required team
= 36 56 + 9 x 70 + 56 = 2016 + 630 + 56 = 2702 = 3C1 5C4 14C6 + 3C1 5C5 14C5
For majority of men in a committee, then their = 3C1 5C1 14C6 + 3C1 5C5 14C5
must be at least 7 men 14! 14!
3 5 3 1
Total number of committees with majority of men 6!(14 6)! 5!(14 5)!
= 9C5 8C7 + 9C4 8C8 14! 14!
9! 8! 9! 15 3
1 6! 8! 5! 9!
5!(9 5)! 7!(8 7)! 4!(9 4)!
14 13 12 11 109 8!
15
6 5 4 3 2 1 8!
78 Permutations and Combinations
SURESH DANI AND SONS CLASSES
14 13 12 1110 9! 8! 4! 8!
3 4
5 4 3 2 1 9! 5!(8 5)! 2!(4 2)! 4!(8 4)!
= 15 3003 + 3 2002 = 45045 + 6006 = 51051 8! 8!
4
3!(8 3)! 2!(8 2)!
195. Total number of person = 8 8! 4! 8! 8! 8!
For a picnic two groups are made 4 4
5! 3! 2! 2! 4! 4! 3! 5! 2! 6!
If each group has at least 3 persons, then the
8 7 6 5! 4 3 2! 8 7 6 5 4!
groups can be formed in following ways 4
5! 3 2 1 2 1 2! 4 3 2 1 4!
Group I : 3, 4, 5 and Group II : 5, 4, 3
8 7 6 5! 8 7 6!
Total number of groups 4
3 2 1 5! 2 1 6!
= 8C3 5C5 + 8C4 4C4 + 8C5 3C3
= 4 56 + 6 70 + 4 56 + 28
8! 8! 8!
1 1 1 = 224 + 420 + 224 + 28 = 896
3!(8 3)! 4!(8 4)! 5!(8 5)!
8! 8! 8!
198. Total number of friends = 9
3! 5! 4! 4! 5! 3!
For a picnic two groups are made.
8 7 6 5! 8 7 6 5 4! 8 7 6 5!
If each group has at least 3 friends, then the groups
3 2 1 5! 4 3 2 1 4! 5! 3 2 1 can be formed in following ways.
= 56 + 70 + 56 + = 182 Group I : 3, 4, 5, 6 and Group II : 6, 5, 4, 3
Total number of groups
196. Total number of men = 9 = 9C3 6C6 + 9C4 5C5 + 9C5 4C4 + 9C6 3C3
Total number of women = 6 9
C3 1 + 9C4 1 9C5 1 + 9C6 1
In a committee of 6 persons, if there are at least 3 = 9C3 + 9C4 + 9C5 + 9C6
women, then in a committee there are 3 women
and 3 men or 4 women and 2 men or 5 women and 199. (b)
1 men or 6 women and no men
Total number of committees 200. Total number of men = 8
= 6C3 9C3 + 6C4 9C2 + 6C5 9C1 + 6C6 9C0 Total number of women = 10
= 6C3 9C3 + 6C4 9C2 + 6C1 9C1 + 6C6 9C0 In a committee of 10 persons, if there are at least 5
6! 9! 6! 9! women, then in a committee there are 5 women
3! (6 3)! 3! (9 3)! 4! (6 4)! 2! (9 2)! and 5 men or 6 women and 4 men or 7 women and
+69+11 3 men or 8 women and 2 men or 9 women and 1
6! 9! 6! 9! men or 10 women and no men
54 1
3! 3! 3! 6! 4! 2! 2! 7! Total number of committees
6 5 4 3! 9 8 7 6! 6 5 4! 9 8 7! = 10C5 8C5 + 10C6 8C4 + 10C7 8C3 + 10C8 8C2
55
3 2 1 3! 3 2 1 6! 4! 2 1 2 1 7! + 10C9 8C1 + 10C10 8C0
= 20 84 + 15 36 + 55 = 10C5 8C5 + 10C6 8C4 + 10C7 8C3 + 10C8 8C2
= 1680 + 540 + 55 = 2275 + 10C1 8C1 + 10C10 8C0
10! 8! 10! 8!
197. Total number of doctors = 4 5!(10 5)! 6!(10 6)! 4!(8 4)!
Total number of lawyers = 8 10! 8! 10! 8!
In a selection of 6 persons, there is at least one 7!(10 7)! 3!(8 3)! 8!(10 8)! 2!(8 2)!
doctor in following ways + 10 8 + 1 1
doctor, 5 lawyers or 2 doctors, 4 lawyers or 3 10! 8! 10! 8! 10! 8!
doctors, 3 lawyers or 4 doctors, 2 lawyers 5! 5! 5! 3! 6! 4! 4! 4! 7! 3! 3! 5!
Total number of selections 10! 8!
80 1
= 4C1 8C5 + 4C2 8C4 + 4C3 8C3 + 4C4 8C2 8! 2! 2! 6!
= 4 8C5 + 4C2 8C4 + 4C1 8C3 + 1 8C2
Permutations and Combinations 79
SURESH DANI AND SONS CLASSES
10 8 7 6 5!
5 4 3 2 1 5! 5! 3 2 1
10 9 8 7 6!
6! 4 3 2 1
10 9 8 7! 8 7 6 5!
7! 3 2 1 3 2 1 5!
10 9 8! 8 7 6!
81
8! 2 1 6!
= 252 26 + 210 70 + 120 56 + 45 28 + 81
= 14112 + 14700 + 6720 + 1260 + 81 = 36873
For majority of men in a committee, then their
must be at least 6 men.
Total number of committees with majority of men
= 10C4 8C6 + 10C3 8C7 + 10C2 8C8
10! 10! 8!
4!(10 4)! 3!(10 3)! 7!(8 7)!
10!
1
2!(10 2)!
10! 8! 10! 8! 10!
4! 6! 6! 2! 3! 7! 7!1! 2! 8!
10 9 8 7 6! 8 7 10 8 7!
4 3 2 1 6! 3 2 1 7!
8 7! 10 9 8!
7! 1 2 1 8!
= 210 28 + 120 8 + 45 = 5880 + 960 + 45
= 6885
80 Permutations and Combinations
You might also like
- 12 Mathematics Permutations CombinationsNo ratings yet12 Mathematics Permutations Combinations16 pages
- Permutation & Combination: Fundamental Principle of Counting100% (1)Permutation & Combination: Fundamental Principle of Counting6 pages
- Dosts Formula-Sheet 68278178e5dc53260cec2125No ratings yetDosts Formula-Sheet 68278178e5dc53260cec21256 pages
- Permutations and Combinations: Fundamental Principle of CountingNo ratings yetPermutations and Combinations: Fundamental Principle of Counting6 pages
- Permutations and Combinations Question BankNo ratings yetPermutations and Combinations Question Bank29 pages
- JEE Main Permutations and Combinations Revision Notes - Free PDF Download50% (2)JEE Main Permutations and Combinations Revision Notes - Free PDF Download5 pages
- Permutations and Combinations - Formula BookletNo ratings yetPermutations and Combinations - Formula Booklet6 pages
- 09 Permutation Combination Formula Sheets QuizrrNo ratings yet09 Permutation Combination Formula Sheets Quizrr6 pages
- 09 Permutation Combination Formula Sheets Getmarks AppNo ratings yet09 Permutation Combination Formula Sheets Getmarks App6 pages
- P (N!) / (N-R) !: Permutation and CombinationNo ratings yetP (N!) / (N-R) !: Permutation and Combination7 pages
- 09 Permutation Combination Formula Sheets QuizrrNo ratings yet09 Permutation Combination Formula Sheets Quizrr5 pages
- Permutation & Combinations (Key Concept)No ratings yetPermutation & Combinations (Key Concept)5 pages
- Permutations and Combinations - BVM: Linear Permutations - Fundamental PrincipleNo ratings yetPermutations and Combinations - BVM: Linear Permutations - Fundamental Principle8 pages
- Permutation The Addition Principle: P P P PNo ratings yetPermutation The Addition Principle: P P P P1 page
- Permutation: Permutation and Combination-XINo ratings yetPermutation: Permutation and Combination-XI20 pages
- Permutation and Combination: R.Thejahsree Class11No ratings yetPermutation and Combination: R.Thejahsree Class1114 pages
- Class 11 Mathematics Topic Wise Line by Line Chapter 6 Permutations and CombinationsNo ratings yetClass 11 Mathematics Topic Wise Line by Line Chapter 6 Permutations and Combinations52 pages
- Counting Principles Permutation CombinationNo ratings yetCounting Principles Permutation Combination1 page
- How Pi Can Save Your Life: Using Math to Survive Plane Crashes, Zombie Attacks, Alien Encounters, and Other Improbable Real-World SituationsFrom EverandHow Pi Can Save Your Life: Using Math to Survive Plane Crashes, Zombie Attacks, Alien Encounters, and Other Improbable Real-World SituationsNo ratings yet
- Sub: Risk Assumption Letter: Insured & Vehicle DetailsNo ratings yetSub: Risk Assumption Letter: Insured & Vehicle Details3 pages
- BakutenShootBeybladeRising Extra EnglishNo ratings yetBakutenShootBeybladeRising Extra English10 pages
- Chapter - Xii Society, Religion and Temple: /j-U-V-/J-U-V-/J-u-u-u-u-u-u-u-U-U-U-u-U-U-VJ-VJ-U-U-U-U-U-U-U-VJNo ratings yetChapter - Xii Society, Religion and Temple: /j-U-V-/J-U-V-/J-u-u-u-u-u-u-u-U-U-U-u-U-U-VJ-VJ-U-U-U-U-U-U-U-VJ35 pages
- Lecture-12 Modulus Equations: Chapter 1 - Fundamentals of MathematicsNo ratings yetLecture-12 Modulus Equations: Chapter 1 - Fundamentals of Mathematics15 pages
- TC1601en-Ed05 TSAPI Deployments For Voice RecorderNo ratings yetTC1601en-Ed05 TSAPI Deployments For Voice Recorder50 pages
- How To Check The Health of Your Laptop's Battery in WindowsNo ratings yetHow To Check The Health of Your Laptop's Battery in Windows8 pages
- Kerrang! UK 2020 No 1808 - HTTP - Downmagaz - Com - Anna's ArchiveNo ratings yetKerrang! UK 2020 No 1808 - HTTP - Downmagaz - Com - Anna's Archive68 pages
- Lesson Plan: Class-V Subject: English Language and Spelling and DictationNo ratings yetLesson Plan: Class-V Subject: English Language and Spelling and Dictation6 pages
