220 Permutations and Combinations

Chapter

6
Permutations and Combinations
The number of ways of arranging = The number of ways of
Permutations filling r places.
Introduction n(n  1) (n  2).......( n  r  1)
=
(1) The Factorial : Factorial notation: Let n be a positive =
integer. Then, the continued product of first n natural numbers is called n(n  1) (n  2).....( n  r  1)((n  r)!) n!
factorial n, to be denoted by n ! or n .   n Pr
(n  r)! (n  r)!
Also, we define 0 ! = 1.
(2) The number of arrangements of n different objects taken all
when n is negative or a fraction, n ! is not defined. n
Thus, n ! = n (n – 1) (n – 2) ......3.2.1. at a time = Pn  n!
(2) Exponent of Prime p in n ! : Let p be a prime number and n!
n be a positive integer. Then the last integer amongst 1, 2, 3, .......(n – (i)
n
P0   1; n Pr  n . n 1 Pr 1
n!
n  n 
1), n which is divisible by p is   p , where   denotes the 1
p p (ii) 0 !  1;  0 or (r) !   (r  N )
(r) !
n
greatest integer less than or equal to . Number of permutations with repetition
p
(1) The number of permutations (arrangements) of n different
Definition of permutation objects, taken r at a time, when each object may occur once, twice,
thrice,........upto r times in any arrangement = The number of ways of
The ways of arranging or selecting a smaller or an equal
filling r places where each place can be filled by any one of n objects.
number of persons or objects at a time from a given group of persons
or objects with due regard being paid to the order of arrangement or r – places :
Number of choices : 1 2 3 4 r
selection are called the (different) permutations.
For example : Three different things a, b and c are given, then The number of permutations n = The
n number
n ofn ways of filling
n r
different arrangements which can be made by taking two things from places = (n) r .
three given things are ab, ac, bc, ba, ca, cb. (2) The number of arrangements that can be formed using n
Therefore the number of permutations will be 6. objects out of which p are identical (and of one kind) q are identical
(and of another kind), r are identical (and of another kind) and the rest
Number of permutations without repetition n!
are distinct is .
(1) Arranging n objects, taken r at a time equivalent to filling r p ! q ! r!
places from n things.
Conditional permutations
r-places : 1 2 3 4 r (1) Number of permutations of n dissimilar things taken r at a
Number of choices : n p
n (n – 1) (n – 2) (n – 3) n – (r – 1) time when p particular things always occur = C r p r! .
 Permutations and Combinations 221
(2) Number of permutations of n dissimilar things taken r at a Theorem (ii) : The number of ways in which n persons can be
time when p particular things never occur = n p
C r r! . seated round a table is (n  1)! .
(3) The total number of permutations of n different things taken Theorem (iii) : The number of ways in which n different beads
not more than r at a time, when each thing may be repeated any 1
can be arranged to form a necklace, is (n  1)! .
r
n(n  1) 2
number of times, is .
n 1 Combinations
(4) Number of permutations of n different things, taken all at a
time, when m specified things always come together is
Definition
m ! (n  m  1)! . Each of the different groups or selections which can be formed
(5) Number of permutations of n different things, taken all at a by taking some or all of a number of objects, irrespective of their
time, when m specified things never come together is arrangements, is called a combination.
n !m !  (n  m  1) ! . Notation : The number of all combinations of n things, taken r
(6) Let there be n objects, of which m objects are alike of one n 
at a time is denoted by C (n, r) or C r or   r  .
n

kind, and the remaining (n  m ) objects are alike of another kind.  

Then, the total number of mutually distinguishable permutations that can n
Cr is always a natural number.
n!
be formed from these objects is . Difference between a permutation and combination :
(m !)  (n  m ) !
(i) In a combination only selection is made whereas in a
The above theorem can be extended further i.e., if there are n permutation not only a selection is made but also an arrangement in a
objects, of which p 1 are alike of one kind; p 2 are alike of another definite order is considered.
kind; p 3 are alike of 3rd kind;......; p r are alike of rth kind such that (ii) Each combination corresponds to many permutations. For
example, the six permutations ABC, ACB, BCA, BAC, CBA and CAB
p 1  p 2  ......  p r  n ; then the number of permutations of correspond to the same combination ABC.
n! Number of combinations without repetition
these n objects is .
( p 1 !)  ( p 2 !)  ......  ( p r !)
The number of combinations (selections or groups) that can be
Circular permutations formed from n different objects taken r(0  r  n) at a time is
In circular permutations, what really matters is the position of n n!
Cr  . Also n
C r  n Cn  r .
an object relative to the others. r !(n  r) !
Thus, in circular permutations, we fix the position of the one of the Let the total number of selections (or groups) = x. Each group
objects and then arrange the other objects in all possible ways. contains r objects, which can be arranged in r ! ways. Hence the
There are two types of circular permutations :
number of arrangements of r objects = x  (r!) . But the number
(i) The circular permutations in which clockwise and the
n
anticlockwise arrangements give rise to different permutations, e.g. of arrangements = Pr .
Seating arrangements of persons round a table. n
(ii) The circular permutations in which clockwise and the Pr n!
 x (r! )  n Pr  x  x  n Cr
anticlockwise arrangements give rise to same permutations, e.g. r! r ! (n  r) !
arranging some beads to form a necklace.
.
Difference between clockwise and anti-clockwise
arrangement : If anti-clockwise and clockwise order of arrangement Number of combinations with repetition and all
are not distinct e.g., arrangement of beads in a necklace, arrangement possible selections
of flowers in garland etc. then the number of circular permutations of
(n  1) ! (1) The number of combinations of n distinct objects taken r at
n distinct items is . a time when any object may be repeated any number of times.
2
= Coefficient of x r in (1  x  x 2  .......  x r )n
(i) Number of circular permutations of n different things, taken
r at a time, when clockwise and anticlockwise orders are taken as = Coefficient of x r in (1  x )  n  n  r 1 C r
n
Pr (2) The total number of ways in which it is possible to form
different is .
r groups by taking some or all of n things at a time is
n
(ii) Number of circular permutations of n different things, taken C1  n C 2  ........  n Cn  2n  1 .
r at a time, when clockwise and anticlockwise orders are not different
(3) The total number of ways in which it is possible to make
n
Pr groups by taking some or all out of n  (n1  n 2  ....) things,
is .
2r when n1 are alike of one kind, n 2 are alike of second kind, and so
Theorems on circular permutations
on is {(n 1  1) (n 2  1)......}  1 .
Theorem (i) : The number of circular permutations of n
different objects is (n  1) ! . (4) The number of selections of r objects out of n identical
objects is 1.
 222 Permutations and Combinations
(5) Total number of selections of zero or more objects from n (2) The number of ways in which (m + n + p) different things
identical objects is n  1 . can be divided into three groups which contain m, n and p things
respectively is
(6) The number of selections taking at least one out of
a1  a 2  a 3  ......  a n + k objects, where a1 are alike (of one m n  p (m  n  p ) !
C m .n p C n . p C p  ,m  n  p .
m !n ! p !
kind), a 2 are alike (of second kind) and so on...... a n are alike (of
nth kind) and k are distinct Corollary : If m  n  p , then the groups are equal size.
k Division of these groups can be given by two types.
= [(a1  1) (a 2  1) (a 3  1).......( a n  1)] 2 1 .
Type I : If order of group is not important : The number of
Conditional combinations ways in which 3p different things can be divided equally into three
(3 p ) !
(1) The number of ways in which r objects can be selected from groups is .
n different objects if k particular objects are 3!( p!) 3
n k
(i) Always included = C r k (ii) Never included Type II : If order of group is important : The number of
n k
ways in which 3p different things can be divided equally into three
= Cr
(3 p )! (3 p ) !
(2) The number of combinations of n objects, of which p are distinct groups is 3
3!  .
3!( p ! ) ( p ! )3
identical, taken r at a time is
n p (i) If order of group is not important : The number of ways in
C r  n  p C r 1  n  p C r  2  .......  n  p C 0 , if which mn different things can be divided equally into m groups is
r  p and mn !
.
n p
Cr  n p
C r 1  n p
C r  2  .......  n p
Cr p , (n!)m m !
if r p. (ii) If order of group is important: The number of ways in
which mn different things can be divided equally into m distinct
Division into groups (mn )! (mn )!
groups is m
 m! .
Case I : (1) The number of ways in which n different things (n!) m ! (n!)m
n  r 1
can be arranged into r different groups is Pn or n !
Derangement
n 1
C r 1 according as blank group are or are not admissible.
Any change in the given order of the things is called a
(2) The number of ways in which n different things can be derangement.
distributed into r different group is If n things form an arrangement in a row, the number of ways
r n  r C 1 (r  1)n  r C 2 (r  2)n  .........  (1)n 1 n in which they can be deranged so that no one of them occupies its
C r 1
original place is
or Coefficient of x n is n ! (e x  1)r .  1 1 1 1 
n !  1  1!  2!  3!  ......  (1) . n ! 
n
.
Here blank groups are not allowed.
 
(3) Number of ways in which m × n different objects can be
distributed equally among n persons (or numbered groups) = (number Some important results for geometrical problems
of ways of dividing into groups) × (number of groups) ! = (1) Number of total different straight lines formed by joining
(mn ) !n ! (mn ) ! the n points on a plane of which m (< n) are collinear is
 . n
(m !)n n! (m !)n C 2 m C 2  1 .
Case II : (1) The number of ways in which (m  n) (2) Number of total triangles formed by joining the n points on
n
different things can be divided into two groups which contain m and n a plane of which m (< n) are collinear is C3 m C3 .
(m  n) ! n
things respectively is,
m n
C m .n C n  ,m  n . (3) Number of diagonals in a polygon of n sides is C2  n .
m !n!
(4) If m parallel lines in a plane are intersected by a family of
Corollary: If m  n , then the groups are equal size. Division other n parallel lines. Then total number of parallelograms so formed
of these groups can be given by two types. mn (m  1)(n  1)
is m C 2 n C 2 i.e ., .
Type I : If order of group is not important : The number of 4
ways in which 2n different things can be divided equally into two
(5) Given n points on the circumference of a circle, then
(2n)! n
groups is . (i) Number of straight lines = C2
2!(n!) 2
n
(ii) Number of triangles = C3
Type II : If order of group is important : The number of
ways in which 2n different things can be divided equally into two (iii) Number of quadrilaterals = n
C4 .
(2n)! 2n!
distinct groups is  2!  . (6) If n straight lines are drawn in the plane such that no two
2!(n!) 2 (n!) 2 lines are parallel and no three lines are concurrent. Then the number of
part into which these lines divide the plane is = 1  n .
 Permutations and Combinations 223
(7) Number of rectangles of any size in a square of nn is = coefficient of x n in x r (1  x )  r
n n

r r 1
3
and number of squares of any size is r
r 1
2
. = coefficient of x n in

(8) In a rectangle of n  p (n  p ) number of rectangles of  r (r  1) 2 r (r  1)(r  2)...( r  n  1)

np x r 1  rx  x  ...  x
any size is (n  1) ( p  1) and number of squares of any size  2 ! n!
4
n = coefficient of x n r in
is  (n  1  r)(p  1  r) .
r 1
 r(r  1) 2 r(r  1)(r  2)....( r  n  1) n
Multinomial theorem 1  rx  x  ...  x
 2! n!
x 1 , x 2 , ......., x m be integers. Then number of
Let
r(r  1) (r  2)......( r  n  r  1)
solutions to the equation x 1  x 2  ......  x m  n .....(i) = =
(n  r) !
Subject to the condition
a1  x 1  b 1 , a 2  x 2  b 2 ,......., a m  x m  b m ..... r(r  1) (r  2).....( n  1)
=
(ii) (n  r)!
is equal to the coefficient of x n in (n  1) !
a1 1 a2 1
 n 1 C r 1 .
(x a1
x  ......  x b1
) (x a2
x  .....  x b2
)......( x am
x am 1
.....r)!
(n x b(mr) 1)!
.....(iii)
This is because the number of ways, in which sum of m integers Number of divisors
in (i) equals n, is the same as the number of times x n comes in (iii).
(1) Use of solution of linear equation and coefficient of a
Let N  p 11 . p 2 2 . p 3 3 ...... p k k , where
power in expansions to find the number of ways of distribution : p 1 , p 2 , p 3 ,...... p k are different primes and
(i) The number of integral solutions of
 1 ,  2 ,  3 ,......,  k are natural numbers then :
x 1  x 2  x 3  ......  x r  n where
(1) The total number of divisors of N including 1 and N is =
x 1  0, x 2  0, ...... x r  0 is the same as the number of ways
( 1  1) ( 2  1) ( 3  1)....( k  1) .
to distribute n identical things among r persons.
(2) The total number of divisors of N excluding 1 and N is =
This is also equal to the coefficient of x n in the expansion of
( 1  1) ( 2  1) ( 3  1).....(  k  1)  2 .
( x 0  x 1  x 2  x 3  ......) r
(3) The total number of divisors of N excluding 1 or N is =
r
 1  ( 1  1) ( 2  1) ( 3  1).....( k  1)  1 .
= coefficient of x n in  
1  x 
(4) The sum of these divisors is
r
= coefficient of x n in (1  x )

= coefficient of x n in  ( p10  p11  p12  ......  p11 ) ( p 20  p 12  p 22  ...  p2 2 ).....

 r(r  1) 2 r(r  1)(r  2)....( r  n  1) n
1  rx  x  ....  x  ...... ( pk0  pk1  pk2  ....  pk k )
 2! n!
(5) The number of ways in which N can be resolved as a
r(r  1) (r  2)....( r  n  1) (r  n  1)! n  r 1product of two factors is
   C r 1
n! n!(r  1)!
 1
.  2 ( 1  1) ( 2  1)....(  k  1), If N is not a perfect sq
(2) The number of integral solutions of x 1  x 2  x 3  1
 [( 1  1) ( 2  1).....(  k  1)  1], If N is a perfect s
.....  x r  n where x 1  1, x 2  1,....... x r  1 is same as 2
the number of ways to distribute n identical things among r persons
(6) The number of ways in which a composite number N can be
each getting at least 1. This also equal to the coefficient of x n in the
resolved into two factors which are relatively prime (or co-prime) to
expansion of (x 1  x 2  x 3  ......) r . each other is equal to 2 n 1 where n is the number of different
r factors in N.
 x 
= coefficient of x n in  
1  x 
 224 Permutations and Combinations
 The number of ways in which n (one type of different) things
and n (another type of different) things can be arranged in a row
alternatively is 2 .n!.n! .
 The number of ways in which m things of one type and n
n
 C 0 n Cn  1, n C1  n . things of another type can be arranged in the form of a garland so

 n
C r  n C r 1  n  1 C r . m !n!
that all the second type of things come together  and
n
2
 C x n C y  x  y or x  y  n .
(m  1)! m Pn
 n. n 1 n
Cr 1  (n  r  1) Cr 1 . no two things of second type come together  .
2
n
 If n is even then the greatest value of Cr is n Cn / 2 .  All the numbers whose last digit is an even number 0, 2, 4, 6
n
or 8 are divisible by 2.
 If n is odd then the greatest value of n
Cr is C n 1 or
 All the numbers sum of whose digits are divisible by 3,is
2
divisible by 3 e.g., 534. Sum of the digits is 12, which are divisible
n
C n 1 . by 3, and hence 534 is also divisible by 3.
2  All those numbers whose last two-digit number is divisible by 4
n n n 1 are divisible by 4 e.g., 7312, 8936, are such that 12, 36 are divisible by
 Cr  . Cr 1 . 4 and hence the given numbers are also divisible by 4.
r
 Number of selections of zero or more things out of n different  All those numbers, which have either 0 or 5 as the last digit,
are divisible by 5.
things is, n C 0  n C1  n C 2  .....  n Cn  2 n .
 All those numbers, which are divisible by 2 and 3
 The number of ways of answering one or more questions simultaneously, are divisible by 6. e.g., 108, 756 etc.
when each question has an alternative is, 3 n  1 .  All those numbers whose last three-digit number is divisible
 The number of ways of answering all of n questions when by 8 are divisible by 8.
each question has an alternative is 2 n .  All those numbers sum of whose digit is divisible by 9 are
 divisible by 9.
 All those numbers whose last two digits are divisible by 25 are
n
C0  n C 2  n C 4  ...... n C1  n C 3  n C5  .....  2 n 1
divisible by 25 e.g., 73125, 2400 etc.
.
2 n 1  If we are given n different digits (a, a2 , a3 .......... an )
 C0  2 n 1 C1  2 n 1 C 2  .....  2 n 1Cn  2 2 n .
then sum of the digits in the unit place of all numbers formed

without repetition is (n  1)! (a1  a2  a3  ......  an ) .
n
Cn  n 1 Cn  n  2 Cn  n  3 Cn  ....  2 n 1 Cn  2 n Cn 1
Sum of the total numbers in this case can be obtained by applying
.
the formula (n  1)! (a1  a2  a3  ......  an ) .
 Number of combinations of n dissimilar things taken all at a
(1111......... n times).
n n! 1
time Cn    1 , (0 !  1) .
n ! (n  n) ! 0!
 Gap method : Suppose 5 males A, B, C, D, E are arranged in
a row as × A × B × C × D × E ×. There will be six gaps between
these five. Four in between and two at either end. Now if three
females P, Q,R are to be arranged so that no two are together we
shall use gap method i.e., arrange them in between these 6 gaps. Definition of permutation, Number of permutations
6
Hence the answer will be P3 . with or without repetition, Conditional permutations
 Together : Suppose we have to arrange 5 persons in a row
1. If the best and the worst paper never appear together, then six
which can be done in 5 ! = 120 ways. But if two particular persons examination papers can be arranged in how many ways
are to be together always, then we tie these two particular persons (a) 120 (b) 480
with a string. Thus we have 5 – 2 + 1 (1 corresponding to these two
(c) 240 (d) None of these
together) = 3 +1 = 4 units, which can be arranged in 4! ways. Now
2. How many numbers divisible by 5 and lying between 3000 and
we loosen the string and these two particular can be arranged in 2! 4000 can be formed from the digits 1, 2, 3, 4, 5, 6 (repetition is
ways. Thus total arrangements = 24 × 2 = 48. not allowed)
Never together = Total – Together = 120 – 48 = 72.
 Permutations and Combinations 225
6
(a) P2 (b) 5
P2

4 6
(c) P2 (d) P3
3. The number of ways in which 6 rings can be worn on the four
fingers of one hand is [AMU 1983]
6
(a) 46 (b) C4
(c) 64 (d) None of these
4. How many numbers can be formed from the digits 1, 2, 3, 4
when the repetition is not allowed
4 4
(a) P4 (b) P3
4 4 4
(c) P1  P2  P3 (d)
4 4 4 4
P1  P2  P3  P4
5. There are 3 candidates for a post and one is to be selected by
the votes of 7 men. The number of ways in which votes can be
given is
(a) 73 (b) 37
7
(c) C3 (d) None of these
6. 4 buses runs between Bhopal and Gwalior. If a man goes from
Gwalior to Bhopal by a bus and comes back to Gwalior by
another bus, then the total possible ways are
(a) 12 (b) 16
(c) 4 (d) 8
7. If n
P5  20 . nP3 , then n
(a) 4 (b) 8
(c) 6 (d) 7
8. How many words comprising of any three letters of the word
UNIVERSAL can be formed
(a) 504 (b) 405
(c) 540 (d) 450
9. If n
P4 : nP5  1 : 2 , then n [MP PET 1987; RPET
1996]
(a) 4 (b) 5
(c) 6 (d) 7
10. In how many ways can mn letters be posted in n letter-
boxes
(a) (mn )n (b) m mn
(c) n mn (d) None of these