olymmath

ILL 1974 Problem 2

    Let un{u_n} be the Fibonacci sequence, i.e., u0=0,u1=1,un=un−1+un−2u_0=0,u_1=1,u_n=u_{n-1}+u_{n-2} for n>1n>1 . Prove that there exist infinitely many prime numbers pp that divide up−1u_{p-1} .

    Dataset text AI-MO AoPS. 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 ill/1974/p2 · Tag HFZ3ZCXS7Z · Edit this page on GitHub · Keys: j next, k previous