This tool calculates the number of ways to arrange or select items from a set, helping you distinguish between situations where order matters and where it does not.
Permutations (nPr):
1
Combinations (nCr):
0
Permutations are for ordered arrangements (where sequence matters, e.g., a race finishing order), while Combinations are for unordered selections (where sequence does not matter, e.g., choosing a committee).
Permutations (nPr) are used to count the number of ways to arrange items where the specific order is important, such as a race finish or a seat assignment. Combinations (nCr) are used to count the number of ways to pick a group from a larger set where the order of selection does not change the outcome, such as picking a committee or a hand of cards.
The formula for permutations is nPr = n! / (n - r)! and the formula for combinations is nCr = n! / [r! * (n - r)!].
nPr = n! / (n - r)!
nCr = n! / [r! * (n - r)!]
Suppose you have a set of 5 total items (n=5) and you want to select 3 items (r=3) from that set.
In standard combinatorics, it is impossible to choose more items than are available in the set; therefore, the result for both nPr and nCr will be 0.
By mathematical definition, 0! equals 1 to ensure that the formulas for permutations and combinations work correctly even when selecting zero or all items from a set.
Use combinations when the result of the selection is the same regardless of order, such as choosing three flavors of ice cream for a single bowl.
© 2026 Hreflabs LLC. All rights reserved.
Made with ❤️ for everyone who loves accurate calculations