Maharashtra PSC – Reasoning Ability
Topic: Seating Arrangement
Focus: Master the techniques required for competitive exams (IIT‑JEE, UPSC, PSC, etc.).
Goal: Be able to solve every type of seating‑arrangement question in ≤ 12 minutes with 100 % accuracy.
1. Quick Reference – Counting Rules
| Scenario | Formula | Notes |
|---|---|---|
| Linear (fixed ends) | (n!) | All (n) people distinct, no extra constraints. |
| Linear with one fixed person | ((n-1)!) | Fix the first person, permute the rest. |
| Circular seating | ((n-1)!) | Rotations considered identical; fix one person to break symmetry. |
| Circular with one fixed seat | (n!) | One seat is marked, so we have a linear arrangement. |
| Adjacent pair as a block | ((n-1)!) | Treat the pair as a single “super‑person”. |
| Adjacent pair with internal order | (2,(n-1)!) | The pair can be swapped. |
| Separation of two persons | ((n-1)! - (n-2)!) | Total minus the cases where they are adjacent. |
| All (k) persons together | ((n-k+1)!) | Treat the block of (k) as one unit. |
| At least one pair adjacent | Inclusion‑Exclusion | Use “at least” → “total – none” or “sum of single pair cases – overlap”. |
Tip: Always start with “how many ways if nothing is constrained?” and then apply restrictions.
2. Common Types of Constraints
| Type | Typical Question | Strategy |
|---|---|---|
| Adjacency | “A must sit next to B.” | Treat A & B as a block. |
| Separation | “A and B cannot sit together.” | Count total minus adjacency cases. |
| Relative Position | “C sits to the left of D.” | Fix one person, consider positions left/right. |
| Fixed Seats | “E must occupy the 3rd seat from the left.” | Treat seat as fixed; permute the rest. |
| Alternating Gender/Type | “No two females together.” | Use gap method or inclusion‑exclusion. |
| Circular Specifics | “Seat 1 is opposite seat 5.” | In a circle, opposite means (n/2) seats apart. |
| Multiple Constraints | “A next to B, C not next to D.” | Resolve one constraint, then apply the other using case‑work. |
3. Step‑by‑Step Solving Framework
-
Read Carefully
- Identify fixed positions (e.g., “seat 2”).
- List all relative constraints.
-
Choose the Base Count
- Start with (n!) (or ((n-1)!) for circles) and adjust for fixed positions.
-
Apply Constraints One by One
- Adjacency → block method.
- Separation → total – adjacency.
- Alternation → gap method or treat as two sub‑problems.
- Fixed seats → reduce (n) accordingly.
-
Use Inclusion–Exclusion When Overlap Occurs
- When two constraints involve the same pair of people, count each separately, then subtract overlap.
-
Check for Over‑counting
- In circular arrangements, rotating the whole arrangement by any offset gives the same seating. Fix one person to avoid this.
-
Simplify
- Reduce factorials where possible: (n!/(n-k)! = n(n-1)\dots(n-k+1)).
-
Verify Edge Cases
- If (n) is small (≤ 4), enumerate manually to confirm.
4. Tricky Points & Pitfalls
| Pitfall | What to Watch For | Remedy |
|---|---|---|
| Assuming linear when circle is intended | “Seat 1 opposite seat 5” → circular. | Always ask: “Is there a concept of rotation?” |
| Treating “to the left of” as “anywhere left” | In a line, “to the left” means any seat left, not necessarily adjacent. | Count positions: if (k) seats left of a fixed point, use (\binom{n-1}{k}). |
| Ignoring that a block of people can be internally permuted | “A next to B” gives 2 internal orders. | Multiply by (2!) for each block. |
| Double‑counting when two blocks overlap | A, B, C – “A next to B” and “B next to C” → A‑B‑C block. | Recognize the combined block; treat as one unit. |
| Forgetting that "at least one pair adjacent" is NOT the same as "exactly one pair adjacent" | Inclusion–exclusion is mandatory. | Count each pair’s adjacency, subtract overlaps. |
| Misapplying gap method | Example: “No two females together” → place males first, then insert females into gaps. | Ensure there are enough gaps: if (m) males, there are (m+1) gaps. |