MathDB
Fibonaccis Sequence

Source: Poland 2001

November 9, 2004
algebra unsolvedalgebra

Problem Statement

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.