Math · Statistics & Probability · Grade 9-12 · 5 min read

Combination

⚡ In one breath

A combination counts unordered selections of rr items from nn distinct items, $C(n,r)=\frac{n!

📐 The formula

C(n,r)=n!r!(nr)!C(n, r) = \frac{n!}{r!(n - r)!}

Orient

The one-line idea, why it matters, and the intuition.

Section 1

Quick Answer

A combination counts unordered selections of rr items from nn distinct items, C(n,r)=n!r!(nr)!C(n,r)=\frac{n!}{r!(n-r)!}. Use it when only which items are chosen matters, not their order — teams, committees, handshakes, lottery picks. The cue is that swapping the order of your chosen items gives the same selection. Before calculating, ask: Does rearranging the chosen items leave it the same selection?

Section 2

Why This Matters

Combinations are the 'order doesn't matter' half of counting, and the dividing-by-r!r! step is exactly what prevents the overcounting that permutations would cause. They are the engine behind the binomial coefficient and Pascal's triangle. Recognizing it by "Does rearranging the chosen items leave it the same selection?" — rather than by familiar numbers — is what lets a student tell it apart from permutation and counting principle and binomial coefficient in a mixed problem set.

Section 3

Intuitive Explanation

Choosing 2 friends from {A, B, C} to invite: AB and BA are the same pair, so there are only (32)=3\binom{3}{2}=3 choices — AB, AC, BC — not 6. This is the clean version of the idea because the visible structure matches the concept before any formula or procedure is chosen.

Do not use a combination when order matters — assigning president and vice-president from a group is a permutation, because Alice-as-president-Bob-as-VP differs from the reverse. That contrast matters because many wrong answers come from recognizing a surface feature, such as a familiar number or word, instead of the actual task.

A useful way to slow down is to name the signal words and then test them. Words like **choose**, **select a group**, **committee or team**, **handshakes**, **order doesn't matter** are helpful clues, but they are not enough by themselves. They must point to the same structure as the mental model: A combination counts the ways to pick rr items from nn when rearranging the picked items doesn't make a new selection.

The recognition test is simple: Does rearranging the chosen items leave it the same selection? If yes, combination is probably the right tool; if not, compare with Permutation or Counting principle or Binomial coefficient before calculating.

Core idea

A combination counts the ways to pick rr items from nn when rearranging the picked items doesn't make a new selection.

Recognize

The cues that signal this concept and how to distinguish it from look-alikes.

Section 4

When to Use

Use Combination when you are selecting a group where the order of the chosen items does not matter. Strong signals include **choose**, **select a group**, **committee or team**, **handshakes**, **order doesn't matter**. The safest workflow is to read the final question first, identify what kind of answer it wants, and then test the structure. Do not use combination just because familiar numbers appear; first decide whether the situation answers "Does rearranging the chosen items leave it the same selection?" with yes.

✨ Pro tip

Ask: Does rearranging the chosen items leave it the same selection?

Section 5

How to Recognize It

Before using Combination, check the structure of the problem, not just the vocabulary. These questions force the same recognition move from several angles: the task, the signal words, the nearest confusion, and the thing that would make the concept fail.

  1. Does rearranging the chosen items leave it the same selection?

    If yes, the problem matches combination. If no, pause before applying the procedure, because the same numbers may belong to a different idea.

  2. Which words signal the structure?

    Look for choose, select a group, committee or team, handshakes. These words are useful only after the situation matches them; a keyword without structure is not proof.

  3. What is the nearest confusion?

    Permutation is the common trap here: Counts ordered arrangements, so order creates distinct outcomes. Compare the desired final answer before choosing a method.

  4. What answer form should I expect?

    The answer should fit this mental model: A combination counts the ways to pick rr items from nn when rearranging the picked items doesn't make a new selection. If the expected answer sounds more like permutation, use the comparison table before solving.

  5. What would make this NOT Combination?

    Do not use a combination when order matters — assigning president and vice-president from a group is a permutation, because Alice-as-president-Bob-as-VP differs from the reverse. This tells you when to switch tools instead of forcing the concept.

Section 6

Combination vs Common Confusions

The hard part is recognizing when the task is really about combination instead of a nearby idea. Read the final answer the problem wants, then ask which row describes the structure before you start calculating.

Combination

Meaning
Use this when you are selecting a group where the order of the chosen items does not matter. The deciding question is: Does rearranging the chosen items leave it the same selection?
Key test
Does rearranging the chosen items leave it the same selection?
Formula
C(n,r)=n!r!(nr)!C(n, r) = \frac{n!}{r!(n - r)!}
Example
How many 3-person committees can be formed from 6 people?

Permutation

Meaning
Counts ordered arrangements, so order creates distinct outcomes.
Key test
Use when positions or ranks distinguish the choices.
Formula
P(n,r)=n!(nr)!P(n,r)=\frac{n!}{(n-r)!}
Example
Assigning 1st, 2nd, 3rd place

Counting principle

Meaning
Multiplies independent choices, allowing repeats and order.
Key test
Use when each pick is a separate slot that can repeat.
Formula
m×nm\times n
Example
Outfits from shirts and pants

Binomial coefficient

Meaning
The same value (nr)\binom{n}{r} used as coefficients in (a+b)n(a+b)^n.
Key test
Use when expanding a binomial power, not counting selections.
Formula
(nr)\binom{n}{r}
Example
Coefficient of x2x^2 in (x+1)4(x+1)^4

Apply

Worked examples and the mistakes most students make.

Section 7

Formula & Notation

C(n,r)=n!r!(nr)!C(n, r) = \frac{n!}{r!(n - r)!}
(nr)=n!r!(nr)!\binom{n}{r} = \frac{n!}{r!(n-r)!} for 0rn0 \leq r \leq n, with (nr)=(nnr)\binom{n}{r} = \binom{n}{n-r}

How to read it: C(n,r)C(n, r), nCr_nC_r, or (nr)\binom{n}{r} all denote combinations of rr items from nn

Section 8

Worked Examples

Example 1 — Pick a committee

Easy

Problem

How many 3-person committees can be formed from 6 people?

Solution

  1. A committee is unordered — same three people is one committee.

    Name the structure before touching arithmetic — that is what makes the right method obvious.

  2. Ask the recognition question: Does rearranging the chosen items leave it the same selection?

    If the answer is yes, the concept applies; the cue, not a keyword, decides the method.

  3. Use C(n,r)C(n,r) with n=6n=6, r=3r=3.

    The rule is chosen only after the structure matches, so the steps mean something.

  4. C(6,3)=6!3!3!=72036C(6,3)=\frac{6!}{3!\,3!}=\frac{720}{36}.

    Keep units, shape, or answer form tied to the story so the work does not become symbol pushing.

  5. Check the answer against the original question.

    It should fit the mental model — choosing a group, order ignored. If it does not, revisit the recognition step before changing the arithmetic.

Answer

2020

Takeaway: When order doesn't matter, divide out the arrangements with C(n,r)C(n,r).

Example 2 — Order suddenly matters

Standard

Problem

From 6 people, how many ways to choose a president and a treasurer?

Solution

  1. Notice why this looks like the same concept.

    Nearby language or numbers can tempt you toward choosing a group, order ignored.

  2. The two roles are distinct, so Alice-pres/Bob-treas differs from the swap.

    Spotting what actually changed is what separates this from the concept it resembles.

  3. Switch to a permutation, since order now distinguishes outcomes.

    The nearby idea may share numbers but answers a different question, so it needs a different move.

  4. State the result in the language of the actual task.

    P(6,2)=30P(6,2)=30. Name it for what the problem really asked, not the concept you first expected.

  5. Say the contrast in one sentence.

    Once chosen items get distinct roles, use a permutation, not a combination.

Answer

P(6,2)=30P(6,2)=30

Takeaway: Once chosen items get distinct roles, use a permutation, not a combination.

Example 3 — Spot the trap: Choosing a group, order ignored

Application

Problem

A student starts with this idea: "Forgetting to divide by r!r!" What should they check before accepting that reasoning?

Solution

  1. Pause before the first move.

    The first move is a decision, not a calculation — does the situation really match choosing a group, order ignored.

  2. Run the recognition test: Does rearranging the chosen items leave it the same selection?

    This is the single check that the trap skips.

  3. that leaves a permutation count, which overcounts the orderings.

    Stating the safer rule turns the mistake into a checkable step instead of a vague "be careful."

  4. Compare with the nearest confusion, Permutation.

    Counts ordered arrangements, so order creates distinct outcomes.

  5. State the corrected decision and reuse it.

    Using the concept only when the structure matches leaves a process the student can repeat on a new problem.

Answer

that leaves a permutation count, which overcounts the orderings.

Takeaway: The recognition step prevents the common trap: Forgetting to divide by r!r!

Section 9

Common Mistakes

Common slip-up

Forgetting to divide by r!r!

The right idea

that leaves a permutation count, which overcounts the orderings.

Common slip-up

Using a combination when order matters

The right idea

assignments and rankings need a permutation.

Common slip-up

Mixing up rr and nrn-r

The right idea

note C(n,r)=C(n,nr)C(n,r)=C(n,n-r), so choosing 3 to keep equals choosing the others to drop.

Practice

Try it, then see where this concept fits in the path.

Section 10

Mini Practice

Try these on your own. Tap Reveal when you want to check.

  1. What clue tells you this is a Combination situation: How many 3-person committees can be formed from 6 people?

    Hint: Does rearranging the chosen items leave it the same selection?

  2. How many 3-person committees can be formed from 6 people?

    Hint: Use C(n,r)C(n,r) with n=6n=6, r=3r=3.

  3. Why is this a contrast case instead of Combination: From 6 people, how many ways to choose a president and a treasurer?

    Hint: The two roles are distinct, so Alice-pres/Bob-treas differs from the swap.

  4. Fix this thinking: Forgetting to divide by r!r!

    Hint: Name the recognition cue before choosing a rule.

  5. Which is the better fit here: Combination or Permutation? Explain the deciding difference.

    Hint: For Combination, ask: Does rearranging the chosen items leave it the same selection?

  6. Write one sentence that would remind a classmate how to recognize Combination.

    Hint: Use the mental model "Choosing a group, order ignored." and one signal word.

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Section 11

Frequently Asked Questions

How do I know when to use Combination?

Use Combination when you are selecting a group where the order of the chosen items does not matter. Do not start from the numbers alone; first name the structure of the situation. The fastest check is: Does rearranging the chosen items leave it the same selection? If the answer is yes and the wording matches cues like choose, select a group, committee or team, then combination is probably the right tool.

What is Combination most often confused with?

Combination is often confused with Permutation. Permutation means Counts ordered arrangements, so order creates distinct outcomes. The difference is not just vocabulary; it changes the action you take. For combination, the key test is "Does rearranging the chosen items leave it the same selection?" For permutation, the better cue is: Use when positions or ranks distinguish the choices.

What is the fastest recognition cue for Combination?

Look for choose, select a group, committee or team, handshakes, but treat those words as clues, not proof. A word problem can contain a familiar keyword and still ask for a different idea. After noticing the cue, ask the recognition question: Does rearranging the chosen items leave it the same selection? That question protects you from using a memorized procedure in the wrong place.

What mistake should I avoid with Combination?

Avoid this thinking: "Forgetting to divide by r!r!" That mistake usually happens when the student jumps to a rule before checking the situation. The safer version is: that leaves a permutation count, which overcounts the orderings. A good habit is to say the mental model out loud first: "Choosing a group, order ignored." Then choose the calculation or representation.

How can I tell this apart from Counting principle?

Counting principle is the better fit when the task is about this: Multiplies independent choices, allowing repeats and order. Combination is the better fit when you are selecting a group where the order of the chosen items does not matter. If both ideas seem possible, compare what the problem wants as the final answer. The desired output often reveals whether you should use combination or switch to the nearby concept.

Why does Combination matter?

Combinations are the 'order doesn't matter' half of counting, and the dividing-by-r!r! step is exactly what prevents the overcounting that permutations would cause. They are the engine behind the binomial coefficient and Pascal's triangle. The practical value is recognition: once you can spot combination, you can choose a method before calculating. That makes later topics easier because you are not memorizing isolated tricks; you are recognizing the same structure when it appears in a new representation.

Section 12

Learning Path

Combination

You are here

Before this, students should be comfortable with Permutation and Factorial. This page focuses on the recognition cue: Does rearranging the chosen items leave it the same selection? That cue is the bridge between earlier skills and later problem solving: students first learn to identify the structure, then they learn which calculation, diagram, graph, or proof move belongs to it. After this, Binomial Coefficient become easier to recognize.

Section 13

See Also