2011 AMC 10A Problems/Problem 6

Problem 6

Set $A$ has $20$ elements, and set $B$ has $15$ elements. What is the smallest possible number of elements in $A \cup B$ ?

$\textbf{(A)}5 \qquad\textbf{(B)}\ 15 \qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 35\qquad\textbf{(E)}\ 300$

Solution 1

$A \cup B$ will be smallest if $B$ is completely contained in $A$ , in which case all the elements in $B$ would be counted for in $A$ . So the total would be the number of elements in $A$ , which is $\boxed{20 \ \mathbf{(C)}}$ .

Solution 2

Assume WLOG that $A={1, 2, 3, 4, \cdots , 20}$ , and $B={6, 7, 8, 9, 10, \cdots , 20}$ . Then, all the integers $6$ through $20$ would be redundant in $A \cup B$ , so $A \cup B = 1, 2, 3, 4, \cdots, 20 \implies \boxed{\textbf{(C) }20}$ .

~MrThinker

2011 AMC 10A (Problems • Answer Key • Resources)
Preceded by Problem 5	Followed by Problem 7
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.

Page

Toolbox

Search

2011 AMC 10A Problems/Problem 6

Contents

Problem 6

Solution 1

Solution 2

See Also