How to Solve Permutations on the GRE/GMAT: The Complete Actionable Guide

How to Solve Permutations on the GRE/GMAT: The Complete Actionable Guide

(1,200+ words, every line optimized for timed exam execution)

? Introduction

"Permutations appear 4-6 times on the GRE and 3-5 times on the GMAT—master them, and you’ll gain 20+ points by avoiding the single most common trap: confusing order matters vs. order doesn’t matter. Let’s break it down."

? WHAT THIS QUESTION TYPE IS ACTUALLY TESTING

The GRE/GMAT isn’t testing your ability to memorize formulas. It’s testing: 1. Order awareness – Can you instantly recognize whether the problem cares about sequence (permutations) or just grouping (combinations)? 2. Constraint parsing – Can you extract and apply restrictions (e.g., "A must sit next to B," "no two identical items adjacent") without overcomplicating? 3. Efficiency under pressure – Can you solve in ≤2 minutes without resorting to brute-force listing?

? ANATOMY OF THE QUESTION

Structure Breakdown

Representative Example

"In how many ways can 6 distinct books be arranged on a shelf if 2 specific books must always be next to each other?" - Stem: 6 distinct books, shelf arrangement. - Condition: 2 books must be adjacent. - Answer Choices: (A) 120 (B) 240 (C) 360 (D) 720 (E) 1440

⚡ THE DECISION FRAMEWORK (Step-by-Step)

Run this process for every permutation question. No exceptions.

1. Step 1: Order Check
2. Ask: "Does swapping two items create a new, valid arrangement?"
   • Yes → Permutation (order matters).
   • No → Combination (order doesn’t matter). Stop here if combination.

3. Example: Arranging books on a shelf → order matters (permutation).

4. Step 2: Total Slots vs. Items

5. Count:
   • n = total items to arrange.
   • k = slots available (if not all items are used).
6. Example: 6 books, all on shelf → n = 6, k = 6 (use n!).

7. Example: 6 books, 3 slots → n = 6, k = 3 (use P(6,3) = 6! / (6-3)!).

8. Step 3: Apply Constraints

9. Adjacency: Treat the constrained items as a single "block."
   • Example: 2 books must be adjacent → treat as 1 block → now 5 "items" (block + 4 books).
   • Multiply by 2! (ways to arrange the 2 books within the block).
10. Non-adjacency: Use the "gap method" (see Example 3).

11. Identical items: Divide by factorial of identical items (e.g., 3 identical books → divide by 3!).

12. Step 4: Calculate

13. Use the formula:
    • All items used: n!
    • Subset of items: P(n,k) = n! / (n-k)!
    • With identical items: n! / (repeats)!

14. Example: 6 books, 2 adjacent → (5! × 2!) = 120 × 2 = 240.

15. Step 5: Match to Answer Choices

16. Eliminate options that:
    • Ignore constraints (e.g., 6! = 720 for the adjacency example).
    • Misapply identical items (e.g., 6! / 2! when no identical items exist).

? WORKED EXAMPLES

Example 1: Straightforward (No Constraints)

"How many ways can 4 distinct paintings be arranged in a row?" 1. Order Check: Swapping paintings changes the arrangement → permutation. 2. Slots vs. Items: 4 paintings, 4 slots → n = 4, k = 4. 3. Constraints: None → use 4!. 4. Calculate: 4! = 24. 5. Answer: (A) 24.

Example 2: Common Trap (Adjacency Constraint)

"How many ways can 5 people sit in a row if Alice and Bob must sit next to each other?" 1. Order Check: Order matters → permutation. 2. Slots vs. Items: 5 people, 5 slots → n = 5, k = 5. 3. Constraints: Alice and Bob must be adjacent → treat as 1 block.
- Now 4 "items" (block + 3 people).
- Block can be arranged in 2! ways (Alice-Bob or Bob-Alice). 4. Calculate: 4! × 2! = 24 × 2 = 48. 5. Answer: (C) 48.
- Trap: Option (A) 120 = 5! (ignores constraint).
- Trap: Option (B) 24 = 4! (ignores block arrangement).

Example 3: Hard Variant (Non-Adjacency + Identical Items)

"How many ways can 3 identical red books and 2 identical blue books be arranged on a shelf if no two blue books are adjacent?" 1. Order Check: Order matters → permutation. 2. Slots vs. Items: 5 books total (3 red, 2 blue). 3. Constraints:
- Identical items → divide by repeats (3! for red, 2! for blue).
- No two blue books adjacent → use gap method:
- Arrange the 3 red books first: _ R _ R _ R _ (4 gaps).
- Place the 2 blue books in the gaps: C(4,2) = 6 ways. 4. Calculate:
- Total arrangements without adjacency: C(4,2) = 6.
- Adjust for identical items: 6 / (3! × 2!) = 6 / 12 = 0.5 → Wait, this is wrong!
- Correction: The gap method already accounts for identical items. The correct calculation is:
- Step 1: Arrange 3 red books → 1 way (identical).
- Step 2: Choose 2 gaps out of 4 for blue books → C(4,2) = 6.
- Total: 6. 5. Answer: (B) 6.
- Trap: Option (A) 10 = C(5,2) (ignores adjacency).
- Trap: Option (E) 60 = 5! / (3! × 2!) (ignores adjacency).

❌ WRONG ANSWER PATTERNS

⚠️ Common Mistakes

⏱️ TIME STRATEGY

• Target time: 1.5–2 minutes per question.
• When to skip: If you’re stuck after Step 3 (applying constraints), flag and return.
• Minimum work:
• Identify order matters vs. doesn’t matter (10 seconds).
• Apply constraints (30 seconds).
• Calculate and match to answer choices (30 seconds).

? BACKSOLVING AND SHORTCUTS

1. Plug in small numbers:
2. For "6 books, 2 adjacent," test with 3 books (A, B, C) where A and B must be adjacent.
3. Total arrangements: (AB)C, C(AB), (BA)C, C(BA) → 4 ways.

4. Formula: 2! × 2! = 4 → confirms 4! × 2! = 24 × 2 = 48 for 6 books.

5. Eliminate impossible answers:

6. If the question involves identical items, the answer must be ≤ n!.

7. If constraints reduce possibilities, the answer must be < n!.

8. Gap method shortcut:

9. For "no two X adjacent," arrange the non-X items first, then place X in the gaps.
10. Example: 4 red, 3 blue books, no two blue adjacent → arrange 4 red (5 gaps), choose 3 gaps → C(5,3).

? 1-Minute Recap

"Here’s the 30-second version for test day: 1. Order check: Does swapping items create a new arrangement? If yes, permutation. 2. Slots vs. items: Are you using all items? If yes, n!. If no, P(n,k). 3. Constraints:
- Adjacent? Treat as a block, multiply by internal arrangements.
- Non-adjacent? Use the gap method.
- Identical items? Divide by factorial of repeats. 4. Calculate and match: Eliminate answers that ignore constraints or misapply formulas. That’s it. No overthinking, no brute force. Next question."

? KEY TAKEAWAYS FOR TEST DAY

1. Permutation = order matters. If the problem involves arranging, seating, or ranking, it’s likely a permutation.
2. Constraints are king. Always apply them before calculating.
3. Formulas are tools, not crutches. Understand why n! or P(n,k) works—don’t just memorize.
4. Eliminate first. Wrong answers are designed to catch common mistakes. Cross them out aggressively.
5. Time is limited. If you’re stuck, flag and move on. Permutations are worth the same as any other question.

Now go practice—timed, with the framework. Every second counts.