2002 AIME II Problems/Problem 9

Revision as of 13:54, 19 April 2008 by 1=2 (talk | contribs) (It's wrong, plugged in x=8, y=2.)

Problem

Let $\mathcal{S}$ be the set $\lbrace1,2,3,\ldots,10\rbrace$ Let $n$ be the number of sets of two non-empty disjoint subsets of $\mathcal{S}$. (Disjoint sets are defined as sets that have no common elements.) Find the remainder obtained when $n$ is divided by $1000$.

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 (ProblemsAnswer KeyResources)
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