2011 AMC 10A Problems/Problem 6
Problem 6
Set
has
elements, and set
has
elements. What is the smallest possible number of elements in
?
Solution 1
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
.
Solution 2
Assume WLOG that
, and
. Then, all the integers
through
would be redundant in
, so
.
~MrThinker
Solution 3 (Same Approach as Solution 1)
If
(
in this case is the superset), then
will contain 15 of the same elements in
and
because
(
in this case is the subset). Therefore our new set must contain 15 elements already variant in both
and
as well as 5 additional elements only the superset
contains, and so our answer is
.
~Pinotation
See Also
| 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 | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: Unable to save thumbnail to destination