olymmath

EGMO 2022 Problem 3

  • Day 1

An infinite sequence of positive integers a1,a2,…a_{1}, a_{2}, \ldots is called good if (1) a1a_{1} is a perfect square, and (2) for any integer n≥2,ann \geq 2, a_{n} is the smallest positive integer such that

na1+(n−1)a2+…+2an−1+ann a_{1}+(n-1) a_{2}+\ldots+2 a_{n-1}+a_{n}

is a perfect square. Prove that for any good sequence a1,a2,…a_{1}, a_{2}, \ldots, there exists a positive integer kk such that an=aka_{n}=a_{k} for all integers n≥kn \geq k.

Proposed by: Joe Benton and Dominic Yeo, United Kingdom

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 egmo/2022/p3 · Tag B8SBS5AN6Q · Edit this page on GitHub · Keys: j next, k previous