US-TST 2011 Problem 9
Determine whether or not there exist two different sets , each consisting of at most positive integers, such that every with satisfies the following inequality:
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.