CWMO 2013 Problem 5
A nonempty set is called an -level-goodset if and (where denotes the number of elements in and denotes the minimum of the elements in ). Let be the number of -level-good sets. Prove that for all positive integers we have .
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.
Similar problems
These problems have the most words in common with this statement.