Permutation Calculation

Permutation is the act of calculating the number of ways to arrange different things in a particular order. Permutations deal with combinations that take into account the order of things. It is mathematically defined as:

Permutations are used when order is important. For example, if you consider the permutations of two people out of three, each time you arrange the two people in a different order, you get a different permutation. {A, B} and {B, A} are combinations. They are counted as the same in calculations, but as different in permutations.

Difference between permutation calculations and combination calculations

The main difference between permutation calculations and combination calculations is , "Whether to consider the order." Permutations consider the order, while combinations ignore the order.

Permutation

The order of arrangement is important → For example, "A-B-C" and "C-B-A" are different.

Example: If you select 3 people from 5 and arrange them in a certain order, there are 60 ways.

Combination calculations< /h4>

The order doesn't matter → For example, "A-B-C" and "C-B-A" are the same.

Example: If you choose 3 people from 5 without considering the order: 10 ways

Select r elements from n elements and sort them Calculate the number of permutations.

n! is the factorial of n, and (n - r)! is the factorial of (n - r).

Factorials and refers to the result of multiplying a positive integer by all the integers from that integer to 1. A factorial is represented using the symbol "!".

Example: Select 3 out of 5 elements and arrange them

5P3 = 5 ​​× 4 × 3 = 60

This tool is available for free.