olymmath

PL-OM 2001 Problem 3

    A sequence x0=Ax_0=A and x1=Bx_1=B and xn+2=xn+1+xnx_{n+2}=x_{n+1} +x_n is called a Fibonacci type sequence. Call a number CC a repeated value if xt=xs=cx_t=x_s=c for tt different from ss . Prove one can choose AA and BB to have as many repeated value as one likes but never infinite.

    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 pl-om/2001/p3 · Tag Q8AG93CF17 · Edit this page on GitHub · Keys: j next, k previous