TH-TMO 2007 Problem 13

Let $S = \{1, 2,..., 8\}$ . How many ways are there to select two disjoint subsets of $S$ ?

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.