2014 OIM Problems/Problem 1
Problem
For each positive integer 
, define 
as the sum of the digits of . Find the smallest positive integer 
such that
![\[s(k) = s(2k) = s(3k) = \cdots = s(2013k) = s(2014k)\]](http://latex.artofproblemsolving.com/d/8/b/d8b5b3b1864339ad65817d48d1fa29a4262675d0.png)
~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.
