Hypercube[n] constructs an n-dimensional hypercube.

IdentityPermutation[n] gives the size-n identity permutation.

InitializeUnionFind[n] initializes a union-find data structure for n elements.

Josephus[n, m] generates the inverse of the permutation defined by executing every m\[Null]^th member in a circle of n members.

NthSubset[n, l] gives the n\[Null]^th subset of list l in canonical order.

NumberOfCompositions[n, k] counts the number of distinct compositions of integer n into k parts.

NumberOfDerangements[n] counts the derangements on n elements, that is, the permutations without any fixed points.

RandomComposition[n, k] constructs a random composition of integer n into k parts.

RandomPartition[n] constructs a random partition of integer n.

RandomPermutation[n] generates a random permutation of the first n natural numbers.