# Reverse Engineer from digits sum

This question is about sums of digits of a number.

Given that sum of digits of $19 = 1+9 = 10$.

However, is there a way that, given $10$, we can come out with $19$?

In this case, we assume that $19$ is the smallest possible number that can be applied to achieve sum of $10$.

Another example will be sum of digits for $79 = 16$.

Given the number $16$, how can we get the number $79$, given $79$ is the smallest possible number to achieve sum of $16$?

Thanks.

-
@hjg, yup. that's right. – Ray.R.Chua Oct 21 '12 at 13:58
Sequence oeis.org/A051885 – hjg Oct 21 '12 at 14:01
@hjg is there a formula for this? – Ray.R.Chua Oct 21 '12 at 16:17

I don't think I can put this into a formula (I'll reply back if I can come up with a simple one), but the way I would solve a problem like this is to just think it through.

Let's take $10$ as an example. Here are all the possible combinations of single digit, positive integers that add up to $10$:

• $1, 9$
• $2, 8$
• $3, 7$
• $4, 6$
• $5, 5$

Remember that each set of digits could be joined in two ways to make two numbers, so all of the possible two digit numbers are as follows:

• $1, 9 \Rightarrow 19, 91$
• $2, 8 \Rightarrow 28, 82$
• $3, 7 \Rightarrow 37, 73$
• $4, 6 \Rightarrow 46, 64$
• $5, 5 \Rightarrow 55$

Technically, we could list many more numbers of 3-10 digits (i.e. 127, 523), but if we have two digit possibilities, then there's no reason to check three digits and up since we're looking for the smallest number.

From the list of numbers above, you can see that $19$ is the smallest. However, we could have found this without exhausting all of the two digit options. Unfortunately, I am suggesting a guess-and-check method, but a strategical/informed version. In this case, we check if 1 could be a possible first digit, since we're looking for the smallest possible number. $10-1 = 9$, so $19$ is a valid result and we can not find a smaller answer (since there is no one-digit number that would equal $10$ and there are no other two digit numbers in the 10s that would add up to $10$.

Now, let me take 16 to show you the proper approach. You don't just want to start with $16-1$ and then $16-2$ since these return a two-digit number ($1+15 = 16$, etc.), so you want to make an informed guess to try and find the lowest pair of single digit numbers that add up to $16$. Since $6+10 = 16$, anything $\le 6$ would have a two-digit partner, so we try $7$ and find that $7+9 = 16$, so $79$ is our smallest value that adds up to 16.

Let's do another example that is $< 20$: $15$. Since $5+10 = 15$, try $6$ since this should be the first with another single digit (since you're technically adding $1$ to $5$ and subtracting $1$ from $10$, so you find $6$ and $9$, or $69$.

Once you get to $19$, it's not possible to find a two-digit answer that adds up to $20$, so we need to move up to 3 digits. Try using $1$ as the first digit (this only works for $19$ by the way, just like it only worked for $10$ for 2 digits), so $19-1 = 18$ and now we need to find two one digits that will add up to $18$, which is $9+9$, so $1+9+9 = 19$, so our answer is $199$.

One-digit answers will only get you as far as $9$, Two-digit answers will only get you as far as $9+9=18$, Three-digits will only go up to $9+9+9=27$, and so on.

Sorry there isn't a formula that I can think of to solve this quickly, but with some informed tries, you should be able to find the answer rather quickly.

-

If $s$ is the sum, the number of digits is $k=\lceil s/9 \rceil$. The lead digit is then $s+9-9k$. Then there are $k-1 \ \ 9$'s

-

If you have any sum s and want to know the smallest number which digits add up to that sum, you just have to use modulo 9 arithmetic.

You calculate s mod 9, that will be your first cypher to the left, then you solve for q and that will be how many 9s you add to the right.

For example:

16 mod 9 is 7. Solving for q in the equation 16 = qx9 + 7 you get q=1, so 7 to the left and one 9 to the right = 79.

This is so because of modulo 9 congruent sets.

-