Restricted Arrangements
Restrictions are where CAT separates fast solvers from the rest, and two methods cover most cases. The grouping (or "string together") method handles "must be together": glue the linked items into a single block, arrange the resulting units, then arrange inside the block. For "always together", n items with a fixed pair give (n−1)! × 2!. The gap method handles "must be apart" or "no two together": first arrange the unrestricted items, then drop the restricted items into the gaps between them (including the ends). If k items must all be separated among m others, arrange the m in m! ways, creating m+1 gaps, and place the k items in those gaps in (m+1)Pk ways. A third tool is the complement: count "at least one pair together" as total minus "none together". Repetition still applies — divide by the factorials of repeated letters when the items are not all distinct.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Core counting
| Permutations (order matters) | nPr = n! / (n − r)! |
|---|---|
| Combinations (order ignored) | nCr = n! / (r!(n − r)!) |
| Arrangements with repetition | n! / (p! q! r! …) for repeated items |
| Fundamental counting principle | total = (ways for step 1) × (ways for step 2) × … |
| Symmetry of combinations | nCr = nC(n − r) |
Circular & special
| Circular arrangement (n distinct) | (n − 1)! |
|---|---|
| Necklace / garland (reflections same) | (n − 1)! / 2 |
| Sum of all combinations | nC0 + nC1 + … + nCn = 2ⁿ |
| At least one selection (from n) | 2ⁿ − 1 |
| Relation P and C | nPr = nCr × r! |