Examples for

The permutation is an important operation in combinatorics and in other areas of mathematics. To permute a list is to rearrange its elements. To count the permutations of a list is to count the number of unique rearrangements of the list. Wolfram|Alpha is useful for counting, generating and doing algebra with permutations.

Perform calculations using permutations and analyze their properties.

Permute different types of data, such as sets with no repeat elements and lists that allow repetition.

Generate random permutations of a specified number of elements.

Count how many rearrangements of a set or list are unique. Use different list sizes and permutation sizes.