Problem

Source:

Tags: modular arithmetic, number theory unsolved, number theory



Let $S(k)$ denote the digit-sum of a positive integer $k$(in base $10$). Determine the smallest positive integer $n$ such that \[S(n^2 ) = S(n) - 7\]