TR-MO 2001 Problem 2
is a sequence of real numbers which satisfies for every . If there exist a real upperbound for this sequence, find all the values can take.
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.