olymmath

NMC 2004 Problem 2

    Let f1=0,f2=1f_{1}=0, f_{2}=1, and fn+2=fn+1+fnf_{n+2}=f_{n+1}+f_{n}, for n=1n=1, 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.

    Add a solution

    Locator nordic/2004/p2 · Tag 9JS42MBR7H · Edit this page on GitHub · Keys: j next, k previous