Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2011 AMC 10A Problems/Problem 6"

(Created page with '==Problem 6== Set <math>A</math> has <math>20</math> elements, and set <math>B</math> has <math>15</math> elements. What is the smallest possible number of elements in <math>A \…')
 
Line 3: Line 3:
  
 
<math> \textbf{(A)}5 \qquad\textbf{(B)}\ 15 \qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 35\qquad\textbf{(E)}\ 300 </math>
 
<math> \textbf{(A)}5 \qquad\textbf{(B)}\ 15 \qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 35\qquad\textbf{(E)}\ 300 </math>
 +
 +
== Solution ==
 +
 +
<math>A \cup B</math> will be smallest if <math>B</math> is completely contained in <math>A</math>, in which case all the elements in <math>B</math> would be counted for in <math>A</math>. So the total would be the number of elements in <math>A</math>, which is <math>\boxed{20 \mathbf{(C)}}</math>.

Revision as of 15:02, 14 February 2011

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

$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)}}$.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2011_AMC_10A_Problems/Problem_6&oldid=36950"