PERMUTATIONS & COMBINATIONS

Exercise 2(B)
Q.1
Number of ways to choose n people out of 2n =
2n
n
C .
Number of ways to arrange these n people in a circle = (n 1)!
Number of ways to arrange rest in a row = n!
Total number of arrangements =
( )
( )
2n
n
2n !
C n 1 ! n! i.e. .
n

Q.2
Three cards must be from three of the four suits and two card must be from any one suit.
Number of ways to choose two cards from any one suit =
4 13
1 2
C C
Number of ways to choose three remaining cards from other three suits =
( )
3
13
1
C
Total number of ways to choose 5 cards =
( )
3
4 13 13
1 2 1
C C C i.e. 685464.
Q.3
Number of ways to choose 12 people including A but not B or B but not A=
15
11
2 C .
Number of ways to choose 12 people not including any of A & B =
15
12
C .
Total number of ways to choose 12 people =
15 15
11 12
2 C C + i.e. 3185.
Q.4
For sum of numbers to be even we need to select
(i) two numbers odd & one even
15 15
2 1
C C
(ii) all three numbers even
15
3
C
Hence total number of selections =
15 15 15
2 1 3
C C C + i.e. 2030.
Q.5
Let A & B get x & y number of books respectively, then C will get
x y
2
+
number of books.
Now
x y
x y 27 x y 18
2
+
+ + = + = .
Now to distribute books, chose 9 books for C and then for rest of the 18 books we have 2 ways
(A or B) for each book.
Number of ways to distribute =
27 18
9
C 2 .

Q.6
As shown 1 line divides a plane in two parts, 2
lines in 4 parts, 3 lines in 7 parts
Let An denote the number of parts in which n
lines divide a plane, then
1 0 2 1 3 2
A A 1, A A 2, A A 3 = = = implies
n n 1
A A n

= .
Now
20 20 20
n n 1 20 1 20
n 2 n 2 n 2
20 21
A A n A A 1 or A 211
2

= = =

= = =

.
Q.7
Let number of ways to climb n stairs by taking single or double steps be
n
A .
If first step is a single step then number of ways to climb remaining stairs =
n 1
A


If first step is a double step then number of ways to climb remaining stairs =
n 2
A


Now
n n 1 n 2
A A A , n 3

= + > .
Also
1 2
A 1 & A 2 = =
Hence
3 2 1
A A A 3 = + = ,
4 3 2 1 2
A A A A 2A 5 = + = + = ,
5 4 3 1 2
A A A 2A 3A 8 = + = + = ,
6 5 4 1 2
A A A 3A 5A 13 = + = + = ,
Therefore
12
A 233 = .
Q.8
If each side is divided in n parts then let number of required triangles be
n
A .
Now
1 2 3 4
A 1, A 4, A 10, A 20,... = = = =
Explanation :
For one point on each side there will be 5 triangles out of which one will be facing down hence 4
triangles including ABC itself have same orientation.
For two points on each side there will be 14 triangles out of which 4 will be facing downwards
hence 10 triangles including ABC itself have same orientation.
Now
2 1 3 2 4 3
A A 3, A A 6, A A 10 = = =
Clearly
5 4 6 5
A A 15 & A A 21 = = .
Hence
5 4 6 5
A A 15 35 & A A 21 56 = + = = + = .
Q.9
We have N =
6 6 6
10 2 5 = .
Let
i j
i, j
d 2 5 = be a divisor of N where 0 i, j 6 s s .
Now Total number of factors = (6 + 1)(6 + 1) = 49.
Product of all the divisors =
( )
49
6 147
2
10 10 = .
Q.10
x, y, z can be put such that y is between x & z in
9
3
C ways.
remaining 6 letters can be arranged in 6! ways.
Total number of ways =
9
3
C 6! .
Q.11
Number of ways to select two men =
8
2
C .
Number of ways to select women =
6
2
C (As spouses cant be included)
Number of ways to form two mixed pair = 2.
Total number of ways =
6 6
2 2
C C 2 840 = .
Q.12
n =
2 2
2 3 5 .
Number of factors of n = (2 + 1)(2 + 1)(1 + 1) = 18,
n
2
=
4 4 2
2 3 5 .
Number of factors of n
2
= (4 + 1)(4 + 1)(2 + 1) = 75
Number of positive integral divisors of n
2
, which do not divide n
= number of factors of
2
n number of factors of n = 75 18 = 57.
Q.13
In the word MISSISSIPPI, other than 4 S we have M, P, P, I, I, I, I.
These can be arranged in
7!
4! 2!
.
Now we can put 4 S in 8 gaps in
8
4
C ways.
Hence total number of ways =
8
4
7!
C
4! 2!

i.e. 7350.
Q.14
Total number ways to select two adjacent squares =
( ) ( ) ( ) ( ) 7 in each row 8 rows 7 in each column 8 columns 112 + =
Number ways to choose two squares at random =
64
2
C .
the number of ways of keeping 2 identical kings on an 8 8 chess-board so that they are not in
adjacent squares =
64
2
C 112 1904 = .
Q.15
For no two HEADs being consecutive, number of times a HEAD appears must be less than or
equal to 5. Now
0 HEAD & 10 TAILs 1 way
1 HEAD & 9 TAILs 10 ways
2 HEADs & 8 TAILs
9
2
C ways (9 gaps created by 8 TAILs to put 2 HEADS)
3 HEADs & 7 TAILs
8
3
C ways (8 gaps created by 7 TAILs to put 3 HEADS)
4 HEADs & 6 TAILs
7
4
C ways (7 gaps created by 6 TAILs to put 4 HEADS)
5 HEADs & 5 TAILs
6
5
C ways (6 gaps created by 5 TAILs to put 5 HEADS)
Total number of ways =
9 8 7 6
2 3 4 5
1 10 C C C C + + + + + = 144.
Q.16
(i) Keeping the central seat vacant we have 10 seats out of which 5 are to be occupied so
number of arrangements will be
10
5
C 5! .
(ii) For keeping symmetrically opposite seats vacant seats can be occupied in the following
ways
Case 1 : 0 seat on left 5 on right as shown(shaded seats are occupied) -
5
0
C 5! ways

OR similarly
0 seat on right and 5 on left -
5
0
C 5! ways
Case 2 : 1 seat on left 4 on right as shown(shaded seats are occupied) -
5
1
C 5! ways

OR similarly
1 seat on right and 4 on left -
5
1
C 5! ways
Case 3 : 2 seat on left 3 on right as shown(shaded seats are occupied) -
5
2
C 5! ways

OR similarly
2 seat on right and 3 on left -
5
2
C 5! ways
Total number of ways =
( )
5 5 5
0 1 2
C C C 5! 2 3840 + + = .
Q.17
A selection of any four vertices gives one point of intersection of diagonals lying inside
the octagon.(diagonals of a quadrilateral intersect inside it).
Hence required number of points =
8
4
C = 70.
Q.18
The gaps between selected points sum up to 9 so the required number of selections will
be the number of ways to divide 9 points in 6 groups where 1
st
and 6
th
groups (not
simultaneously) may be empty but rest must have at least one point.
If the 1
st
group is empty, then number of positive integral solutions of
2 3 4 5 6
a a a a a 9 + + + + = will be
9 1
5 1
C i.e. 70

.
If the 6
th
group is empty, then number of positive integral solutions of
1 2 3 4 5
a a a a a 9 + + + + = will be
9 1
5 1
C i.e. 70

.
Total number of solutions = 140.
Alternately
Required number is number of ways to choose 6 points out of 15 points in a circular
arrangement such that no two of the selected points are adjacent.
Required number of ways =
10 8
6 4
C C 140 =
(Number of ways to choose r objects out of n objects arranged in a circle such that no two
of the selected objects are adjacent =
n r 1 n r 1
r r 2
C C
+

)
Q.19
We can give each person a glove for right hand then distribute gloves for left hand such
that nobody gets a pair.
Required number of ways = (Number of ways to permute 5 objects) (number of ways
to derange 5 objects) = ( )
2 1 1 1 1 1 1
5! 5280
0! 1! 2! 3! 4! 5!
| |
+ + =
|
\ .
.
Q.20
Required number of ways =
6 3 6 3 6
1 2
3 C 2 C 1 + = 540.
(By Principle on Inclusion & Exclusion)
Q.21
Gaps created by m 0s = m + 1
Number of ways to put n 1s in these gaps =
m 1
n
C
+
.
Q.22
All 7 tiles of size 1 1 : 1 way.
5 tiles of size 1 1 & 1 of size 1 2 : 6 ways
3 tiles of size 1 1 & 2 of size 1 2 : 10 ways
1 tile of size 1 1 & 3 of size 1 2 : 4 ways
4 tiles of size 1 1 & 1 of size 1 3 : 5 ways
1 tile of size 1 1 & 2 of size 1 3 : 3 ways
2 tiles of size 1 1 , 1 of size 1 2 & 1 of size 1 3 : 12 ways
2 tiles of size 1 2 & 1 of size 1 3 : 3 ways
Total = 44 ways.
Q.23
Seating arrangements can be made in following manner
Table 1 Table 2 Table 3 Arrangements
1 1 4
6!
3!
4!2!
= 90
1 2 3
6!
2!
2!3!
= 120
2 2 2
6!
2!2!2!3!
= 15
Total number of arrangements = 225.
Q.24
(i) Numbers with 1 & 2 at first place = 2 4! = 48.
Numbers with 31, 32, 34 at first two places = 3 3! = 18
Numbers with 351, 352 at first three places = 2 2! = 4
Number 35412, then comes 35421.
Rank of 35421 = 72
nd
.
(ii) Total numbers = 5! = 120
Numbers with 5 at first place = 4! = 24
Numbers before those with 5 at first place = 96
Numbers after that 51234, 51243, 51324, 51342
100
th
number = 52143.
Q.25
Number 11111 (2010 digits) is not a perfect square hence number of divisors is even.
Q.26
Number of divisors of given number is (6 + 1)(4 + 1)(2 + 1)(4 + 1) = 525.
Out of these divisors
3 2 2
2 .3 .5.7 n = , hence 262 divisors are less than n & 262 are
greater than n .
Q.27
( )( )
1 1 1
100x 100y xy or x 100 y 100 10000
x y 100
+ = + = =
( )( )
4 4
x 100 y 100 2 .5 =
Number of divisors of
4 4
2 .5 = (4 + 1)(4 + 1) = 25.
Also each value of (x 100) gives a unique value of (y 100).
Hence number of solutions = 25.
Q.28
Let the selected terms be a, b, c.
Now a + c = 2b implies we need to select a & c such that their sum is even.
Number of ways to select two odd numbers =
50
2
C
Number of ways to select two even numbers =
50
2
C
Total number of selections =
50
2
2 C = 2450.
Q.29
126000 =
4 2 3
2 .3 .5 .7
Now LCM(a, b) =
4
2 in 9 ways (a can take any value from
0 1 2 3 4
2 , 2 , 2 , 2 , 2 . Similarly b
can take any value from
0 1 2 3 4
2 , 2 , 2 , 2 , 2 . hence 5 + 5 1 = 9)
Similarly LCM(a, b) =
2
3 in 5 ways.
LCM(a, b) =
3
5 in 7 ways.
LCM(a, b) = 7 in 3 ways.
Hence LCM(a, b) =
4 2 3
2 .3 .5 .7 in 9 5 7 3 i.e. 945 ways.
Now number of unordered pairs (a, b) =
945 1
473
2
+
= ways.
Q.30
Let the vertices of the given polygon be
1 2 21
A , A ,..., A .
For isosceles triangles : choose any one vertex say A1 and then take two other vertices at
equal gap, one from left and other from right of A1. This gives 10 triangles for each
vertex (From
21 1 2 11 1 10
A A A till A A A A A ).
Hence supposed number of triangles = 21 10 .
Now in above counting equilateral triangles have been counted more than once as
explained below
To form equilateral triangle we need to choose three points dividing remaining 18 points
in equal groups so by joining every 7
th
point we get an equilateral triangle
e.g.
1 8 15
A A A A .
Now each vertex will be a part of three equilateral triangles so actually there will be 7
equilateral triangles but in our counting of isosceles triangles this has been taken as
7 3 21 = triangles.
Hence required number of triangles = 210 14 = 196.