Permutation and Combination Calculator
Last updated: July 2026 · Free · No sign-up required
Enter values above and click Calculate to see your result instantly.
Quick reference
Permutations vs combinations:
| Question | Use |
|---|---|
| Does order matter? | Permutation (nPr) |
| Order does not matter? | Combination (nCr) |
| Example: race finishes | Permutation |
| Example: lottery picks | Combination |
functions Shows the working, not just the answer
For students and teachers, the final number is only half the value. Every math tool here exposes the formula it applied, the intermediate steps, and the rounding rule, so you can follow along, check your homework, or use the answer in a proof or report with confidence.
calculate Accurate to the spec
Calculations use 64-bit floating point with sensible rounding for the domain (currency to 2 decimals, percentages to 4 decimals, algebra to 6 significant figures). Where exact rational arithmetic matters — fractions, factorials, simplification — we use a dedicated BigNumber path so 1/3 + 1/6 returns ½, not 0.49999.
school Free for classroom use
Educators are welcome to link to any math calculator on CalcaTools from a class site, Google Classroom, or worksheet. The pages are mobile-friendly, free, ad-supported (so we can keep them free) and have no sign-up wall — students just click and use them in class or at home.
tips_and_updates Pair with the spoke articles
Below the calculator we link a small set of plain-English explainer pages — "What is a percentage?", "Why does PEMDAS matter?", and so on. They cover the underlying concept in 4–6 short paragraphs. Read those before the calculator if the topic is new, or after if you want the extra context.
Interpretation guide
Sample values (n = 5):
| r | nPr (5) | nCr (5) |
|---|---|---|
| 1 | 5 | 5 |
| 2 | 20 | 10 |
| 3 | 60 | 10 |
| 5 | 120 | 1 |
Formula & methodology
Formula: nPr = n! / (n - r)!; nCr = n! / (r! (n - r)!)
Permutations count ordered arrangements; combinations count unordered selections. The calculator evaluates nPr = n!/(n-r)! when order matters (like ranking finishers) and nCr = n!/(r!(n-r)!) when it doesn't (like choosing a committee). Because every combination corresponds to r! permutations, nPr is always r! times larger than nCr. These counts power probability, lottery odds, and combinatorics problems.