Difference between revisions of "1993 AIME Problems/Problem 8"
m |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | Let <math>S\,</math> be a set with six elements. In how many different ways can one select two not necessarily distinct subsets of <math>S\,</math> so that the union of the two subsets is <math>S\,</math>? The order of selection does not matter; for example, the pair of subsets <math>\{a, c\}\,</math>, <math>\{b, c, d, e, f\}\,</math> represents the same selection as the pair <math>\{b, c, d, e, f\}\,</math>, <math>\{a, c\}\,</math>. | ||
== Solution == | == Solution == | ||
| + | {{solution}} | ||
== See also == | == See also == | ||
| − | + | {{AIME box|year=1993|num-b=7|num-a=9}} | |
Revision as of 23:11, 25 March 2007
Problem
Let 
be a set with six elements. In how many different ways can one select two not necessarily distinct subsets of so that the union of the two subsets is ? The order of selection does not matter; for example, the pair of subsets 
, 
represents the same selection as the pair , .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 1993 AIME (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 | ||
