Difference between revisions of "2010 AIME II Problems/Problem 8"
m (→Solution 2) |
(→Solution) |
||
(2 intermediate revisions by 2 users not shown) | |||
Line 19: | Line 19: | ||
So the answer is <math>\left(\sum_{n=1}^{11} \dbinom{10}{n-1}\right) - \dbinom{10}{5}=2^{10}-252= \boxed{772}</math>. | So the answer is <math>\left(\sum_{n=1}^{11} \dbinom{10}{n-1}\right) - \dbinom{10}{5}=2^{10}-252= \boxed{772}</math>. | ||
+ | |||
+ | Note: We have <math>\dbinom{10}{n-1}</math> ways of picking the numbers to be in <math>A</math> because there are <math>n</math> numbers in <math>A</math> and since <math>12-n</math> is already a term in the set we simply have to choose another <math>n-1</math> numbers from the <math>10</math> numbers that are available. | ||
== Solution 2== | == Solution 2== | ||
Regardless of the size <math>n</math> of <math>A</math> (ignoring the case when <math>n = 6</math>), <math>n</math> must not be in <math>A</math> and <math>12 - n</math> must be in <math>A</math>. | Regardless of the size <math>n</math> of <math>A</math> (ignoring the case when <math>n = 6</math>), <math>n</math> must not be in <math>A</math> and <math>12 - n</math> must be in <math>A</math>. | ||
− | There are <math>10</math> remaining elements | + | There are <math>10</math> remaining elements whose placements have yet to be determined. Note that the actual value of <math>n</math> does not matter; there is always <math>1</math> necessary element, <math>1</math> forbidden element, and <math>10</math> other elements that need to be distributed. There are <math>2</math> places to put each of these elements, for <math>2^{10}</math> possibilities. |
− | However, | + | However, there is the edge case of <math>n = 6; 6</math> is forced not the be in either set, so we must subtract the <math>\dbinom{10}{5}</math> cases where <math>A</math> and <math>B</math> have size <math>6</math>. |
Thus, our answer is <math>2^{10} - \dbinom{10}{5} = 1024 - 252 = \boxed{772}</math> | Thus, our answer is <math>2^{10} - \dbinom{10}{5} = 1024 - 252 = \boxed{772}</math> |
Latest revision as of 08:36, 6 September 2021
Contents
Problem
Let be the number of ordered pairs of nonempty sets and that have the following properties:
- ,
- ,
- The number of elements of is not an element of ,
- The number of elements of is not an element of .
Find .
Solution
Let us partition the set into numbers in and numbers in ,
Since must be in and must be in (, we cannot partition into two sets of 6 because needs to end up somewhere, or either).
We have ways of picking the numbers to be in .
So the answer is .
Note: We have ways of picking the numbers to be in because there are numbers in and since is already a term in the set we simply have to choose another numbers from the numbers that are available.
Solution 2
Regardless of the size of (ignoring the case when ), must not be in and must be in .
There are remaining elements whose placements have yet to be determined. Note that the actual value of does not matter; there is always necessary element, forbidden element, and other elements that need to be distributed. There are places to put each of these elements, for possibilities.
However, there is the edge case of is forced not the be in either set, so we must subtract the cases where and have size .
Thus, our answer is
See also
2010 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
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.