PERMUTATION AND COMBINATION

PERMUTATION AND COMBINATION

1. FUNDAMENTAL PRINCIPLES OF COUNTING

1.1 Fundamental Principle of Multiplication

1. Let r and n be positive integers such that l d r d n.

If an event can occur in m different ways following which
Then, the number of all permutations of n distinct items
another event can occur in n different ways following which
or objects taken r at a time, is
another event can occur in p different ways. Then the total
n
number of ways of simultaneous happening of all these Pr = nCr × r !
events in a definite order is m × n × p.
Proof : Total ways = n(n – 1)(n – 2) . . . (n  r  1)

1.2 Fundamental Principle of Addition

n(n  1)(n  2)...(n  r  1)(n  r)!

If there are two jobs such that they can be performed (n  r)!
independently in m and n ways respectively, then either of

the two jobs can be performed in (m + n) ways.

n!
(n  r )!
2. SOME BASIC ARRANGEMENTS AND SELECTIONS

= nPr.
2.1 Combinations
So, the total no. of arrangements (permutations) of n-
Each of the different selections made by taking some or all
distinct items, taking r at a time is nPr or P(n, r).
of a number of distinct objects or items, irrespective of
2. The number of all permutations (arrangements) of n
their arrangements or order in which they are placed, is
distinct objects taken all at a time is n!.
called a combination.
3. The number of ways of selecting r items or objects from
2.2 Permutations a group of n distinct items or objects, is

Each of the different arrangements which can be made by

n! n
taking some or all of a number of distinct objects is called Cr .
(n  r)!r!
a permutation.
 PERMUTATION AND COMBINATION

3. GEOMETRIC APPLICATIONS OF nCr 5. DIVISION OF OBJECTS INTO GROUPS

(i) Out of n non-concurrent and non-parallel straight 5.1 Division of items into groups of unequal sizes
n
lines, points of intersection are C2.
1. The number of ways in which (m + n) distinct items
(ii) Out of ‘n’ points the number of straight lines are can be divided into two unequal groups containing
(when no three are collinear) nC2 .

(iii) If out of n points m are collinear, then No. of straight mn !

m and n items, is .
m!n!
lines = nC2 – mC2 + 1

(iv) In a polygon total number of diagonals out of n points

2. The number of ways in which (m+ n+ p) items can be
n ( n  3) divided into unequal groups containing m, n, p items, is
(no three are collinear) = nC2 – n .
2
mnp !
(v) Number of triangles formed from n points is nC3 . m+n+p
Cm . n + pCm = .
m!n ! p!
(when no three points are collinear)
(vi) Number of triangles out of n points in which m are 3. The number of ways to distribute (m + n+ p) items among
n m
collinear, is C3 – C3 . 3 persons in the groups containing m, n and p items
(vii) Number of triangles that can be formed out of n points = (No. of ways to divide) × (No. of groups)!
(when none of the side is common to the sides of
polygon), is nC3 – nC1 – nC1 . n – 4C1 mnp !
u 3!.
(viii)Number of parallelograms in two systems of parallel m!n!p!

lines (when 1st set contains m parallel lines and 2nd

set contains n parallel lines), is = nC2 × mC2
5.2 Division of Objects into groups of equal size
(ix) Number of squares in two system of perpendicular
The number of ways in which mn different objects can be
parallel lines (when 1st set contains m equally spaced
parallel lines and 2nd set contains n same spaced divided equally into m groups, each containing n objects
parallel lines) and the order of the groups is not important, is

m 1
§ mn ! · 1
¦ (m  r )(n  r); (m  n ) ¨ ¸
¨ n! m ¸ m !
r 1 © ¹

4. PERMUTATIONS UNDER CERTAIN CONDITIONS The number of ways in which mn different items can be
The number of all permutations (arrangements) of n divided equally into m groups, each containing n objects
different objects taken r at a time :
and the order of groups is important, is
(i) When a particular object is to be always included in
n–1
each arrangement, is Cr–1 × r ! . § mn ! 1 · mn !
¨ u ¸ m!
(ii) When a particular object is never taken in each ¨ n! m m! ¸ n!
m
© ¹
n–1
arrangement, is Cr × r!.
PERMUTATION AND COMBINATION

6. PERMUTATIONS OF ALIKE OBJECTS 7. DISTRIBUTION OF ALIKE OBJECTS

1. The number of mutually distinguishable permutations
of n things, taken all at a time, of which p are alike of
one kind, q alike of second kind such that p + q = n, is
n!
p!q!
2. The number of permutations of n things, of which p
are alike of one kind, q are alike of second kind and
n!
remaining all are distinct, is . Here p + q z n
p!q!
3. The number of permutations of n things, of which p1
are alike of one kind; p2 are alike of second kind; p3 are
alike of third kind; ..... ; pr are alike of rth kind such that
(i) The total number of ways of dividing n identical items
among r persons, each one of whom, can receive 0, 1,
2, or more items (d n), is n + r – 1Cr – 1.
OR
The total number of ways of dividing n identical objects
into r groups, if blank groups are allowed, is n + r – 1Cr – 1.
(ii) The total number of ways of dividing n identical items
among r persons, each of whom, receives at least one
item is n – 1Cr – 1.
OR
The number of ways in which n identical items can
be divided into r groups such that blank groups are
not allowed, is n – 1Cr – 1.
(iii) The number of ways in which n identical items can
be divided into r groups so that no group contains
less than k items and more than m (m < k) is
The coefficient of xn in the expansion of
(xm + xm + 1 + . . . . xk)r

n! 8. NO. OF INTEGRAL SOLUTIONS OF LINEAR

p1 + p2 + . . . + pr = n, is .
p1 !p2 !p3 !....pr ! EQUATIONS AND INEQUATIONS

Consider the eqn. x1 + x2 + x3 + x4 + . . . .+ xr = n ...(i)

4. Suppose there are r things to be arranged, allowing
where x1, x2,. . . . ., xr and n are non–negative integers.
repetitions. Let further pl, p2, ...., pr be the integers such This equation may be interpreted as that n identical objects
that the first object occurs exactly p1 times, the second are to be divided into r groups.

occurs exactly p2 times subject, etc. Then the total 1. The total no. of non-negative integral solutions of the
equation x1 + x2 + ....+ xr = n is n + r –1Cr –1.
number of permutations of these r objects to the above
2. The total number of solutions of the same equation in
condition, is the set N of natural numbers is n – 1Cr– 1.
3. In order to solve inequations of the form
(p1  p 2  ...  p r )! x1 + x2 + . . . . .+ xm d n
.
p!p 2 ! p 3!....p r !
we introduce a dummy (artificial) variable xm + 1

such that x1 +x2 + . . . . + xm + xm + 1 = n, where xm + 1 t 0.

The no. of solutions of this equation are same as the no. of
solutions of in Eq. (i).
 PERMUTATION AND COMBINATION

9. CIRCULAR PERMUTATIONS 11. THE NUMBER OF DIVISORS AND THE SUM

OF THE DIVISORS OF A GIVEN NATURAL NUMBER
1. The number of circular permutations of n distinct objects
is (n – l)!.
n n n n
2. If anti-clockwise and clockwise order of arrangements Let N p11 .p22 .p33 .....pk k ...(1)
are not distinct then the number of circular permutations
of n distinct items is 1/2 {(n – 1)!} where pl, p2, . . . . , pk are distinct prime numbers and
n1, n2,....,nk are positive integers.
e.g., arrangements of beads in a necklace, arrangements
of flowers in a garland etc. 1. Total number of divisors of N = (n1 + 1)(n2 + 1) . . .(nk + 1).

2. This includes 1 and n as divisors. Therefore, number of

10. SELECTION OF ONE OR MORE OBJECTS divisors other than 1 and n, is

(n1 + 1)(n2 + 1)(n3 + 1). . . . .(nk + 1) – 2.

1. The number of ways of selecting one or more items from a
3. The sum of all divisors of (1) is given by
group of n distinct items is 2n – 1.

Proof : Out of n items, 1 item can be selected in nCl

­° p n 1 1  1 ½°­° p n 2 1  1 ½°­° p n 3 1  1 ½° ­° p n k 1  1 ½°
1 2 3 k
n
ways; 2 items can be selected in C2 ways; 3 items can ® ¾® ¾® ¾....® ¾.
°̄ 1p  1 °¿°̄ 2p  1 °¿°̄ 3p  1 °¿ °̄ p k  1 °¿
be selected in nC3 ways and so on......

Hence, the required number of ways

12. DEARRANGEMENTS
= nC1 + nC2 + nC3 + . . . . + nCn

= (nC0 + nC1 + nC2 + . . . . + nCn) – nC0 If n distinct objects are arranged in a row, then the no. of
ways in which they can be dearranged so that none of them
= 2n – 1.
occupies its original place, is
2. The number of ways of selecting r items out of n
identical items is 1 . ­ 1 1 1 1 1½
n!®1      ....   1 n ¾
¯ 1! 2! 3! 4! n!¿
3. The total number of ways of selecting zero or more
items from a group of n identical items is (n + 1). and it is denoted by D (n).
4. The total number of selections of some or all out of If r (0 d r d n) objects occupy the places assigned to them
p + q + r items where p are alike of one kind, q are alike of i.e., their original places and none of the remaining (n - r)
second kind and rest are alike of third kind, is objects occupies its original places, then the no. of such
ways, is
[(p + 1)(q + 1)(r+ 1)]– 1.
D(n – r) = nCr . D(n – r)
5. The total number of ways of selecting one or more items
from p identical items of one kind; q identical items of ­ 1 1 1 1 ½
nr
= nCr . (n – r) ! ®1  1!  2!  3!  ....   1 ¾.
(n  r )!¿
second kind; r identical items of third kind and n different ¯
items, is (p + 1) (q + 1)(r + 1) 2n – 1