Introduction
Many permutation problems include extra rules - people who must sit together, items that can’t be adjacent, fixed positions, or alternating patterns. These conditional permutations require breaking the problem into clear cases and applying basic permutation rules within each case.
This pattern is important because real exam questions often add restrictions to make counting non-trivial; learning systematic case-work and reductions prevents mistakes.
Pattern: Conditional Permutations (With/Without Restrictions)
Pattern
Key idea: convert the restriction into an equivalent counting step (treat a block as one item, subtract forbidden arrangements from total, fix positions, or use multiplication of independent choices).
Common approaches:
- Together: Treat the required-together items as a single block, count internal arrangements, then multiply by arrangements of the block with others.
- Not together: Count total arrangements and subtract arrangements where the items are together (Total - Together).
- Fixed positions: Place constrained items first (anchor), then permute remaining slots.
- Alternating arrangement: Place one type (e.g., women) in chosen slots, then permute the other type into remaining slots.
Step-by-Step Example
Question
Five people A, B, C, D, E sit in a row. How many arrangements are possible if A and B must sit together?
Solution
-
Step 1: Understand the restriction.
A and B must be adjacent → treat AB as a single block (call it X). Now count arrangements of X, C, D, E. -
Step 2: Arrange the blocks.
Number of ways to arrange X, C, D, E = 4! = 24. -
Step 3: Count internal arrangements of the block.
Inside block X, A and B can be ordered as AB or BA → 2! = 2. -
Step 4: Multiply independent counts.
Total arrangements = arrangements of blocks × internal arrangements = 4! × 2 = 24 × 2 = 48. -
Final Answer:
48 valid arrangements where A and B sit together. -
Quick Check:
If A and B were free → 5! = 120. Together-case should be smaller: 48 < 120 ✅
Quick Variations
1. “Never together”: Total - Together. Example: total 5! = 120; together = 48 → never together = 72.
2. Three together: Treat three as a single block; multiply by internal 3! arrangements.
3. Fixed seats: If a person must sit in a particular seat, fix them first and permute remaining (n - 1)! ways.
4. Alternate men & women: Place the smaller group first into alternate slots, then permute the other group into remaining slots. Example: for 3 men and 3 women around a table (or row), count placements accordingly.
Trick to Always Use
- Step 1 → Translate the restriction into an operation: block, exclusion, fixed slot, or alternating slots.
- Step 2 → Count arrangements of the transformed problem (use factorials or permutations).
- Step 3 → Multiply by internal arrangements (order inside blocks) and by choices for which positions the block/people occupy.
- Step 4 → Quick sanity check: result ≤ total unconstrained arrangements (n!).
Summary
Summary
Conditional permutations reduce to simpler counting after one of these transforms:
- Together: Treat grouped items as a block → arrange blocks × internal permutations.
- Not together: Use Total - Together.
- Fixed positions: Place constrained items first, then permute remaining.
- Alternating: Place one group into chosen slots, then arrange the other group into remaining slots.
Always show the small case-work explicitly and perform a quick check against the unconstrained total.
