2011 AMC 10A Problems/Problem 6
Revision as of 14:02, 14 February 2011 by Flyingpenguin (talk | contribs)
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 .