Maths Probability

Combination calculator

Items to choose from (n)
Items chosen (r)
Combinations (nCr) 2,598,960
C(52,5) = n! ÷ (r!(n−r)!)
Permutations (nPr) 311,875,200
With repetition, order matters 380,204,032
With repetition, order does not 3,819,816
n factorial 80,658,175,170,943,880,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
nPr = nCr × r!

Choosing five cards from fifty-two where order does not matter gives 2,598,960 possible hands. If order did matter it would be 311,875,200 — exactly 120 times more, because five cards can be arranged in 5! = 120 ways. That factor of r! is the entire difference between a combination and a permutation, and it is why nCr is always the smaller number.

Advertisement
320 × 100

A combination counts selections where order does not matter: C(52,5) = 2,598,960 possible poker hands. A permutation counts arrangements where it does: P(52,5) = 311,875,200 — exactly 5! times more.

How to count combinations

1 Enter n, the number of items available.
2 Enter r, how many you are choosing.
3 Read combinations if order does not matter, permutations if it does.
4 Use the repetition rows if items can be picked more than once.

The four numbers here cover every counting situation, and picking the right one comes down to two questions. Does order matter? And can an item be chosen more than once? A lottery draw is combinations without repetition. A four-digit PIN is arrangements with repetition, which is why there are 10,000 of them rather than 5,040. A podium finish is permutations without repetition. Getting the wrong one is by far the most common error in counting problems.

Questions

Order. Combinations treat ABC and CBA as the same selection; permutations count them separately.

Advertisement
300 × 250
Was this tool any good?
INTERNAL SIGNAL ONLY · WE USE IT TO FIND TOOLS WORTH REBUILDING