Permutations
permutationsCalculate the number of ordered arrangements of k items from a set of n without repetition. Useful for combinatorial count of ordered choices.
Instructions
Calculate the number of ways to choose k items from n items without repetition and with order.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| k | No | The optional number of items to choose. | |
| n | Yes | The number of items to choose from. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |