Difference between revisions of "2011 AMC 10A Problems/Problem 6"
(→Solution) |
|||
Line 6: | Line 6: | ||
== Solution == | == 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>. | + | <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 14:02, 14 February 2011
Problem 6
Set has elements, and set has elements. What is the smallest possible number of elements in ?
Solution
will be smallest if is completely contained in , in which case all the elements in would be counted for in . So the total would be the number of elements in , which is .