permutation_count
Calculates the number of permutations P(n,k) = n!/(n-k)! representing ordered arrangements of k elements selected from n elements. Returns the count as an integer. (cost: 1 credit)
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| k | No | integer, required, number of elements to select (must be 0 ≤ k ≤ n) | |
| n | No | integer, required, total number of elements (must be non-negative) |