Permute VI
- Updated2025-07-30
- 1 minute(s) read
Computes the number of ways to obtain an ordered subset of k elements from a set of n elements.

Inputs/Outputs
n
—
n is an unsigned integer.
k
—
k is an unsigned integer.
nPk
—
nPk returns the number of ordered subsets of k elements that you can obtain from a set of n elements. |
n
—
nPk
—