A combination is a choice of a group where order does not matter. A team containing Ana, Ben, and Chen is the same team regardless of which name you write first. Recognizing this prevents a common counting error: counting the same group many times.
Why combinations divide by a factorial
To choose 3 students from 5, first imagine filling three ordered positions. There are arrangements. But any particular three-person group appears in orders. Divide out that repetition:
In general,
The notation is read “ choose .” It assumes distinct available objects, no repeated selection, and an unordered group. Choosing the included objects is equivalent to choosing the excluded ones, so
Example: require people from two categories
A committee needs 2 students from a group of 5 juniors and 3 from a group of 6 seniors. Choose each category separately:
Multiplication combines one junior choice with one senior choice. Do not use that counts all five-person committees, including committees with the wrong numbers from each category.
Also, do not multiply by afterward. The committee members have no distinct assigned positions. If the problem later assigns roles, that is a separate arrangement step.
Example: at least one from a special group
Among 8 books, 3 are novels and 5 are nonfiction. How many selections of 3 books contain at least one novel?
Count every three-book selection, then remove selections with no novels:
This is simpler than separately counting one, two, or three novels. If you do use those cases, they must be disjoint. The case method gives
The complement method works because the universe is clearly defined: all three-book selections from these eight distinct books.
Counting groups versus assigning roles
From 6 people, choosing a two-person team gives Choosing a captain and an assistant gives Each team can fill the two roles in two ways, explaining the factor of two.
Ask whether switching two selected objects creates a new result. If it does, order matters; if it does not, you need to remove the repeated orderings. Do not rely solely on words such as “choose,” which can appear in either kind of problem.
Combinations can support probability calculations
Suppose a bag contains 4 red and 6 blue counters, all individually distinct, and you choose 3 uniformly without replacement. The total number of three-counter groups is A group with exactly two red counters has possibilities, so its probability is
The ratio works because the unordered groups are equally likely under this sampling process. The denominator and numerator must count outcomes in the same way. Dividing an ordered favorable count by an unordered total count would mix two different sample spaces. Also, a combination formula without replacement is inappropriate if each counter is returned before the next draw; then the experiment's stages, rather than distinct selected groups, provide the natural counting model.
Try it yourself
A club has 7 members. How many four-member teams include a particular member? How many exclude that member?
Answer: Including the member fixes one place, so choose the other 3 from 6: Excluding the member means choose all 4 from the remaining 6: Together they make 35, agreeing with
What to remember
Combinations count unordered selections. Explain why order is irrelevant, apply category restrictions explicitly, and use complementary counting when “at least one” has a simple opposite.