MathDB
Same sum of digits between multiples

Source:

September 24, 2014
number theory unsolvednumber theory

Problem Statement

For each positive integer nn, let s(n)s(n) be the sum of the digits of nn. Find the smallest positive integer kk such that s(k)=s(2k)=s(3k)==s(2013k)=s(2014k).s(k) = s(2k) = s(3k) = \cdots = s(2013k) = s(2014k).