For example,the sum of the digits of the number $139=1+3+9=13$ The smallest $3$ digit number to fulfill this condition is $109$
Essentially,this question is asking "For three whole numbers $x,y,z$ find the number of permutations such that $x+ y+ z$ $\ge$ 10, $ x \neq 0$(since hundreds digit can't be $0$)"
I want to know how we would calculate the final answer.
I also want to know the formula for this question if it was extended to n digit numbers.
Well, There are $900$ three digit numbers. So if we find out how many $3$ digit number have the digits add up to $9$ or less we just subtract those.
Now consider this:
Suppose the three digit number is $abc$.
Suppose you are given $9$ stars and $3$ bars and you want to represent you number this way.
From left to right: Put down $a$ stars to represent the first digit. But down $1$ bar to represent a place holder. Put down $b$ more stars to represent the second digit. Put down a second bar to represent a $2$nd place holder. Put down $c$ stars. Put a bar as the $3$rd place holder. You have $a+b+c \le 9$ so you may have some stars remaining. Put them down.
Every three digit number where the sum is $9$ or less can be represented by a unique combination of stars and bars and each combination represents a unique three digit number where the sums of the digits is $9$ or less.
THis is a line of $12$ items and you must choose $3$ positions for where the bars go.
So there are ${12\choose 3}$ such numbers.
But notice we can't have the first digit be $0$. That is, we can't start with a bar.
So given we start with a star we have $11$ more items and we must choose $3$ position for where the bars go.
So there are ${11 \choose 3}$ such number that have three digits, the first digit is not zero, and the digits add to $9$ or less.
SO there are $900-{11\choose 3}$ three digit numbers where the digits add up to $10$ or more.