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 always contains all 20 elements of A. It has exactly 20 when every element of B is already in A.
Solution
The union is everything that is in , in , or in both. We want it as small as possible, so we want and to share as much as they can.
- It can't be smaller than 20. The union contains every element of , and has elements. So the union has at least .
- 20 can happen. Make every element of also an element of . For example, let be the numbers to and be the numbers to . Then the union is just to , which has elements.
The smallest possible union has elements.
The answer is .
Why this works
The number of elements in the union is minus the number of elements the two sets share (otherwise the shared ones are counted twice). The two sets can share at most elements, since only has . Sharing all gives the smallest union, . Sharing none gives the largest, . Questions about the smallest or largest union usually come down to these two extreme pictures: one set inside the other, or no overlap at all.
The trap
Subtracting to get 20 − 15 = 5, or adding to get 35. Adding gives the largest possible union, not the smallest.
Concise 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 .
Review in the AoPS books
- Intermediate Counting & Probability, Chapter 2: Sets and Logic (§2.2, §2.3)
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic (§1.3)
- Prealgebra, Chapter 7: Ratios, Conversions, and Rates (§7.4)
- Intermediate Counting & Probability, Chapter 3: A Piece of PIE (§3.2, §3.3)
Techniques
Consider the largest/smallest element or boundary case