Verystep Guides Verystep Guides

How to Calculate Permutations and Combinations

Most wrong answers here aren't arithmetic errors. They're decision errors β€” the count was fine, but it counted the wrong thing. Two questions, asked first, fix that.

Published November 16, 2026 - A Verystep guide

Illustration of numbered tiles branching into ordered rows and unordered groups

Ask two questions before you touch a formula. Does order matter? Can an item repeat? If order matters, you want a permutation: P(n, r) = n! / (n - r)!. If it doesn't, you want a combination: C(n, r) = n! / (r! (n - r)!). Then enter n and r in the calculator, pick the repetition mode that matches your answers, and read the exact result. Don't stop there. Check that the combination is no larger than the permutation for the same n and r, and test the symmetry C(n, r) = C(n, n - r). If either check fails, your inputs β€” not the math β€” need a second look.

Two questions before any numbers

Start with the order question, and answer it with a swap test. Pick two items in your head and trade their places. Did the outcome change? A podium finish β€” gold, silver, bronze β€” changes when first and third swap. A three-person committee doesn't. Same three people, same committee, whichever order you name them in. If swapping changes the outcome, order matters and you're counting permutations. If it doesn't, you're counting combinations. That's the whole decision, and it's worth saying out loud before you calculate anything.

Second question: can an item repeat? A four-digit PIN can reuse a digit β€” 1, 1, 7, 7 is legal. A lottery draw can't pull the same ball twice. Repetition changes the count a lot, and it changes which mode you pick in the tool. Most textbook problems assume no repetition unless they say otherwise, but real problems β€” codes, passwords, licence plates β€” allow it all the time. Decide both questions first. The formula is the easy part.

Run the calculator in seven steps

Open the Permutation and Combination Calculator and work down this list in order. Steps one and two happen before your hands reach the keyboard.

  1. Ask the order question first: if swapping two picked items creates a different outcome, you need a permutation; if it does not, you need a combination.
  2. Ask the repetition question next: can the same item be picked more than once, or can each item be used only once?
  3. Enter n, the total number of items you are picking from, in the calculator's n field.
  4. Enter r, the number of items you pick each time, in the r field, and check that r is not larger than n when repetition is off.
  5. Pick the repetition mode that matches your answer in step two, with repetition or without repetition, before you read any result.
  6. Read the result for the mode you chose, and note both the permutation and combination values if the tool shows them.
  7. Sanity-check the numbers: the combination should be less than or equal to the permutation, and C(n, r) should equal C(n, n - r).

Why insist on both values in step six? Because the gap between them tells you whether your order decision was even consequential. If P and C come out close, order barely mattered. If they're far apart, picking the wrong one would have wrecked the answer β€” and now you know which side of that risk you're on.

Worked example: pick 3 from 10

Say you have 10 items and you pick 3. Run the permutation first. P(10, 3) = 10! / (10 - 3)! = 10! / 7!. The 7! cancels, leaving 10 Γ— 9 Γ— 8 = 720. That's the ordered count: 720 ways to arrange 3 picks out of 10 when position matters. Now the combination. C(10, 3) = 10! / (3! Γ— 7!) = 720 / 6 = 120. Same picks, no order, 120 groups.

Illustration of one set of items branching into ordered arrangements on one side and unordered groups on the other
One pick, two counts: ordered arrangements on one branch, unordered groups on the other.

Look at the ratio. 720 / 120 = 6, and 6 is 3! β€” the number of ways to order any single group of 3. That's not a coincidence, it's the structure of the two formulas. Every unordered group of 3 can be lined up in 3! = 6 orders, so the permutation count is always the combination count times r!. If your two results don't divide that cleanly, something's off with an input.

Now the symmetry check from step seven. C(10, 3) should equal C(10, 7), because choosing 3 to keep is the same act as choosing 7 to leave behind. Run it: C(10, 7) = 120. It matches. This check costs you ten seconds and catches swapped n and r entries, which are the most common slip with this tool.

Two bigger checks: cards and lineups

Poker hands are the classic combination. A 5-card hand from a 52-card deck doesn't care about the order the cards arrived in, so it's C(52, 5) = 2,598,960. Run that in the tool and you'll get the full number, digit for digit. That's the point of exact big-integer output: 2,598,960 is a fact you can quote, while 2.6 Γ— 10^6 is a shrug. If your tool rounds to scientific notation, you can't run the symmetry check either, because the digits you'd compare aren't really there.

Lineups show the other end. Put 8 people in a row and every position matters, so you're counting 8! = 40,320 arrangements. Notice that's just P(8, 8) β€” when r equals n, the (n - r)! term becomes 0!, which is 1, and the permutation formula collapses to n!. Worth knowing, because students often think the tool has glitched when they enter equal values and get a plain factorial back. It hasn't. The math really is that simple at the edge. Keep both checks β€” the ratio and the symmetry β€” in your pocket for exams too, where there's no tool: they give you a way to catch a slip before you hand the answer in.

Mistakes that survive correct arithmetic

The classic error is counting permutations for a combination problem β€” committees, hands, lottery draws β€” and reporting a number that's exactly r! times too big. The swap test prevents it, but only if you run it before calculating, not after the answer already feels official. Second error: leaving repetition on from a previous problem. Modes persist in your head even when they don't persist on screen, so re-ask the repetition question every time, out loud if you have to.

Third: entering r larger than n with repetition off, then trusting whatever comes back. You can't pick 12 distinct items from a set of 10. If a result appears anyway, you've misread which field is which. And a quiet one: using C(n, r) when the problem picks in stages with different rules at each stage. Two separate picks β€” say a president and then a committee β€” are two counts multiplied together, not one count. The calculator handles each stage fine. It just can't know your problem had stages. That's your call, made at step one.

Try your own n and r

The Verystep Permutation and Combination Calculator takes n and r, offers modes with and without repetition, and returns exact big-integer answers β€” no rounded scientific notation to guess from. Enter the two numbers from the problem in front of you and run the checks in this guide on the result.

Open the Permutation & Combination Calculator ->

Last verified November 16, 2026 β€” steps and fields checked against the Verystep Permutation and Combination Calculator and verified by hand calculation.

Frequently asked questions

How do I know whether order matters?

Use the swap test. Take one valid outcome, swap two of its items, and ask whether you'd count the swapped version as a different outcome. Podium places, rankings, codes and lineups: yes, use a permutation. Committees, hands of cards and lottery draws: no, use a combination.

Why is C(10, 3) the same as C(10, 7)?

Because picking 3 items to keep automatically picks the other 7 to leave out. Both numbers count the same split of the set, so C(n, r) always equals C(n, n - r). It's a handy check: if the tool gives you different values for the two, an input is wrong.

What changes when repetition is allowed?

Each pick draws from the full set again, so counts grow fast and r can be larger than n. A PIN is the everyday case: digits can repeat, so a 4-digit code isn't P(10, 4). Pick the with-repetition mode in the tool and re-check which real-world rule your problem actually follows.

Why does the tool show such long numbers instead of rounding?

Because these counts explode. Factorials pass a billion quickly, and a rounded answer hides exactly the digits you need for checks like C(n, r) = C(n, n - r). The calculator returns exact big-integer results so you can quote the number and verify it, not just estimate it.

My combination came out bigger than my permutation. What went wrong?

That can't happen for the same n, r and repetition setting β€” ordering a set of picks can only add distinctions, never remove them. You almost certainly compared results from two different modes or changed n or r between runs. Reset both fields, pick one mode, and run it again.

More guides