Solved Exercises on Permutations vs Combinations Applications

Master when to use permutations vs combinations: practical applications and detailed comparisons through these 5 exercises.

Solution: Exercises 1 to 3
1 Permutation vs Combination Comparison
Exercise 1
Compare: (A) How many ways can 3 people be arranged in a line? (B) How many ways can 3 people be selected from 8 for a team?
Definition:

Permutation vs Combination: Permutations count arrangements where order matters; combinations count selections where order doesn't matter.

Decision method:
  1. Determine if order matters in the problem
  2. If yes, use permutation: P(n,r) = n!/(n-r)!
  3. If no, use combination: C(n,r) = n!/[r!(n-r)!]
Part A: Arrangement
P(8,3)
Part B: Selection
C(8,3)
Calculations
336 vs 56
Step 1: Analyze Part A - Arrangement

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.

Step 2: Analyze Part B - Selection

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.

Step 3: Compare results

Permutations (336) > Combinations (56) because arrangements count more possibilities than selections.

A: 336 arrangements, B: 56 selections
Final answer:

Part A: 336 ways to arrange 3 people in a line. Part B: 56 ways to select 3 people for a team.

Applied rules:

• Order matters: Use permutations for arrangements

• Order doesn't matter: Use combinations for selections

• Relationship: P(n,r) = C(n,r) × r!

2 Committee Positions
Exercise 2
From 10 people, how many ways can we select a committee of 4 with specific roles: president, vice-president, secretary, and treasurer?
Definition:

Role Assignment: When positions are distinct and have different responsibilities, order matters and we use permutations.

Total people
n=10
Positions
r=4
Type
Permutation
Result
P(10,4)=5,040
Step 1: Identify if order matters

Since each position (president, VP, secretary, treasurer) is distinct, the assignment order matters. Person A as president is different from person A as secretary.

Step 2: Apply permutation formula

We're selecting and arranging 4 people from 10: P(10,4) = 10!/(10-4)! = 10!/6! = 10×9×8×7 = 5,040.

Step 3: Verify the approach

Alternative method: President: 10 choices, VP: 9 choices, Secretary: 8 choices, Treasurer: 7 choices. Total: 10×9×8×7 = 5,040.

5,040 ways to assign the 4 distinct positions
Final answer:

There are 5,040 different ways to assign the 4 distinct positions.

Applied rules:

• Distinct roles: Use permutations when positions differ

• Assignment with order: Who gets which position matters

• Without replacement: One person per position

3 Committee Selection
Exercise 3
From 10 people, how many ways can we select a committee of 4 people with no specific roles?
Definition:

Roleless Committee: When all members have equal status and roles are interchangeable, order doesn't matter and we use combinations.

Total people
n=10
Committee size
r=4
Type
Combination
Result
C(10,4)=210
Step 1: Identify if order matters

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}.

Step 2: Apply combination formula

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.

Step 3: Compare with Exercise 2

Notice: C(10,4) = 210 vs P(10,4) = 5,040. Combinations give fewer results since they ignore order.

210 ways to select the 4-person committee
Final answer:

There are 210 different ways to select a 4-person committee with no specific roles.

Applied rules:

• 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

Rules and methods, laws,...
\(P(n,r) = \frac{n!}{(n-r)!} \quad \text{vs} \quad C(n,r) = \frac{n!}{r!(n-r)!}\)
Permutation vs Combination
Permutation
Order matters
Arrangements, sequences, rankings
Combination
Order doesn't matter
Selections, groups, subsets
Key Relationship
P(n,r) = C(n,r) × r!
Permutations = Combinations × Arrangements
Decision Tree
Does reordering change the outcome?
Yes → Permutation, No → Combination
Key definitions:

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.

Decision-making methodology:
  1. Read the problem carefully: Identify what is being asked
  2. Ask the key question: "Does changing the order create a different outcome?"
  3. If YES: Use permutation (order matters)
  4. If NO: Use combination (order doesn't matter)
  5. Apply the appropriate formula: P(n,r) or C(n,r)
  6. Calculate and verify: Check if the answer makes sense
Tip 1: Permutation keywords: arrange, order, rank, sequence, position, schedule.
Tip 2: Combination keywords: select, choose, pick, group, team, committee, subset.
Tip 3: If positions/roles are distinct, use permutations; if equivalent, use combinations.
Tip 4: Remember: P(n,r) ≥ C(n,r), with equality only when r=0 or r=1.
Common errors: Using combinations when permutations are needed, vice versa, misinterpreting the problem's requirement for order.
Key insight: The relationship P(n,r) = C(n,r) × r! connects both concepts mathematically.
Essential comparison formulas:

• 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)

Solution: Exercises 4 to 5
4 Password vs Code Comparison
Exercise 4
Compare: (A) How many 4-digit PIN codes can be created using digits 0-9? (B) How many ways can 4 digits be selected from 0-9 without repetition?
Definition:

PIN vs Selection: A PIN code requires specific ordering of digits, while selection just chooses which digits to include.

Part A: PIN Code
10⁴
Part B: Digit Selection
C(10,4)
Results
10,000 vs 210
Step 1: Analyze Part A - PIN Code

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.

Step 2: Analyze Part B - Digit Selection

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.

Step 3: Compare the approaches

PIN codes care about position (permutation-like), while digit selection cares about inclusion (combination).

A: 10,000 PIN codes, B: 210 digit sets
Final answer:

Part A: 10,000 different 4-digit PIN codes. Part B: 210 different ways to select 4 digits from 0-9.

Applied rules:

• Position-dependent: PIN codes require specific ordering

• Set selection: Choosing which digits to include, not their order

• Repetition: PIN allows repetition, selection doesn't

5 Race Finishers vs Medal Winners
Exercise 5
In a race with 12 runners, compare: (A) How many ways can the top 3 finishers be arranged? (B) How many ways can 3 medal winners be selected?
Definition:

Finish Order vs Selection: Ranking considers who finishes first, second, third (order matters), while selection just chooses who wins medals (order doesn't matter).

Part A: Top 3 Order
P(12,3)
Part B: Medal Selection
C(12,3)
Results
1,320 vs 220
Step 1: Analyze Part A - Finish Order

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.

Step 2: Analyze Part B - Medal Selection

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.

Step 3: Verify the relationship

Check: P(12,3) = C(12,3) × 3! = 220 × 6 = 1,320 ✓

A: 1,320 finish orders, B: 220 medal winner sets
Final answer:

Part A: 1,320 different ways for top 3 finishers. Part B: 220 different ways to select 3 medal winners.

Applied rules:

• Ranking: Use permutations for ordered results

• Grouping: Use combinations for unordered selections

• Verification: P(n,r) = C(n,r) × r! confirms calculations

Comprehensive Summary: Permutations vs Combinations Applications
\(P(n,r) = \frac{n!}{(n-r)!} \quad \text{vs} \quad C(n,r) = \frac{n!}{r!(n-r)!}\)
Permutation vs Combination Formulas
Key definitions:

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.

Complete decision-making methodology:
  1. Read the problem thoroughly: Identify what is being counted or selected
  2. Ask the critical question: "Would changing the order of selected objects create a different outcome?"
  3. Answer YES: Use permutation formula P(n,r) = n!/(n-r)!
  4. Answer NO: Use combination formula C(n,r) = n!/[r!(n-r)!]
  5. Identify parameters: Determine n (total objects) and r (objects to select/arrange)
  6. Calculate carefully: Simplify factorials and verify arithmetic
  7. Check reasonableness: Verify the answer makes logical sense
Tip 1: Permutation keywords: arrange, order, rank, sequence, position, schedule, appoint, assign specific roles.
Tip 2: Combination keywords: select, choose, pick, group, team, committee, subset, sample, collect, form a group.
Tip 3: If roles are distinct (president, VP, secretary), use permutations; if equivalent (committee members), use combinations.
Tip 4: Remember: P(n,r) ≥ C(n,r) with equality only when r=0 or r=1.
Tip 5: Use the relationship P(n,r) = C(n,r) × r! to verify your choice was correct.
Common errors: Misinterpreting whether order matters, using combinations when permutations are needed, vice versa, not recognizing distinct vs equivalent roles.
Memorization aid: "Permutation = Position matters" and "Combination = Collection matters".
Advanced insight: Both concepts are foundational for probability theory and statistics.
Essential comparison rules:

• 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\)

Example progression (Simple to Complex):

• 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

Key takeaways for memorization:

• 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).