MathNet 2017-part-02 — 176 problems (EN–VI) Question 157

Show that for every integer $n \geq 1$, there exists a multiple $m$ of $n$ whose sum of digits equals $n$.