# Permutations

Definition: Permutations are a fundamental concept in combinatorics that deal with the arrangement of objects or elements in a specific order. A permutation is an ordered arrangement of objects taken from a set without repetition.

Key Concepts:

1. Permutation: A permutation is an ordered arrangement of "r" distinct objects selected from a set of "n" distinct objects without repetition. The order of arrangement matters in permutations.

The number of permutations of a set of objects is given by the following formula:

P(n) = n!


where is the factorial of , which is the product of all the positive integers less than or equal to .

For example, the number of permutations of a set of 3 objects is:

P(3) = 3! = 3 * 2 * 1 = 6

2. Factorial Notation: Factorial notation is commonly used in permutations. The symbol "n!" represents the factorial of a non-negative integer "n" and is defined as the product of all positive integers from 1 to "n."

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

3. Permutation Formula: The number of permutations of "r" objects selected from a set of "n" distinct objects without repetition is calculated using the permutation formula:

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

Where:

• P(n, r) represents the number of permutations of "r" objects from a set of "n."
• n! is the factorial of "n."
• (n - r)! is the factorial of "n - r."
4. Example: Suppose you have a set of 5 distinct books, and you want to arrange 3 of them on a shelf in a specific order. To find the number of permutations, use the formula:

P(5, 3) = 5! / (5 - 3)! P(5, 3) = 5! / 2! P(5, 3) = (5 × 4 × 3 × 2 × 1) / (2 × 1) P(5, 3) = 60 permutations

So, there are 60 different ways to arrange 3 books out of 5 on the shelf.

5. Permutation with Repetition: In some cases, you may need to calculate permutations with repetition. This occurs when objects can be repeated in the arrangement. The formula for permutations with repetition is:

P(n, r) = ${n}^{r}$

Where:

• P(n, r) represents the number of permutations of "r" objects from a set of "n" with repetition.
• n is the number of distinct objects.
• r is the number of positions or repetitions.
6. Application: Permutations are widely used in various fields, including mathematics, statistics, computer science, and cryptography. They are essential for solving problems related to arranging elements in specific orders, creating passwords, and analyzing data.

7. Circular Permutations: Circular permutations deal with arranging objects in a circle or cycle. In a circular permutation, the order of objects is considered, and it is one less than the number of linear permutations. The formula for circular permutations is:

P(n) = (n - 1)!

Where:

• P(n) represents the number of circular permutations of "n" distinct objects arranged in a circle.