**CAT Modern Math: Permutation & Combination – The 99%ile Playbook**

CAT Modern Math: Permutation & Combination – The 99%ile Playbook

What This Is

Permutation & Combination (P&C) is the backbone of Modern Math in CAT. It appears in 3–5 questions every year, often as standalone problems or embedded in Probability, Geometry, or Logical Reasoning questions. Mastering P&C doesn’t just fetch you 10–15 marks—it trains your brain to break complex constraints into simple cases, a skill that spills over into Data Interpretation and Logical Reasoning.

Real CAT-Style Example:
In how many ways can 5 distinct books be distributed among 3 children if each child must get at least one book? (Answer: 150—we’ll solve this step-by-step later.)

Key Concepts & Techniques

1. Fundamental Counting Principle (FCP)
2. What: If Event A can happen in m ways and Event B in n ways, then A and B together can happen in m × n ways.

3. When to use: When tasks are independent (e.g., choosing a shirt and a pant).

4. Permutation (Arrangement) vs. Combination (Selection)

5. Permutation (nPr): Order matters (e.g., arranging books on a shelf).
   Formula: nPr = n! / (n–r)!
6. Combination (nCr): Order doesn’t matter (e.g., selecting a team).
   Formula: nCr = n! / [r! × (n–r)!]

7. When to use: Ask: "Does swapping two items change the outcome?" If yes → Permutation.

8. Restriction Handling: "At Least One"

9. What: Use Total – Unwanted (e.g., total ways to distribute books – ways where at least one child gets zero).

10. When to use: Problems with minimum constraints (e.g., "each child must get at least one book").

11. Identical vs. Distinct Objects

12. Identical objects: Use stars and bars (e.g., distributing identical candies to children).
    Formula: (n + k – 1)C(k – 1), where n = objects, k = groups.
13. Distinct objects: Use permutation/combination (e.g., distributing distinct books).

14. When to use: Check if objects are labeled (distinct) or unlabeled (identical).

15. Circular Permutation

16. What: Arrangements in a circle are (n–1)!, not n! (since rotations are identical).

17. When to use: Problems involving round tables, necklaces, or circular arrangements.

18. Grouping with Identical Items

19. What: If k items are identical, divide by k! to avoid overcounting.
    Example: Arranging letters in "MISSISSIPPI" → 11! / (4! × 4! × 2!).

20. When to use: Problems with repeated elements (e.g., words, digits).

21. Derangement (No Fixed Points)

22. What: Number of ways to arrange n items so that no item is in its original position.
    Formula: !n = n! × (1 – 1/1! + 1/2! – 1/3! + ... + (–1)^n / n!)

23. When to use: Problems like "In how many ways can letters be put in envelopes so that no letter goes to the correct envelope?"

24. Inclusion-Exclusion Principle

25. What: For overlapping sets, use |A ∪ B| = |A| + |B| – |A ∩ B|.
26. When to use: Problems with multiple constraints (e.g., "at least one of X or Y must be selected").

Step-by-Step Strategy

Follow this process for EVERY P&C question:

1. Read the problem twice. Underline:
2. Are objects distinct or identical?
3. Is order important (permutation) or not (combination)?

4. Are there restrictions (e.g., "at least one," "no two adjacent")?

5. Classify the problem type.

6. Distribution? → Use stars and bars (identical) or permutation (distinct).
7. Arrangement? → Check if linear or circular.

8. Selection? → Use combination (order doesn’t matter).

9. Break into cases if needed.

10. Example: "At least one" → Total – Unwanted.

11. Example: "No two identical items together" → Gap method.

12. Apply the formula.

13. Write down the formula before plugging numbers (avoids confusion).
14. For identical objects, use stars and bars.

15. For distinct objects, use nPr or nCr.

16. Verify with a smaller example.

17. If the problem is complex, test with n=2 or n=3 to ensure the formula works.

18. Check for traps.

19. Are items identical? Did you overcount? Is order important?

Fully Worked CAT-Style Example

Problem:
In how many ways can 5 distinct books be distributed among 3 children if each child must get at least one book?

Solution (Using the Strategy):

1. Read twice:
2. Books: distinct (labeled).
3. Children: distinct (order matters).

4. Constraint: each child must get at least one book.

5. Classify:

6. Distribution of distinct objects with minimum constraints → Use Total – Unwanted.

7. Break into cases:

8. Total ways to distribute 5 distinct books to 3 children (no restrictions):
   Each book has 3 choices → 3^5 = 243.
9. Unwanted cases (where at least one child gets zero books):
   • Case 1: Exactly 1 child gets zero books.
     Choose which child gets zero: 3C1 = 3.
     Distribute books to remaining 2 children: 2^5 = 32.
     But this includes cases where both remaining children get zero (which is impossible here), so no adjustment needed.
     Total for Case 1: 3 × 32 = 96.
   • Case 2: Exactly 2 children get zero books.
     Choose which 2 children get zero: 3C2 = 3.
     All books go to the remaining child: 1^5 = 1.
     Total for Case 2: 3 × 1 = 3.
   • Total unwanted cases: 96 + 3 = 99.

10. Valid cases: Total – Unwanted = 243 – 99 = 144.
    But wait! This is incorrect because we’ve overcounted. The correct approach is to use inclusion-exclusion:

    
    
    • Total: 3^5 = 243.
    • Subtract cases where at least one child gets zero:
      3 × 2^5 = 96 (choose 1 child to exclude, distribute to 2).
    • Add back cases where two children get zero (since they were subtracted twice):
      3 × 1^5 = 3 (choose 2 children to exclude, all books to 1).
    • Valid cases: 243 – 96 + 3 = 150.

11. Apply formula:

12. Alternatively, use Stirling numbers of the second kind (advanced), but for CAT, inclusion-exclusion is safer.

13. Verify with n=2:

14. If 2 books and 2 children, each must get at least one:
    Total ways: 2^2 = 4.
    Unwanted: Both books to child 1 or both to child 2 → 2 cases.
    Valid: 4 – 2 = 2 (which is correct: AB| and |AB).

15. Final answer: 150.

Common Mistakes

1. Mistake: Confusing permutation vs. combination.
2. Why it happens: Students see "arrange" and assume permutation, but "select" and assume combination—without checking if order matters.

3. Correct approach: Always ask: "Does swapping two items change the outcome?" If yes → Permutation.

4. Mistake: Overcounting identical objects.

5. Why it happens: Treating identical items as distinct (e.g., distributing identical candies as if they’re labeled).

6. Correct approach: Use stars and bars for identical objects.

7. Mistake: Ignoring "at least one" constraints.

8. Why it happens: Solving for total ways without subtracting unwanted cases.

9. Correct approach: Use Total – Unwanted or inclusion-exclusion.

10. Mistake: Misapplying circular permutation.

11. Why it happens: Using n! instead of (n–1)!.

12. Correct approach: For circular arrangements, fix one item and arrange the rest linearly.

13. Mistake: Forgetting to divide by k! for identical items.

14. Why it happens: Arranging letters in "MISSISSIPPI" as 11! instead of 11! / (4! × 4! × 2!).
15. Correct approach: If k items are identical, divide by k!.

CAT Traps & Time Management

1. Trap: "At least one" vs. "Exactly one"
2. How to spot: "At least one" → Use Total – Unwanted.
   "Exactly one" → Use nC1 × (n–1)C(r–1).

3. Example: "At least one defective bulb" vs. "exactly one defective bulb."

4. Trap: Identical vs. Distinct Objects

5. How to spot: Words like "identical," "same," or "unlabeled" → Use stars and bars.
   Words like "distinct," "different," or "labeled" → Use permutation/combination.

6. Trap: Overcounting in Distribution Problems

7. How to spot: If distributing distinct objects to distinct groups, ensure you’re not counting the same distribution multiple times.

8. Example: Distributing 3 distinct books to 2 children → 2^3 = 8 (not 3! × 2).

9. Time Management:

10. Easy P&C questions: 1–1.5 minutes.
11. Medium P&C questions: 2–2.5 minutes.
12. Hard P&C questions (with constraints): 3 minutes max. If stuck, skip and return later.

Quick Practice

1. Question:
   In how many ways can the letters of the word "ENGINEER" be arranged so that no two E’s are adjacent?
   Answer: 1260.
   Solution Path: Total arrangements = 8! / (3! × 2!) = 3360. Subtract arrangements where E’s are adjacent (treat EE as a single entity → 7! / 2! = 2520). Valid arrangements = 3360 – 2520 = 840. Wait! This is incorrect because we have three E’s. Correct approach: Use the gap method (arrange non-E letters first, then place E’s in gaps).

2. Question:
   How many 4-digit numbers can be formed using the digits 1, 2, 3, 4, 5 without repetition such that the number is divisible by 4?
   Answer: 24.
   Solution Path: A number is divisible by 4 if its last two digits form a number divisible by 4. Possible last two digits: 12, 24, 32, 52 (from 1,2,3,4,5). For each, arrange the remaining two digits in 3P2 = 6 ways. Total = 4 × 6 = 24.

Last-Minute Cram Sheet

1. Permutation (Order matters): nPr = n! / (n–r)!
2. Combination (Order doesn’t matter): nCr = n! / [r! × (n–r)!]
3. Identical objects: Use stars and bars → (n + k – 1)C(k – 1).
4. Circular permutation: (n–1)!
5. At least one: Total – Unwanted (e.g., 3^5 – 3 × 2^5 + 3 × 1^5).
6. No two identical items adjacent: Use the gap method (arrange non-identical items first, then place identical items in gaps).
7. Derangement: !n = n! × (1 – 1/1! + 1/2! – ... + (–1)^n / n!)
8. Inclusion-Exclusion: |A ∪ B| = |A| + |B| – |A ∩ B|
9. Trap: "At least one" ≠ "exactly one."
10. Trap: Identical objects ≠ distinct objects (use stars and bars for identical).

Final Tip: P&C is about pattern recognition. The more you practice, the faster you’ll spot the right formula. Solve 50+ problems from past CAT papers to internalize these concepts. Good luck! ?