CZ-SK-MO 2003 Problem 3
A sequence satisfies and for each . Prove that the signs " " can be chosen so that holds only for finitely many .
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.