HMMT 2005 T13
- Team 1
Let be a set of integers either bounded below or bounded above. Then show that if tiles all other integers , then tiles all integers .
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.