Permutations with Repetition Calculator
Count the distinct arrangements of a multiset from the count of each repeated item, exactly.
Permutations with Repetition Calculator
Count the distinct arrangements of a multiset from the count of each repeated item, exactly.
What the page prints, and what it refuses
Every figure is printed with the rule or formula that produced it, and any numerical tolerance is stated on the result rather than implied. The page refuses an input the formula does not define and names the value it read; it prints no answer it cannot support.
The calculation runs entirely in this browser tab; nothing is uploaded.
The page counts distinct arrangements when some items repeat. A multiset with counts 2, 1 and 1 has 4 items and 4! ÷ (2! × 1! × 1!) = 12 distinct orders, which is the classic count for the letters of a four-letter word with one repeated letter.
The arithmetic is the multinomial coefficient, computed with BigInt, so every count up to 1000 is exact. The formula is printed with your counts substituted.
Why identical items divide the count out
With all items distinct there are n! orders. Swapping two identical items produces the same arrangement, so each real arrangement is counted once for every permutation of each repeated group: n! ÷ (n₁! n₂! … nₖ!).
The page multiplies the denominator factorials and divides once, exactly, then reports the digit count. A count of zero is refused because a group with no items is not a group.
How to use Permutations with Repetition Calculator
Enter the count of each distinct item, comma-separated, then press Run.
The first line is the number of arrangements, followed by its digit count, the item total and the formula with your counts.
What to Expect
Best for
- Counting distinct orders of a multiset
- Checking a MISSISSIPPI-style exercise
- Getting an exact answer where a factorial ratio is large
Not ideal for
- Items treated as distinct, which is the permutations page
- More than 1000 total items
- Counts of zero, which do not describe an item
What this tool keeps
- The count of every group exactly
What may need cleanup
- Nothing: the count is a final integer
Common errors
- A zero count is refused
- A non-integer count is refused by name
Example use cases
- Count the orders of 2,1,1
- Check MISSISSIPPI's 34650 arrangements
- Count an anagram with three repeats
Sample input
counts = 2,1,1
Sample output
12 distinct arrangements from 4! ÷ (2! × 1! × 1!)
Who this is for
- Combinatorics students
- Readers checking an anagram count
Frequently asked questions
Why does 2,1,1 give 12 and not 24?
There are 4! = 24 orders of four distinct items, but the two identical items can be swapped without changing the order, so every arrangement is counted twice. Dividing by 2! gives 12.
Does the order of the counts matter?
No. The denominator is a product, so 2,1,1 and 1,2,1 describe the same multiset and give the same answer.
What is the largest input?
Counts that total at most 1000 items. The exact answer is still printable, but a much larger factorial would be a wall of digits.
Build custom tools for your store
Join the SDK program to create useful ecommerce utilities for your store.