Set has 20 elements, and set has 15 elements. What is the smallest possible number of elements in , the union of and ?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
The union is smallest when the smaller set sits entirely inside the larger one, so it cannot have fewer than 20 elements and 20 is attainable.
Solution
The union contains all of , so it has at least elements.
Exactly is achievable: let consist of of the elements of . Then , which has elements.
The answer is .
Why this works
By inclusion-exclusion, , and the overlap is at most (a set cannot share more elements than it has). The union is minimized when the overlap is maximized, i.e. when . Minimum and maximum questions about unions come down to the two extreme configurations: nested sets and disjoint sets.
The trap
Subtracting to get 20 - 15 = 5, or treating the sets as disjoint and answering 35 (the maximum, not the minimum).
Common mistakes
- Subtracting to get 20 - 15 = 5, or treating the sets as disjoint and answering 35 (the maximum, not the minimum).
- Confusing the union with the intersection and answering .
Techniques
Consider the largest/smallest element or boundary case