MathDB
Counting Disjoint Subsets

Source:

December 28, 2006
countingdistinguishability

Problem Statement

Let S\mathcal{S} be the set {1,2,3,…,10}.\{1,2,3,\ldots,10\}. Let nn be the number of sets of two non-empty disjoint subsets of S.\mathcal{S}. (Disjoint sets are defined as sets that have no common elements.) Find the remainder obtained when nn is divided by 1000.1000.
Back to ProblemsView on AoPS