Seating Arrangement – Reasoning Ability (Jharkhand TET)
Why this topic is exam‑oriented?
In competitive exams (IIT‑JEE, JEE Mains, JEE Advanced, TET, etc.) seating‑arrangement problems test combinatorial reasoning, pattern recognition, and the ability to translate verbal constraints into mathematical expressions. Mastery of the core principles guarantees a high score on every such question.
1. Core Concepts & Notations
| Symbol | Meaning |
|---|---|
| (n) | Total number of objects (people, seats, etc.) |
| (n!) | Number of linear permutations of (n) distinct objects |
| ((n-1)!) | Number of circular permutations of (n) distinct objects (rotations considered identical) |
| ({n \choose k}) | Number of ways to choose (k) items from (n) (combinations) |
| (P(n,k)=\frac{n!}{(n-k)!}) | Number of ordered selections of (k) items from (n) (partial permutations) |
Key idea: Any seating problem can be mapped to a permutation problem, possibly with additional restrictions that require combinatorial techniques such as inclusion–exclusion, block method, or derangements.
2. Linear Arrangements
2.1 Unrestricted
- Formula: (n!)
Proof: Place first person in any of (n) seats, second in any of the remaining (n-1), etc.
2.2 With Fixed Positions
-
Example: Person (A) must sit in the 3rd seat.
- Fix (A) → (1) choice for seat 3.
- Arrange remaining (n-1) people in ( (n-1)! ) ways.
- Result: ((n-1)!)
-
General: If (k) people are fixed in specific seats → ((n-k)!)
2.3 Adjacent / Non‑Adjacent Constraints (Block Method)
-
Adjacent (together): Treat the group as a single block.
- If a block of size (m) is formed, we have (n-m+1) entities to arrange.
- Arrange block internally: (m!) ways.
- Total: ((n-m+1)! \times m!)
-
Non‑Adjacent: Use inclusion–exclusion or “gaps” method.
- Gaps method: Arrange the “other” (n-k) people first → ((n-k)!).
- These create (n-k+1) gaps (including ends).
- Choose gaps for the (k) people: ({n-k+1 \choose k}).
- Arrange the (k) people inside the chosen gaps: (k!).
- Total: ((n-k)! \times {n-k+1 \choose k} \times k!)
2.4 Derangements (No One in Original Seat)
-
Formula: ( !n = n! \sum_{i=0}^{n} \frac{(-1)^i}{i!} )
- Equivalent: ( !n = \left\lfloor \frac{n!}{e} + \frac12 \right\rfloor )
-
Use‑case: “No one sits in their own seat” (common in “musical chairs” type problems).
3. Circular Arrangements
3.1 Unrestricted
- Formula: ((n-1)!)
Reason: Fix one person to break rotational symmetry, then permute the remaining (n-1).
3.2 With Fixed Positions
- If a specific person must occupy a specific seat → treat that seat as fixed, reducing the problem to linear arrangement of the remaining (n-1) people: ((n-1)!).
3.3 Adjacent Constraints
- Block method in circular setting is similar:
- Consider the block as a single entity → we effectively have (n-m) entities to arrange around a circle → ((n-m-1)!) ways.
- Multiply by (m!) for internal arrangements.
- Caveat: If the block occupies the entire circle (i.e., (m=n)), the rotation symmetry is lost and the answer is simply ((n-1)!).
3.4 Non‑Adjacent (Opposite) Constraints
- Use diagonal or gap reasoning:
- For example, “no two boys sit together” in a circular table.
- Arrange the (B) boys first: ((B-1)!).
- Treat each boy as a gap for girls → number of ways to place (G) girls in (B) gaps without adjacency is ({B \choose G}) (if (G \le B)).
- Multiply by (G!).
- Total: ((B-1)! \times {B \choose G} \times G!)
4. Advanced Topics & Techniques
4.1 Inclusion–Exclusion (IE)
- General principle:
[ |A^c| = N - \sum |A_i| + \sum |A_i \cap A_j| - \sum |A_i \cap A_j \cap A