olymmath

CN-LEAGUE 2013 Problem 2

    Let u,vu,v be positive integers. Define sequence {an}\{a_n\} as follows: a1=u+va_1=u+v , and for integers m≥1m\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\} .

    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 cn-league/2013/p2 · Tag XBYQGDQW0D · Edit this page on GitHub · Keys: j next, k previous