Combinations

A combination counts the ways to choose r items from n different items when order does not matter. If you count by lining them up (permutations), the same r items get counted r!r! times, once for each order. So you divide the number of permutations by r!r!.

Chalcack concept card · Reviewed by the Chalcack team ·

Grouping each pair that differs only in order turns 6 cases into 3.

Formulas

  • nCr=nPrr!{}_nC_r = \frac{{}_nP_r}{r!} (r!=r×(r−1)×⋯×1r! = r \times (r-1) \times \cdots \times 1)
  • nC2=n×(n−1)2{}_nC_2 = \frac{n \times (n-1)}{2}

When to use it

Use it when you only choose and order does not matter, such as picking representatives or a team.

Worked example

Choose 2 representatives from 5 people. Step 1: choosing in order gives 5×4=205 \times 4 = 20 ways. Step 2: but (A, B) and (B, A) are the same pair, so divide by 2. Step 3: 5C2=20÷2=10{}_5C_2 = 20 \div 2 = 10, so the answer is 10 ways.

Common mistake

If the chosen people get different roles, like president and vice president, order matters, so use a permutation, not a combination. First ask whether swapping the chosen people gives the same case.

Related concepts

All 181 math concepts