AMC 10 · 2011 · #6

Grade 4 arithmetic
set-partitionoptimizationprinciple-of-inclusion-exclusion extremal-construction ↑ Prerequisites: set-partition
📏 Short solution 💡 1 insight
📘 View easy version →
Problem
Set A holds 20 elements and set B holds 15 elements. Arrange the two sets so their union A ∪ B is as small as it can possibly be, and report how many elements that smallest union has.

Pick an answer.

(A)
5
(B)
15
(C)
20
(D)
35
(E)
300

AMC 10 2011 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Extreme Principle

The question asks for the smallest possible union, which is a min/max question — exactly what Tool #14, the Extreme Principle, is for. Instead of trying every arrangement, jump straight to the extreme: shared elements are the only way to shrink a union, so push the overlap as large as it can go. A Venn diagram (Tool #12) makes that extreme easy to see — slide B's circle completely inside A's circle so nothing pokes out. Then only counting is left.

1STEP 1

Aim for maximum overlap

The union counts each element once, so shared elements are the only brake on the count — make the overlap as big as possible.

|A ∪ B| = |A| + |B| - |A ∩ B|, so a bigger |A ∩ B| means a smaller union.
2STEP 2

Slide B inside A

B has only 15 elements, so the overlap tops out at 15: draw B's circle wholly inside A's and B adds nothing new.

B ⊆ A → A ∩ B = B → |A ∩ B| = 15
3STEP 3

Count the union

With B tucked inside A the union is all of A, and the formula agrees: 20 + 15 - 15 = 20, choice (C).

|A ∪ B| = 20 + 15 - 15 = 20 → (C)
Answer
20
The union must be at least 20, because A's 20 elements are always inside it — that rules out (A) 5 and (B) 15 as too small. It can be at most 20 + 15 = 35 when the sets are completely separate, which is choice (D), the largest union, not the smallest. So the smallest sits at the bottom of that range, 20, and (E) 300 is far outside any possibility. Choice (C) 20 is the only value that fits.
💡Key takeaway

A union is smallest when the sets overlap the most, so the smallest possible union is just the size of the bigger set.

  • Aim for maximum overlap
  • Slide B inside A
  • Count the union