6.1 Fundamental Counting Principle, Permutations, and Combinations

6.1 Fundamental Counting Principle, Permutations, and Combinations

Quick Summary: On the calculator-free GMAT Quantitative Reasoning section, counting problems assess logical structure rather than brute calculation. Success depends on knowing whether order matters (permutations vs. combinations), applying the slot method with priority constraints, handling indistinguishable items via multinomial reduction, and deploying the glue and slot methods for spatial restrictions.

Combinatorics questions on the GMAT Focus Edition measure your ability to organize complex scenarios into structured, mutually exclusive cases. Because calculators are prohibited, problems are engineered to reward structural factorizations, factorial cancellations, and systematic reasoning rather than tedious arithmetic.

---

The Fundamental Counting Principle and the Slot Method

The Fundamental Counting Principle (FCP) is the foundation of all counting theory. It states that if an experiment or operation can be broken down into $k$ successive stages, where stage 1 can occur in $n_1$ ways, stage 2 in $n_2$ ways, stage 3 in $n_3$ ways, and so on, then the total number of distinct outcomes for the entire sequence is the product:

$\text{Total Outcomes} = n_1 \times n_2 \times n_3 \times \dots \times n_k$

The Slot Method Framework

When translating a word problem into FCP math, draw physical blanks (slots) for each decision to be made:

$\underline{\quad n_1 \quad} \times \underline{\quad n_2 \quad} \times \underline{\quad n_3 \quad} \times \dots \times \underline{\quad n_k \quad}$

The Priority Constraint Rule

Whenever a problem imposes restrictions on specific positions (e.g., "the first digit cannot be 0," "the code must be even," or "the vowels must occupy even positions"), you must fill the most restricted slots first. Leaving constrained positions until the end creates conflicting dependencies that ruin your calculation.

Constrained Slot Example

Problem: How many 3-digit odd positive integers can be formed from the digits ${0, 1, 2, 3, 4, 5}$ if no digit may be repeated?

1. Identify the slots: A 3-digit number has three slots: $\underline{\text{Hundreds}} \times \underline{\text{Tens}} \times \underline{\text{Units}}$.
2. Identify constraints:
   • The Hundreds slot cannot be 0 (otherwise it is a 2-digit number).
   • The Units slot must be an odd digit (${1, 3, 5}$) for the integer to be odd.
   • No digits may repeat.
3. Resolve restricted slots: Notice that 0 is restricted from the hundreds slot, but the units slot restricts odd digits. Fill the units slot first:
   • Units slot: Must be 1, 3, or 5 $\implies 3$ choices.
   • Hundreds slot: Must not be 0, and cannot be the digit chosen for the units slot. Out of the 6 original digits, 2 are eliminated $\implies 6 - 2 = 4$ choices.
   • Tens slot: Can be any of the remaining digits (including 0). Two digits have been used $\implies 6 - 2 = 4$ choices.
4. Compute product: $\underline{\quad 4 \quad} \times \underline{\quad 4 \quad} \times \underline{\quad 3 \quad} = 48$ There are 48 such integers.

---

Permutations vs. Combinations: The Fundamental Distinction

The central decision in every GMAT counting problem is whether the arrangement order creates a distinct outcome:

• Permutation: Order matters. Changing the order of the chosen elements creates a new outcome (e.g., electing a President and Vice President; forming a password; seating people in a row).
• Combination: Order does not matter. Changing the order of the chosen elements results in the identical group (e.g., selecting a committee of 3 delegates; picking 4 pizza toppings; drawing a hand of cards).

The "Swap Test"

To instantly classify an ambiguous scenario, pick two arbitrary elements in your selection and swap their positions:

• Does the swap alter the real-world outcome?
  • Yes $\implies$ Permutation (Order matters).
  • No $\implies$ Combination (Order does not matter).

---

Permutation Mechanics and Factorial Arithmetic

The factorial of a non-negative integer $n$, denoted $n!$, is the product of all positive integers less than or equal to $n$:

$n! = n \times (n - 1) \times (n - 2) \times \dots \times 2 \times 1$

By mathematical definition, $0! = 1$. On the GMAT, commit the first seven factorials to memory:

• $1! = 1$
• $2! = 2$
• $3! = 6$
• $4! = 24$
• $5! = 120$
• $6! = 720$
• $7! = 5,040$

Arranging $n$ Distinct Items into $r$ Positions

The number of ways to arrange $r$ items selected from a pool of $n$ distinct items is:

$nPr = \frac{n!}{(n - r)!} = n(n - 1)(n - 2)\dots(n - r + 1)$

If all $n$ items are being arranged ($r = n$), then $nPn = \frac{n!}{0!} = n!$.

---

Combination Mechanics and Symmetry Shortcuts

The number of ways to choose an unordered subset of $r$ items from a set of $n$ distinct items is:

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

Because order is irrelevant, we divide the permutation count $nPr$ by $r!$ to eliminate the $r!$ duplicate orderings of the same group.

The Complementary Symmetry Shortcut

Every time you choose a group of $r$ items from $n$, you simultaneously leave behind a group of $(n - r)$ items. Therefore:

$\binom{n}{r} = \binom{n}{n - r}$

Always use this symmetry to minimize manual arithmetic:

• Computing $\binom{10}{8}$ directly is tedious. Convert to $\binom{10}{2}$: $\binom{10}{8} = \binom{10}{2} = \frac{10 \times 9}{2 \times 1} = 45$
• Computing $\binom{15}{12}$: $\binom{15}{12} = \binom{15}{3} = \frac{15 \times 14 \times 13}{3 \times 2 \times 1} = 5 \times 7 \times 13 = 455$

---

Indistinguishable Items and the Anagram Formula

When arranging $n$ total items where some items are identical, the standard $n!$ formula overcounts because swapping identical items produces no observable change.

If a set of $n$ items contains $n_1$ identical items of type 1, $n_2$ identical items of type 2, ..., and $n_k$ identical items of type $k$, the number of distinct permutations is:

$\text{Distinct Permutations} = \frac{n!}{n_1! \cdot n_2! \cdot n_3! \cdots n_k!}$

Word Anagram Example

How many distinct arrangements can be formed from the letters of the word STATISTICS?

• Total letters $n = 10$.
• Letter frequencies: $\text{S} = 3$, $\text{T} = 3$, $\text{A} = 1$, $\text{I} = 2$, $\text{C} = 1$.
• Total arrangements: $\frac{10!}{3! \cdot 3! \cdot 2! \cdot 1! \cdot 1!} = \frac{3,628,800}{6 \times 6 \times 2} = \frac{3,628,800}{72} = 50,400$

Grid-Walking Path Problems

A classic GMAT question asks for the number of paths from point $(0,0)$ to point $(m, n)$ on a coordinate grid moving only Up ($U$) and Right ($R$):

• Every valid path requires exactly $m$ Right steps and $n$ Up steps, for a total of $m + n$ moves.
• This is mathematically identical to finding the distinct arrangements of a word with $m$ identical $R$'s and $n$ identical $U$'s: $\text{Total Paths} = \frac{(m + n)!}{m! \cdot n!} = \binom{m + n}{m}$

---

Circular Permutations

When $n$ distinct people or objects are seated in a straight line, there are $n!$ arrangements. However, when arranged around a circle, there are no fixed "ends." Rotating every person one seat to the right produces an identical relative seating arrangement.

Because there are $n$ equivalent rotations for every arrangement, we divide the linear total by $n$:

$\text{Circular Permutations of } n \text{ distinct items} = \frac{n!}{n} = (n - 1)!$

The "Fixed Anchor" Intuition

To derive this mentally on test day, imagine placing the first person anywhere at the circular table. Because all seats are identical until someone sits down, the first person has only 1 unique choice (they serve solely as the fixed reference anchor). Once that anchor is established, the remaining $(n - 1)$ seats become distinct relative positions (e.g., "two seats to the left of the anchor"), which can be filled in $(n - 1)!$ ways:

$1 \times (n - 1)! = (n - 1)!$

Key Exception: If positions on the circle are explicitly numbered or distinguishable (e.g., "Seat 1 is by the window"), the rotational symmetry is broken, and the formula reverts to standard linear $n!$.

---

Advanced Constrained Arrangements: Glue vs. Slot Methods

Many high-difficulty Problem Solving questions impose spatial restrictions on arrangements.

1. The "Glue" (Block) Method: Items Must Be Adjacent

When specific items must always sit or stand next to each other, treat those items as a single combined "super-item":

1. Package the group: Treat the restricted elements as 1 item.
2. Arrange external units: Count permutations of the remaining items plus the single super-item.
3. Multiply by internal arrangements: Multiply by the number of ways the elements inside the super-item can arrange among themselves.

2. The Slot Insertion Method: Items Must NOT Be Adjacent

When two or more specific items must never be placed next to each other:

1. Arrange all the unrestricted items first in a line.
2. Identify the spaces (slots) created between, before, and after the unrestricted items.
   • If there are $k$ unrestricted items, they create $k + 1$ available insertion slots.
3. Choose from these $k + 1$ slots to place the restricted items (using combinations or permutations depending on whether the restricted items are distinct).

---

Worked Problem Solving Examples

Example 1: Multi-Group Committee Selection with Minimum Constraints

Problem: A consulting firm must select a project committee of 5 analysts from a department consisting of 6 senior analysts and 5 junior analysts. If the committee must contain at least 3 senior analysts and at least 1 junior analyst, how many distinct committees can be formed?

Solution:

1. Identify the composition constraints: Total committee size is 5. Senior count must be $\ge 3$, and Junior count must be $\ge 1$.
2. Enumerate the mutually exclusive cases that satisfy both conditions:
   • Case 1: Exactly 3 senior analysts and 2 junior analysts.
   • Case 2: Exactly 4 senior analysts and 1 junior analyst. (Note: 5 senior analysts and 0 junior analysts is invalid because it violates the requirement of at least 1 junior analyst.)
3. Calculate combinations for Case 1: $\binom{6}{3} \times \binom{5}{2} = \frac{6 \times 5 \times 4}{3 \times 2 \times 1} \times \frac{5 \times 4}{2 \times 1} = 20 \times 10 = 200$
4. Calculate combinations for Case 2: $\binom{6}{4} \times \binom{5}{1} = \binom{6}{2} \times 5 = \frac{6 \times 5}{2 \times 1} \times 5 = 15 \times 5 = 75$
5. Sum the mutually exclusive cases: $\text{Total Valid Committees} = 200 + 75 = 275$

Example 2: Letter Arrangement with Separation Restrictions

Problem: In how many distinct ways can the 6 letters in the word FACTOR be arranged such that the vowels ($A$ and $O$) are never adjacent to each other?

Solution: Method: Slot Insertion

1. Separate the letters into consonants ${F, C, T, R}$ (4 letters) and vowels ${A, O}$ (2 letters).
2. Arrange the 4 unrestricted consonants first in a line: $\text{Ways to arrange consonants} = 4! = 24$
3. Visualize the insertion slots created around the 4 consonants: $\_ \; C_1 \; \_ \; C_2 \; \_ \; C_3 \; \_ \; C_4 \; \_$ Four consonants create exactly $4 + 1 = 5$ available slots.
4. To guarantee that the vowels are never adjacent, each vowel must occupy a separate slot. We must choose 2 distinct slots out of the 5 available for the 2 vowels: $\text{Ways to select and assign slots to } A \text{ and } O = 5P2 = 5 \times 4 = 20$
5. Multiply the independent stages: $\text{Total Arrangements} = 24 \times 20 = 480$ (Alternative Check via Subtraction: Total arrangements without restriction = $6! = 720$. Arrangements where vowels are adjacent (Glue Method) = $5! \times 2! = 120 \times 2 = 240$. Arrangements where vowels are separated = $720 - 240 = 480$.)

---

High-Frequency GMAT Traps

• Trap 1: The Multi-Stage Double-Counting Trap
  When a problem requires "at least 1" of a specific group, never pick 1 first and then choose the rest from the combined pool. For instance, picking 1 woman from 5 women, then picking 2 people from the remaining pool of 4 women and 6 men creates severe double counting because the same group of women is chosen in multiple different sequences. Always break into distinct, mutually exclusive cases or use the complement rule.

• Trap 2: Forgetting Internal Rearrangements in the Glue Method
  When treating a block of 3 friends as 1 unit, candidates frequently calculate $(n - 2)!$ but forget to multiply by $3! = 6$ for the internal orderings of the 3 friends within their block.

• Trap 3: Applying Circular Permutations to Linear Setups
  If a circular table has designated seat numbers, or if seating is defined relative to an external landmark (such as "facing the podium"), rotational equivalence does not exist. Use $n!$, not $(n - 1)!$.