Difference between revisions of "2020 AIME I Problems/Problem 5"
(→Problem) |
(→Solution) |
||
| Line 4: | Line 4: | ||
Six cards numbered <math>1</math> through <math>6</math> are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | Six cards numbered <math>1</math> through <math>6</math> are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | ||
| − | == Solution == | + | == Solution 1 == |
Realize that any sequence that works (ascending) can be reversed for descending, so we can just take the amount of sequences that satisfy the ascending condition and multiply by two. | Realize that any sequence that works (ascending) can be reversed for descending, so we can just take the amount of sequences that satisfy the ascending condition and multiply by two. | ||
| Line 10: | Line 10: | ||
-molocyxu | -molocyxu | ||
| + | |||
| + | == Solution 2 (Inspired by 2018 CMIMC combo round) == | ||
| + | |||
| + | Similar to above, a <math>1-1</math> correspondence between ascending and descending is established by subtracting each number from <math>7</math>. | ||
| + | |||
| + | We note that the given condition is equivalent to "cycling" <math>123456</math> for a contiguous subset of it. For example, | ||
| + | |||
| + | <math>12(345)6 \rightarrow 125346, 124536</math> | ||
| + | |||
| + | It's not hard to see that no overcount is possible, and that the cycle is either <math>1</math> "right" or <math>1</math> "left." Therefore, we consider how many elements we flip by. If we flip <math>1</math> or <math>2</math> such elements, then there is one way to cycle them. Otherwise, we have <math>2</math> ways. Therefore, the total number of ascending is <math>1 + 2 + 2(3 + 4 + 5 + 6) = 26</math>, and multiplying by two gives <math>\boxed{052}.</math> ~awang11 | ||
==See Also== | ==See Also== | ||
Revision as of 16:33, 12 March 2020
Note: Please do not post problems here until after the AIME.
Problem
Six cards numbered 
through 
are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order.
Solution 1
Realize that any sequence that works (ascending) can be reversed for descending, so we can just take the amount of sequences that satisfy the ascending condition and multiply by two.
If we choose any of the numbers through , there are five other spots to put them, so we get 
. However, we overcount some cases. Take the example of 
. We overcount this case because we can remove the 
or the 
. Therefore, any cases with two adjacent numbers swapped is overcounted, so we subtract 
cases (namely, 
,) to get 
, but we have to add back one more for the original case, 
. Therefore, there are 
cases. Multiplying by gives the desired answer, 
.
-molocyxu
Solution 2 (Inspired by 2018 CMIMC combo round)
Similar to above, a 
correspondence between ascending and descending is established by subtracting each number from 
.
We note that the given condition is equivalent to "cycling" for a contiguous subset of it. For example,
It's not hard to see that no overcount is possible, and that the cycle is either "right" or "left." Therefore, we consider how many elements we flip by. If we flip or such elements, then there is one way to cycle them. Otherwise, we have ways. Therefore, the total number of ascending is 
, and multiplying by two gives 
~awang11
See Also
| 2020 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 4 |
Followed by Problem 6 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
