Permutation: Definition, Formula, Types, and Examples

Permutation basically means the arrangement of things. And when we talk about arrangement then the order becomes important if the things to be arranged are different from each other (when things to be arranged are the same then order doesn’t have any role to play). So in permutations order of objects becomes important. In real life, we use permutation for arranging numbers, letters, codes, and alphabets.

In this article, we will cover the Introduction Of Permutation. This topic falls under the broader category of Permutations and combinations, which is a crucial chapter in Class 11 Mathematics. This is very important not only for board exams but also for competitive exams, which even include the Joint Entrance Examination Main and other entrance exams: SRM Joint Engineering Entrance, BITSAT, WBJEE, and BCECE. A total of thirteen questions have been asked on this topic in JEE Main from 2013 to 2023 including one in 2013, one in 2014, two in 2020, one in 2021, and eight in 2023.

Permutation: Definition

A permutation is an arrangement of all or part of a set of objects, with regard to the order of the arrangement.

Arranging n objects in r places (Same as arranging n objects taken r at a time) is equivalent to filling $r$ places from $n$ things.

For example, suppose we have a set of three letters: A, B, and C. We want to find the number of ways in which 2 letters from this set can be arranged. Each possible arrangement would be an example of a permutation. The complete list of possible permutations would be $A B, A C$, $B A, B C, C A$, and $C B$. Thus there 6 number of permutations. We observe that the order in which letters are occurring is important, i.e., AB and BA are two different arrangements. In mathematics, we use a specific terminology. That is "permutations as $n$ distinct objects taken $r$ at a time". Here n refers to the number of objects from which the permutation is formed, and $r$ refers to the number of objects used to form the permutation. In the above example, the permutation was formed from 3 letters (A, B, and C), so $n=3$ and the permutation consisted of 2 letters, so $\mathrm{r}=$.

Permutation Formula

Arranging $n$ objects in $r$ places (Same as arranging $n$ objects taken $r$ at a time) is equivalent to filling $r$ places from $n$ things.

So the number of ways of arranging $n$ objects taken $r$ at a time $=n(n-1)$ $(n-2) \ldots(n-r+1)$

$
\frac{n(n-1)(n-2) \ldots(n-r+1)(n-r)!}{(n-r)!}=\frac{n!}{(n-r)!}={ }^n P_r
$

Where $r \leq n$ and $r \in W$

So, the number of ways arranging n different objects taken all at a time $=$ ${ }^{\imath} P_n=n!$

Example: In how many ways can 5 people be seated at 3 places?

Solution: Basically this question is about arranging 5 people at 3 different places

Let's think that we are given 3 places, so for the first place we have 5 people to choose from, hence this can be done in 5 ways as all 5 are available.

Now for 2nd place we have 4 people to choose from, hence this can be done in 4 ways.

Similarly, for 3rd place, we have 3 choices.
Since we have to choose for all 3 places, so multiplication rule is applicable, and the total number of ways $5 \times 4 \times 3=120$,

This can also be done directly from the notation or formula

$
{ }^{\mathrm{n}} \mathrm{P}_{\mathrm{r}} \text { where } \mathrm{n}=5, \mathrm{r}=3, \text { so }{ }^5 \mathrm{P}_3=\frac{5!}{2!}=5 \times 4 \times 3=120
$
Example: Find the number of ways the letters of the word "BIRTHDAY" can be arranged taken all at a time.

Solution: From the above concept directly using the formula ${ }^n \mathrm{P}_{\mathrm{n}}$ we have

$
{ }^8 \mathrm{P}_8=8!=40,320
$

Types of Permutation

Permutation can be classified into three different categories:

• Permutation of n different objects (when repetition is not allowed)

• Repetition, where repetition is allowed

• Permutation when the objects are not distinct (Permutation of multisets)

Permutation of n different objects

If $n$ is a positive integer and $r$ is a whole number, such that $r<n$, then $P(n$, r) represents the number of all possible arrangements or permutations of n distinct objects taken r at a time. In the case of permutation without repetition, the number of available choices will be reduced each time. It can also be represented as ${ }^n P_r$.

$
P(n, r)=n!/(n-r)!
$

Permutation when repetition is allowed

When the number of objects is " $n$," and we have " $r$ " to be the selection of object, then;

Choosing an object can be in $n$ different ways.
Thus, the permutation of objects when repetition is allowed will be equal to,

$
n \times n \times n \times \ldots \ldots(r \text { times })=n^r
$
Permutation of multi-sets

Permutation of n different objects when $\mathrm{P}_1$ objects among ' $n$ ' objects are similar, $\mathrm{P}_2$ objects of the second kind are similar, $\mathrm{P}_3$ objects of the third kind are similar $\qquad$ and so on, $\mathrm{P}_{\mathrm{k}}$ objects of the kth kind are similar and the remaining of all is of a different kind,

Thus it forms a multiset, where the permutation is given as:

$
\frac{n!}{P_{1}!P_{2}!\ldots P_{n}!}
$

Relation Between Combination And Permutations

The relation between combinations and permutations is given by

$
{ }^n C_r \times r!={ }^n P_r
$
Factorial notation

Many times we multiplied consecutive integers. On the basis of this factorial notation is devised. In the counting principle many times answer is written in the form of factorial to save us time. The product of first $n$ natural numbers is denoted by $\mathrm{n}!$ and is read as 'factorial n '.

Note:
The factorial of zero is defined and its value is one.

Solved Examples Based on Permutation

Example 1: Eight persons are to be transported from city A to city B in three cars of different makes. If each car can accommodate at most three persons, then the number of ways, in which they can be transported, is
[JEE MAINS 2023]

Solution

$
\begin{aligned}
& \text { Ways }=\frac{8!}{3!3!2!2!} \times 3! \\
& =\frac{8 \times 7 \times 6 \times 5 \times 4}{4} \\
& =56 \times 30 \\
& =1680
\end{aligned}
$

Hence, the answer is 1680

Example 2: The letters of the word OUGHT are written in all possible ways and these words are arranged as in a dictionary, in a series. Then the serial number of the word TOUGH is
[JEE MAINS 2023]

Solution

Hence, the answer is 89

Example 3: The number of seven digits odd numbers, that can be formed using all the seven digits $1,2,2,2,3,3,5$ is $\qquad$
[JEE MAINS 2023]
Solution The no. of 7-digit odd Numbers that can be formed using 1, 2, 2, $2,3,3,5$

= 240

Hence, the answer is 240

Example 4: The number of 4-letter words, with or without meaning, each consisting of 2 vowels and 2 consonants, which can be formed from the letters of the word UNIVERSE without repetition is [JEE MAINS 2023]

Solution: UNIVERSE:

2 vowels different, 2 consonants different

$
\begin{aligned}
& \left({ }^3 \mathrm{C}_2\right)\left({ }^4 \mathrm{C}_2\right)(4!) \\
& =(3)(6)(24) \\
& =432
\end{aligned}
$

Hence, the answer is 432.

Example 5: The number of integers, greater than 7000 that can be formed, using the digit $3,5,6,7,8$ without repetition, is
[JEE MAINS 2023]
Solution
C-1

$
\begin{aligned}
& 2 \times 4 \times 3 \times 2=48 \\
& C-2 \quad 5!(5 \text { digit nos })=\frac{120}{168}
\end{aligned}
$

Hence, the answer is 168

Summary

The permutations represent the number of distinct arrangements of objects where the order matters. The calculation of permutations using factorial notation provides a precise method to quantify and analyze sequential arrangements. Understanding of permutation is necessary for solving complex problems.