When some items of a list are identical, there are fewer distinct arrangements than n!. The multiset permutations calculator counts the arrangements of letters or objects with repeats with the formula n! / (g1! × g2! × …), and shows the factor that removes the repeats.
How the calculation works
- Enter the total number of items to arrange, such as the letters of a word.
- Enter the size of each group of identical items. For MISSISSIPPI, the I and the S appear 4 times each and the P twice. Leave the unused groups at 0.
- The calculator finds the number of distinct arrangements = n! / (g1! × g2! × g3! × g4!).
- It also shows the n! you would have if all the items were different, the factor that removes the repeats, and the items that appear only once.
Example
The word MISSISSIPPI has 11 letters: 4 I, 4 S, 2 P and 1 M. The number of distinct arrangements is 11! / (4! × 4! × 2!) = 39,916,800 / 1,152 = 34,650. The factorials product is 1,152, and 1 letter (the M) appears only once.
Why it matters
The calculator helps students of combinatorics and probability, teachers who prepare exercises, and puzzle or password lovers who want to count the arrangements of a word or of a set of objects. It makes the link between permutations and the multinomial coefficient clear.
Good to know
The formula assumes that the items in the same group are exactly identical and that all the groups of identical items are known. Items that appear only once do not need to be entered, since they are the remainder. The calculator limits n to 17 and the groups to four, and for constraints such as items that cannot be next to each other, a different method is needed.
Related tools
The permutations calculator counts the arrangements of distinct items, the combinations calculator counts the groups where order does not matter, the derangements calculator counts the arrangements with no item in its place, and the hypergeometric distribution calculator finds probabilities when drawing without replacement.