Howdy Integers!

n = 1 0 m 1 a m + 1 0 m 2 a m 1 + + a 1 \large{n = 10^{m-1}a_m + 10^{m-2}a_{m-1} + \ldots + a_1}

A positive integer n n as described above can be written in the decimal notation as a m a m 1 a 1 a_m a_{m-1} \dotsm a_1 , where a m , a m 1 , , a 1 { 0 , 1 , 2 , , 9 } a_m, a_{m-1}, \ldots, a_1 \in \{0, 1, 2, \ldots, 9 \} and a m 0 a_m \neq 0 .

Find the SUM of all n n such that:

n = ( a m + 1 ) × ( a m 1 + 1 ) × × ( a 1 + 1 ) \large{n = (a_m+1) \times (a_{m-1}+1) \times \dotsm \times (a_1 +1)}


The answer is 18.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...