Chapter

Permutation and
12 Combination
INTRODUCTION

Factorial
The important mathematical term “Factorial” has extensively used in this
chapter.
The product of first n consecutive natural numbers is defined as factorial
of n. It is denoted by n! or n . Therefore,

n! = 1´ 2 ´ 3 ´ ....... ´ (n - 1) ´ n

For example, 5! = 5 × 4 × 3 × 2 × 1 = 120

Note that :

n! æ n ö
¹ ç ÷!
r! è r ø

0! = 1
The factorials of fractions and negative integers are not defined.

Fundamental Principles of Counting

1. Principle of Addition : If an event can occur in 'm' ways and another
event can occur in 'n' ways independent of the first event, then either of
the two events can occur in (m + n) ways.
2. Principle of Multiplication : If an operation can be performed in 'm'
ways and after it has been performed in any one of these ways, a
second operation can be performed in 'n' ways, then the two
operations in succession can be performed in (m × n) ways.
 94 Permutation and Combination
Method of Sampling :
Sampling process can be divided into following forms :
1. The order is IMPORTANT and the repetition is ALLOWED, each
sample is then a SEQUENCE.
2. The order is IMPORTANT and the repetition is NOT ALLOWED,
each sample is then a PERMUTATION.
3. The order is NOT IMPORTANT and repetition is ALLOWED, each
sample is then a MULTISET.
4. The order is NOT IMPORTANT and repetition is NOT ALLOWED,
each sample is then a COMBINATION.

PERMUTATION
Each of the arrangements, which can be made by taking, some or all of a
number of things is called a PERMUTATION.
For Example : Formation of numbers, word formation, sitting
arrangement in a row.
The number of permutations of 'n' things taken 'r' at a time is denoted by
nP . n!
r It is defind as, nPr = .
(n - r)!
Note that:
nP = n!
n

Circular permutations:
(i) Arrangements round a circular table :
Consider five persons A, B, C, D and E to be seated on the
circumference of a circular table in order (which has no head). Now,
shifting A, B, C, D and E one position in anticlockwise direction we
will get arrangements as follows:

E D C
A D E C D B

B C A B E A

(i) (ii) (iii)

Permutation and Combination 95

B A
C A B E

D E C D
(iv) (v)
we see that arrangements in all figures are same.
\ The number of circular permutations of n different things taken all
n
Pn
at a time is = (n – 1) !, if clockwise and anticlockwise orders are
n
taken as different.
(ii) Arrangements of beads or flowers (all different) around
a circular necklace or garland:
Consider five beads A, B, C, D and E in a necklace or five flowers A,
B, C and D, E in a garland etc. If the necklace or garland on the left is
turned over we obtain the arrangement on the right, i.e., anticlockwise
and clockwise order of arrangements are not different.
Thus the number of circular permutations of ‘n’ different things taken.
1
all at a time is (n – 1)!, if clockwise and anticlockwise orders are
2
taken to be some.

D C C D

E B B E
A A

Conditional Permutations
Number of permutations of n things taking r at a time, in which a
-
particular thing always occurs = r . n 1Pr -1 .

Distinguishable Permutations
1. Suppose a set of n objects has n1 of one kind of object, n 2 of a
second kind, n 3 of a third kind, and so on, with n = n 1 + n2 + n3 + . .
. + nk, Then the number of distinguishable permutations of the n
 96 Permutation and Combination

n!
objects is
n1 ! n 2 ! n 3 !..... n k !

2. Number of permutations of n things taking r at a time, in which a

n -1
particular thing never occurs = Pr .

3. Number of permutations of n different things taking all at a time, in

which m specified things always come together = m!(n - m + 1)! .
4. Number of permutations of n different things taking all at a time, in
which m specified things never come together = n!- m!(n - m + 1)!
5. The number of permutations of 'n' things taken all at a time, when 'p'
are alike of one kind, 'q' are alike of second, 'r' alike of third, and so on
n!
= .
p! q! r!

6. The number of permutations of 'n' different things, taking 'r' at a time,

when each thing can be repeated 'r' times = n r

F Shortcut Approach
Number of ways to declare the result where ‘n’ match are played =
2n

COMBINATION
Each of the different selections that can be made with a given number of
objects taken some or all of them at a time is called a COMBINATION.
The number of combinations of 'n' dissimilar things taken 'r' at a time is
denoted by nCr or C(n, r). It is defined as,
n!
nC =
r r!(n - r)!
Permutation and Combination 97

n n n
ê C0 = 1, Cn = 1 ; Pr = r! n C r
n
ê C r = n C n -r
ê n
C r -1 + n C r = n +1C r
ê nC = nC Þ x + y = n
x y
ê nC = nC = n+1C
r r+1 r

nC
n n–1C
ê r = . r–1
r

nC =
1
ê r (n – r + 1) nCr–1
r
ê nC1 = nCn–1 = n

Conditional Combinations
1. Number of combinations of n distinct things taking r (£ n ) at a time,

when k (0 £ k £ r) particular objects always occur = n -k

C r -k .
2. Number of combinations of n distinct objects taking r(£ n) at a

time, when k (0 £ k £ r) particular objects never occur = n -k

Cr .

3. Number of selections of r things from n things when p particular

things are not together in any selection = nCr – n – pCr – p
4. Number of selection of r consecutive things out of n things in a row
=n–r+1
5. Number of selection of r consecutive things out of n things along a
circle

ìn , when r < n
=í
î1, when r = n
6. The number of Combinations of 'n' different things taking some or all
at a time

= n C1 + n C 2 + n C 3 + .............. + n C n = 2 n - 1
 98 Permutation and Combination

NOTE : If a person is always there then we have to select only 1 from the
remaining 25 – 1 = 24

F Shortcut Approach
Let there are n persons in a hall. If every person shakes his hand
with every other person only once, then total number of handshakes
n(n - 1)
= n C2 =
2
Note: If in place of handshakes each person gives a gift to another
person, then formula changes to = n (n – 1)

7. The number of ways of dividing 'm + n' things into two groups
containing 'm' and 'n' things respectively
(m + n)!
= m + nCm nC
n
=
m!n!
8. The number of ways of dividing ‘m + n + p’ things into
three groups containing ‘m’, ‘n’ and ‘p’ things respectively
(m + n + p)!
= m+n+pCm . n+pC =
p m! n! p!
(i) If m = n = p i.e. '3m' things are divided into three equal groups
(3m)! (3m)!
then the number of combinations is m! m! m! 3! =
(m!)3 3!
(ii) Buf if '3m' things are to be divided among three persons, then
(3m)!
the number of divisions is
(m!)3
9. If mn distinct objects are to be divided into m groups. Then, the
number of combination is
(mn)! , when the order of groups is not important and
m! (n!) m

(mn)!
, when the order of groups is important
(n!) m
Permutation and Combination 99
NUMBER OF RECTANGLES AND SQUARES
n
(a) Number of rectangles of any size in a square of size n × n is å r 3and
r =1
n
number of squares of any size is å r 2.
r =1
(b) Number of rectangles of any size in a rectangle size
np
n × p (n < p) is (n + 1) (p + 1) and number of squares of any size
4
n
is å (n + 1 - r ) (p + 1 - r) .
r =1

F Shortcut Approach
Æ If there are n non-collinear points in a plane, then
(i) Number of straight lines formed = nC2
(ii) Number of triangles formed = nC3
(iii) Number of quadrilaterals formed = nC4

Æ If there are n points in a plane out of which m are collinear, then

(i) Number of straight lines formed = nC2 – mC2 + 1
(ii) Number of triangles formed = nC3 – mC3

Æ Number of diagonals in a polygen of n sides = nC2 – n

ebooks Reference Page No.

Solved Examples – S-50-53

Exercises with Hints & Solutions – E-94-98

Chapter Test – 23-24

Past Solved Papers