Arrangements – Data Interpretation & Logical Reasoning
(ATMA – Program)
1. Simple Explanation
An arrangement is a way of ordering a set of objects.
- Permutation – order matters.
- Combination – order does not matter.
In many reasoning problems we must count how many different ways a group of items can be arranged, often under extra conditions (e.g., two items must stay together, certain items cannot be adjacent, etc.).
2. Key Points & Formulae
| Concept | Notation | Formula | Notes |
|---|---|---|---|
| Permutations of distinct items | (nPr) | (\displaystyle \frac{n!}{(n-r)!}) | (n) items, pick (r) in order. |
| Combinations (unordered) | (nCr) | (\displaystyle \frac{n!}{r!(n-r)!}) | Order irrelevant. |
| All items arranged | (n!) | (\displaystyle n!) | (r=n). |
| Permutations of identical items | – | (\displaystyle \frac{n!}{n_1! n_2! \dots n_k!}) | (n_i) = copies of the (i^{th}) identical item. |
| Circular arrangements | – | (\displaystyle (n-1)!) | Fix one item to break symmetry. |
| Blocks/Groups treated as single item | – | Treat the block as one “super‑item” and permute. | Multiply by internal arrangements of the block. |
| Restrictions (e.g., no two X adjacent) | – | Use Inclusion‑Exclusion or “gap” method. | Common patterns: “Place A’s first, then insert B’s into gaps.” |
Common Tricks
| Situation | How to handle |
|---|---|
| Two or more items must stay together | Treat the group as one item. If the group has (k) items, internal arrangements = (k!). |
| Two items must NOT be adjacent | Count total arrangements – arrangements where they are adjacent. |
| Circular seating | Fix one person, arrange the rest in ((n-1)!) ways. |
| Repeated letters (e.g., “BALLOON”) | Use identical‑item formula. |
| Gap method | Arrange the “fixed” items first, then fill gaps with the remaining items. |
3. Worked Example
Problem
There are 5 distinct letters: A, B, C, D, E.
How many arrangements are there if A and B must always stay together?
Step‑by‑Step Solution
-
Treat AB as a single block
- The block can be AB or BA → 2 internal arrangements.
-
Count items to arrange
- Block (AB), C, D, E → 4 “items”.
-
Permute the 4 items
[ 4! = 24 \text{ arrangements} ] -
Include internal block arrangements
[ 24 \times 2 = 48 ]
Answer: There are 48 valid arrangements.
4. Quick Revision Summary
- Permutation: (nPr = \frac{n!}{(n-r)!})
- Combination: (nCr = \frac{n!}{r!(n-r)!})
- All items: (n!)
- Identical items: (\frac{n!}{n_1!n_2!\dots})
- Circular: ((n-1)!)
- Block method: Treat group as single item, multiply by internal arrangements.
- Gap method: Place fixed items first, then insert others into gaps.
- Inclusion–Exclusion: Total – (bad arrangements).
Use these formulas and tricks to tackle any arrangement problem in ATMA’s Data Interpretation & Logical Reasoning section. Good luck!