USAMO 2016 Problem 1
- Day 1
Let be a sequence of mutually distinct nonempty subsets of a set . Any two sets and are disjoint and their union is not the whole set , that is, and , for all . Find the smallest possible number of elements in .
Dataset text AI-MO AoPS. Quoted with source.
Also USAJMO 2016 Problem 3.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.