Permutation: An arrangement of objects in a specific order. When arranging all n distinct objects, the number of permutations is n! (n factorial).
- Identify if order matters in the arrangement
- Determine the number of objects to arrange
- If arranging all objects, use n!
- If arranging r objects from n, use P(n,r) = n!/(n-r)!
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.
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
Total arrangements = 4 × 3 × 2 × 1 = 4! = 24
Since we're arranging all 4 books, we use P(4,4) = 4!/(4-4)! = 4!/0! = 4!/1 = 24
There are 24 different ways to arrange 4 books on a shelf.
• Permutation Formula: n! for arranging n distinct objects
• Order Matters: Position on shelf is important
• Distinct Objects: Each book is unique
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)!]
We're selecting 3 toppings from 8, and the order doesn't matter (pepperoni, mushrooms, onions is the same as onions, pepperoni, mushrooms).
C(n,r) = n!/[r!(n-r)!]
C(8,3) = 8!/[3!(8-3)!] = 8!/(3! × 5!)
C(8,3) = (8 × 7 × 6 × 5!)/(3! × 5!)
= (8 × 7 × 6)/(3 × 2 × 1)
= 336/6
= 56
Using the calculator: C(8,3) = 56 ✓
There are 56 different ways to choose 3 toppings from 8 options.
• 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
Permutation with specific positions: When assigning specific roles to selected individuals, order matters because each position is distinct.
Yes, order matters because each position (president, vice-president, secretary) is distinct and has different responsibilities.
P(n,r) = n!/(n-r)!
P(10,3) = 10!/(10-3)! = 10!/7!
P(10,3) = (10 × 9 × 8 × 7!)/7!
= 10 × 9 × 8
= 720
There are 720 different ways to assign these 3 distinct positions to 10 people.
There are 720 different ways to select a president, vice-president, and secretary from 10 people.
• Permutation Formula: P(n,r) = n!/(n-r)!
• Distinct Positions: Each role is unique, so order matters
• Factorial Cancellation: Simplify by canceling common terms
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)
- Ask: Does order matter? If yes, use permutation; if no, use combination
- Identify: How many objects total (n) and how many to select (r)?
- Select: Apply appropriate formula
- Calculate: Simplify using factorial properties
• 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
• Order matters
• Arrangement problem
• More possibilities
• P(n,r) = n!/(n-r)!
• Order doesn't matter
• Selection problem
• Fewer possibilities
• C(n,r) = n!/[r!(n-r)!]
• Cancel factorials when possible
• Use calculator for large values
• Remember: 0! = 1
• P(n,r) = C(n,r) × r!
Sequential Permutations: When multiple selections are made in sequence, multiply the number of possibilities for each selection.
Password format: LLLL-DDD (4 letters followed by 3 digits), with no repetition allowed.
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
First digit: 10 choices
Second digit: 9 choices
Third digit: 8 choices
Total digit arrangements: 10 × 9 × 8 = P(10,3) = 720
Since the letter and digit selections are independent, multiply the possibilities:
358,800 × 720 = 258,336,000
There are 258,336,000 different possible passwords.
• 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
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).
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.
We need to choose 2 people from 12, so we use C(12,2)
C(12,2) = 12!/[2!(12-2)!] = 12!/(2! × 10!)
C(12,2) = (12 × 11 × 10!)/(2! × 10!)
= (12 × 11)/(2 × 1)
= 132/2
= 66
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 ✓
There are 66 handshakes that occur.
• Combination for Selections: Order doesn't matter in handshakes
• Pair Formation: Each handshake creates a unique pair
• Alternative Verification: Cross-check with different approaches
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.
- Understand the problem: Identify whether order matters in the outcome
- Identify variables: Determine n (total objects) and r (objects to select/arrange)
- Choose formula: Use permutation if order matters, combination if not
- Calculate: Apply the appropriate formula and simplify
• 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)
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