Permutation: An arrangement of objects where order matters. For n distinct objects arranged in a line, there are n! possible arrangements.
- Identify the number of objects to arrange (n)
- Apply the factorial formula: n! = n × (n-1) × (n-2) × ... × 1
- Calculate the result
We need to arrange 5 distinct books in a line. Since the order matters (the book at position 1 is different from position 2, etc.), this is a permutation problem.
For n distinct objects arranged in a line, the number of arrangements is n!. Here, n = 5, so we need 5!.
5! = 5 × 4 × 3 × 2 × 1 = 120
There are 120 different ways to arrange 5 different books on a shelf.
• Order matters: Each arrangement is unique based on position
• Factorial: n! represents the number of ways to arrange n distinct objects
• Distinct objects: Each book is unique and distinguishable
Partial Permutation: When selecting r objects from n distinct objects where order matters, the number of arrangements is P(n,r) = n!/(n-r)!.
We're selecting 3 students from 8, but the order matters because each position (president, VP, secretary) is distinct.
P(n,r) = n!/(n-r)! = 8!/(8-3)! = 8!/5! = 8×7×6 = 336
President: 8 choices, VP: 7 remaining choices, Secretary: 6 remaining choices. Total: 8×7×6 = 336.
There are 336 different ways to select and arrange 3 students for the three distinct positions.
• Partial permutation: P(n,r) = n!/(n-r)! when selecting r from n with order
• Distinct positions: Each role is unique, so order matters
• Without replacement: Once selected, a student cannot hold another position
Circular Permutation: When arranging n objects in a circle where rotations are considered identical, there are (n-1)! distinct arrangements.
In a circle, rotating the entire arrangement doesn't create a new arrangement. For example, ABCDE is the same as BCDEA when rotated.
To count distinct circular arrangements, we fix one person's position. This eliminates the rotational symmetry.
With one person fixed, we arrange the remaining 5 people in the remaining 5 positions: 5! = 120 arrangements.
There are 120 different ways for 6 people to sit around a circular table when rotations are considered the same.
• Circular permutation: (n-1)! when rotations are identical
• Rotation symmetry: Fix one object to eliminate redundant arrangements
• Order still matters: The relative positions between people matter
Permutation: An arrangement of objects where the order matters. Different orders represent different arrangements.
Factorial (n!): The product of all positive integers less than or equal to n. 0! = 1 by definition.
Partial Permutation: Selecting and arranging r objects from n distinct objects where order matters.
Circular Permutation: Arranging objects in a circle where rotations may be considered identical.
- Identify the problem: Determine if order matters (permutation) or not (combination)
- Count the objects: Identify n (total objects) and r (objects to arrange)
- Check constraints: Linear, circular, or other arrangement restrictions
- Apply the formula: Use appropriate permutation formula
- Calculate: Perform factorial operations carefully
- Verify: Check if the answer is reasonable
• Full permutation: \(n! = n \times (n-1) \times (n-2) \times \ldots \times 1\)
• Partial permutation: \(P(n,r) = \frac{n!}{(n-r)!} = n \times (n-1) \times \ldots \times (n-r+1)\)
• Circular permutation: \((n-1)!\) when rotations are identical
• Factorial properties: \(n! = n \times (n-1)!\), \(0! = 1\)
Letter Permutation: When forming words from a set of letters, we consider the available unique letters and apply permutation principles.
"MATHEMATICS" has letters: M-A-T-H-E-M-A-T-I-C-S. Unique letters: M, A, T, H, E, I, C, S (8 distinct letters).
Each letter can only be used once, so we're selecting 4 letters from 8 distinct letters where order matters.
P(8,4) = 8!/(8-4)! = 8!/4! = 8×7×6×5 = 1,680 different 4-letter words.
There are 1,680 different 4-letter words that can be formed from the letters in "MATHEMATICS" using each letter only once.
• Distinct letters: Only count unique letters available
• Without replacement: Each letter used only once
• Order matters: Different arrangements of same letters form different words
Multi-stage Permutation: When a problem involves multiple stages of selection without replacement, multiply the possibilities at each stage.
4 different letters from 26: P(26,4) = 26×25×24×23 = 358,800
3 different digits from 10: P(10,3) = 10×9×8 = 720
Total passwords = 358,800 × 720 = 258,336,000
There are 258,336,000 different possible passwords.
• Multi-stage counting: Calculate each stage separately, then multiply
• Without replacement: Each character used only once in its category
• Independent stages: Letter choices don't affect digit choices
Permutation: An arrangement of objects where the order matters. Different orders represent different arrangements.
Factorial (n!): The product of all positive integers less than or equal to n. By definition, 0! = 1.
Partial Permutation: The number of ways to select and arrange r objects from n distinct objects, denoted as P(n,r) or nPr.
Linear Permutation: Arranging objects in a straight line where position matters.
Circular Permutation: Arranging objects in a circle where rotations may be considered identical.
- Problem identification: Determine if order matters (permutation) or not (combination)
- Object counting: Identify the total number of objects (n) and objects to arrange (r)
- Constraint analysis: Check for circular arrangements, repetitions, or other restrictions
- Formula selection: Choose appropriate permutation formula based on constraints
- Calculation: Perform factorial operations carefully
- Verification: Check if the answer is reasonable and meets problem requirements
• Full permutation: \(n! = n \times (n-1) \times (n-2) \times \ldots \times 1\)
• Partial permutation: \(P(n,r) = \frac{n!}{(n-r)!} = n \times (n-1) \times \ldots \times (n-r+1)\)
• Circular permutation: \((n-1)!\) when rotations are identical
• Factorial properties: \(n! = n \times (n-1)!\), \(0! = 1\), \(1! = 1\)
• Symmetry: \(P(n,n) = n!\) (arranging all objects)
• Simple: Arranging 3 books = 3! = 6 ways
• Intermediate: Selecting 2 from 5 for positions = P(5,2) = 20 ways
• Advanced: Circular arrangement of 6 people = 5! = 120 ways
• Complex: Multi-stage arrangement (letters + digits) = Product of individual stages
• "Permutation" means "position matters" - order is crucial
• Use factorials when arranging all objects in a line
• Use P(n,r) when selecting and arranging only some objects
• For circles, divide by n to account for rotational symmetry
• Factorials grow extremely fast - 10! = 3,628,800
Questions & Answers
Question: I'm confused about when to use permutations versus combinations. How do I decide which one to use?
Answer: The key difference is whether ORDER matters:
- Permutations: Order matters. Example: Arranging people in a line (person A in position 1 is different from position 2).
- Combinations: Order doesn't matter. Example: Selecting a committee (choosing A,B,C is the same as choosing C,B,A).
Ask yourself: "Does changing the order create a different outcome?" If yes, use permutations. If no, use combinations.
More examples: Seating arrangements (permutation), lottery numbers (combination), race finishes (permutation), pizza toppings (combination).
Question: Why do we use (n-1)! for circular permutations instead of n!?
Answer: In circular arrangements, rotations of the same arrangement are considered identical:
- If 4 people sit in positions A-B-C-D around a table, rotating them to B-C-D-A is the same arrangement.
- This creates redundancy that we need to eliminate.
- We fix one person's position (to eliminate rotational symmetry), then arrange the remaining (n-1) people.
Example: For 4 people ABCD around a circle, fixing A gives us 3! = 6 unique arrangements instead of 4! = 24.
Think of it as: "Once we place one reference point, we only need to arrange the rest relative to it."
Question: What's the difference between P(n,r) and n!? When do I use each?
Answer: These are related but different formulas:
- n!: Number of ways to arrange ALL n objects in a line
- P(n,r): Number of ways to select and arrange r objects from n objects
Examples:
n!: Arranging 5 books on a shelf = 5! = 120 ways
P(n,r): Selecting 3 books from 5 and arranging them = P(5,3) = 5!/(5-3)! = 60 ways
Note: P(n,n) = n! (when we arrange all objects, it's the same as a full permutation).