2002 AIME II Problems/Problem 9
Revision as of 13:03, 19 April 2008 by I like pie (talk | contribs) (Added problem, solution still needed)
Problem
Let be the set Let be the number of sets of two non-empty disjoint subsets of . (Disjoint sets are defined as sets that have no common elements.) Find the remainder obtained when is divided by .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
2002 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |