Difference between revisions of "2021 AIME II Problems/Problem 6"
(→See also) |
(→Solution 2) |
||
Line 8: | Line 8: | ||
==Solution 2== | ==Solution 2== | ||
+ | |||
+ | We denote <math>\Omega = \left\{ 1 , 2 , 3 , 4 , 5 \right\}</math>. | ||
+ | We denote <math>X = A \intersect B</math>, <math>Y = A \backslash \left( A \intersect B \right)</math>, <math>Z = B \backslash \left( A \intersect B \right)</math>, <math>W = \Omega \backslash \left( A \union B \right)</math>. | ||
+ | |||
+ | Therefore, <math>X \cup Y \cup Z \cup W = \Omega</math> and the intersection of any two out of sets <math>X</math>, <math>Y</math>, <math>Z</math>, <math>W</math> is an empty set. | ||
+ | Therefore, <math>\left( X , Y , Z , W \right)</math> is a partition of <math>\Omega</math>. | ||
+ | |||
+ | Following from our definition of <math>X</math>, <math>Y</math>, <math>Z</math>, we have <math>A \cup B = X \cup Y \cup Z</math>. | ||
+ | |||
+ | Therefore, the equation | ||
+ | |||
+ | <cmath> | ||
+ | |A| \cdot |B| = |A \cap B| \cdot |A \cup B| | ||
+ | </cmath> | ||
+ | |||
+ | can be equivalently written as | ||
+ | |||
+ | <cmath> | ||
+ | \left( | X | + | Y | \right) \left( | X | + | Z | \right) | ||
+ | = | X | \left( | X | + | Y | + | Z | \right) . | ||
+ | </cmath> | ||
+ | |||
+ | This equality can be simplified as | ||
+ | |||
+ | <cmath> | ||
+ | | Y | \cdot | Z | = 0 . | ||
+ | </cmath> | ||
~ Steven Chen (www.professorchenedu.com) | ~ Steven Chen (www.professorchenedu.com) |
Revision as of 20:19, 22 March 2021
Problem
For any finite set , let denote the number of elements in . FInd the number of ordered pairs such that and are (not necessarily distinct) subsets of that satisfy
Solution 1
By PIE, , and after some algebra you see that we need or . WLOG , then for each element there are possibilities, either it is in both and , it is in but not , or it is in neither nor . This gives us possibilities, and we multiply by since it could of also been the other way around. Now we need to subtract the overlaps where , and this case has ways that could happen. It is because each number could be in the subset or it could not be in the subset. So the final answer is .
~ math31415926535
Solution 2
We denote . We denote $X = A \intersect B$ (Error compiling LaTeX. Unknown error_msg), $Y = A \backslash \left( A \intersect B \right)$ (Error compiling LaTeX. Unknown error_msg), $Z = B \backslash \left( A \intersect B \right)$ (Error compiling LaTeX. Unknown error_msg), $W = \Omega \backslash \left( A \union B \right)$ (Error compiling LaTeX. Unknown error_msg).
Therefore, and the intersection of any two out of sets , , , is an empty set. Therefore, is a partition of .
Following from our definition of , , , we have .
Therefore, the equation
can be equivalently written as
This equality can be simplified as
~ Steven Chen (www.professorchenedu.com)
2021 AIME II (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 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.