Permutations with Restrictions: Fixed Positions
What you'll learn: How to count arrangements when certain objects must occupy specific positions.
The Core Idea
When calculating permutations, we sometimes face constraints where particular objects must go in particular spots. For example, arranging 5 people in a row where one specific person must sit in the middle seat. These fixed-position restrictions change how we count valid arrangements.
The strategy is simple: handle the fixed positions first, then count arrangements for the remaining objects.
The Method
- Place the restricted objects in their required positions (there's only 1 way to do this per restriction)
- Count the remaining positions and objects
- Permute the unrestricted objects in the remaining positions using standard permutation formulas
Example
Problem: In how many ways can 5 students (Alice, Bob, Carol, Dan, Eve) stand in a line if Alice must be first and Carol must be third?
Solution:
- Fix Alice in position 1: 1 way
- Fix Carol in position 3: 1 way
- Remaining: 3 students (Bob, Dan, Eve) for 3 positions (2nd, 4th, 5th)
- These 3 can be arranged in 3! = 6 ways
Total arrangements: 1 × 1 × 6 = 6 ways
Analogy
Think of assigning dorm rooms where some students have already been guaranteed specific rooms. You handle those guaranteed assignments immediately, then figure out how to assign the remaining students to the leftover rooms.
Multiple Fixed Positions
If k objects must occupy k specific positions, place all k first (1 way total), then arrange the remaining (n - k) objects in (n - k)! ways.
Key Takeaway: When objects must occupy fixed positions, place them first (1 way each), then calculate permutations of the remaining objects in the remaining positions using (remaining objects)!.