Permutations of n taken k calculator
Enter how many candidates and how many places to get the number of ways.
This calculator is also in the Numnote app for your phone. Google Play
Example
With 8 candidates and 4 places, the number of ways to arrange them is 1,680.
Arrangements out of 8 items when the order matters
| total | places | ways to arrange |
|---|---|---|
| 8 | 1 | 8 |
| 8 | 2 | 56 |
| 8 | 3 | 336 |
| 8 | 4 | 1,680 |
| 8 | 5 | 6,720 |
In detail
How it is calculated
Arrangements show how many ways a few items can be chosen and put in different places. Any of all the items fits the first place, any of the rest the second, and so on, and the counts are multiplied until every place is filled. This is how prize places, the order of performances or codes without repeated digits are counted. Each item takes at most one place.
Common mistakes
Arrangements are easy to confuse with combinations. If the places are equal and only who gets chosen matters, the “Combinations” calculator is needed, whose result is smaller by as many times as the chosen items can be reordered. This calculator does not fit codes whose symbols may repeat either: there any symbol fits each place, and with at least two places there are more ways than here. There cannot be more places than candidates.
Questions
In how many ways can prize places be awarded?
Enter the number of participants and the number of prize places, and the calculator shows how many different podiums there can be.
When does the order matter?
Use arrangements when the places differ: first and second, a chair and a deputy, the positions in a code. If the places are equal, use the “Combinations” calculator.