d(n)+d(d(n)+d(d(d(n)=2015 find the number of solutions to the abovenequation where d(n) represents the digital sum.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Lhs is 0modd(3) whereas rhs is 2 mod(3)