Problem

Source: Bundeswettbewerb Mathematik (German Federal Math Competiton) Round 2 2021

Tags: number theory



Let $Q(n)$ denote the sum of the digits of $n$ in its decimal representation. Prove that for every positive integer $k$, there exists a multiple $n$ of $k$ such that $Q(n)=Q(n^2)$.