Counting · Decide what makes an outcome different
The distinction comes from the outcome you want to count. Rearranging the same members changes an ordered result, but it does not create a new unordered group.
A permutation counts ordered arrangements; a combination counts unordered selections. With distinct objects A, B, and C, the pairs AB and BA are different permutations but the same combination. Without repetition, ordered selections use n!/(n − r)!, while unordered selections divide that count by r!.
What Makes Two Outcomes Different?
Define the task before choosing a formula. Selecting a chair and secretary makes the positions meaningful. Selecting two members for an equal-role team cares only about which people are selected.
If Alex is chair and Blair is secretary, swapping their roles gives a different assignment. But a team containing Alex and Blair is the same team after its names are listed in the opposite order. The objects are unchanged; the outcome definition differs.
Ask whether swapping two selected objects changes the result being counted. A yes points toward an ordered model. A no points toward an unordered selection, provided no other role or position information matters.
Can A Small List Show The Difference?
Choose two distinct objects from A, B, and C without replacement. The ordered results are AB, AC, BA, BC, CA, and CB. There are six permutations.
The unordered groups are {A, B}, {A, C}, and {B, C}. Each group appears twice in the ordered list. Ignoring order leaves three combinations.
Writing a group in a preferred alphabetical order does not make it a permutation problem. That is a display convention, not an additional outcome. The question still concerns membership rather than sequence.
Why Does The Permutation Formula Multiply Decreasing Choices?
Without replacement, filling a position uses up one available object. From five distinct objects, there are five choices for the first position and four for the second. The ordered two-position count is 5 × 4 = 20.
For three positions, the count becomes 5 × 4 × 3 = 60. Each complete assignment follows one branch of those choices. This is the multiplication principle for consecutive decisions.
The general product is n(n − 1) through n − r + 1. Factorial notation writes it compactly as P(n, r) = n!/(n − r)!. The canceled factorial removes the unused lower factors.
For example, 5!/(5 − 2)! = 120/6 = 20. You do not need to calculate the full factorials by hand when the shorter product is easier. Both expressions represent the same count.
Why Do Combinations Divide By r Factorial?
Each unordered selection of r distinct members appears r! times in the ordered count. There are r choices for its first position, r − 1 for its second, and so on. These orders do not create new membership sets.
For two chosen members, the two orders are AB and BA, so divide by 2! = 2. For three members, the six orders of ABC all describe one group when positions do not matter. Divide by 3! = 6.
Therefore C(n, r) = P(n, r)/r! = n!/[r!(n − r)!]. From five people, the number of three-member teams is 60/6 = 10. The correction removes repeated counting, not real possible teams.
OpenStax connects combinations to permutations by removing the orders of each selected group. This explains the denominator instead of asking you to memorize a second unrelated formula.
When Do Labeled Roles Matter Even If No Sequence Is Written?
Roles can make an outcome ordered without a literal line of objects. Selecting a chair, secretary, and treasurer from five people has 60 assignments. Each named role is a distinguishable position.
Selecting an equal-role three-person committee from those same people has 10 groups. Choosing the committee and then assigning its three roles gives 10 × 6 = 60. The two-step method agrees with the permutation count.
Words such as team and committee are clues, not guarantees. A team with a designated captain may include additional role information. State exactly what the problem counts before deciding whether to ignore order.
What Changes When Repetition Is Allowed?
The decreasing-choice formula assumes each object is used at most once. If an ordered position can reuse any of n options, each position still has n choices. The count is n raised to power r.
For four symbols filling two positions with repetition allowed, there are 4 × 4 = 16 strings. Without repetition, there are 4 × 3 = 12. The difference is whether repeated-symbol outcomes are permitted.
Ordinary combinations also assume distinct objects chosen without replacement. Selecting repeated items from types is a different model. Do not use C(n, r) automatically for a problem that permits several copies of one type.
Why Must You Check Whether Objects Are Distinct?
The factorial count treats every object as distinguishable. If two objects are identical for the outcome definition, swapping them does not create a visibly different arrangement. A correction may be needed.
For the letters A, A, and B, the different visible strings are AAB, ABA, and BAA. There are three, not 3! = 6. The two A objects have two internal swaps that leave each visible string unchanged.
In contrast, two students with the same first name are still distinct people if the task assigns individuals. The distinction depends on what makes an outcome different, not whether printed labels happen to match.
Why Does Choosing r Members Match Choosing Those Left Out?
Every selection of r members from n identifies exactly n − r members not selected. This creates a one-to-one match between the two kinds of selection. Therefore C(n, r) = C(n, n − r).
Choosing four people from a group of six is equivalent to deciding which two to leave out. Both counts are 15. This shortcut can make a calculation smaller without changing the outcome definition.
It does not give a matching permutation rule, because ordering the selected members adds position information. Complement membership and position assignments are different structures. Keep the symmetry attached to combinations.
How Do Counting Choices Affect A Probability Calculation?
A count becomes a probability only after you specify the random model. When outcomes are equally likely, divide favorable outcomes by total outcomes. Use a consistent ordered or unordered description in both counts.
If a two-person team is chosen uniformly from five people, there are C(5, 2) = 10 possible teams. One specified pair then has probability 1/10. Uniform selection is an assumption about the mechanism, not a result of the combination formula alone.
Counting favorable teams but using ordered assignments as the denominator would mix incompatible outcome definitions. You could use an ordered model, but then the favorable numerator must include every corresponding order too.
Which Input Boundaries Should You Check?
The usual formulas use nonnegative whole-number n and r with r ≤ n. You cannot select five distinct members without replacement from only three. That situation has zero possible selections, rather than a valid negative factorial calculation.
Selecting zero members has one outcome: the empty selection. This agrees with the convention 0! = 1. Choosing all n members has one combination but n! orders when positions matter.
With one selected member, permutations and combinations agree because one object has only one internal order. These boundaries are useful checks on a formula or calculator input.
What If A Selection Must Include Different Types Of Members?
Extra conditions can change the count before order is considered. Suppose a group has two teachers and three students, and a team must contain one of each. There are 2 × 3 = 6 valid teams.
Using C(5, 2) = 10 would include teams with two teachers or two students, which the condition forbids. The membership rule must be applied before accepting a standard combination result.
The categories identify a useful way to count each valid group once. This does not mean the team members have ranked positions. The problem is still an unordered selection with an additional restriction.
Practice Applying The Swap Test
Choose two equal-role representatives from six people, then choose a president and vice president from the same six. The first count is C(6, 2) = 15. The second is P(6, 2) = 30.
Explain why swapping the two names changes only the second outcome. Next choose five members from six: there are six combinations, one for each person left out. Listing small cases can expose a mistaken order assumption.
Count After Defining The Outcome
Identify order, replacement, and distinctness before entering n and r. A numerical formula cannot choose that model for you.
Permutation and combination calculatorBrowse statistics tools