Skip to main content
Logo image

Section 21.2 Definition

We often want to count how many ways we can โ€œmix upโ€ the objects in a collection.
permutation
a bijection from a finite set to itself

Remark 21.2.1.

Once you have written the elements of a finite set in some order, think of a permutation as a way of re-ordering them.

Example 21.2.2. Permutations of three objects.

Figure 21.2.3 contains tables of values for all six possible permutations of the set A={a,b,c}. We have grouped them according to: all elements fixed; one element fixed and two mixed; all elements mixed.
x a b c
idA(x) a b c
x a b c
fa(x) a c b
fb(x) c b a
fc(x) b a c
x a b c
sr(x) c a b
sl(x) b c a
Figure 21.2.3. All possible permutations on three objects.