Difference between revisions of "2018 AMC 12B Problems/Problem 5"
Giraffefun (talk | contribs) (→Solution 1) |
Giraffefun (talk | contribs) |
||
| Line 1: | Line 1: | ||
| + | ==Problem== | ||
| + | |||
How many subsets of <math>\{2,3,4,5,6,7,8,9\}</math> contain at least one prime number? | How many subsets of <math>\{2,3,4,5,6,7,8,9\}</math> contain at least one prime number? | ||
<math>(\text{A}) \indent 128 \qquad (\text{B}) \indent 192 \qquad (\text{C}) \indent 224 \qquad (\text{D}) \indent 240 \qquad (\text{E}) \indent 256 </math> | <math>(\text{A}) \indent 128 \qquad (\text{B}) \indent 192 \qquad (\text{C}) \indent 224 \qquad (\text{D}) \indent 240 \qquad (\text{E}) \indent 256 </math> | ||
Revision as of 15:52, 16 February 2018
Problem
How many subsets of 
contain at least one prime number?
Solution 1
Since an element of a subset is either in or out, the total number of subsets of the 8 element set is 
. However, since we are only concerned about the subsets with at least 1 prime in it, we can use complementary counting to count the subsets without a prime and subtract that from the total. Because there are 4 non-primes, there are 
subsets with at least 1 prime so the answer is 
(Giraffefun)
See Also
| 2018 AMC 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 4 |
Followed by Problem 6 |
| 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 12 Problems and Solutions | |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
