Permutation and Combination

Circular Permutations
<<(premutation and combination) previous | next (restricted permutations}>>
Circular permutations
There are two cases of circular-permutations-
(a) !f cloc"wise and anti cloc"-wise orders are different# then total number
of circular-permutations is $iven b% (n-&)'
(b) !f cloc"-wise and anti-cloc"-wise orders are ta"en as not different# then
total number of circular-permutations is $iven b% (n-&)'()'
Proof(a)
(a) *et+s consider that , persons -#.#C# and / are sittin$ around a round
table
0hiftin$ -# .# C# /# one position in anticloc"-wise direction# we $et the
followin$ a$reements-

Thus# we use that if , persons are sittin$ at a round table# then the% can be
shifted four times# but these four arran$ements will be the same# because the
se1uence of -# .# C# /# is same2 .ut if -# .# C# /# are sittin$ in a row# and
the% are shifted# then the four linear-arran$ement will be different2

3ence if we have 4,+ thin$s# then for each circular-arran$ement number of
linear-arran$ements 5,
0imilarl%# if we have 4n+ thin$s# then for each circular 6 a$reement# number of
linear 6 arran$ement 5 n2
*et the total circular arran$ement 5 p
Total number of linear6arran$ements 5 n2p
Total number of linear6arran$ements
5 n2 (number of circular-arran$ements)
7r 8umber of circular-arran$ements 5 & (number of linear arran$ements)
n 5 &( n')(n
circular permutation 5 (n-&)'
Proof (b) 9hen cloc"-wise and anti-cloc" wise arran$ements are not
different# then observation can be made from both sides# and this
will be the same2 3ere two permutations will be counted as one2 0o
total permutations will be half# hence in this case2
Circular6permutations 5 (n-&)'()
Note 8umber of circular-permutations of 4n+ different thin$s ta"en 4r+ at a
time-
(a) !f cloc"-wise and anti-cloc"wise orders are ta"en as different# then
total number of circular-permutations 5
n
P
r
(r
(b) !f cloc"-wise and anti-cloc"wise orders are ta"en as not different# then
total number of circular 6 permutation 5
n
P
r
()r
:xample 3ow man% nec"lace of &) beads each can be made from &; beads
of different colours<
-ns2 3ere cloc"-wise and anti-cloc"wise arran$ement s are same2
3ence total number of circular6permutations
&;
P
&)
()x&)
5 &;'((= x ),)
>estricted 6 Permutations
(a) 8umber of permutations of 4n+ thin$s# ta"en 4r+ at a time# when a particular
thin$ is to be alwa%s included in each arran$ement
5 r
n-&
P
r-&
(b) 8umber of permutations of 4n+ thin$s# ta"en 4r+ at a time# when a particular
thin$ is fixed 5
n-&
P
r-&
(c) 8umber of permutations of 4n+ thin$s# ta"en 4r+ at a time# when a particular
thin$ is never ta"en 5
n-&
P
r2
(d) 8umber of permutations of 4n+ thin$s# ta"en 4r+ at a time# when 4m+ specified
thin$s alwa%s come to$ether 5 m' x ( n-m?&) '
(e) 8umber of permutations of 4n+ thin$s# ta"en all at a time# when 4m+
specified thin$s alwa%s come to$ether 5 n ' - @ m' x (n-m?&)' A
:xample 3ow man% words can be formed with the letters of the word
47B:C-+ when
(i) 47+ and 4-+ occup%in$ end places2
(ii) 4:+ bein$ alwa%s in the middle
(iii) Dowels occup%in$ odd-places
(iv) Dowels bein$ never to$ether2
-ns2
(i) 9hen 47+ and 4-+ occup%in$ end-places
5> B2:2C2 (7-)
3ere (7-) are fixed# hence B# :# C can be arran$ed in E' wa%s
.ut (7#-) can be arran$ed themselves is )' wa%s2
5> Total number of words 5 E' x )' 5 &) wa%s2
(ii) 9hen 4:+ is fixed in the middle
5> 72B2(:)# C2-2
3ence four-letter 72B2C2-2 can be arran$ed in ,' i2e ), wa%s2
(iii) Three vowels (7#:#-#) can be arran$ed in the odd-places (&
st
# E
rd
and F
th
) 5 E' wa%s2
-nd two consonants (B#C#) can be arran$ed in the even-place
()
nd
# ,
th
) 5 ) ' wa%s
5> Total number of wa%s5 E' x )' 5 &) wa%s2
(iv) Total number of words 5 F' 5 &)G'
!f all the vowels come to$ether# then we have (72:2-2)# B#C
These can be arran$ed in E' wa%s2
.ut (7#:2-2) can be arran$ed themselves in E' wa%s2
5> 8umber of wa%s# when vowels come-to$ether 5 E' x E'
5 E= wa%s
5> 8umber of wa%s# when vowels bein$ never-to$ether
5 &)G-E= 5 ;, wa%s2
8umber of Combination of 4n+ different thin$s# ta"en 4r+ at a time is $iven b%-
n
C
r
5 n' ( r ' x (n-r)'
Proof :ach combination consists of 4r+ different thin$s# which can be arran$ed
amon$ themselves in r' wa%s2
5> Hor one combination of 4r+ different thin$s# number of arran$ements 5 r'
Hor
n
C
r
combination number of arran$ements r
n
C
r
5> Total number of permutations 5 r'
n
C
r
---------------(&)
.ut number of permutation of 4n+ different thin$s# ta"en 4r+ at a time
5
n
P
r
-------())
Hrom (&) and ())
n
P
r
5 r' 2
n
C
r
or n'((n-r)' 5 r' 2
n
C
r

or
n
C
r
5 n'(r'x(n-r)'
Note:
n
C
r
5
n
C
n-r
or
n
C
r
5 n'(r'x(n-r)' and
n
C
n-r
5 n'((n-r)'x(n-(n-r))'
5 n'((n-r)'xr'
>estricted 6 Combinations
(a) 8umber of combinations of 4n+ different thin$s ta"en 4r+ at a time# when
4p+ particular thin$s are alwa%s included 5
n-p
C
r-p
2
(b) 8umber of combination of 4n+ different thin$s# ta"en 4r+ at a time# when
4p+ particular thin$s are alwa%s to be excluded 5
n-p
C
r
:xample !n how man% wa%s can a cric"et-eleven be chosen out of &F
pla%ers< if
(i) - particular pla%er is alwa%s chosen#
(ii) - particular is never chosen2
-ns
(i) - particular pla%er is alwa%s chosen# it means that &G pla%ers are
selected out of the remainin$ &, pla%ers2
52 >e1uired number of wa%s 5
&,
C
&G
5
&,
C
,
5 &,'(,'x&I' 5 &E=F
(ii) - particular pla%ers is never chosen# it means that && pla%ers are selected
out of &, pla%ers2
5> >e1uired number of wa%s 5
&,
C
&&

5 &,'(&&'xE' 5 E=,
(iii) 8umber of wa%s of selectin$ Jero or more thin$s from 4n+ different thin$s is
$iven b%- )
n
-&
Proof 8umber of wa%s of selectin$ one thin$# out of n-thin$s 5
n
C
&
8umber of selectin$ two thin$s# out of n-thin$s 5
n
C
)
8umber of wa%s of selectin$ three thin$s# out of n-thin$s 5
n
C
E
8umber of wa%s of selectin$ 4n+ thin$s out of 4n+ thin$s 5
n
C
n
5>Total number of wa%s of selectin$ one or more thin$s out of n different
thin$s
5
n
C
&
?
n
C
)
?
n
C
E
? ------------- ?
n
C
n
5 (
n
C
G
?
n
C
&
? -----------------
n
C
n
) -
n
C
G
5 )
n
6 & @
n
C
G
5&A
:xample Kohn has ; friends2 !n how man% wa%s can he invite one or more of
them to dinner<
-ns2 Kohn can select one or more than one of his ; friends2
5> >e1uired number of wa%s 5 )
;
6 &5 )FF2
(iv) 8umber of wa%s of selectin$ Jero or more thin$s from 4n+ identical thin$s is
$iven b% - n?&
:xample !n how man% wa%s# can Jero or more letters be selected form the
letters -----<
-ns2 8umber of wa%s of
0electin$ Jero L-Ls 5 &
0electin$ one L-Ls 5 &
0electin$ two L-Ls 5 &
0electin$ three L-Ls 5 &
0electin$ four L-Ls 5 &
0electin$ five L-Ls 5 &
5> >e1uired number of wa%s 5 = @F?&A
(D) 8umber of wa%s of selectin$ one or more thin$s from 4p+ identical thin$s
of one t%pe 41+ identical thin$s of another t%pe# 4r+ identical thin$s of the
third t%pe and 4n+ different thin$s is $iven b% -
(p?&) (1?&) (r?&))
n
6 &
:xample Hind the number of different choices that can be made from E
apples# , bananas and F man$oes# if at least one fruit is to be chosen2
-ns
8umber of wa%s of selectin$ apples 5 (E?&) 5 , wa%s2
8umber of wa%s of selectin$ bananas 5 (,?&) 5 F wa%s2
8umber of wa%s of selectin$ man$oes 5 (F?&) 5 = wa%s2
Total number of wa%s of selectin$ fruits 5 , x F x =
.ut this includes# when no fruits i2e2 Jero fruits is selected
5> 8umber of wa%s of selectin$ at least one fruit 5 (,xFx=) -& 5 &&I
8ote - There was no fruit of a different t%pe# hence here n5o
5> )
n
5 )
G
5&
(D!) 8umber of wa%s of selectin$ 4r+ thin$s from 4n+ identical thin$s is 4&+2
:xample !n how man% wa%s F balls can be selected from 4&)+ identical red
balls<
-ns2 The balls are identical# total number of wa%s of selectin$ F balls 5 &2
:xample 3ow man% numbers of four di$its can be formed with di$its &# )# E# ,
and F<
-ns2 3ere n 5 F @8umber of di$itsA
-nd r 5 , @ 8umber of places to be filled-upA
>e1uired number is
F
P
,
5 F'(&' 5 F x , x E x ) x &
Permutation Permutation means arrangement of thin$s2 The word
arrangement is used# if the order of thin$s is considered2
Combination Combination means selection of thin$s2 The word selection is
used# when the order of thin$s has no importance2
Example: 0uppose we have to form a number of consistin$ of three di$its
usin$ the di$its 1,2,3,4# To form this number the di$its have to be arranged2
/ifferent numbers will $et formed dependin$ upon the order in which we
arran$e the di$its2 This is an example of Permutation2
8ow suppose that we have to ma"e a team of && pla%ers out of )G pla%ers#
This is an example of combination# because the order of pla%ers in the team
will not result in a chan$e in the team2 8o matter in which order we list out the
pla%ers the team will remain the same' Hor a different team to be formed at
least one pla%er will have to be chan$ed2
8ow let us loo" at two fundamental principles of countin$
-ddition rule !f an experiment can be performed in 4n+ wa%s# M another
experiment can be performed in 4m+ wa%s then either of the two experiments
can be performed in (m?n) wa%s. This rule can be extended to an% finite
number of experiments2
:xample 0uppose there are E doors in a room# ) on one side and & on
other side2 - man want to $o out from the room2 7bviousl% he has 4E+ options
for it2 3e can come out b% door 4-+ or door 4.+ or door +C+2

Bultiplication >ule !f a wor" can be done in m wa%s# another wor" can be
done in 4n+ wa%s# then both of the operations can be performed in m x n wa%s2
!t can be extended to an% finite number of operations2
:xample2 0uppose a man wants to cross-out a room# which has ) doors
on one side and & door on other site2 3e has ) x & 5 ) wa%s for it2
Hactorial n The product of first 4n+ natural numbers is denoted b% n'2
n' 5 n(n-&) (n-)) NNNNNN22E2)2&2
:x2 F' 5 F x , x E x ) x & 5&)G
Note G' 5 &
Proof n' 5n# (n-&)'
7r (n-&)' 5 @n x (n-&)'A(n 5 n' (n
Puttin$ n 5 &# we have
7' 5 &'(&
or G 5 &
Permutation
8umber of permutations of 4n+ different thin$s ta"en 4r+ at a time is $iven
b%-
n
P
r
5 n'((n-r)'
Proof 0a% we have 4n+ different thin$s a
&
# a
)
NN# a
n
2
Clearl% the first place can be filled up in 4n+ wa%s2 8umber of thin$s left after
fillin$-up the first place 5 n-&
0o the second-place can be filled-up in (n-&) wa%s2 8ow number of thin$s left
after fillin$-up the first and second places 5 n - )
8ow the third place can be filled-up in (n-)) wa%s2
Thus number of wa%s of fillin$-up first-place 5 n
8umber of wa%s of fillin$-up second-place 5 n-&
8umber of wa%s of fillin$-up third-place 5 n-)
8umber of wa%s of fillin$-up r-th place 5 n 6 (r-&) 5 n-r?&
.% multiplication 6 rule of countin$# total no2 of wa%s of fillin$ up# first# second
-- rth-place to$ether -
n (n-&) (n-)) ------------ (n-r?&)
3ence
n
P
r
5 n (n-&)(n-)) --------------(n-r?&)
5 @n(n-&)(n-))----------(n-r?&)A @(n-r)(n-r-&)-----E2)2&2A ( @(n-r)(n-r-&)A ----E2)2&
n
P
r
5 n'((n-r)'
8umber of permutations of 4n+ different thin$s ta"en all at a time is $iven
b%-
n
P
n
5 n'
Proof
8ow we have 4n+ obOects# and n-places2
8umber of wa%s of fillin$-up first-place 5 n
8umber of wa%s of fillin$-up second-place 5 n-&
8umber of wa%s of fillin$-up third-place 5 n-)
8umber of wa%s of fillin$-up r-th place# i2e2 last place 5&
8umber of wa%s of fillin$-up first# second# --- n th place
5 n (n-&) (n-)) ------ )2&2
n
P
n
5 n'
Concept2
9e have
n
P
r
5 n'(n-r
Puttin$ r 5 n# we have -
n
P
r
5 n' ( (n-r)
.ut
n
P
n
5 n'
Clearl% it is possible# onl% when n' 5 &
3ence it is proof that G' 5 &
Note Hactorial of ne$ative-number is not defined2 The expression 6E' has
no meanin$2
:xamples
P2 3ow man% different si$nals can be made b% F fla$s from ;-fla$s of different
colours<
-ns2 8umber of wa%s ta"in$ F fla$s out of ;-fla$e 5
;
P
F
5 ;'((;-F)'
5 ; x Q x = x F x , 5 =Q)G
P2 3ow man% words can be made b% usin$ the letters of the word
R0!BP*:T78S ta"en all at a time<
-ns2 There are 4I+ different letters of the word R0!BP*:T78S
8umber of Permutations ta"in$ all the letters at a time 5
I
P
I
5 I' 5 E=);;G2
8umber of permutations of n-thin$# ta"en all at a time# in which 4P+ are of one
t%pe# 4$+ of them are of second-t%pe# 4r+ of them are of third-t%pe# and
rest are all different is $iven b% -
n'(p' x 1' x r'
:xample !n how man% wa%s can the letters of the word RPre-Tniversit%S be
arran$ed<
&E'()' U )' U )'
8umber of permutations of n-thin$s# ta"en 4r+ at a time when each thin$ can
be repeated r-times is $iven b% 5 n
r
2
Proof2
8umber of wa%s of fillin$-up first 6place 5 n
0ince repetition is allowed# so
8umber of wa%s of fillin$-up second-place 5 n
8umber of wa%s of fillin$-up third-place
8umber of wa%s of fillin$-up r-th place 5 n
3ence total number of wa%s in which first# second ----r th# places can be filled-
up
5 n x n x n ------------- r factors2
5 n
r
:xample - child has E poc"et and , coins2 !n how man% wa%s can he put
the coins in his poc"et2
-ns2 Hirst coin can be put in E wa%s# similarl% second# third and forth coins
also can be put in E wa%s2
0o total number of wa%s 5 E x E x E x E 5 E
,
5 ;&
>estricted 6 Permutations
(a) 8umber of permutations of 4n+ thin$s# ta"en 4r+ at a time# when a particular
thin$ is to be alwa%s included in each arran$ement
5 r
n-&
P
r-&
(b) 8umber of permutations of 4n+ thin$s# ta"en 4r+ at a time# when a particular
thin$ is fixed 5
n-&
P
r-&
(c) 8umber of permutations of 4n+ thin$s# ta"en 4r+ at a time# when a particular
thin$ is never ta"en 5
n-&
P
r2
(d) 8umber of permutations of 4n+ thin$s# ta"en 4r+ at a time# when 4m+ specified
thin$s alwa%s come to$ether 5 m' x ( n-m?&) '
(e) 8umber of permutations of 4n+ thin$s# ta"en all at a time# when 4m+
specified thin$s alwa%s come to$ether 5 n ' - @ m' x (n-m?&)' A
:xample 3ow man% words can be formed with the letters of the word
47B:C-+ when
(i) 47+ and 4-+ occup%in$ end places2
(ii) 4:+ bein$ alwa%s in the middle
(iii) Dowels occup%in$ odd-places
(iv) Dowels bein$ never to$ether2
-ns2
(i) 9hen 47+ and 4-+ occup%in$ end-places
5> B2:2C2 (7-)
3ere (7-) are fixed# hence B# :# C can be arran$ed in E' wa%s
.ut (7#-) can be arran$ed themselves is )' wa%s2
5> Total number of words 5 E' x )' 5 &) wa%s2
(ii) 9hen 4:+ is fixed in the middle
5> 72B2(:)# C2-2
3ence four-letter 72B2C2-2 can be arran$ed in ,' i2e ), wa%s2
(iii) Three vowels (7#:#-#) can be arran$ed in the odd-places (&
st
# E
rd
and F
th
) 5 E' wa%s2
-nd two consonants (B#C#) can be arran$ed in the even-place
()
nd
# ,
th
) 5 ) ' wa%s
5> Total number of wa%s5 E' x )' 5 &) wa%s2
(iv) Total number of words 5 F' 5 &)G'
!f all the vowels come to$ether# then we have (72:2-2)# B#C
These can be arran$ed in E' wa%s2
.ut (7#:2-2) can be arran$ed themselves in E' wa%s2
5> 8umber of wa%s# when vowels come-to$ether 5 E' x E'
5 E= wa%s
5> 8umber of wa%s# when vowels bein$ never-to$ether
5 &)G-E= 5 ;, wa%s2
8umber of Combination of 4n+ different thin$s# ta"en 4r+ at a time is $iven b%-
n
C
r
5 n' ( r ' x (n-r)'
Proof :ach combination consists of 4r+ different thin$s# which can be arran$ed
amon$ themselves in r' wa%s2
5> Hor one combination of 4r+ different thin$s# number of arran$ements 5 r'
Hor
n
C
r
combination number of arran$ements r
n
C
r
5> Total number of permutations 5 r'
n
C
r
---------------(&)
.ut number of permutation of 4n+ different thin$s# ta"en 4r+ at a time
5
n
P
r
-------())
Hrom (&) and ())
n
P
r
5 r' 2
n
C
r
or n'((n-r)' 5 r' 2
n
C
r

or
n
C
r
5 n'(r'x(n-r)'
Note:
n
C
r
5
n
C
n-r
or
n
C
r
5 n'(r'x(n-r)' and
n
C
n-r
5 n'((n-r)'x(n-(n-r))'
5 n'((n-r)'xr'
>estricted 6 Combinations
(a) 8umber of combinations of 4n+ different thin$s ta"en 4r+ at a time# when
4p+ particular thin$s are alwa%s included 5
n-p
C
r-p
2
(b) 8umber of combination of 4n+ different thin$s# ta"en 4r+ at a time# when
4p+ particular thin$s are alwa%s to be excluded 5
n-p
C
r
:xample !n how man% wa%s can a cric"et-eleven be chosen out of &F
pla%ers< if
(i) - particular pla%er is alwa%s chosen#
(ii) - particular is never chosen2
-ns
(i) - particular pla%er is alwa%s chosen# it means that &G pla%ers are
selected out of the remainin$ &, pla%ers2
52 >e1uired number of wa%s 5
&,
C
&G
5
&,
C
,
5 &,'(,'x&I' 5 &E=F
(ii) - particular pla%ers is never chosen# it means that && pla%ers are selected
out of &, pla%ers2
5> >e1uired number of wa%s 5
&,
C
&&

5 &,'(&&'xE' 5 E=,
(iii) 8umber of wa%s of selectin$ Jero or more thin$s from 4n+ different thin$s is
$iven b%- )
n
-&
Proof 8umber of wa%s of selectin$ one thin$# out of n-thin$s 5
n
C
&
8umber of selectin$ two thin$s# out of n-thin$s 5
n
C
)
8umber of wa%s of selectin$ three thin$s# out of n-thin$s 5
n
C
E
8umber of wa%s of selectin$ 4n+ thin$s out of 4n+ thin$s 5
n
C
n
5>Total number of wa%s of selectin$ one or more thin$s out of n different
thin$s
5
n
C
&
?
n
C
)
?
n
C
E
? ------------- ?
n
C
n
5 (
n
C
G
?
n
C
&
? -----------------
n
C
n
) -
n
C
G
5 )
n
6 & @
n
C
G
5&A
:xample Kohn has ; friends2 !n how man% wa%s can he invite one or more of
them to dinner<
-ns2 Kohn can select one or more than one of his ; friends2
5> >e1uired number of wa%s 5 )
;
6 &5 )FF2
(iv) 8umber of wa%s of selectin$ Jero or more thin$s from 4n+ identical thin$s is
$iven b% - n?&
:xample !n how man% wa%s# can Jero or more letters be selected form the
letters -----<
-ns2 8umber of wa%s of
0electin$ Jero L-Ls 5 &
0electin$ one L-Ls 5 &
0electin$ two L-Ls 5 &
0electin$ three L-Ls 5 &
0electin$ four L-Ls 5 &
0electin$ five L-Ls 5 &
5> >e1uired number of wa%s 5 = @F?&A
(D) 8umber of wa%s of selectin$ one or more thin$s from 4p+ identical thin$s
of one t%pe 41+ identical thin$s of another t%pe# 4r+ identical thin$s of the
third t%pe and 4n+ different thin$s is $iven b% -
(p?&) (1?&) (r?&))
n
6 &
:xample Hind the number of different choices that can be made from E
apples# , bananas and F man$oes# if at least one fruit is to be chosen2
-ns
8umber of wa%s of selectin$ apples 5 (E?&) 5 , wa%s2
8umber of wa%s of selectin$ bananas 5 (,?&) 5 F wa%s2
8umber of wa%s of selectin$ man$oes 5 (F?&) 5 = wa%s2
Total number of wa%s of selectin$ fruits 5 , x F x =
.ut this includes# when no fruits i2e2 Jero fruits is selected
5> 8umber of wa%s of selectin$ at least one fruit 5 (,xFx=) -& 5 &&I
8ote - There was no fruit of a different t%pe# hence here n5o
5> )
n
5 )
G
5&
(D!) 8umber of wa%s of selectin$ 4r+ thin$s from 4n+ identical thin$s is 4&+2
:xample !n how man% wa%s F balls can be selected from 4&)+ identical red
balls<
-ns2 The balls are identical# total number of wa%s of selectin$ F balls 5 &2
:xample 3ow man% numbers of four di$its can be formed with di$its &# )# E# ,
and F<
-ns2 3ere n 5 F @8umber of di$itsA
-nd r 5 , @ 8umber of places to be filled-upA
>e1uired number is
F
P
,
5 F'(&' 5 F x , x E x ) x &

Anyways for the question I would say:-
Let the 4 women be seated in a spacing first .They can be arranged in (4-!" # $"
ways.
%ow&between these 4 women the men can be arranged in 4"(can be written as 4' (
$"! ways.)*ere 4" since it also matters between which two women the man is sitting
with+
,o&the answer will be 4" ( $" # -4 ( . # 44 ways.