We want to find the number of all possibilities, that a set of $n$ elements can be ordered. Again it can be viewed as a multi-stage process, where elements are drawn sequentially, but this time every draw reduces the number of possibilities for all later stages (drawing without replacement). ![[permutation.png|center|400]] $ n*(n-1)*(n-2)*\dots * 1=n! $