USAMO 2012 Problem 6
- Day 2
- Difficulty band 8
For integer , let be real numbers satisfying For each subset , define . (If is the empty set, then .) Prove that for any positive number , the number of sets satisfying is at most . For which choices of does equality hold?
Dataset text NuminaMath olympiads. 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.