olymmath

KöMaL 2018 B4950

    Let FnF_n denote the nnth Fibonacci number (F1=F2=1F_1=F_2=1, Fn+2=Fn+1+FnF_{n+2}= F_{n+1}+F_n), and define the sequence a0,a1,a2,…a_0,a_1,a_2,\dots with the following recurrence relation: let a0=2018a_0=2018, and for all k≥0k\ge 0 let ak+1=ak+Fna_{k+1}=a_k+F_n, where FnF_n is the largest Fibonacci number less than aka_k. Will there be any Fibonacci number in the sequence (ak)(a_k)?

    Official text KöMaL. 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

    Similar problems

    These problems have the most words in common with this statement.

    Locator hu-komal/2018/b4950 · Tag NJVYYY112C · Edit this page on GitHub · Keys: j next, k previous