How many numbers with two or more digits can be formed with the digits so that in every such number, each digit is used at most once and the digits appear in the ascending order?
How many numbers with two or more digits can be formed with the digits so that in every such number, each digit is used at most once and the digits appear in the ascending order?
Entered answer:
Solution
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 =
2-digit numbers: Choose 2 digits from 9 =
3-digit numbers: Choose 3 digits from 9 =
4-digit numbers: Choose 4 digits from 9 =
And so on...
We can use the binomial theorem identity:
This tells us that the sum of all combinations equals .
Total numbers with 2 or more digits =
Using our identity:
Let's calculate:
(choosing 0 digits - this gives us no number)
(choosing 1 digit - this gives us 1-digit numbers)
Therefore:
We subtract and because:
represents choosing no digits, which doesn't form any number
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.
Related questions:
CAT 2022 Slot 2