2014 OIM Problems/Problem 1

Problem

For each positive integer $n$, define $s(n)$ as the sum of the digits of $n$. Find the smallest positive integer $k$ such that

\[s(k) = s(2k) = s(3k) = \cdots = s(2013k) = s(2014k)\]

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions