Ordered Permutations Without Replacement
Count the ordered ways to fill k positions from n distinct items without replacement, such as arranging a lineup or assigning different roles.
Formula & assumptions
P(n,k) = n!/(n − k)!
Different orders are counted separately, and each item can appear only once.
Worked example
- Total items n
- 10
- Positions k
- 3
- Arrangements
- 720
Interpreting the result
For k selected objects, dividing the permutation count by k factorial gives the number of unordered selections.