MathDB
Sequences of Subsets

Source: 2016 USAMO 1/USAJMO 3

April 19, 2016
USAMOProblem Sets2016 USAMO

Problem Statement

Let X1,X2,,X100X_1, X_2, \ldots, X_{100} be a sequence of mutually distinct nonempty subsets of a set SS. Any two sets XiX_i and Xi+1X_{i+1} are disjoint and their union is not the whole set SS, that is, XiXi+1=X_i\cap X_{i+1}=\emptyset and XiXi+1SX_i\cup X_{i+1}\neq S, for all i{1,,99}i\in\{1, \ldots, 99\}. Find the smallest possible number of elements in SS.