Arrangements
Subject: Data Interpretation & Logical Reasoning
Exam Focus: IIT‑JEE, BITS‑AT, NTA‑JEE, GRE, GMAT, and other competitive exams
1. Introduction
An arrangement is a way of ordering a set of objects (people, objects, letters, etc.) subject to certain constraints.
In logical reasoning, arrangements appear in:
| Context | Typical Question Type | Key Idea |
|---|---|---|
| Linear arrangements | Seating, ordering of books | Use permutations / combinations |
| Circular arrangements | Seating around a round table | Fix one position to break symmetry |
| With restrictions | “No two musicians together”, “Chef sits next to the waiter” | Inclusion–Exclusion, derangements, constructive counting |
| Partial arrangements | “Arrange 3 out of 5 people” | Partial permutations (P(n,k)) |
| Conditional arrangements | “If A sits at seat 1, how many ways can others sit?” | Fix positions, reduce problem size |
Tip: Always check if the problem is linear, circular, with/without repetition and with/without restrictions.
2. Fundamental Counting Principles
2.1. Multiplication Principle
If an activity can be performed in (n_1) ways and a second activity in (n_2) ways, the total number of ways to perform both is (n_1 \times n_2).
2.2. Permutations
A permutation is an ordered arrangement of all (n) distinct items.
[ P(n) = n! = n \times (n-1) \times \dots \times 1 ]
Derivation:
Choose the 1st position in (n) ways, 2nd in ((n-1)) ways, etc.
2.3. Partial Permutations
Arrange (k) distinct items chosen from (n):
[ P(n,k) = \frac{n!}{(n-k)!} ]
Why it works:
Choose (k) items in (\binom{n}{k}) ways and then order them in (k!) ways.
2.4. Combinations
Order irrelevant. Select (k) items from (n):
[ C(n,k) = \binom{n}{k} = \frac{n!}{k!(n-k)!} ]
3. Circular Arrangements
When objects are placed on a circle, rotating the entire arrangement produces a same arrangement.
Formula:
[ \text{Circular permutations of } n \text{ distinct objects} = (n-1)! ]
Derivation:
Fix one object as a reference (break rotational symmetry). Arrange remaining (n-1) objects in ((n-1)!) ways.
Special Cases
| Condition | Formula | Explanation |
|---|---|---|
| Arrange 3 distinct people in a circle | (2!) | ((3-1)!) |
| Arrange 4 identical chairs in a circle | (1) | All rotations identical; 1 arrangement |
| Arrange 5 people but two must be opposite each other | ((5-2)! = 6) | Fix one pair opposite, arrange rest |
4. Arrangements with Restrictions
4.1. Inclusion–Exclusion Principle
Used when constraints overlap.
General form for (m) restrictions:
[ N = N_0 - \sum N_i + \sum N_{i,j} - \dots + (-1)^m N_{1,2,\dots,m} ]
Where:
- (N_0) = total arrangements without restrictions
- (N_i) = arrangements violating restriction (i)
- (N_{i,j}) = arrangements violating both restrictions (i) and (j), etc.
Example
“Place 3 men and 3 women in a line such that no two women sit together”
- Total ways (= 6!)
- Count ways where at least one pair of women are adjacent → use inclusion–exclusion.
4.2. Derangements
A derangement is a permutation where no item appears in its original position.
Formula:
[ !n = n! \sum_{k=0}^{n} \frac{(-1)^k}{k!} ]
Derivation (Inclusion–Exclusion):
- (N_0 = n!)
- (N_i = (n-1)!) (fix item (i) in its spot)
- Continue alternating signs.
Approximation: (!n \approx \frac{n!}{e})
4.3. Adjacent / Separated Arrangements
-
Adjacent: Treat the pair as a single entity.
Example: (n) people with 2 specific people always adjacent → treat them as one block → ((n-1)!) arrangements, multiply by (2!) for internal order. -
Separated: Use the gap method.
- Arrange the “separable” group first.
- Count the “gaps” between them, including ends.
- Place the other group in gaps such that restrictions are satisfied.
5. Common Tricky Points
| Tricky Point | Why It Happens | How to Avoid |
|---|---|---|
| Circular vs. Linear | Forgetting to divide by (n) or fixing a seat | Always ask: Are rotations considered distinct? |
| Overcounting with identical objects | Counting indistinguishable items as distinct | Use multinomial coefficient: (\frac{n!}{n_1! n_2! \dots}) |
| Restrictions overlapping | Inclusion–exclusion complexity | Write all subsets explicitly; check for double counting |
| Assuming independence | Constraints may create dependencies | Verify with small examples; use casework |
| Misapplying derangements | Counting only permutations with no fixed points but other restrictions exist | Combine derangement formula with additional constraints |