Permutations and Combinations: Slot Discipline for GMAT Counting Problems
Counting questions collapse into slot decisions: does order matter, are repeats allowed, and which constraint should be seated first.
Why this matters
Counting problems produce more abandoned solutions than almost any other Quant topic because candidates start multiplying before deciding what a distinct outcome looks like. Two arrangements that differ only in order are different outcomes in a race podium but identical outcomes in a committee. Choosing the wrong convention does not merely slow you down; it produces a confident answer that is exactly wrong by a factorial factor.
The GMAT compounds the difficulty with constraints: two people who must sit together, letters that repeat, or a team requiring at least one specialist. Each constraint has a standard handling, and the exam rewards candidates who apply the standard calmly instead of inventing case analyses under pressure.
A working method
Begin with two questions: does order matter, and can elements repeat. Order with distinct elements means permutations or direct slot filling; order without meaning means combinations, dividing out the arrangements you never wanted. Fill restricted slots first, then let free slots take whatever remains. That single sequencing habit, constraint first, dissolves most seating and lineup puzzles.
Use standard constraint moves. Glue elements that must stay together into one block, count block arrangements, then multiply by internal arrangements of the block. Subtract from the unrestricted total when elements must stay apart. Divide by factorials of repeated letters in word arrangements. For at-least-one team requirements, count the complement, teams with none, and subtract from the total; direct case counting should be the fallback, not the reflex.
How to practice this skill
Practice with small verifiable cases. Solve a three-person, two-seat version of each problem by listing every outcome, then confirm your formula reproduces the list. This closes the gap between symbolic counting and reality, which is where most counting errors live. Only after formulas match enumerations should you scale up to exam-sized numbers.
Then build a constraint ladder: five together problems, five apart problems, five repeated-letter problems, and five at-least-one problems. Solve each with the standard move and record the move name beside the answer. Under time pressure you will not derive techniques; you will retrieve them, and retrieval requires that each move has been named and rehearsed.
A rigorous review protocol
Review by locating the first structural decision, not the final arithmetic. If you chose permutations where the outcome was unordered, the error happened in the first ten seconds, and practicing multiplication will not fix it. Write the misclassification in your log with the sentence that should have signaled the correct convention, such as the word committee implying unordered selection.
For every correct answer, ask whether you could defend the denominator choice to a skeptic. Counting is unusual in that lucky answers are common, and unexamined luck becomes a miss when the exam changes one word. A defense you can state in one sentence is the difference between a method and a coincidence.
Applying it in a timed section
In a timed section, cap counting problems at one clean plan. If cases begin multiplying beyond three, switch to the complement or eliminate answer choices by magnitude, since counting answers usually spread widely enough for estimation to remove three options. Bookmark only if a specific unfinished step remains, and never let a seating puzzle bill you four minutes.
What mastery looks like
Mastery is reached when the order question, the repeat question, and the constraint-first habit run automatically, and when small-case verification feels natural rather than remedial. Counting then becomes one of the most predictable question families on the exam, because its surface stories conceal only a handful of skeletons.