**Permutations**

## Table of Content |

**What do you mean by Permutation?**

The word ** permutation** means

**arrangement**of the alike or different objects taken some or all at a time. So we can observe the word ‘arrangement’ used in the definition of permutation. Here the arrangement means selection as well as ordering. That means the order in which the objects are selected have also been taken care of in this case.

**For Example**

The number of 5 digit numbers which can be formed using the digits 0, 1, 2, 3, 4 and 5.

In this example, we just not have to select the 5 digits out of given 6 digits but also have to see the number of possible cases for the different arrangement. So, the numbers 34251, 21034, 42351 are all different cases.

We will try to explore this definition in the upcoming heading.

**Explain Permutation with some practical examples**

Permutation refers to the situation where the arrangement of objects are being considered.

In general, the permutation of n distinct objects taken r at a time, is represented and calculated as:

This can also be represented as **P(n, r) or P _{r}^{n}**. Here, in the definition of permutation,

*r*can be any positive integer less then or equals to

*n*So, on the basis of the values of

**.***r*whether it is less then or equals to n we can have two different conditions or theorems.

**Theorem – 1**

The number of permutations or arrangement of n distinct things taken all at a time can be represented by:

Consider the 5 seats in a car on which 5 persons are to be seated.

So, to find the number of cases in which 5 persons can be seated will be the case of permutation of 5 persons taking all 5 seats at a time (^{5}*P _{5})*.

**Theorem - 2**

The number of permutations or arrangement of n distinct things taken only r (r < n) at a time can be represented by:

**Example**

Consider the 10 chairs in a room for which 15 persons are supposed to be seated.

In this case, here we have 15 persons to be arranged but only on 10 chairs. So, this can be calculated by ^{15}P_{10.}

One more thing which we can learn by observing the above example is that, we first need to choose or select 10 out of 15 persons which can be arranged on 10 available chairs.

So, every problem on permutation is broken down into selection and then arrangement.

that is,

Permutation = Selection x Arrangement |

**What is Distinguishable Permutations?**

Distinguishable Permutations are the permutations which are different from each other. The number of distinguishable permutations of *n* things (taken all at a time) out of which *– p* are all alike and is of one kind, *q* are also alike but of another kind and rest all different will be given by

**For Example**

The permutations of the numbers 1, 2 and 3 will be – 123, 132, 213, 231, 312, 321. All these 6 permutations (that is, 3!) are different and thus are distinguishable permutations.

But let us take another example where we have to find the permutations of the numbers 1, 2 and 1 (here we have 2 ones). In this case, the possible permutations will be 121, 112, 211, 211, 121, 112. Again, we have 6 permutations but out of these only 3 are distinguishable or different.

Thus, the number of distinguishable permutations will be calculated as 3!/2! = 3

So, the number of different permutations possible

Let us take one of the favorite example of permutations.

**Example**

Find the number of different permutations of the word ‘** ASSASSINATION**’

In this example, we have given 13 alphabets in which A occurs 3 times, S occurs 4 times, I occurs 2 times, N occurs 2 times, T and O occurs 1 times each.

So, the number of different permutations possible

**Explain the Permutation of alike objects**

When we are given certain set of objects or items, in which some of them are identical of the same kind and these identical groups may be of two or more items, in this case the number of permutations actually reduces. This concept of distinguishable permutation is also explained in the previous heading.

Let us break this problem into two different cases.

**Case – I:** Permutation of alike objects taken all at a time.

This case is same as that which is explained under the subheading – ‘** Distinguishable Permutations**’. There it was assumed that the permutations of all the given objects is to be done. So, let’s directly take an example to understand this case.

**Example**

How many different words can be formed with the letters of the word **‘PATALIPUTRA’**.

In the given word, we have two P’s, three A’s, two T’s, one L, one I, one U and one R.

So, the number of different permutations of the given word (taken all at a time)

One example, which you may try on this case – How many 8 digit numbers can be formed using two 1’s, two 2’s, two 3’s, one 4 and one 5.

One more example of alike permutation is shown in the figure.

**Case – II:** Permutation of alike objects taken few at a time.

In this case, where we are supposed to permutate few objects from the given number of objects, we actually need to form different cases depending upon the given problem. In every problem of this case, we first go for selection and then arrangement.

Permutation = Selection x Arrangement |

Below is the example to understand this case.

**Example**

Find the number of words each consisting 5 letters from the letters of the word “INDEPENDENCE”

Here, we have – four E’s, three E’s, two D’s, one P, one I and one C.

Now, to form a 5 lettered word, we need to make different cases,

**Case – i)** 4 alike and 1 different (that is, EEEEP)

For four alike, we only have one option i.e. E and 5 options for selecting one different (e.g. EEEP)

So, selection = 1 x ^{5}C_{1} = 5

Arrangement = 5!/4!

Thus, Number of permutation

**Case – ii)** 3 alike and 2 different (that is, EEEDC)

selection = ^{2}C_{1} x ^{5}C_{2} = 20

Arrangement = = 5!/3!

Thus, Number of permutation

**Case – iii)** 3 alike and 2 alike of different kind (that is, EEEDD)

selection = ^{2}C_{1} x ^{5}C_{1} = 4

Arrangement

Thus, Number of permutation

**Case – iv)** 2 alike and 3 diff (that is, EENDI)

selection = ^{3}C_{1} x ^{5}C_{3} = 30

Arrangement = 5!/2!

Thus, Number of permutation

**Case – v)** 2 alike + 2 other alike and 1 diff (that is, EENND)

selection = ^{3}C_{2} x 4 = 12

Arrangement

Thus, Number of permutation

**Case – vi)** all five different (that is, EDIPC)

selection = ^{6}C_{5} = 6

Arrangement = 5!

Thus, number of permutation = 6 x 5! = 720

Thus, add all the results of different cases at the end to get the final answer.

**What is circular permutation and how it is different from linear permutation?**

Till now, we have discussed only about linear permutation in which we arrange the given objects into a single row.

In case of circular permutation, the objects will be arranged in the ** circular fashion** i.e. they won’t have starting or end point.

For the circular permutation, one just fix the place of any one of the object and arrange the others same as that of linear permutation. This technique effectively will give us the number of circular permutations. Now the reason, why we are fixing the place of one and then arranging the others in linear permutation can be understood very comfortable by an example in the below figure.

In the figure, two different circular arrangement (1 and 2) are shown. The relative positions of A, B and C are exactly same in two respective arrangements. And thus, we can consider, all the arrangements shown in either 1 or 2 are same but arrangement in 1 is different from arrangement 2. So, finally we only have 2 different arrangement.

Thus, to solve this problem of repetition, we first fix the position of any one.

In general, the number of circular permutation of *n* distinct objects (when objects are different) is **(n-1)!. **

But note that, in this definition, we are assuming the clockwise order and anti-clock wise order as different permutation.

While, if anti-clockwise and clock wise are considered to be same, then the total number of permutation will be half of that of the previous case. that is,This happens in the case of flowers or garland beds in a neckless.

Note – If we have n different things off which only 4 things has to be arranged in the circular order, then the number of arrangements will be = ^{n}**C _{r }x (r-1)!**

**Example**

Find the number of ways in which 12 people can be seated on a round table so that all shall not have the same neighbors in any two arrangements.

For this case, anti-clock wise and clock wise arrangements will be considered as same.

Thus, the number of permutations will be

**More Readings**

**To read more, Buy study materials of ****Permutations and Combinations**** comprising study notes, revision notes, video lectures, previous year solved questions etc. Also browse for more study materials on Mathematics ****here**.