Permutation and Combination for CAT: A Shortcut Bank

Quant

A CAT quant section rarely tests permutation and combination with a textbook formula sitting in plain view. It shows up as a seating arrangement with one hidden condition, a word with repeated letters, or a distribution question phrased so oddly that half the room skips it inside the first ten seconds.

Most aspirants lose marks here not because the formulas are hard, but because they reach for the wrong one under pressure, or spend ninety seconds building a case split a named technique would have skipped entirely, costing them a question they actually knew how to solve.

Why Permutation and Combination Costs More Marks Than It Should

Modern maths sits in a strange spot on the CAT syllabus. The formulas are short enough to memorise in an afternoon, yet the questions are written to disguise which formula applies, so recognition speed matters more than formula recall, and that speed only comes from repeated exposure to disguised phrasing.

A shaky grip on it also bleeds into probability, since most CAT probability questions are counting problems wearing a fraction. Fixing permutation and combination fixes a chunk of probability for free, without a single extra hour spent on probability itself.

The counting logic underneath these three clusters also resurfaces outside modern maths itself, often in disguise. Our guide on 20 CAT quant topics you cannot skip before CAT 2026 shows where permutation and combination ranks among the chapters most worth fixing early.

• DILR sets that ask how many valid arrangements satisfy a set of clues.
• Probability questions that reduce to counting favourable outcomes over total outcomes.
• Data sufficiency questions that hinge on whether a count is unique or ambiguous.
• Word problems that quietly hide a grouping or distribution question inside a story.
• Committee or team formation questions that are combinations wearing a business scenario.
• Number forming questions that combine permutation logic with a divisibility condition.

The Modern Maths Shortcut Bank

Cluster 1: Circular and Restricted Permutations

A permutation counts arrangements, and arrangements around a circle behave differently from arrangements in a row because rotating the whole circle does not create a new arrangement, which is the one fact this entire cluster is built on.

The Circular Permutation Formula

Seat n distinct people around a round table and the count is (n minus 1) factorial, not n factorial, because fixing one person's seat removes the rotations that would otherwise be counted as different layouts. If the table has no distinguishable direction, such as a necklace that can be flipped, divide that result by 2 as well.

Permutations With Repeated Elements

Arranging the letters of a word with repeats is not n factorial either. Divide n factorial by the factorial of each letter's repeat count. The word ARRANGE has 7 letters with A repeated twice and R repeated twice, so the count is 7 factorial divided by 2 factorial times 2 factorial, which is 5040 divided by 4, giving 1260 distinct arrangements.

Handling Together and Never Together Conditions

When specific items must sit together, glue them into one block, arrange the block with the rest, then multiply by the internal arrangements of the block. When specific items must never sit together, find the total arrangements and subtract the together case, which is almost always faster than building the separate case directly.

• Circular seats, direction matters: (n minus 1) factorial.
• Circular seats, direction ignored: (n minus 1) factorial divided by 2.
• Repeated objects in a row: n factorial divided by each repeat's factorial.
• Together case: glue as one unit, then multiply by internal arrangements.

Question Type	Formula	When It Applies
Circular, all seats distinct	(n minus 1)!	Round table, fixed direction
Circular, direction ignored	(n minus 1)! divided by 2	Necklace, garland, bracelet
Repeated objects in a row	n! divided by product of each repeat!	Words with repeated letters
No two specific items together	Total minus together case	Two friends who refuse to sit adjacent

Cluster 2: Combinations With Conditions

A combination counts selections, where order does not matter, and CAT rarely asks for a plain selection. It attaches a condition, and the condition decides which shortcut applies, so reading the condition correctly matters more than knowing the base formula.

Combinations With Mandatory or Excluded Items

If a specific item must be included in every selection, choose the remaining items from what is left. Selecting 4 books from 10 where one specific book is compulsory becomes choosing 3 more from the remaining 9, which is C(9,3), not C(10,4). If that item must be excluded instead, choose all 4 from the remaining 9 books directly.

At Least and At Most Conditions

Questions asking for at least one item from a group are almost always faster solved by the complement method. Find the total ways with no restriction, subtract the ways with zero items from that group, and the remainder is your answer. Building every valid case by hand instead is the single biggest time sink in this cluster.

• Compute the total selections with no restriction applied at all.
• Compute the selections that use zero items from the restricted group.
• Subtract the second number from the first.
• Confirm the phrase says "at least," not an exact count, before applying this shortcut.

Cluster 3: Grouping, Distribution and the Gap Method

The third cluster covers two related ideas: splitting a set of distinct items into groups, and arranging items so that certain ones never end up adjacent to each other, which is where most of this cluster's marks are lost or won.

Grouping and Distribution Shortcuts

Dividing n distinct items into groups of fixed, unequal sizes uses n factorial divided by the product of each group size's factorial. If any groups share the exact same size and are themselves unlabelled, such as splitting 6 people into three unlabelled pairs, divide once more by the factorial of how many groups share that size, to remove the duplicate orderings the earlier step still counted.

The Gap Method for No Two Adjacent

Arrange one set of items first, then treat the spaces between and around them as gaps to be filled by the second set, one item per gap. Arranging n items creates n plus 1 gaps, which is exactly why this method controls adjacency without a single case split.

• Arrange the unrestricted set first and count how many items that is.
• Count the gaps created: one more than the number of items arranged.
• Choose and arrange the restricted set into those gaps, one item per gap.
• Multiply the two arrangement counts together for the final answer.

Worked Examples: Applying the Bank Under Time Pressure

A circular seating question: 6 people are seated around a round table, and two specific people must always sit together. Glue the pair into one unit, giving 5 units to seat in a circle: (5 minus 1)! equals 24. The pair can swap internally in 2 ways, so the answer is 24 times 2, which is 48.

A gap method question: 5 boys and 3 girls sit in a row so that no two girls are adjacent. Seat the 5 boys first: 5! equals 120 ways, creating 6 gaps. Choose and arrange 3 of those 6 gaps for the girls: 6 times 5 times 4 equals 120. The total is 120 times 120, which is 14400.

• Circular question: glue the pair, seat the reduced group, multiply by internal swaps.
• Gap question: seat the larger group, count the gaps, place the smaller group into them.
• Both questions collapse to two short steps once the cluster is recognised correctly.

Common Mistakes That Cost Marks in Permutation and Combination

Working through CAT previous year permutation and combination questions exposes these traps in their original, awkward phrasing, not a cleaned up textbook version. See the three CAT quant shortcuts that cost the most marks to check whether these same slips show up in your own attempts. If modern maths is quietly costing you marks elsewhere too, get your CAT preparation strategy reviewed.

Build a Modern Maths Practice Routine That Sticks

The three clusters only pay off once recognising them becomes automatic, and that only happens through repetition against fresh questions, not by rereading the same solved example twice until it feels familiar.

Drill each cluster separately for a week before mixing them: circular and restricted permutations first, combinations with conditions next, grouping and the gap method last. Mixing all three too early is what makes recognition feel slow in a live section.

• Days one and two: circular permutations and repeated element counting only.
• Days three and four: combinations with mandatory, excluded, and at least conditions.
• Days five and six: grouping, distribution, and gap method questions.
• Day seven: a mixed set pulling randomly from all three clusters.

A generic study plan treats modern maths like every other chapter and moves on regardless of whether it stuck. Get a study plan that tracks which cluster is actually weak and adjusts your next practice block accordingly, instead of assuming a single pass through the topic was enough.