If n is a list or set, then permute returns a list of all the permutations of the elements of n, taken r at a time.  If n is a non-negative integer, it is interpreted in the same way as a list of the first n integers. If r is not specified, then it is taken to be equal to the number of elements in n.

The permutations are generated in order. Duplicates in n are respected.

The function numbperm will compute the number of possible permutations: numbperm(n, r) = nops(permute(n, r)).

The command with(combinat,permute) allows the use of the abbreviated form of this command.