PERMUTATION

PERMUTATION
LBSITW

Sajith P

October 8, 2020

Sajith P PERMUTATION October 8, 2020 1 / 18

Permutation

Permutations with Repetition

We have a set of n distinct objects.
An ordered arrangement of r object of the set when repetetion is allowed is
called an r-permutation with repetition.

Sajith P PERMUTATION October 8, 2020 2 / 18

Permutation

Example
When repetition is allowed pove P(n, r ) = nr

Sajith P PERMUTATION October 8, 2020 3 / 18

Permutation
Proof.
P(n, r ) is the r permutation of n thing with repetition allowed.
It is like filling r places with n obeject.
Let T be the task of filling r places with n object.
Let
T1 be the task of filling the fist place with n objects.
This can be performed in n ways
Since repetition is allowed, after filling the first place there are again n
object left.
T2 be the task of filling the second place with n objects.
This can also be performed in n ways
After filling the second place there again are n object left.
T3 be the task of filling the third place with n objects.
This can be performed in n ways.

Sajith P PERMUTATION October 8, 2020 4 / 18

Permutation

Proof.
After filling the third place there are n object left.

Tr be the task of filling the rth place with n objects.

This can be performed in n ways.
So the task T can be performed in T1 . T2 . T3 . . . . Tr ways

= n. n. n. . n, r times
r
= n

Sajith P PERMUTATION October 8, 2020 5 / 18

Permutation

Example
How many strings of length r can be formed from the uppercase letters of
the English alphabet if repetition is allowed.

Sajith P PERMUTATION October 8, 2020 6 / 18

Permutation

Solution
Let T be the task of filling r places with 26 object.
It is the permutation of 26 things taken r at a time with repetetion allowed.
i.e. P(26, r ) with repetiotion.
So T = P(26, r ) = 26r

Sajith P PERMUTATION October 8, 2020 7 / 18

Permutation

Permutations when the objects are not distinct

Theorem
We have n ojects. Out of this n objets there are n1 indistinguishable
objects of first type , n2 indistinguishable objects of second type , . . . . . .
and nr indistinguishable objects of rth type such that
n1 + n2 + n3 + . . . + nr = n
Then number of different permutation is n1 !.n2n !,....n
!
r !

Sajith P PERMUTATION October 8, 2020 8 / 18

Permutation

Example
How many distinct bit strings can be formed from three 0’s and two 1’s?
Forming distinct bit of string using three 0’s and two 1’s.

Sajith P PERMUTATION October 8, 2020 9 / 18

Permutation

Solution
Let T be the task of forming distinct strings using three 0’s and two 1’s.
Total permutation using 5 digits = 5!.
Out this permutation three 0’s and two 1’s are indistinguishable.
So T = 3 5!.2! ! = 12012 = 10

Sajith P PERMUTATION October 8, 2020 10 / 18

Permutation

Example
In how many ways can the letters in the DATAGRAM can be arrianged?.
How many have all three A’s togther?

Sajith P PERMUTATION October 8, 2020 11 / 18

Permutation

Solution
Let T be the number of distinct arriangemnts using the letters of the word
DATAGRAM
Since there is three A’s T = 83 !! = 6720
If A’s are togther we have only six letters D, T, G, R, AAA
So number of arriange if 3 A’s togther = 6 ! = 720 ways.

Sajith P PERMUTATION October 8, 2020 12 / 18

Permutation

Example
1 In how many ways can the letters in the SOCIOLOGICAL can be
arrianged?.
2 How many of the arriangement in part (a) are A and G adjacent?
3 How many of the arriangement in part (a) are all the vowels adjacent?

Sajith P PERMUTATION October 8, 2020 13 / 18

Permutation
Solution
1 Number of arriangement using the letters of the word

SOCIOLOGICAL = 3 !.212!.2! !.2 !

2 to find number of arriangement in which are A and G adjacent.
Let T1 The number of arriangement in which are A and G adjacent in
the form AG = 3 !.211!.2! !.2 !
Let T2 The number of arriangement in which are A and G adjacent in
the form GA = 3 !.211!.2! !.2 !
So total arriangement = T1 + T2 = 3 !.211!.2! !.2 ! + 3 !.211!.2! !.2 !
3 The the vowels in the word SOCIOLOGICAL are I,I,O, O, O, A, six
letters.
Let T1 be the ariangement of this six letters textbfI,I,O, O, O, A
So T1 = 2 6!.3! !
Then the number of ariangement of this 12 letters with all vowels
adjacent = 212!.2! ! . 2 6!.3! !
Sajith P PERMUTATION October 8, 2020 14 / 18
Permutation

Circular permutation
Suppose we have n objects.
We have to arriange these n object around a cirle.
The total number of ways of arrianging these n object around a circle is
called circular permutation.
It is of two types.
1 Case 1:- Clockwise and Anticlockwise orders are different.
2 Case 2:- Clockwise and Anticlockwise orders are same.

Sajith P PERMUTATION October 8, 2020 15 / 18

Permutation

Suppose we have four chairs around the roundtable.

We need to make arrangement for four persons A, B, C , and D.
Any of the persons can take any of the positions.
Suppose any one take a chair then the number of options reduces by one
for the other three persons.

Sajith P PERMUTATION October 8, 2020 16 / 18

Permutation

If it is a linear permutation, four persons A, B, C , and D can arrange

themselves in 4 ! ways.
As in a linear permutation ı.e, in a row arrangement, there is a start and
there is an end.
But in the circular permutation, there is nothing like a start or an end.
In the circular permutation, we consider that one person or object is fixed.
Then we arriange the remaining persons or objects. Suppose the position
of A is fixed.
The number of ways in which the other three persons arrange themselves
is (4 − 1) ! = 3 ! = 6.

Sajith P PERMUTATION October 8, 2020 17 / 18

Permutation

P(n, n) = Circular permutation n object around a circle.

P(n, n) = (n − 1) !

Sajith P PERMUTATION October 8, 2020 18 / 18