olymmath

US-TST 2014 Problem 2

    Let a1,a2,a3,…a_{1}, a_{2}, a_{3}, \ldots be a sequence of integers, with the property that every consecutive group of aia_{i} 's averages to a perfect square. More precisely, for all positive integers nn and kk, the quantity an+an+1+⋯+an+k−1k\frac{a_{n}+a_{n+1}+\cdots+a_{n+k-1}}{k} is always the square of an integer. Prove that the sequence must be constant (all aia_{i} are equal to the same perfect square).

    Dataset text NuminaMath olympiads. 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

    Locator us-tst/2014/p2 · Tag ZTWB79GNFR · Edit this page on GitHub · Keys: j next, k previous