Join the USAMO Guide Discord Server. Regular updates are posted there!

Let me Join!
Dismiss

IMO Team Selection Test #0jju

IMO Team Selection TestHard

From module Strong Number Theory

Community difficultyNo ratings yetBe the first to rate this problem.
Understand the scale
Scale 0.5: Easiest math competition problems, often solvable even for early middle school students without experience. 1: Problems strictly for beginners, often at a moderate middle school level. 1.5: Problems for stronger beginner students, on the level of the middling problems in most middle school contests. 2: For motivated beginners, harder questions from the previous categories. 2.5: More advanced beginner problems, hardest questions from previous categories. 3: Early intermediate problems that require more creative thinking. 3.5: Tougher early intermediate problems that consistently stretch into higher-level creative thinking or conceptual knowledge. 4: Intermediate-level problems. 4.5: Upper intermediate problems approaching the upper bound for non-invitational sprint math competitions. 5: More difficult AIME problems or simple proof-based Olympiad-style problems. 6: High-level AIME-styled questions or introductory Olympiad-level questions. 7: Tougher Olympiad-level questions, may require more technical knowledge. 8: High-level Olympiad-level questions. 9: Expert Olympiad-level questions. 9.5: The hardest problems appearing on Olympiads which the strongest students could reasonably solve. 10: Historically notorious problems, generally unsuitable for even very hard competitions because they are exceedingly tedious, long, and difficult.
Quadratic residuesInverses mod nPrime numbers

Problem

Let a1,a2,a3,…a_1, a_2, a_3, \dots be a sequence of integers, with the property that every consecutive group of aia_i's averages to a perfect square. More precisely, for every positive integers nn and kk, the quantity

an+an+1+⋯+an+k−1k\frac{a_n + a_{n+1} + \dots + 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).

← Back to all problems