GMAT® Permutations and Combinations: A Complete Guide

Permutations and combinations have a reputation as the most intimidating topic on the GMAT®. A lot of test takers see a question about arranging people in chairs or selecting committee members and freeze. The formulas feel unfamiliar, the counting feels endless, and the topic seems like a branch of math that has nothing to do with the rest of the test.

If that's where you are, it makes sense. Counting questions work differently from most of the math on the GMAT®. You're not solving for a variable or simplifying an expression. You're figuring out how many ways something can happen, and that requires a different kind of thinking. Most of the math on the test rewards you for being systematic and methodical, working through steps until you reach an answer. Counting questions reward you for seeing structure in a situation, and that can feel unfamiliar even if you're strong in quant overall. It takes practice to get comfortable with, and the fact that these questions show up rarely makes it harder to build that comfort through repetition.

Here's the good news: Permutations and combinations show up rarely on the GMAT® Focus Edition, usually one or two questions per test. And the ones that do appear tend to test the same handful of concepts. You don't need to know every counting formula ever written. You need to understand one core distinction, learn two methods, and develop a system for applying them.

This guide covers what counting questions look like on the GMAT® Focus Edition, the fundamental difference between permutations and combinations, the slot method, the formula approach, worked examples, common traps, and a system you can run on every counting question.

Where Counting Questions Appear on the GMAT® Focus Edition

Counting questions show up in two places on the GMAT® Focus Edition.

The Quantitative section includes permutations and combinations in Problem Solving questions. You might need to calculate the number of ways to arrange items, select groups, or assign tasks.

The Data Insights section can include counting concepts in Data Sufficiency questions. These typically ask whether you have enough information to determine a count, rather than asking you to compute one directly.

Counting questions are relatively rare. You'll usually see one or two on the entire test, and sometimes none at all. That frequency matters for how you prioritize your study time. If you're early in your prep, building a solid foundation in algebra, number properties, and word problems should move your score more than going deep on permutations and combinations. If you're cramming, you may want to skip counting and focus on higher-frequency topics.

But if you have the time and want to be ready for every question the GMAT® can throw at you, understanding the basics is worth it. Missing a question you could have answered is frustrating, and counting questions are very answerable once you have a system.

The Core Distinction: Does Order Matter?

Nearly every counting question on the GMAT® comes down to one question: does the order of selection matter?

If order matters, you're dealing with a permutation. Arranging people in a row, assigning distinct roles, etc. are all permutation situations. ABC is different from CBA because the order of the letters changes the result.

If order doesn't matter, you're dealing with a combination. Selecting a committee, choosing toppings, etc. are all combination situations. A committee of Alice, Bob, and Carol is the same committee regardless of what order you name them.

Everything else in this guide builds on that single fork in the road. When you read a counting question, your first job is to ask yourself: "Would the result change if I rearranged the items I'm counting?" If yes, it's a permutation. If no, it's a combination.

Permutations: When Order Matters

A permutation counts the number of ways to arrange items where the sequence matters. The classic example is arranging people in chairs. If you have 5 people and 5 chairs, the number of ways to seat them is:

$5 \times 4 \times 3 \times 2 \times 1 = 120$

That's because you have 5 choices for the first chair, 4 for the second, 3 for the third, and so on. Each choice reduces the pool for the next position.

This product is called a factorial, written as $n!$. So $5! = 5 \times 4 \times 3 \times 2 \times 1 = 120$.

Permutations of r items from n items

Sometimes you don't arrange all the items. You select a subset and arrange that. For example, if you have 8 runners and want to know how many ways the top 3 finishers can be arranged (gold, silver, bronze), you're picking 3 from 8 where order matters.

The formula is:

$P(n, r) = \frac{n!}{(n-r)!}$

For the medal example:

$P(8, 3) = \frac{8!}{(8-3)!} = \frac{8!}{5!} = 8 \times 7 \times 6 = 336$

Notice what happened. The $5!$ in the denominator cancels out everything from 5 down, and you're left with $8 \times 7 \times 6$. That's the slot method in formula form, which we'll cover next.

The Slot Method: The Approach We Recommend

Formulas work, but the slot method can be more intuitive and less error-prone on the GMAT®.

When order matters, draw a slot for each position you need to fill. Fill each slot with the number of choices available, multiplying as you go.

Example: How many ways can a president, vice president, and treasurer be selected from 7 candidates?

Draw 3 slots:

$\underset{7}{\_} \quad \underset{6}{\_} \quad \underset{5}{\_}$

7 choices for president, 6 remaining for VP, 5 remaining for treasurer.

$7 \times 6 \times 5 = 210$

The slot method works because it mirrors how the counting actually happens. You're not memorizing a formula. You're reasoning through the choices one slot at a time. That makes it easier to catch mistakes and adjust for restrictions (like "Alice can't be president").

Handling restrictions with the slot method

When a question adds a restriction, fill the restricted slot first.

Example: How many ways can 5 people be arranged in 5 chairs if Person A refuses to sit in the first chair?

Fill the restricted slot first. The first chair has 4 choices (everyone except Person A). The remaining 4 chairs have 4, 3, 2, and 1 choices respectively.

$\underset{4}{\_} \quad \underset{4}{\_} \quad \underset{3}{\_} \quad \underset{2}{\_} \quad \underset{1}{\_}$

$4 \times 4 \times 3 \times 2 \times 1 = 96$

Compare that to the unrestricted count of $5! = 120$. The difference is 24, which happens to be $4!$. That makes sense: you're excluding the arrangements where Person A is in the first chair, and there are $4!$ ways to arrange the remaining 4 people once A is fixed in position 1.

Combinations: When Order Doesn't Matter

A combination counts the number of ways to select items where the sequence doesn't matter. The classic example is choosing a committee. If you need a 3-person committee from 8 candidates, the order in which you pick them doesn't change who's on the committee.

The formula is:

$C(n, r) = \frac{n!}{r!(n-r)!}$

For the committee example:

$C(8, 3) = \frac{8!}{3! \times 5!} = \frac{8 \times 7 \times 6}{3 \times 2 \times 1} = 56$

Notice what the $r!$ in the denominator does. It divides out the arrangements that are just reorderings of the same group. That's the mathematical difference between permutations and combinations: combinations are permutations divided by the number of ways to rearrange each group.

The slot method for combinations

You can adapt the slot method for combinations. Fill the slots the same way you would for a permutation, then divide by the number of slots factorial to remove the reorderings.

For choosing 3 from 8:

Numerator (slots): $8 \times 7 \times 6 = 336$

Divide by $3! = 6$:

$\frac{336}{6} = 56$

Same result, but the slot method makes it clear why you're dividing. You're not following a formula blindly. You're removing the arrangements that don't count as distinct selections.

Worked Example 1: Arranging Books (Permutation)

Try this one before reading on.

The question asks for an arrangement of 4 distinct books. Order matters because each arrangement produces a different sequence on the shelf. This is a permutation.

Slot method: 4 slots, one for each position on the shelf.

$\underset{4}{\_} \quad \underset{3}{\_} \quad \underset{2}{\_} \quad \underset{1}{\_}$

$4 \times 3 \times 2 \times 1 = 24$

The answer is (D).

This is simply $4! = 24$. The slot method and the factorial formula give you the same result because you're arranging all the items.

Worked Example 2: Selecting a Team (Combination)

Try this one before reading on.

This is a combination question because the order of selection doesn't matter. A committee of Alice, Betty, and Carlos is the same committee regardless of the order you name them.

But there's a restriction: exactly 1 man and 2 women. Handle each group separately.

Choose 1 man from 5:

$C(5, 1) = \frac{5!}{1! \times 4!} = 5$

Choose 2 women from 4:

$C(4, 2) = \frac{4!}{2! \times 2!} = \frac{4 \times 3}{2 \times 1} = 6$

Multiply the results (each man can pair with each pair of women):

$5 \times 6 = 30$

The answer is (C).

The key insight: when a question involves multiple groups with restrictions, handle each group separately and multiply. The multiplication rule applies because every choice from one group can combine with every choice from the other.

Worked Example 3: Letters with Repeated Characters (Permutation with a Twist)

Try this one before reading on.

This question introduces a complication: repeated letters. BANNER has 6 letters, but N appears twice. That means some arrangements will look identical even though you swapped the two Ns, and those duplicates shouldn't be counted separately.

When items repeat, divide the total arrangement count by the factorial of the number of repetitions.

Total arrangements of 6 letters: $6! = 720$

Adjust for the repeated N (appears 2 times): divide by $2! = 2$

$\frac{720}{2} = 360$

The answer is (D).

The general principle: when arranging $n$ items where one item repeats $a$ times, another repeats $b$ times, and so on, the count is:

$\frac{n!}{a! \times b! \times \ldots}$

This is sometimes called a "permutation with repetition" or "permutation of indistinguishable items." The slot method still works for the numerator, but you need to adjust for duplicates in the denominator.

Common Traps on GMAT® Counting Questions

Trap 1: Using permutations when you need combinations

This is probably the most common mistake. The question asks for a committee, a team, or a group, and you reach for the permutation formula because it feels more natural. But if the order doesn't matter, using permutations will overcount by a factor of $r!$.

The fix: before you write anything, ask yourself: "Would swapping two of the selected items create a different result?" If no, it's a combination.

Trap 2: Forgetting about repeated items

When a question involves arranging letters or items that repeat, you need to divide by the factorial of each repetition count. If you forget this step, your answer will be too large.

The fix: after setting up the slot method or factorial, scan the items for duplicates before finalizing.

Trap 3: Double-counting with restrictions

When a question has restrictions like "at least one woman" or "no two adjacent," it's easy to count some arrangements twice if you're not careful with how you fill the slots.

The fix: the complement method often works better for "at least" questions. Instead of counting all the ways to include at least one woman, count the total and subtract the ways that include zero women (all men).

Example: A committee of 3 from 5 men and 4 women with at least 1 woman.

Total: $C(9, 3) = 84$

All men (the complement): $C(5, 3) = 10$

At least 1 woman: $84 - 10 = 74$

The complement method turns a multi-case counting problem into a single subtraction.

Trap 4: Misreading "and" vs "or"

When a question says "1 man and 2 women," you multiply the counts. When it says "all men or all women," you add them. Mixing these up is a fast way to get the wrong answer.

The fix: "and" means multiply (each choice from one group pairs with each from the other). "Or" means add (you're counting separate cases and combining the totals).

Counting on Data Sufficiency Questions

Counting concepts appear in Data Sufficiency questions too. The key difference is that you usually don't need to compute the answer. You need to determine whether you have enough information to compute it.

Common DS patterns:

Statement (1) gives you the total number of items but not how many to select. Insufficient on its own.

Statement (2) gives you the number to select but not the total pool. Insufficient on its own.

Together, you have both pieces. Sufficient.

But watch for statements that introduce restrictions without giving you enough to count around them. "The committee must include the president" reduces the pool, but you need to know how many remaining members to select.

The same "does order matter?" question applies on DS. If the statement says "a delegation of 3," that's a combination. If it says "a president, VP, and secretary," that's a permutation.

A System for Every Counting Question

When you see a counting question on the GMAT®, run this sequence:

1. Identify what you're counting. Arrangements, selections, assignments, or distributions.

2. Ask: does order matter? If the items are being arranged, ranked, or assigned to distinct roles, order matters (permutation). If they're being selected as a group, order doesn't matter (combination).

3. Check for restrictions. Are there items that can't go in certain positions? Are there minimums or maximums for a category? Fill restricted slots first.

4. Check for repeated items. If any items are identical, divide by the factorial of the repetition count.

5. Choose your method. The slot method works for most GMAT® counting questions. Use formulas if you're comfortable with them, but the slot method is usually faster and less error-prone.

6. Consider the complement. For "at least" questions, subtract the unwanted case from the total rather than counting each desired case separately.

7. Verify your answer. Does the magnitude make sense? If you're choosing 3 from 10, the answer should be in the hundreds, not the thousands. A quick sanity check can catch off-by-a-factor-of-ten errors.

FAQ

How often do permutations and combinations appear on the GMAT® Focus Edition?

Usually one or two questions per test, and sometimes none. Counting is one of the less frequent quant topics. You're more likely to see algebra, number properties, and word problems. If your study time is limited, prioritize those higher-frequency topics first.

Do I need to memorize the permutation and combination formulas?

The formulas help, but the slot method covers most GMAT® counting questions without needing to recall formula notation. If you understand the slot method and know when to divide by $r!$ for combinations, you can handle the majority of counting questions. The formulas are just the slot method written compactly, so learning both gives you flexibility.

What is the difference between a permutation and a combination?

A permutation counts arrangements where order matters. A combination counts selections where order doesn't matter. Choosing a president, VP, and treasurer from 7 people is a permutation (3 distinct roles). Choosing a 3-person committee from 7 people is a combination (the roles are identical).

When should I use the complement method?

The complement method works well for "at least" questions. Instead of counting all the ways to get at least one of something, count the total and subtract the ways that get zero of that thing. This turns a multi-case problem into a single subtraction.

How do I handle counting questions with repeated items?

When arranging items where some are identical, divide the total arrangement count by the factorial of each repetition. For example, arranging the letters in BANNER (6 letters with N repeated twice): $\frac{6!}{2!} = 360$. The division removes the duplicate arrangements created by swapping identical items.

Should I skip permutations and combinations if I'm short on time?

If you're cramming with limited time, skipping counting questions is a reasonable strategy. They appear rarely and take disproportionate time to master. Focus on algebra, word problems, and number properties instead. But if you have a full study timeline, learning the basics is worth the small investment. Missing a question you could have answered is always frustrating.

Want to learn even more?

Permutations and combinations connect to several other GMAT® quant topics. These related posts go deeper on adjacent concepts:

• GMAT® Probability: A Complete Guide
• GMAT® Number Properties: A Complete Guide
• GMAT® Data Sufficiency: How to Approach DS Questions
• GMAT® Word Problems: A Complete Guide
• How to Study for the GMAT®: A Complete Guide
• GMAT® Timing Strategy: How to Pace Each Section
• GMAT® Error Log: How to Track and Review Mistakes
• How to Break Through a GMAT® Score Plateau
• When to Let Go of a GMAT® Question
• What's on the GMAT®: The Complete Topic List

You can also listen to our podcast on Spotify, Apple Podcasts, or YouTube for more strategy episodes and worked problem walkthroughs.