PL-OM 2001 Problem 3
A sequence and and is called a Fibonacci type sequence. Call a number a repeated value if for different from . Prove one can choose and to have as many repeated value as one likes but never infinite.
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.