Difference between revisions of "2017 AMC 10B Problems/Problem 17"
(→Solution 2) |
m (monotonous is bold now instead of latex italic) |
||
Line 2: | Line 2: | ||
==Problem== | ==Problem== | ||
− | Call a positive integer <math>monotonous</math> if it is a one-digit number or its digits, when read from left to right, form either a strictly increasing or a strictly decreasing sequence. For example, <math>3</math>, <math>23578</math>, and <math>987620</math> are monotonous, but <math>88</math>, <math>7434</math>, and <math>23557</math> are not. How many monotonous positive integers are there? | + | Call a positive integer <math>\textbf{monotonous}</math> if it is a one-digit number or its digits, when read from left to right, form either a strictly increasing or a strictly decreasing sequence. For example, <math>3</math>, <math>23578</math>, and <math>987620</math> are monotonous, but <math>88</math>, <math>7434</math>, and <math>23557</math> are not. How many monotonous positive integers are there? |
<math>\textbf{(A)}\ 1024\qquad\textbf{(B)}\ 1524\qquad\textbf{(C)}\ 1533\qquad\textbf{(D)}\ 1536\qquad\textbf{(E)}\ 2048</math> | <math>\textbf{(A)}\ 1024\qquad\textbf{(B)}\ 1524\qquad\textbf{(C)}\ 1533\qquad\textbf{(D)}\ 1536\qquad\textbf{(E)}\ 2048</math> |
Revision as of 20:38, 24 January 2021
- The following problem is from both the 2017 AMC 12B #11 and 2017 AMC 10B #17, so both problems redirect to this page.
Problem
Call a positive integer if it is a one-digit number or its digits, when read from left to right, form either a strictly increasing or a strictly decreasing sequence. For example, , , and are monotonous, but , , and are not. How many monotonous positive integers are there?
Solution 1
Case 1: monotonous numbers with digits in ascending order
There are ways to choose n digits from the digits 1 to 9. For each of these ways, we can generate exactly one monotonous number by ordering the chosen digits in ascending order. Note that 0 is not included since it will always be a leading digit and that is not allowed. Also, (the empty set) isn't included because it doesn't generate a number. The sum is equivalent to
Case 2: monotonous numbers with digits in descending order
There are ways to choose n digits from the digits 0 to 9. For each of these ways, we can generate exactly one monotonous number by ordering the chosen digits in descending order. Note that 0 is included since we are allowed to end numbers with zeros. However, (the empty set) still isn't included because it doesn't generate a number. The sum is equivalent to We discard the number 0 since it is not positive. Thus there are here.
Since the 1-digit numbers 1 to 9 satisfy both case 1 and case 2, we have overcounted by 9. Thus there are monotonous numbers.
Solution 2
Like Solution 1, divide the problem into an increasing and decreasing case:
Case 1: Monotonous numbers with digits in ascending order.
Arrange the digits 1 through 9 in increasing order, and exclude 0 because a positive integer cannot begin with 0.
To get a monotonous number, we can either include or exclude each of the remaining 9 digits, and there are ways to do this. However, we cannot exclude every digit at once, so we subtract 1 to get monotonous numbers for this case.
Case 2: Monotonous numbers with digits in descending order.
This time, we arrange all 10 digits in decreasing order and repeat the process to find ways to include or exclude each digit. We cannot exclude every digit at once, and we cannot include only 0, so we subtract 2 to get monotonous numbers for this case.
At this point, we have counted all of the single-digit monotonous numbers twice, so we must subtract 9 from our total.
Thus our final answer is .
Solution 3
Unlike the first two solutions, we can do our casework based off of whether or not the number contains a .
If it does, then we know the must be the last digit in the number (and hence, the number has to be decreasing). Because is not positive, is not monotonous. So, we need to pick at least number in the set After choosing our numbers, there will be just way to arrange them so that the overall number is monotonous.
In total, each of the digits can either be in the monotonous number or not, yielding total solutions. However, we said earlier that cannot be by itself so we have to subtract out the case in which we picked none of the numbers . So, this case gives us .
Onto the second case, if there are no s, then the number can either be arranged in ascending order or in descending order. So, for each selection of the digits , there are solutions. This gives possibilities. Note that we subtracted out the because we cannot choose none of the numbers.
However, realize that if we pick just digit, then there is only arrangement. We cannot put a single digit in both ascending and descending order. So, we must subtract out from there (because there are possible ways to select one number and for each case, we overcounted by ).
All in all, that gives monotonous numbers.
See Also
2017 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 16 |
Followed by Problem 18 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
2017 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 10 |
Followed by Problem 12 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.