Permutation vs Combination: Permutations count arrangements where order matters; combinations count selections where order doesn't matter.
- Determine if order matters in the problem
- If yes, use permutation: P(n,r) = n!/(n-r)!
- If no, use combination: C(n,r) = n!/[r!(n-r)!]
Arranging people in a line means order matters (person A in position 1 is different from position 2). This is a permutation: P(8,3) = 8!/(8-3)! = 8!/5! = 8×7×6 = 336.
Selecting people for a team means order doesn't matter (team with A,B,C is same as C,B,A). This is a combination: C(8,3) = 8!/(3!×5!) = (8×7×6)/(3×2×1) = 56.
Permutations (336) > Combinations (56) because arrangements count more possibilities than selections.
Part A: 336 ways to arrange 3 people in a line. Part B: 56 ways to select 3 people for a team.
• Order matters: Use permutations for arrangements
• Order doesn't matter: Use combinations for selections
• Relationship: P(n,r) = C(n,r) × r!
Role Assignment: When positions are distinct and have different responsibilities, order matters and we use permutations.
Since each position (president, VP, secretary, treasurer) is distinct, the assignment order matters. Person A as president is different from person A as secretary.
We're selecting and arranging 4 people from 10: P(10,4) = 10!/(10-4)! = 10!/6! = 10×9×8×7 = 5,040.
Alternative method: President: 10 choices, VP: 9 choices, Secretary: 8 choices, Treasurer: 7 choices. Total: 10×9×8×7 = 5,040.
There are 5,040 different ways to assign the 4 distinct positions.
• Distinct roles: Use permutations when positions differ
• Assignment with order: Who gets which position matters
• Without replacement: One person per position
Roleless Committee: When all members have equal status and roles are interchangeable, order doesn't matter and we use combinations.
Since all committee members have equal status with no specific roles, the order of selection doesn't matter. Committee {A,B,C,D} is the same as {D,C,B,A}.
We're selecting 4 people from 10 without considering order: C(10,4) = 10!/(4!×6!) = (10×9×8×7)/(4×3×2×1) = 5,040/24 = 210.
Notice: C(10,4) = 210 vs P(10,4) = 5,040. Combinations give fewer results since they ignore order.
There are 210 different ways to select a 4-person committee with no specific roles.
• Equal status: Use combinations when members are equivalent
• Selection without order: Just choosing who's included
• Relationship: P(10,4) = C(10,4) × 4! = 210 × 24 = 5,040
Permutation: An arrangement of objects where order matters. Different orders represent different arrangements.
Combination: A selection of objects where order does not matter. Different orders of the same objects represent the same combination.
Order matters: When rearranging selected objects creates a different outcome.
Order doesn't matter: When rearranging selected objects produces the same result.
- Read the problem carefully: Identify what is being asked
- Ask the key question: "Does changing the order create a different outcome?"
- If YES: Use permutation (order matters)
- If NO: Use combination (order doesn't matter)
- Apply the appropriate formula: P(n,r) or C(n,r)
- Calculate and verify: Check if the answer makes sense
• Permutation: \(P(n,r) = \frac{n!}{(n-r)!}\)
• Combination: \(C(n,r) = \frac{n!}{r!(n-r)!}\)
• Relationship: \(P(n,r) = C(n,r) \times r!\)
• Symmetry: \(C(n,r) = C(n,n-r)\), but \(P(n,r) \neq P(n,n-r)\) (except r=n-r)
PIN vs Selection: A PIN code requires specific ordering of digits, while selection just chooses which digits to include.
A 4-digit PIN has positions: thousands, hundreds, tens, units. Order matters (PIN 1234 ≠ 4321). Each position can have any digit 0-9: 10×10×10×10 = 10⁴ = 10,000 possibilities.
Selecting 4 digits from 10 where order doesn't matter: C(10,4) = 10!/(4!×6!) = (10×9×8×7)/(4×3×2×1) = 210 different sets of 4 digits.
PIN codes care about position (permutation-like), while digit selection cares about inclusion (combination).
Part A: 10,000 different 4-digit PIN codes. Part B: 210 different ways to select 4 digits from 0-9.
• Position-dependent: PIN codes require specific ordering
• Set selection: Choosing which digits to include, not their order
• Repetition: PIN allows repetition, selection doesn't
Finish Order vs Selection: Ranking considers who finishes first, second, third (order matters), while selection just chooses who wins medals (order doesn't matter).
Who finishes 1st, 2nd, 3rd matters (gold, silver, bronze). Order is crucial: (Alice 1st, Bob 2nd, Carol 3rd) ≠ (Carol 1st, Bob 2nd, Alice 3rd). This is P(12,3) = 12!/(12-3)! = 12×11×10 = 1,320.
Simply selecting 3 medal winners from 12, regardless of which medal they win. Order doesn't matter: {Alice, Bob, Carol} is the same as {Carol, Bob, Alice}. This is C(12,3) = 12!/(3!×9!) = (12×11×10)/(3×2×1) = 220.
Check: P(12,3) = C(12,3) × 3! = 220 × 6 = 1,320 ✓
Part A: 1,320 different ways for top 3 finishers. Part B: 220 different ways to select 3 medal winners.
• Ranking: Use permutations for ordered results
• Grouping: Use combinations for unordered selections
• Verification: P(n,r) = C(n,r) × r! confirms calculations
Permutation: An arrangement of objects where order matters. Different orders represent different arrangements.
Combination: A selection of objects where order does not matter. Different orders of the same objects represent the same combination.
Order matters: When rearranging selected objects creates a different outcome or meaning.
Order doesn't matter: When rearranging selected objects produces the same result or situation.
Distinct roles: Positions or functions that are not interchangeable.
Equivalent members: Participants that serve the same function.
- Read the problem thoroughly: Identify what is being counted or selected
- Ask the critical question: "Would changing the order of selected objects create a different outcome?"
- Answer YES: Use permutation formula P(n,r) = n!/(n-r)!
- Answer NO: Use combination formula C(n,r) = n!/[r!(n-r)!]
- Identify parameters: Determine n (total objects) and r (objects to select/arrange)
- Calculate carefully: Simplify factorials and verify arithmetic
- Check reasonableness: Verify the answer makes logical sense
• Permutation formula: \(P(n,r) = \frac{n!}{(n-r)!}\)
• Combination formula: \(C(n,r) = \frac{n!}{r!(n-r)!}\)
• Relationship: \(P(n,r) = C(n,r) \times r!\)
• Symmetry: \(C(n,r) = C(n,n-r)\), but \(P(n,r) \neq P(n,n-r)\) (except when r=n-r)
• Special cases: \(P(n,n) = n!\), \(C(n,n) = 1\), \(P(n,0) = C(n,0) = 1\)
• Simple: Arranging 2 from 3 (permutation: 6, combination: 3)
• Intermediate: Selecting committee vs assigning roles
• Advanced: Multi-constraint problems requiring both concepts
• Complex: Probability problems combining both concepts
• Ask: "Does reordering change the outcome?" Yes→Permutation, No→Combination
• Distinct positions → Permutations, Equivalent roles → Combinations
• Arrangements → Permutations, Selections → Combinations
• Rankings/sequences → Permutations, Groups/sets → Combinations
• Always verify using P(n,r) = C(n,r) × r! relationship
Questions & Answers
Question: How can I quickly determine whether a problem requires permutations or combinations?
Answer: Use this simple decision rule:
- Ask yourself: "If I rearrange the selected items, do I get a different outcome?"
- If YES: Use permutations (order matters)
- If NO: Use combinations (order doesn't matter)
Examples: Arranging books on a shelf (different order = different arrangement) → permutation. Selecting books for a reading list (same books = same list) → combination.
Question: Why is P(n,r) always greater than or equal to C(n,r)?
Answer: This relationship comes from their mathematical definitions:
- P(n,r) = n!/(n-r)! counts all possible arrangements
- C(n,r) = n!/[r!(n-r)!] counts only unique groups
- The relationship is: P(n,r) = C(n,r) × r!
Since r! ≥ 1 for r ≥ 1, we have P(n,r) ≥ C(n,r). They're equal only when r! = 1, which happens when r = 0 or r = 1.
Intuitively: Permutations count MORE because they consider all possible orderings of each group.
Question: Can a problem involve both permutations and combinations? If so, how do I handle it?
Answer: Yes, many problems combine both concepts! Approach these step-by-step:
- Break down the problem: Identify which parts require order consideration
- Apply the right tool: Use permutation for ordered parts, combination for unordered parts
- Combine results: Often multiply the results using the fundamental counting principle
Example: Selecting a committee of 3 from 10 people AND assigning them to president, VP, secretary. First select: C(10,3). Then arrange: 3!. Total: C(10,3) × 3! = P(10,3).