**CAT DILR: Grouping & Distribution – The 99%ile Study Guide**

CAT DILR: Grouping & Distribution – The 99%ile Study Guide

What This Is

Grouping & Distribution (G&D) is a high-frequency, high-scoring DILR topic where you assign distinct or identical items (people, objects, numbers) into distinct or identical groups (teams, boxes, categories) under constraints. It appears 2–3 times per CAT (often in sets of 3–4 questions) and is easier to master than LR puzzles if you follow a structured approach. A typical CAT question:

Six friends—A, B, C, D, E, F—are to be divided into two teams of three each. A and B cannot be in the same team. How many ways can this be done?

Mastering G&D gives you 3–4 guaranteed marks per set with <2 minutes per question—critical for a 99%ile DILR score.

Key Concepts & Techniques

1. Distinct vs. Identical Items/Groups
2. Distinct items/groups: Order matters (e.g., Team 1 vs. Team 2).
3. Identical items/groups: Order doesn’t matter (e.g., identical boxes).

4. When to use: Always check if items/groups are labeled (distinct) or unlabeled (identical).

5. Partitioning vs. Distribution

6. Partitioning: Dividing items into groups (order of groups doesn’t matter).
7. Distribution: Assigning items to labeled groups (order matters).

8. When to use: Use partitioning for identical groups (e.g., dividing 6 people into 2 teams of 3). Use distribution for distinct groups (e.g., assigning 6 people to 2 departments).

9. Stirling Numbers (for identical groups)

10. Formula: ( S(n,k) ) = number of ways to partition ( n ) distinct items into ( k ) identical groups.

11. When to use: When groups are identical and non-empty (e.g., dividing 5 distinct books into 3 identical boxes with no box empty).

12. Stars and Bars (for identical items)

13. Formula: ( \binom{n+k-1}{k-1} ) for distributing ( n ) identical items into ( k ) distinct groups.

14. When to use: When items are identical (e.g., distributing 10 identical chocolates to 3 children).

15. Inclusion-Exclusion Principle

16. Formula: Total ways – Forbidden ways.

17. When to use: When constraints prohibit certain groupings (e.g., A and B cannot be together).

18. Circular Permutations (for seating arrangements)

19. Formula: ( (n-1)! ) for arranging ( n ) distinct items in a circle.

20. When to use: When items are arranged in a circular group (e.g., seating 5 people around a table).

21. Derangements (for no fixed points)

22. Formula: ( !n = n! \sum_{k=0}^n \frac{(-1)^k}{k!} ).

23. When to use: When no item can be in its "original" position (e.g., no person gets their own hat).

24. Symmetry in Grouping

25. Concept: If groups are identical, swapping them doesn’t create a new case.
26. When to use: To avoid double-counting (e.g., dividing 4 people into 2 identical teams of 2: ( \frac{\binom{4}{2}}{2} = 3 ) ways).

Step-by-Step Strategy

Follow this 6-step process for every G&D question:

1. Identify the Type
2. Are items/groups distinct or identical?

3. Is it partitioning (groups unlabeled) or distribution (groups labeled)?

4. List Constraints

5. Write down all restrictions (e.g., "A and B cannot be together," "No group can be empty").

6. Choose the Right Formula

7. Use Stirling numbers for identical groups.
8. Use stars and bars for identical items.

9. Use inclusion-exclusion for constraints.

10. Calculate Total Unrestricted Ways

11. Compute the total number of ways without constraints.

12. Apply Constraints

13. Subtract forbidden cases or adjust for restrictions.

14. Adjust for Symmetry (if needed)

15. Divide by ( k! ) if groups are identical and order doesn’t matter.

Fully Worked CAT-Style Example

Question: Six distinct books are to be distributed among 3 students such that each student gets at least one book. In how many ways can this be done?

Solution (Step-by-Step):

1. Identify the Type:
2. Books: distinct (labeled).
3. Students: distinct (labeled).

4. Distribution problem (groups are labeled).

5. List Constraints:

6. Each student must get at least one book.

7. Choose the Right Formula:

8. Total ways to distribute 6 distinct books to 3 distinct students: ( 3^6 ) (each book has 3 choices).

9. Subtract cases where at least one student gets no book (inclusion-exclusion).

10. Calculate Total Unrestricted Ways:

11. Total ways = ( 3^6 = 729 ).

12. Apply Constraints:

13. Subtract cases where at least one student gets no book:

    
    
    • ( \binom{3}{1} \times 2^6 = 3 \times 64 = 192 ) (1 student gets nothing).
    • Add back cases where two students get nothing (since they were subtracted twice):
      ( \binom{3}{2} \times 1^6 = 3 \times 1 = 3 ).
    • Total valid ways = ( 729 - 192 + 3 = 540 ).

14. Adjust for Symmetry:

15. Not needed (students are distinct).

Answer: 540 ways.

Common Mistakes

1. Mistake: Treating identical groups as distinct.
2. Why it happens: Confusing "teams" (identical) with "Team 1 and Team 2" (distinct).

3. Correct approach: If groups are identical, divide by ( k! ) to avoid double-counting.

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

5. Why it happens: Forgetting to subtract cases where a group is empty.

6. Correct approach: Use inclusion-exclusion for "at least one" conditions.

7. Mistake: Using stars and bars for distinct items.

8. Why it happens: Misapplying formulas (stars and bars is for identical items).

9. Correct approach: For distinct items, use ( k^n ) or inclusion-exclusion.

10. Mistake: Overcounting in circular arrangements.

11. Why it happens: Treating rotations as distinct.

12. Correct approach: Use ( (n-1)! ) for circular permutations.

13. Mistake: Not adjusting for symmetry in identical groups.

14. Why it happens: Forgetting that swapping identical groups doesn’t create a new case.
15. Correct approach: Divide by ( k! ) for identical groups.

CAT Traps & Time Management

1. Trap: Hidden Identical Groups
2. Example: "Divide 6 people into 2 teams of 3." Teams are identical unless labeled (e.g., "Team A and Team B").

3. How to spot: Look for words like "teams" (identical) vs. "Team 1 and Team 2" (distinct).

4. Trap: "At Least One" vs. "Exactly One"

5. Example: "Each student gets at least one book" vs. "Each student gets exactly two books."

6. How to avoid: Read constraints carefully. "At least one" requires inclusion-exclusion; "exactly" may not.

7. Time Management:

8. Easy question: 1–1.5 minutes.
9. Medium question: 2 minutes.
10. Hard question: 2.5–3 minutes (skip if stuck).

Quick Practice

Question: In how many ways can 5 distinct toys be distributed among 3 identical boxes if no box is empty?

Answer: 25 ways.
Solution Path: - Use Stirling numbers of the second kind: ( S(5,3) = 25 ).

Last-Minute Cram Sheet

1. Distinct items → distinct groups: ( k^n ) (total), inclusion-exclusion for constraints.
2. Distinct items → identical groups: Stirling numbers ( S(n,k) ).
3. Identical items → distinct groups: Stars and bars ( \binom{n+k-1}{k-1} ).
4. Identical items → identical groups: Integer partitions (no formula, enumerate).
5. At least one per group: Subtract cases where a group is empty (inclusion-exclusion).
6. Circular arrangements: ( (n-1)! ).
7. Derangements: ( !n = n! \sum_{k=0}^n \frac{(-1)^k}{k!} ).
8. Symmetry adjustment: Divide by ( k! ) for identical groups.
9. Trap: "Teams" = identical; "Team 1 and Team 2" = distinct.
10. Time: 2 minutes max per question—skip if stuck.

Final Tip: Practice 10–15 G&D questions under timed conditions. Focus on identifying the type and applying the right formula—speed comes with pattern recognition.