4
votes
2answers
138 views

Using the invariance principle: how to solve $n+d(n)+d(d(n))=m$?

Let $d(n)$ be the digital sum of $n$. How to solve $n+d(n)+d(d(n))=m$, where $n$ and $m$ are natural?