NMC 2004 Problem 2
Let , and , for , 2, ..., be the Fibonacci sequence. Show that there exists a strictly increasing infinite arithmetic sequence none of whose numbers belongs to the Fibonacci sequence. [A sequence is arithmetic, if the difference of any of its consecutive terms is a constant.]
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.