331+ free tools. No sign-up. No hidden fees. Explore the toolkit

Permutation & Combination Calculator

How many ways can you pick 3 players from a squad of 10? It depends on whether the order matters. If you are picking a captain, vice-captain and goalkeeper, the order matters — that is a permutation. If you are just picking any 3 players, the order does not matter — that is a combination.

Enter n (the total items) and r (how many you choose), and this calculator gives you all four counts at once: permutations and combinations, each with and without repetition, with the formula for each.

How many items you are choosing from. Whole numbers from 0 to 1,000.

How many items you pick. Must be no larger than n.

Permutations (nPr) — order matters

Save to Pinterest
Note: results above 1015 are shown in scientific notation, because they are too large to display exactly. n is capped at 1,000 — beyond that the counts have hundreds of digits and only the scientific form is meaningful.

How It Works

The four counts answer four different questions about choosing r items from n:

The key question is always: does the order matter? If swapping two chosen items gives a different outcome — first, second and third places in a race — use permutations. If swapping them changes nothing — a hand of cards, a team, a pizza topping selection — use combinations. The second question is whether an item can be chosen more than once: a PIN can repeat digits, a lottery ticket cannot repeat a ball.

Under the hood, combinations are computed with the multiplicative product form — n × (n−1) × … divided by r! step by step — rather than by computing huge factorials directly. That keeps the results exact for far larger values of n and r, and anything above 1015 is shown in scientific notation.

Worked Example

With n = 10 and r = 3: permutations without repetition are 10 × 9 × 8 = 720 — ten choices for the first place, nine for the second, eight for the third. Combinations without repetition are 720 ÷ 3! = 720 ÷ 6 = 120, because each set of 3 can be arranged in 6 orders and combinations count each set once. Permutations with repetition are 103 = 1,000. Combinations with repetition are (10 + 3 − 1)! / (3! × 9!) = 12! / (6 × 362,880) = 479,001,600 ÷ 2,177,280 = 220.

A smaller check: with n = 5 and r = 5 there are 5! = 120 permutations — every ordering of all five items — but only 1 combination, because there is only one way to choose all five. And choosing nothing (r = 0) always gives exactly 1 way in every case, because 0! = 1.

Assumptions

Sources: No external data is used on this page — every figure is calculated from the n and r you enter, using the standard counting formulas (multiplicative form for combinations). Last reviewed: 15 November 2026.

Built and tested by SumKitTool — see how we check our numbers.

How to Use This Calculator

Enter n (how many items you are choosing from) and r (how many you pick). All four counts appear at once: the headline is the permutations without repetition, and the table shows the combinations and both with-repetition counts, each with its formula.

Try n = 52 and r = 5 to see the number of possible 5-card poker hands (2,598,960 combinations), or n = 10 and r = 4 for the number of 4-digit PINs (10,000 with repetition).

Tips and Practical Advice

Permutations grow fast. Arranging just 10 items gives 3,628,800 orders, and 20 items give over 2.4 quintillion — more than the number of seconds since the Big Bang. That is why passwords and PINs get strong so quickly with length, and why brute-forcing a long code is hopeless.

If you are unsure whether order matters, ask: does swapping two chosen items change the outcome? A race podium (1st, 2nd, 3rd) changes — permutations. A lottery ticket does not — combinations. A safe combination, despite the name, is a permutation: 1-2-3 opens a different lock from 3-2-1.

For combinations, remember the symmetry: choosing r items from n is the same as leaving n − r behind, so nCr = nC(n−r). Choosing 47 balls from 50 is the same count as choosing 3 — the calculator uses the smaller of the two internally to stay exact.

Frequently Asked Questions

When should I use permutations instead of combinations?

Use permutations when the order of the chosen items matters — first, second and third places in a race, or the digits of a PIN. Use combinations when the order does not matter — a hand of cards, a team of players, or a set of lottery numbers. The test is simple: if swapping two chosen items changes the outcome, it is a permutation; if it does not, it is a combination.

What does 'with repetition' mean?

It means the same item can be chosen more than once. A 3-digit PIN allows repetition — 1-1-2 is a valid code — so there are 10³ = 1,000 possibilities. A lottery draw does not allow repetition: once a ball is drawn it cannot be drawn again, so the count is smaller. With repetition there are always at least as many possibilities as without.

What is 0! and why does it equal 1?

0! (zero factorial) equals 1 by definition. It is the only value that keeps the counting formulas consistent: choosing 0 items from n must give exactly 1 way (the empty selection), and n! ÷ (n − 0)! only equals 1 if 0! = 1. It also matches the pattern 3! = 6, 2! = 2, 1! = 1, where each step divides by the next number down.

Why is there a limit of n = 1,000?

Because the counts grow explosively: even n = 100 with r = 50 gives a 30-digit number, and n = 1,000 gives counts with hundreds of digits. The 1,000 cap keeps the page fast while covering every realistic use — exam questions, card games, lotteries and password counts all sit far below it. Results above 10¹⁵ are shown in scientific notation.

Last updated: