olymmath

KöMaL 2009 C997

    Prove that every fourth term of the Fibonacci sequence is divisible by three. (In the Fibonacci sequence, a1a_1=1, a2a_2=1 and ana_n=an−1a_{n-1}+an−2a_{n-2} for all n∈Nn\in \mathbb{N} , n≥n \ge3.)

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