Permutations and Combinations: Distinguishing Between Them

Master permutations and combinations: learn to distinguish between them, understand formulas, and solve counting problems through 5 detailed exercises with visual examples and step-by-step solutions.

Solution: Exercises 1 to 3
1 Permutation Problem
Exercise 1
In how many ways can 4 different books be arranged on a shelf?
Definition:

Permutation: An arrangement of objects in a specific order. When arranging all n distinct objects, the number of permutations is n! (n factorial).

Permutation method:
  1. Identify if order matters in the arrangement
  2. Determine the number of objects to arrange
  3. If arranging all objects, use n!
  4. If arranging r objects from n, use P(n,r) = n!/(n-r)!
Books to Arrange
4
All Books
Yes
Formula
4!
Step 1: Identify the problem type

We're arranging 4 distinct books in a specific order on a shelf. Order matters because Book A in position 1 is different from Book A in position 2.

Step 2: Apply the permutation principle

First position: 4 books can go here
Second position: 3 remaining books can go here
Third position: 2 remaining books can go here
Fourth position: 1 remaining book can go here

Step 3: Calculate using factorial

Total arrangements = 4 × 3 × 2 × 1 = 4! = 24

Step 4: Verify with general formula

Since we're arranging all 4 books, we use P(4,4) = 4!/(4-4)! = 4!/0! = 4!/1 = 24

Total arrangements: 24
Final answer:

There are 24 different ways to arrange 4 books on a shelf.

Applied rules:

• Permutation Formula: n! for arranging n distinct objects

• Order Matters: Position on shelf is important

• Distinct Objects: Each book is unique

2 Combination Problem
Exercise 2
A pizza place offers 8 different toppings. In how many ways can a customer choose 3 toppings for their pizza?
Definition:

Combination: A selection of objects where order does not matter. The number of combinations of n objects taken r at a time is C(n,r) = n!/[r!(n-r)!]

Total Toppings
8
Toppings to Choose
3
Formula
C(8,3)
Step 1: Identify the problem type

We're selecting 3 toppings from 8, and the order doesn't matter (pepperoni, mushrooms, onions is the same as onions, pepperoni, mushrooms).

Step 2: Apply combination formula

C(n,r) = n!/[r!(n-r)!]
C(8,3) = 8!/[3!(8-3)!] = 8!/(3! × 5!)

Step 3: Simplify the calculation

C(8,3) = (8 × 7 × 6 × 5!)/(3! × 5!)
= (8 × 7 × 6)/(3 × 2 × 1)
= 336/6
= 56

Step 4: Verify the result

Using the calculator: C(8,3) = 56 ✓

Total topping combinations: 56
Final answer:

There are 56 different ways to choose 3 toppings from 8 options.

Applied rules:

• Combination Formula: Order doesn't matter, so use C(n,r)

• Factorial Simplification: Cancel common terms in numerator and denominator

• Context Verification: Pizza toppings don't depend on order of selection

3 Committee Selection
Exercise 3
From a group of 10 people, how many ways can we select a president, vice-president, and secretary?
Definition:

Permutation with specific positions: When assigning specific roles to selected individuals, order matters because each position is distinct.

Total People
10
Positions to Fill
3
Formula
P(10,3)
Step 1: Determine if order matters

Yes, order matters because each position (president, vice-president, secretary) is distinct and has different responsibilities.

Step 2: Apply permutation formula

P(n,r) = n!/(n-r)!
P(10,3) = 10!/(10-3)! = 10!/7!

Step 3: Calculate the result

P(10,3) = (10 × 9 × 8 × 7!)/7!
= 10 × 9 × 8
= 720

Step 4: Interpret the result

There are 720 different ways to assign these 3 distinct positions to 10 people.

Total arrangements: 720
Final answer:

There are 720 different ways to select a president, vice-president, and secretary from 10 people.

Applied rules:

• Permutation Formula: P(n,r) = n!/(n-r)!

• Distinct Positions: Each role is unique, so order matters

• Factorial Cancellation: Simplify by canceling common terms

Permutations and Combinations: Key Concepts
Permutation: P(n,r) = n!/(n-r)! | Combination: C(n,r) = n!/[r!(n-r)!]
Basic Formulas
Permutation
Order matters
Arrangement
Combination
Order doesn't matter
Selection
Factorial
n! = n×(n-1)×...×2×1
Basic building block
Key Definitions:

Permutation: An arrangement of objects where the order is important

Combination: A selection of objects where the order is not important

Factorial (n!): The product of all positive integers less than or equal to n

Relationship: P(n,r) = C(n,r) × r! (permutations = combinations × arrangements of selected items)

Decision Process:
  1. Ask: Does order matter? If yes, use permutation; if no, use combination
  2. Identify: How many objects total (n) and how many to select (r)?
  3. Select: Apply appropriate formula
  4. Calculate: Simplify using factorial properties
Tip 1: "Permutation" has "position" in it - think of arranging in positions. "Combination" has "collection" in it - think of selecting a collection.
Tip 2: If the problem uses words like "arrange," "order," "sequence," or "rank," it's likely a permutation problem.
Tip 3: If the problem uses words like "select," "choose," "pick," or "group," it's likely a combination problem.
Tip 4: Always remember that C(n,r) = C(n, n-r) - choosing r items is the same as leaving out (n-r) items.
Common errors: Confusing permutations with combinations, forgetting to check if order matters, misapplying factorial simplifications.
Key properties: P(n,r) ≥ C(n,r) since permutations count more arrangements. Also, P(n,n) = n! and C(n,n) = 1.
Essential Formulas:

• Permutation: P(n,r) = n!/(n-r)!

• Combination: C(n,r) = n!/[r!(n-r)!]

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

• Special cases: P(n,n) = n!, C(n,n) = 1, C(n,0) = 1

Permutation vs Combination
📊
Permutations

• Order matters

• Arrangement problem

• More possibilities

• P(n,r) = n!/(n-r)!

Combinations

• Order doesn't matter

• Selection problem

• Fewer possibilities

• C(n,r) = n!/[r!(n-r)!]

Calculation Tips

• Cancel factorials when possible

• Use calculator for large values

• Remember: 0! = 1

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

Problem-Solving Flow
1
Does order matter?
2
Identify n and r
3
Choose formula
4
Calculate
Relationship Insight
P(n,r) = C(n,r) × r! - Permutations count combinations multiplied by arrangements of selected items
Master Permutations & Combinations!
Solution: Exercises 4 to 5
4 Password Creation
Exercise 4
A password consists of 4 different letters followed by 3 different digits. How many different passwords are possible?
Definition:

Sequential Permutations: When multiple selections are made in sequence, multiply the number of possibilities for each selection.

Letter Positions
P(26,4)
Digit Positions
P(10,3)
Total
P(26,4) × P(10,3)
Step 1: Analyze the structure

Password format: LLLL-DDD (4 letters followed by 3 digits), with no repetition allowed.

Step 2: Calculate letter arrangements

First letter: 26 choices
Second letter: 25 choices (one already used)
Third letter: 24 choices
Fourth letter: 23 choices
Total letter arrangements: 26 × 25 × 24 × 23 = P(26,4) = 358,800

Step 3: Calculate digit arrangements

First digit: 10 choices
Second digit: 9 choices
Third digit: 8 choices
Total digit arrangements: 10 × 9 × 8 = P(10,3) = 720

Step 4: Combine the results

Since the letter and digit selections are independent, multiply the possibilities:
358,800 × 720 = 258,336,000

Total passwords: 258,336,000
Final answer:

There are 258,336,000 different possible passwords.

Applied rules:

• Permutation for Arrangements: Since no repetition is allowed and order matters

• Sequential Selection: Multiply possibilities for independent selections

• Non-replacement: Choices decrease with each selection

5 Handshake Problem
Exercise 5
In a room of 12 people, everyone shakes hands with everyone else exactly once. How many handshakes occur?
Definition:

Handshake Problem: Each handshake involves 2 people, and order doesn't matter (A shaking hands with B is the same as B shaking hands with A).

Total People
12
People per Handshake
2
Formula
C(12,2)
Step 1: Identify the problem type

Each handshake involves selecting 2 people from 12. The order doesn't matter because person A shaking hands with person B is the same as person B shaking hands with person A.

Step 2: Apply combination formula

We need to choose 2 people from 12, so we use C(12,2)
C(12,2) = 12!/[2!(12-2)!] = 12!/(2! × 10!)

Step 3: Simplify the calculation

C(12,2) = (12 × 11 × 10!)/(2! × 10!)
= (12 × 11)/(2 × 1)
= 132/2
= 66

Step 4: Verify with alternative approach

Alternative method: Person 1 shakes hands with 11 others, Person 2 with 10 others (excluding Person 1), etc.
Total = 11 + 10 + 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 = 66 ✓

Total handshakes: 66
Final answer:

There are 66 handshakes that occur.

Applied rules:

• Combination for Selections: Order doesn't matter in handshakes

• Pair Formation: Each handshake creates a unique pair

• Alternative Verification: Cross-check with different approaches

Comprehensive Permutations and Combinations Guide
P(n,r) = n!/(n-r)! | C(n,r) = n!/[r!(n-r)!] | P(n,r) = C(n,r) × r!
Fundamental Relationships
Key definitions:

Permutation: An ordered arrangement of objects. P(n,r) represents the number of ways to arrange r objects from n distinct objects.

Combination: An unordered selection of objects. C(n,r) represents the number of ways to select r objects from n distinct objects.

Factorial: For any positive integer n, n! = n × (n-1) × (n-2) × ... × 2 × 1. By definition, 0! = 1.

Complete methodology:
  1. Understand the problem: Identify whether order matters in the outcome
  2. Identify variables: Determine n (total objects) and r (objects to select/arrange)
  3. Choose formula: Use permutation if order matters, combination if not
  4. Calculate: Apply the appropriate formula and simplify
Tip 1: The word "arrange" or "order" typically signals a permutation problem, while "select" or "choose" often indicates a combination problem.
Tip 2: Remember that C(n,r) = C(n, n-r). Choosing 3 items from 10 is the same as leaving out 7 items from 10.
Tip 3: For problems with restrictions, sometimes it's easier to count the total possibilities and subtract the unwanted ones.
Tip 4: Always check if repetition is allowed. If so, use different formulas: n^r for permutations with repetition.
Common errors: Confusing permutations with combinations, forgetting to adjust for restrictions, misinterpreting "at least" or "at most" conditions, not accounting for repetition allowance.
Key relationships: P(n,r) = C(n,r) × r!. Also, C(n,r) = C(n, n-r). For large n and small r, P(n,r) ≈ n^r.
Essential formulas to know:

• Permutation: P(n,r) = n!/(n-r)! = n × (n-1) × ... × (n-r+1)

• Combination: C(n,r) = n!/[r!(n-r)!]

• Special cases: P(n,n) = n!, C(n,n) = 1, C(n,0) = 1, C(n,1) = n

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

• Symmetry: C(n,r) = C(n, n-r)

Applications in Probability and Real Life
Advanced Application: Probability Calculations
Permutations and combinations are essential for calculating probabilities in various scenarios, from card games to lotteries to statistical sampling.

Analysis: Permutations and combinations form the foundation for probability theory, statistics, and discrete mathematics.

  • Permutations: Used when order matters (arrangements, sequences, rankings)
  • Combinations: Used when order doesn't matter (selections, groups, committees)
  • Both: Essential for calculating probabilities in games of chance
  • Applications: Cryptography, computer science, genetics, and more

Questions & Answers

Question: I'm still confused about when to use permutations versus combinations. Can you give me a simple way to remember the difference?

Answer: The key is to ask yourself: "Does changing the order of the selected items create a different outcome?"

  • Use permutations when order matters: Arranging people in a line, creating passwords, awarding prizes (1st, 2nd, 3rd)
  • Use combinations when order doesn't matter: Selecting team members, choosing lottery numbers, picking pizza toppings

Memory trick: "Permutation = Position matters" and "Combination = Collection matters".

Example: If you're choosing 3 people from 10 to form a team, it's a combination (the team Alice-Bob-Charlie is the same as Bob-Alice-Charlie). But if you're choosing 3 people from 10 to be president, vice-president, and secretary, it's a permutation (the arrangement matters).

Question: Why is there an r! in the denominator of the combination formula but not in the permutation formula?

Answer: The r! in the denominator of the combination formula accounts for the fact that order doesn't matter.

Think of it this way:

  • Permutations (P(n,r)): Count every possible arrangement of r items from n items. If you select items A, B, C, then ABC, ACB, BAC, BCA, CAB, CBA are all counted as different.
  • Combinations (C(n,r)): Count only unique groups of r items from n items. If you select items A, B, C, then {A, B, C} is counted only once, regardless of the order.

Since there are r! ways to arrange r items, we divide the permutation count by r! to get the combination count: C(n,r) = P(n,r)/r! = n!/[r!(n-r)!]

This relationship also explains why P(n,r) = C(n,r) × r!.

Question: How do I know if a problem allows repetition or not? It's not always clearly stated.

Answer: Look for specific clues in the problem wording:

  • Words suggesting NO repetition: "different", "distinct", "without replacement", "unique"
  • Words suggesting WITH repetition: "may repeat", "with replacement", "as many times as needed"

If it's not explicitly stated, consider the context:

  • No repetition is more common in counting problems unless specified otherwise
  • Physical objects typically don't allow repetition (you can't use the same book twice in an arrangement)
  • Abstract elements like numbers or letters may allow repetition unless stated otherwise

When in doubt, solve for both cases or ask for clarification. The formulas are different: without repetition uses P(n,r) and C(n,r), while with repetition uses n^r for ordered selections.

Question: How can I quickly calculate large factorials or combinations without a calculator?

Answer: Here are some strategies for manual calculation:

  1. Cancel factorials: In C(10,3) = 10!/(3!×7!), write it as (10×9×8×7!)/(3!×7!) and cancel 7! to get (10×9×8)/(3×2×1)
  2. Look for symmetry: Use C(n,r) = C(n, n-r) to choose the easier calculation
  3. Simplify early: Cancel common factors before multiplying large numbers
  4. Memorize small factorials: Know 1!=1, 2!=2, 3!=6, 4!=24, 5!=120, 6!=720

Example: C(8,3) = (8×7×6)/(3×2×1) = 336/6 = 56

For larger calculations, break down the multiplication: 8×7×6 = 56×6 = 336, then 336÷6 = 56.

Remember that factorials grow very quickly: 10! = 3,628,800, so most practical problems involve small values of r.

Question: How are permutations and combinations related to probability? I see them taught together but don't understand the connection.

Answer: Permutations and combinations are the foundation of classical probability! The basic probability formula is:

P(Event) = Number of favorable outcomes / Total number of possible outcomes

  • Permutations/Combinations help determine the total number of possible outcomes
  • Permutations/Combinations help determine the number of favorable outcomes
  • Without accurate counting, probability calculations would be impossible

For example, the probability of getting exactly 2 heads in 3 coin flips: total outcomes = 2³ = 8, favorable outcomes = C(3,2) = 3, so P = 3/8.

This connection makes permutations and combinations essential for understanding probability distributions, statistical inference, and random processes.