olymmath

KöMaL 2018 A730

    Let FnF_n be the nnth Fibonacci number (F1=F2=1{F_1=F_2=1}, Fn+1=Fn+Fn−1{F_{n+1}=F_n+F_{n-1}}). Construct infinitely many positive integers nn such that nn divides FFnF_{F_n} but nn does not divide FnF_n.

    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/a730 · Tag AMKKTJYSJW · Edit this page on GitHub · Keys: j next, k previous