Skip to content

Combinations Calculator (nCr)

Type how many items there are and how many to choose to count the groups…

Type how many items there are and how many to choose to count the groups, with every group listed when there are few enough to show.

Repeats

ExampleCombinations, 5C3

10

There are 10 ways to choose 3 of 5 when order doesn’t matter. If order mattered there would be 60.

Type your own n and r.

All 10, with the items named A, B, C, D…:

  • ABC
  • ABD
  • ABE
  • ACD
  • ACE
  • ADE
  • BCD
  • BCE
  • BDE
  • CDE
If order mattered
60
Digits
2
How this works: 9 sources,

How this works

Method

A combination is a choice where order doesn’t matter: a hand of cards, a committee, the toppings on a pizza. The number of ways to choose r items from n is C(n, r) = n! ÷ (r! × (n − r)!), read “n choose r”. Choosing 3 of 5 people gives 5 × 4 × 3 ÷ (3 × 2 × 1) = 10 groups. Full method

How it’s tested

2 worked examples for this page are checked by automated tests before every release: given the inputs, the tool must show the expected answer.

Privacy

On your device. Nothing you enter or open leaves this browser. About privacy labels

Changes

  • First published: live curves with draggable cut-offs, and tests on pasted data (t-tests, ANOVA, chi-square, Fisher’s exact, correlation, regression, A/B), checked against SciPy.

Every change on What’s new

How we make toolsReport a mistake

How to count combinations

A combination is a choice where order doesn’t matter: a hand of cards, a committee, the toppings on a pizza. The number of ways to choose r items from n is C(n, r) = n! ÷ (r! × (n − r)!), read “n choose r”. Choosing 3 of 5 people gives 5 × 4 × 3 ÷ (3 × 2 × 1) = 10 groups.

The formula counts the ordered arrangements (5 × 4 × 3 = 60) and divides by the 3! = 6 orders each group can come in, since ABC, ACB, BAC and the rest are the same group. A five-card poker hand from a 52-card deck is C(52, 5) = 2,598,960 hands, and a 6-from-49 lottery ticket is one of C(49, 6) = 13,983,816.

When repeats are allowed (choosing 3 scoops from 5 flavours, where two scoops can be the same), the count is C(n + r − 1, r), which for 3 from 5 is C(7, 3) = 35. Every answer here is an exact whole number, however large.

C(n, r) = n! ÷ (r!(n − r)!) · with repeats C(n + r − 1, r)

Combinations people look up

How many ways to choose r items from n when order doesn’t matter.

How many ways to choose r items from n when order doesn’t matter.
ChoicenrCombinations
Pairs from 6 people6215
3 of 5 people5310
A committee of 4 from 10104210
Half of 202010184,756
A 5-card hand5252,598,960
A 6-from-49 lottery ticket49613,983,816
A 13-card bridge hand5213635,013,559,600
3 toppings from 12123220
5 numbers from 6969511,238,513
Teams of 11 from 2323111,352,078

Common questions

What is the difference between combinations and permutations?

Order. A combination counts groups (ABC is the same as CBA); a permutation counts arrangements (ABC and CBA are different). There are always r! times as many permutations as combinations.

Why is C(n, r) the same as C(n, n − r)?

Choosing which r to take is the same as choosing which n − r to leave out. C(10, 3) and C(10, 7) are both 120.

What is C(n, 0)?

It is 1: there is exactly one way to choose nothing. And 0! is defined as 1 so that the formula agrees.