MathDB
Sequence with infinitely many squares

Source: Chin Second Round (A) 2013 Q2

May 15, 2016
number theory

Problem Statement

Let u,vu,v be positive integers. Define sequence {an}\{a_n\} as follows: a1=u+va_1=u+v, and for integers m1m\ge 1,
{a2m=am+u,a2m+1=am+v,\begin{array}{lll} \begin{cases} a_{2m}=a_m+u, \\ a_{2m+1}=a_m+v, \end{cases} \end{array}
Let Sm=a1+a2++am(m=1,2,)S_m=a_1+a_2+\ldots +a_m(m=1,2,\ldots ). Prove that there are infinitely many perfect squares in the sequence {Sn}\{S_n\}.