BG-MO 2005 Problem 3
Let . Determine, with proof, whether there exists a subset with the property that every number in can be uniquely written as the sum of finitely many distinct elements of .
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.