Seating Arrangement – Study Notes (Uttarakhand TET / Competitive Exams)
Why this topic?
Seating‑arrangement problems test a candidate’s ability to:
- Visualise permutations under constraints.
- Apply combinatorial formulas correctly.
- Deduce relationships between people and seats.
- Spot subtle “trick” conditions (symmetry, adjacency, circularity).
Below is a rigorous, exam‑oriented guide that covers the common patterns, derivations, key formulas, and pitfalls, along with a hard‑practice question.
1. Basic Terminology & Notation
| Term | Meaning | Symbol |
|---|---|---|
| Linear arrangement | People sit in a straight row (no wrap‑around). | n! ways for n distinct persons |
| Circular arrangement | People sit around a round table (rotation considered the same). | (n‑1)! ways |
| Adjacency constraint | Two persons must sit next to each other. | Treat as a single “super‑person” |
| Relative position | Statements like “A sits somewhere to the left of B” or “C is exactly 2 seats right of D.” | Use indices or “distance” |
| Derangement | No person sits in the original seat. | !n = n! \sum_{k=0}^{n} (-1)^k / k! |
| Block/Group | A set of people must stay together, but internal order may vary. | k! · (n-k+1)! for a block of size k |
2. Core Formulas & Derivations
2.1 Linear Arrangements
Total permutations for n distinct persons:
[ P_{\text{linear}} = n! ]
Derivation: Each seat can be filled by any of the remaining unseated persons.
( n ) choices for seat 1, ( n-1 ) for seat 2, …, ( 1 ) for seat n → product ( n! ).
2.2 Circular Arrangements
Total permutations for n distinct persons:
[ P_{\text{circular}} = (n-1)! ]
Why? Fix one person at any seat (to break rotational symmetry).
The remaining n‑1 persons can be permuted arbitrarily: (n-1)!.
2.3 Adjacency Constraints
Suppose persons A and B must sit together.
- Treat
A-Bas a single “super‑person.” - Number of entities to arrange = (n-1) (since 2 persons collapsed).
- Internal order of
AandBcan be swapped:2!.
[ P_{\text{adjacent}} = 2! \times (n-1)! ]
If the pair must occupy a specific pair of adjacent seats (e.g., seats 3 & 4 in a linear row), fix the pair and then arrange the rest:
[ P_{\text{fixed pair}} = 2! \times (n-2)! ]
2.4 “Left of / Right of” Constraints
Constraint: A sits somewhere to the left of B (in a linear row).
- Exactly half of all permutations satisfy “A left of B.”
- So
[ P_{A \text{ left of } B} = \frac{n!}{2} ]
Proof: For any permutation, swapping A and B yields another permutation where the relative order flips. Pairs are bijective → half the permutations.
2.5 “Exactly k seats apart”
Let A and B be exactly (k) seats apart in a linear arrangement.
Number of ways:
- Choose position of A: any of (n-k) seats (because B must be at position (i+k) or (i-k)).
- Choose orientation: 2 (A left of B or B left of A).
- Arrange remaining (n-2) persons: ((n-2)!).
[ P_{\text{exactly }k\text{ apart}} = 2 (n-k) (n-2)! ]
2.6 Derangements (No One in Original Seat)
The number of derangements of n items (no fixed points):
[ !n = n! \left( 1 - \frac{1}{1!} + \frac{1}{2!} - \frac{1}{3!} + \cdots + \frac{(-1)^n}{n!} \right) ]
Recursive form:
!n = (n-1)(!(n-1)+!(n-2)) with !1 = 0, !2 = 1.
2.7 Blocks of Size > 2
For a block of k persons that must stay together (internal order allowed):
- Treat block as one entity →
n-k+1entities to arrange. - Internal permutations:
k!.
[ P_{\text{block}} = k! \times (n-k+1)! ]