Skip to main contentSkip to solution

How many numbers with two or more digits can be formed with the digits 1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9, so that in every such number, each digit is used at most once and the digits appear in the ascending order?

Entered answer:

Solution

✅ Correct Answer: 502

We need to find how many numbers with two or more digits can be formed using digits 1, 2, 3, 4, 5, 6, 7, 8, 9 where each digit is used at most once and digits appear in ascending order.


When digits must appear in ascending order, we don't need to worry about arranging them - we just need to choose which digits to use.

For example:

If we choose digits {2, 5, 8}, there's only one way to arrange them in ascending order: 258

If we choose digits {1, 3, 6, 9}, there's only one way to arrange them: 1369

This means forming an n-digit number is equivalent to choosing n digits from the 9 available digits.


Number of ways to form an n-digit number = 9Cn{{}}^{{9}}C_{{n}}

2-digit numbers: Choose 2 digits from 9 = 9C2{{}}^{{9}}C_{{2}}

3-digit numbers: Choose 3 digits from 9 = 9C3{{}}^{{9}}C_{{3}}

4-digit numbers: Choose 4 digits from 9 = 9C4{{}}^{{9}}C_{{4}}

And so on...


We can use the binomial theorem identity:

29=9C0+9C1+9C2+9C3+...+9C92^9 = {{}}^{{9}}C_{{0}} + {{}}^{{9}}C_{{1}} + {{}}^{{9}}C_{{2}} + {{}}^{{9}}C_{{3}} + ... + {{}}^{{9}}C_{{9}}

This tells us that the sum of all combinations equals 292^9.


Total numbers with 2 or more digits = 9C2+9C3+9C4+9C5+9C6+9C7+9C8+9C9{{}}^{{9}}C_{{2}} + {{}}^{{9}}C_{{3}} + {{}}^{{9}}C_{{4}} + {{}}^{{9}}C_{{5}} + {{}}^{{9}}C_{{6}} + {{}}^{{9}}C_{{7}} + {{}}^{{9}}C_{{8}} + {{}}^{{9}}C_{{9}}

Using our identity:

=29−(9C0+9C1)= 2^9 - ({{}}^{{9}}C_{{0}} + {{}}^{{9}}C_{{1}})

Let's calculate:

29=5122^9 = 512

9C0=1{{}}^{{9}}C_{{0}} = 1 (choosing 0 digits - this gives us no number)

9C1=9{{}}^{{9}}C_{{1}} = 9 (choosing 1 digit - this gives us 1-digit numbers)

Therefore:

=512−(1+9)=512−10=502= 512 - (1 + 9) = 512 - 10 = 502


We subtract 9C0{{}}^{{9}}C_{{0}} and 9C1{{}}^{{9}}C_{{1}} because:

9C0=1{{}}^{{9}}C_{{0}} = 1 represents choosing no digits, which doesn't form any number

9C1=9{{}}^{{9}}C_{{1}} = 9 represents 1-digit numbers (1, 2, 3, 4, 5, 6, 7, 8, 9), but we need two or more digits

The total number of numbers with two or more digits that can be formed is 502.

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question