Number theory · Perfect powers · Digit sums · Modular arithmetic · Sum of squares
Problem 3, 2012
For every natural number \(n\), let \(x_n\) be the number obtained by writing the squares of the first \(n\) natural numbers one after another, in increasing order; for example
\[ x_{12} = 149162536496481100121144 . \]
Call a natural number \(y\) a perfect power if \(y = a^k\) for some natural numbers \(a\) and \(k > 1\). Prove that there exist infinitely many natural numbers \(n\) for which \(x_n\) is not a perfect power.
Sign in to check answers, open hints, read the full solution, and track your progress. Statements are always free.
Serbian Regional Competition 2012, high school grade I, category A, problem 3. Organized by the Mathematical Society of Serbia (DMS). Source