About the Permutation Calculator
This calculator gives exact counts for permutations and related results. You enter Total items n and Items chosen r. The tool shows permutations without repetition (nPr), permutations with repetition (n^r), and combinations (nCr) for comparison. It runs entirely in your browser; nothing is uploaded to a server. Results update instantly as you type and there is no calculate button. The tool produces exact whole numbers of any length using arbitrary precision, and n is limited to 100,000. You can copy a numeric result or share a link that reopens the page with your inputs. The page does not handle multiset word permutations, circular arrangements, or constrained rule sets. Use this calculator when you need fast, exact counts for ordered selections or quick comparisons with combinations.
How to use it
- 1Enter the total number of distinct items n.
- 2Enter how many items you choose r.
- 3Toggle repetition if items may repeat (use n^r when allowed).
- 4View nPr, n^r and nCr; results update instantly as you type.
- 5Copy a result or share the link that reopens with your numbers.
Worked example
Example: n = 10, r = 3. Permutations without repetition nPr = 10P3 = 10 x 9 x 8 = 720. With repetition n^r = 10^3 = 1000. Combinations nCr = 10C3 = 120.
The formula
nPr = n! / (n - r)! = n x (n - 1) x .x (n - r + 1): the number of ordered arrangements of r items picked from n, with no item used twiceWith repetition allowed there are n^rOrder matters in a permutation: ABC and CBA count as twoSource: Wolfram MathWorld, PermutationOpenStax, Contemporary Mathematics, section on permutationsWikipedia, Permutation. Last checked 6 November 2026.
What it is good for
- Instant results as you type; no calculate button.
- Exact whole numbers with arbitrary precision for large outputs.
- Runs in your browser; nothing is uploaded.
- n is limited to 100,000.
- Does not compute multiset word permutations, circular permutations, or constrained rule cases.
Questions people ask
What is a permutation?
A permutation is an ordered arrangement of r items chosen from n distinct items. Order matters, so ABC and CBA are counted separately. See Wolfram MathWorld for the standard definition.
What formula does this tool use for nPr?
The calculator uses nPr = n! / (n - r)!, equivalently the product n x (n - 1) x ... x (n - r + 1). This holds for integers 0 ≤ r ≤ n.
How do I count when repetition is allowed?
When repetition is allowed, each of the r positions has n choices, so the count is n^r. Toggle the repetition option to see this value alongside nPr.
What is the difference between permutation and combination?
A permutation counts ordered outcomes; a combination counts unordered groups. Numerically, nPr = nCr × r! when r items are chosen from n without repetition.
Can this tool handle very large results exactly?
Yes. The tool uses arbitrary precision arithmetic to produce exact whole numbers of any length. However, n is capped at 100,000 to keep calculations practical in the browser.
Do I need to upload any data?
No. All calculations run in your browser. Nothing you type is uploaded or stored by the site unless you explicitly use the account save or share features.
What about word anagrams like MISSISSIPPI?
This tool does not compute multiset permutations such as word anagrams. For those you need the formula n! / (a! b! ...), which is not supported here.
Help keep every tool free
FreeToolr stays free because people help it grow. Share a tool you like, tell us what to build next, or support us on Ko-fi.