Quick guide
How to use this calculator
- Enter the symbols to arrange.
- Choose whether spaces and letter case distinguish symbols.
- Read the number of unique arrangements after duplicate orders are removed.
Calculation method
Divide out repeated-symbol orders
If n symbols contain repeated frequencies r₁, r₂, and so on, the number of distinct arrangements is n! divided by r₁!r₂!⋯.
Worked example
Arrange LEVEL
LEVEL has five letters, with L repeated twice and E repeated twice.
5!/(2!2!) = 30
Supported inputs
Precision and limits
Discrete domain
Inputs are whole counts. Negative, fractional, grouped, and scientific-notation inputs are rejected.
Exact integers
Results use arbitrary-precision integers and are never rounded. Inputs and output size are bounded to keep the page responsive.
Text
Up to 1,000 Unicode grapheme clusters are supported. Canonically equivalent text is normalized before counting. The result is a count; the anagrams themselves are not generated.