With permutations, we can count the number of different ways of choosing objects from a set if the order of the objects does matter. This is different from combinations, where the order of the objects does not matter.

Here, we will start with a summary of permutations and look at their formula. Then, we will see several examples with answers to understand the application of the permutations formula.

## Summary of permutations

A permutation is a list of objects, in which the order is important. Permutations are used when we are counting without replacing objects and order does matter. If the order doesn’t matter, we use combinations.

In general *P*(*n, k*) means the number of permutations of *n* objects from which we take *k* objects. Alternatively, the permutations formula is expressed as follows:

where:

*n*represents the total number of elements in a set*k*represents the number of selected objects- ! is the factorial symbol

To solve permutations problems, we have to remember that the factorial (denoted as “!”) is equal to the product of all positive integers less than or equal to the number preceding the factorial. For example, .

## Permutations – Examples with answers

In the following examples, we will see the application of the permutations formula. Each example has its respective detailed solution, which can be used to understand the reasoning in the answer to each exercise.

**EXAMPLE 1**

Find the result of the permutation .

##### Solution

We have to use the permutations formula , and substitute and :

We can simplify this by writing to 7! as :

**EXAMPLE 2**

Find the result of the permutation .

##### Solution

We use the permutations formula using the values and :

In this case, we have nothing to simplify, so we have to calculate 8!:

Start now: Explore our additional Mathematics resources

**EXAMPLE 3**

Find the number of permutations .

##### Solution

In this case, we have the values and :

We recognize that we can write 9! as .Therefore, we simplify the 3!:

**EXAMPLE 4**

How many permutations are there with 4 objects and 2 places?

##### Solution

We can recognize the values and . Therefore, we use the formula substituting these values:

We rewrite the 4! as and we simplify:

**EXAMPLE 5**

In how many ways can a president, treasurer, and secretary be chosen from 7 candidates?

##### Solution

The problem involves 7 candidates, of which we chose 3. Therefore, we have the values and :

Now, we write 7! as . Then, we simplify the 4!:

**EXAMPLE 6**

In how many ways can the first 3 places be awarded in a race with 5 participants?

##### Solution

We recognize the values and :

We rewrite the factorial 5! as . Then, we simplify the 2!:

→ Permutations Calculator (nPr)

## Permutations – Practice problems

Practice and test your knowledge of permutations. Select an answer and check it to see if you chose the correct answer. If you need help, you can look at the solved examples above.

## See also

Interested in learning more about factorials, permutations, and combinations? Take a look at these pages:

### Learn mathematics with our additional resources in different topics

**LEARN MORE**