750-Level Thinking (Target: 30–45 seconds): This is a set-counting/inclusion-exclusion problem. The key is to stop thinking about people and start thinking about committee seats.
---
Step 1: Total committee memberships. Each committee has 40 members, so the total number of committee seats occupied is 40 + 40 + 40 = 120. However, the company has only 110 employees.
---
Core Insight (the 750-level trigger): Every employee who belongs to exactly one committee contributes 1 seat. Every employee who belongs to multiple committees contributes extra seats. Therefore, the excess seats are 120 − 110 = 10. This is the entire problem.
---
Let x2 be the number of people in exactly 2 committees and x3 be the number of people in exactly 3 committees. Then X = x2 + x3, since X represents the number of employees who belong to more than one committee. A person in 2 committees creates 1 extra seat, while a person in 3 committees creates 2 extra seats. Therefore, x2 + 2x3 = 10. This equation captures the whole problem.---
Least possible X: We want as few people as possible creating those 10 extra memberships, so we maximize the number of triple-members. Since each triple-member contributes 2 extra seats, we can have x3 = 5 and x2 = 0, giving X = 5. This is feasible because 5 people belonging to all three committees contribute 15 memberships in total, leaving each committee needing 35 additional unique members. Adding 35 unique members to each committee gives 35 + 35 + 35 + 5 = 110 employees. Therefore, Xmin = 5.
---
Greatest possible X: We now want as many people as possible creating those 10 extra seats, so nobody should belong to all three committees. Instead, every overlapping employee should belong to exactly two committees. Thus, x2 = 10 and x3 = 0, giving X = 10. This is feasible because the 10 double-members create exactly 10 extra memberships, and the remaining 100 employees each belong to exactly one committee. Total memberships are therefore 100(1) + 10(2) = 120, which satisfies the requirement. Hence, Xmax = 10.
---
Answer: Least value = 5, Greatest value = 10.
---
750-Scorer Under-1-Minute Thought Process: Total seats = 120. Employees = 110. Therefore, there are exactly 10 extra memberships. A double-member contributes +1 extra, while a triple-member contributes +2 extras. To minimize X, maximize triple-members: 10 ÷ 2 = 5. To maximize X, make everyone a double-member: 10 ÷ 1 = 10. Therefore, the answer is (5, 10). A strong test-taker should finish this in about 20–30 seconds.
---
Pattern Recognition Code (Memorize): Whenever you see fixed group sizes, a total number of people, and the possibility of multiple memberships, immediately compute: Extra memberships = Total seats − People. Then ask: how many extra seats does each overlapping person contribute? For minimum overlap, maximize the contribution per person (triples, quadruples, etc.). For maximum overlap, minimize the contribution per person (doubles, pairs, etc.). This is one of the fastest and most powerful counting shortcuts on difficult set-counting problems.
---
Similar 750-Level Drills:
Drill 1: Three clubs have 50 members each. There are 140 students, and every student belongs to at least one club. Find the minimum and maximum number belonging to multiple clubs. (Answer: 5 and 10.)
Drill 2: Four committees have 30 members each. There are 100 employees, and everyone belongs to at least one committee. What is the minimum number belonging to multiple committees? Think: total seats = 120, extras = 20, and one person can contribute at most 3 extras. Final Answer: (Min, Max) = (7, 20).
---
GMAT Takeaway: The elite pattern is Seats − People = Overlap Units. Once you know the number of overlap units, the extrema become simple: maximize the number of extra seats contributed per person to minimize the number of overlapping people, and minimize the number of extra seats contributed per person to maximize the number of overlapping people. This converts what looks like a messy Venn-diagram problem into a 20-second arithmetic problem.