US-TST 2001 Problem 3
For a set , let denote the number of elements in . Let be a set of positive integers with . Prove that there exists a set such that
(i) ; (ii) ; (iii) for any (not necessarily distinct), .
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.