How to Calculate Permutations and Combinations

You’re working through a probability or statistics problem — how many ways can 5 people be arranged in a line, or how many different 6-card hands are possible from a deck of 52 — and you need nPr or nCr calculated correctly, ideally without manually computing a factorial that grows enormous fast. Factorials scale so quickly that even a modest problem (arranging 15 items, say) produces a number in the trillions, and a standard calculator can hit floating-point precision limits or overflow before you even get an exact answer.

The math itself — permutations count ordered arrangements, combinations count unordered selections — isn’t the hard part conceptually. Getting an exact, correctly computed result without a calculator choking on large factorials is the practical obstacle.

What permutations and combinations actually calculate

A permutation (nPr) counts the number of ways to arrange r items chosen from a set of n, where order matters — arranging 3 people out of 5 in a specific sequence, for example. A combination (nCr) counts the number of ways to choose r items from n where order doesn’t matter — picking 3 people out of 5 for a committee, where who’s “first” doesn’t count for anything. The two formulas are related (nCr = nPr divided by r!), but they answer genuinely different questions, and mixing them up is one of the most common probability mistakes.

For larger values of n, the factorials involved grow far beyond what a standard calculator can represent precisely, which is why exact, arbitrary-precision computation matters — an approximate or overflowed result isn’t just imprecise, it can be wrong in a way that invalidates the rest of a probability calculation built on top of it.

Why people get stuck here

• Confusing when order matters. The single most common error is using nPr when a problem actually calls for nCr, or vice versa — arranging vs. selecting sound similar but aren’t.
• Factorials overflow standard calculators. Once n gets into the double digits, factorial values exceed what many calculators can compute exactly, introducing rounding errors.
• Multi-step probability problems compound errors. A wrong nPr or nCr early in a larger probability calculation propagates through every step that depends on it.
• Formula memorization under exam pressure. Recalling the exact formula structure (and not swapping numerator and denominator) is easy to fumble when working quickly.

What a good permutation calculator looks like

Both nPr and nCr clearly available

The tool should make it obvious which calculation you’re running, since picking the wrong one is the most common real error.

Exact, arbitrary-precision results

For larger n values, the result should be computed exactly rather than approximated, avoiding the overflow and rounding issues standard calculators run into.

Clear input for n and r

Simple, unambiguous fields for total items (n) and the selection size (r) reduce the chance of a transcription error.

Common mistakes to avoid

• Using nPr for a problem that’s actually about unordered selection (committees, card hands), which will overcount by a factor of r!.
• Assuming a standard calculator’s factorial function gives an exact result for large n — many introduce floating-point rounding well before the true overflow point.
• Confusing n and r in the input, especially in problems phrased less directly than “choose r from n.”
• Forgetting that 0! equals 1, a common edge case that trips up manual factorial calculations.

How to do it with Permutation Calculator

Online Tool Store’s Permutation Calculator calculates nPr permutations and nCr combinations from n and r with exact, arbitrary-precision results, entirely in your browser.

1. Open the Permutation Calculator tool.
2. Enter your total item count (n) and selection size (r).
3. Choose whether you need nPr (order matters) or nCr (order doesn’t matter).
4. Read the exact result, computed without the overflow or rounding issues a standard calculator would introduce for large values.

Frequently asked questions

How do I know whether to use permutations or combinations?

Ask whether order matters for the outcome you’re counting. If arranging the same items in a different order counts as a different result (like a race finishing order), use permutations (nPr). If different orderings of the same selection are equivalent (like picking a committee), use combinations (nCr).

Why does my calculator give a wrong or infinite result for large n?

Standard calculators often hit floating-point precision limits or outright overflow once factorials grow large enough, which happens surprisingly quickly — 20! is already over 2 quintillion. A tool built for exact, arbitrary-precision computation avoids this.

What’s the relationship between nPr and nCr?

nCr equals nPr divided by r! — combinations are permutations with the ordering within each selection divided back out, since combinations don’t care about the internal order of the chosen items.

Final thought

Get clear on whether order matters before you pick a formula — that single distinction, more than any calculation step, is what determines whether you need nPr or nCr.

Try the free Permutation Calculator tool