Difference between revisions of "2017 AIME II Problems/Problem 1"
(→See Also) |
|||
Line 6: | Line 6: | ||
=See Also= | =See Also= | ||
− | {{AIME box|year=2017|n=I|num= | + | {{AIME box|year=2017|n=I|num-b=0|num-a=2}} |
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 11:47, 23 March 2017
Find the number of subsets of that are subsets of neither nor .
The number of subsets of a set with elements is . The total number of subsets of is equal to . The number of sets that are subsets of at least one of or can be found using complimentary counting. There are subsets of and subsets of . It is easy to make the mistake of assuming there are sets that are subsets of at least one of or , but the subsets of are overcounted. There are sets that are subsets of at least one of or , so there are subsets of that are subsets of neither nor . .
See Also
2017 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 0 |
Followed by Problem 2 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.