Circular Arrangements
Around a circle there is no fixed "first" seat, so a rotation of an arrangement is the same arrangement. Fixing one person to kill the rotational symmetry leaves (n−1)! ways to seat n distinct people at a round table. If the arrangement can also be flipped over and still count as the same — a necklace of beads or a garland of flowers, where clockwise and anticlockwise are indistinguishable — divide once more by 2, giving (n−1)!/2. The CAT subtlety: a round table where seats are numbered or where there is a head (a throne, a fixed gate) is NOT a free rotation, so it behaves like a row and you use n! instead. Always ask two questions: can it rotate freely (÷ by removing one factor), and can it be reflected (÷ 2)?
✅ 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! |