Permutations with repetition

Computes the number of permutations with repetitions. That is, given a non-negative integer $n$ and a sequence of one or more additional non-negative integers $n_{1}, . . ., n_{r}$ such that $n_{1} + \dots + n_{r} = n$ , this functions returns the number of permutations for $n$ elements taken from $r$ different elements and such that the $i$ -th element repeats $n_{i}$ times.

Syntax

permutations_with_repetition(Integer, Integer, ..., Integer)

permutations_with_repetition(Integer, List | Vector)

Description

Given an integer $n$ and a set of integers $n_1, ..., n_r$ satisfying the conditions above, computes the number of permutations for $n$ elements taken from $r$ different elements and such that the $i$ -th element repeats $n_i$ times.

combinatorics.permutations_with_repetition1.calc.png

Given an integer $n$ and a list or vector of $n$ elements, comprised of $r$ different elements and such that the $i$ -th element repeats $n_i$ times, returns a list of all the different distinct permutations (in lexicographical order).

combinatorics.permutations_with_repetition2.calc.png

Permutations with repetition

Syntax

Description

Related functions