Counting and probability · Eqora guide
Combinations in math: when does order count?
Choosing a team and assigning its roles are different outcomes. Derive the counting formula, avoid repeated groups and check constrained selections.
Eight volunteers are available, and you need a team of three. Multiplying 8 × 7 × 6 gives 336, but the number of possible teams is only 56. Neither calculation is random: they count different outcomes. The product distinguishes a first, second and third volunteer; the team description does not. Combinations in math remove those repeated orderings without discarding any genuinely different group. Before choosing a formula, decide what one finished result looks like.
We will count the ordered choices first, explain why each three-person team appears six times, and derive the combination formula from that observation. Then we will change the rules: named roles, required members, category restrictions and repeated choices all matter. You can follow every example on paper without an app. The central skill is recognizing when two descriptions represent the same outcome, not recognizing a keyword on a calculator button.
Eqora publishes this guide as a learning aid, not an exam substitute or a guarantee of correctness or grades. Check the original question, notation, assumptions and result. The desert photographs suggest selecting, grouping and arranging equipment. They are conceptual illustrations rather than numerical diagrams: the number or color of visible clips does not specify the example’s population. All calculations refer to the explicitly stated, fictional volunteers or objects.
Combinations in math count groups, not histories
Assume the eight volunteers are distinct people and nobody can join the same team twice. Label three selected people A, B and C. The descriptions ABC and BAC identify the same team if all members have equal status. Writing the names in a different order does not change who belongs. The act of selecting people may happen sequentially, but the final outcome can still be an unordered group. Physical chronology alone does not determine the counting model.
Now ask what information the result must retain. A team list keeps membership; a podium keeps membership and rank. A committee with a chair keeps one distinguished role as well. The word “choose” can occur in any of those questions, so it cannot settle the issue by itself. Our guide to interpreting word problems explains how to separate the requested result from the story’s incidental details. State the outcome clearly before calculating its count.
An ordered choice keeps every position
Suppose three different volunteers receive the roles of navigator, recorder and coordinator. There are eight possibilities for navigator, seven remaining possibilities for recorder, then six for coordinator. The multiplication principle gives 8 × 7 × 6 = 336 assignments. Swapping navigator and recorder changes the result even if team membership stays fixed. We are counting ordered selections without repetition, often called permutations in English; some courses reserve “permutation” for arranging the entire population.
For k distinct positions filled from n distinct objects without reuse, the product is n(n − 1)…(n − k + 1). It contains k factors, not n factors. The factorial expression n!/(n − k)! abbreviates that product. If k = n, every object receives a position and the result is n!. Here only three of eight people are assigned, so using 8! would also arrange the five people who were never selected.
Why dividing by k factorial removes repeats
A fixed team containing A, B and C appears in six ordered lists: ABC, ACB, BAC, BCA, CAB and CBA. There are 3 × 2 × 1 = 3! such arrangements. Every three-person team of distinct people produces exactly the same number of lists. Therefore the 336 ordered selections split into equally sized groups of six. Dividing gives C(8,3) = 336/6 = 56. We divide because we can explain the repeated representations, not because unordered questions always need a convenient correction factor.
More generally, C(n,k) = n!/[k!(n − k)!], for integers 0 ≤ k ≤ n. The notation is also written as a stacked binomial coefficient and read “n choose k.” Western University’s combinations notes develop the relationship between ordered selections and subsets. Our volunteer example makes the repetition explicit: the denominator k! removes the order of selected people, while (n − k)! cancels the unused tail of n!.
Calculate with cancellation and check the edges
For ten distinct objects taken three at a time, avoid writing two huge factorials. Cancel the common tail first: C(10,3) = (10 × 9 × 8)/(3 × 2 × 1) = 120. A combination count is a nonnegative integer. A fractional answer signals a calculation mistake or a model that does not match the formula. Keep the denominator grouped: dividing only the last factor by three is not the same as dividing the full numerator by six.
There is one way to choose nothing and one way to choose every object: C(n,0) = C(n,n) = 1. These are legitimate selections, not zero possibilities. The convention 0! = 1 makes the formula agree. If the task requires k > n distinct people without reuse, no selection exists and the count is zero; do not enter a negative factorial into this elementary formula. Also check that n and k are whole-number counts rather than measurements or percentages.
Use the unchosen group as an independent check
Selecting three volunteers from eight uniquely determines the five left out. Conversely, specifying the five excluded people uniquely determines the team. Hence C(8,3) = C(8,5) = 56. This is a one-to-one correspondence, not a numerical coincidence. It often shortens arithmetic because you may choose the smaller of k and n − k when forming the product. It does not mean a team of three and a team of five have the same members.
A second check separates teams according to one particular volunteer, A. If A joins, choose two of the other seven: C(7,2) = 21. If A does not join, choose three of those seven: C(7,3) = 35. These cases cannot overlap and together contain every team, so 21 + 35 = 56. Our independent answer-checking guide encourages checks that use different reasoning rather than repeating the same factorial entry and getting the same display twice.
Apply membership restrictions before adding cases
Now three of the eight volunteers have a required training certificate; the other five do not. For a team with exactly two certified members, choose two from the certified group and one from the other group. The count is C(3,2) × C(5,1) = 3 × 5 = 15. Multiply because each permitted certified pair can be combined with each permitted third person. Do not multiply by three again to give the uncertified person a position: no such position is part of the team definition.
For at least one certified member, subtraction is simpler: all teams minus teams with none gives C(8,3) − C(5,3) = 56 − 10 = 46. Check by disjoint cases. Exactly one gives C(3,1)C(5,2) = 30; exactly two gives 15; exactly three gives one. Their sum is 46. “At least one” and “exactly one” differ because a team with two certified people satisfies the first requirement but not the second.
Repeated choices require a different model
The ordinary C(n,k) formula assumes each distinct object is chosen at most once. If you fill three ordered slots with four reusable symbols, there are 4³ = 64 sequences. If only the quantities of four symbol types matter, there are instead C(6,3) = 20 multisets of size three. One way to see this is to arrange three identical markers and three separators: the four spaces between separators specify the four type counts, including possible zeros.
Do not obtain that 20 by dividing 64 by 3!. A sequence with three different symbols has six reorderings, one with two equal symbols has three, and one with all equal symbols has one. There is no common multiplicity to divide out. Unlimited reuse of types also differs from choosing physical objects from a limited stock. If supplies are capped or some objects are indistinguishable, write those rules explicitly and build suitable cases rather than silently reusing a familiar formula.
A count becomes a probability only with a model
Under a uniform random choice among all 56 three-person teams, the probability of exactly two certified members is 15/56. The denominator counts the same kind of outcome as the numerator: unordered teams. Dividing 15 by 336 would mix team counts with ordered role assignments. If you intentionally use ordered triples, count the favorable ordered triples too: 15 × 6 = 90, giving 90/336 = 15/56.
Uniformity is an additional assumption, not a consequence of knowing the count. A selection procedure that always includes one named volunteer does not make all 56 teams equally likely. Sequentially drawing three distinct people with equal chances at each draw does produce uniform unordered teams, because each team has six equally likely ordered histories. If someone’s eligibility, availability or selection weight differs, you need the stated probability mechanism. Counting possibilities alone cannot supply missing probabilities.
Transfer the reasoning to seven people
Close the worked example and choose a two-person team from seven distinct volunteers. With no roles and no reuse, C(7,2) = 7 × 6 / 2 = 21. With two named roles, there are 42 assignments. Explain the factor of two by exchanging the two selected people. Now suppose two volunteers are certified and five are not. Exactly one certified member gives C(2,1)C(5,1) = 10 teams; at least one gives 21 − C(5,2) = 11.
The remaining certified pair accounts for the difference between ten and eleven. Listing the two-person teams in a small case, such as four people, is another useful check: AB, AC, AD, BC, BD and CD gives six. If your count doubles when you reverse the written names, revisit the outcome definition. Finish by stating the population, selection size, role rules, reuse rules and any restrictions in one sentence. That sentence justifies your formula more clearly than a calculator abbreviation alone.
