Permutations

Permutations are multiplicative events where the number of possibilities is decreasing and whether it is important the order of a permutation, it is an arrangement of a set of objects in a defined order.

The number of possible permutations to take objects from the set of elements will be, following the same argumentation:

Watch the video:

Permutations can be:

• Without repetition of n items taken all at once.

bioprofe |permutations-theory|01

• Permutations without repetition of n elements taken in groups of r ítems.

bioprofe |permutations-theory|02

• With repetition of n elements taken in groups of r ítems.

bioprofe |permutations-theory|03

• Permutations of n elements which h is from a type, j is from other, etc. In this case, all the elements enter, the order does matter and the elements are repeated.

bioprofe |permutations-theory|04

• Circular Permutations. These are used when elements have to be ordered “in circle” so that the first element that “take place” in the sample determines the beginning and end of the sample.

(For example, commensals at a table)

bioprofe |permutations-theory|05

It must be clear that the factorial function (symbol: ! ) means that all smaller numbers are multiplied:

Example:

bioprofe |permutations-theory|06

You can download the App BioProfe READER to practice this theory with self-corrected exercises.