Difference between revisions of "2020 AIME I Problems/Problem 5"
(→Solution 7 (Casework)) |
|||
(18 intermediate revisions by 12 users not shown) | |||
Line 1: | Line 1: | ||
− | |||
== Problem == | == Problem == | ||
+ | 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. | ||
+ | |||
+ | If we choose any of the numbers <math>1</math> through <math>6</math>, there are five other spots to put them, so we get <math>6 \cdot 5 = 30</math>. However, we overcount some cases. Take the example of <math>132456</math>. We overcount this case because we can remove the <math>3</math> or the <math>2</math>. Therefore, any cases with two adjacent numbers swapped is overcounted, so we subtract <math>5</math> cases (namely, <math>213456, 132456, 124356, 123546, 123465</math>,) to get <math>30-5=25</math>, but we have to add back one more for the original case, <math>123456</math>. Therefore, there are <math>26</math> cases. Multiplying by <math>2</math> gives the desired answer, <math>\boxed{052}</math>. | ||
+ | |||
+ | -molocyxu | ||
+ | |||
+ | Video Solution: | ||
+ | |||
+ | https://www.youtube.com/watch?v=E6YJh7vsLPU | ||
+ | |||
+ | ==Video solution== | ||
+ | |||
+ | https://youtu.be/ctVf7X6fTLI | ||
+ | |||
+ | == 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 + 5 + 2(4 + 3 + 2 + 1) = 26</math>, and multiplying by two gives <math>\boxed{052}.</math> ~awang11 | ||
+ | |||
+ | == Solution 3 == | ||
+ | Similarly to above, we find the number of ascending arrangements and multiply by 2. | ||
+ | |||
+ | We can choose <math>5</math> cards to be the ascending cards, therefore leaving <math>6</math> places to place the remaining card. There are <math>\binom{6}{5}\cdot 6=36</math> to do this. However, since the problem is asking for the number of arrangements, we overcount cases such as <math>123456</math>. Notice that the only arrangements that overcount are <math>123456</math> (case 1) or if two adjacent numbers of <math>123456</math> are switched (case 2). | ||
+ | |||
+ | <math>\text{Case 1: } </math> This arrangement is counted <math>6</math> times. Each time it is counted for any of the <math>5</math> numbers selected. Therefore we need to subtract <math>5</math> cases of overcounting. | ||
+ | |||
+ | <math>\text{Case 2: }</math> Each time <math>2</math> adjacent numbers of switched, there is one overcount. For example, if we have <math>213456</math>, both <math>1</math> or <math>2</math> could be removed. Since there are <math>5</math> possible switches, we need to subtract <math>5</math> cases of overcounting. | ||
+ | |||
+ | Therefore, we have <math>36-5-5=26</math> total arrangements of ascending numbers. We multiply by two (for descending) to get the answer of <math>\boxed{052}.</math> -PCChess | ||
+ | |||
+ | == Solution 4 (No overcounting) == | ||
+ | Like in previous solutions, we will count the number of ascending arrangements and multiply by 2. | ||
+ | |||
+ | First, consider the arrangement 1-2-3-4-5-6. That gives us 1 arrangement which works. | ||
+ | |||
+ | Next, we can switch two adjacent cards. There are 5 ways to pick two adjacent cards, so this gives us 5 arrangements. | ||
+ | |||
+ | Now, we can "cycle" 3 adjacent cards. For example, 1-2-3 becomes 2-3-1 which becomes 3-1-2. There are 4 ways to pick a set of 3 adjacent cards, so this gives us 4x2=8 arrangements. | ||
+ | |||
+ | Cycling 4 adjacent cards, we get the new arrangements 2-3-4-1 (which works,) 3-4-1-2 (which doesn't work,) and 4-1-2-3 (which does work.) We get 6 arrangements. | ||
+ | |||
+ | Similarly, when cycling 5 cards, we find 2x2=4 arrangements, and when cycling 6 cards, we find 2x1=2 arrangements. | ||
+ | |||
+ | Adding, we figure out that there are 1+5+8+6+4+2=26 ascending arrangements. Multiplying by 2, we get the answer <math>\boxed{052}.</math> -i8Pie | ||
+ | ==Solution 5 (Official MAA 1)== | ||
+ | First count the number of permutations of the cards such that if one card is removed, the remaining cards will be in ascending order. There is <math>1</math> such permutation where all the cards appear in order: <math>123456.</math> There are <math>5</math> such permutations where two adjacent cards are interchanged, as in <math>124356.</math> The other such permutations arise from removing one card from <math>123456</math> and placing it in a position at least two away from its starting location. There are <math>4</math> such positions to place each of the cards numbered <math>1</math> and <math>6,</math> and <math>3</math> such positions for each of the cards numbered <math>2, 3, 4,</math> and <math>5.</math> This accounts for <math>2\cdot4 + 4\cdot3 =20</math> permutations. Thus there are <math>1 + 5 + 20 = 26</math> permutations where one card can be removed so that the remaining cards are in ascending order. There is an equal number of permutations that result in the cards' being in descending order. This gives the total <math>26 + 26 = 52</math>. | ||
+ | ==Solution 6 (Official MAA 2)== | ||
+ | More generally, suppose there are <math>n \geq 4</math> cards numbered <math>1, 2, 3, \dots, n</math> arranged in ascending order. If any one of the <math>n</math> cards is removed and placed in one of the <math>n</math> positions in the arrangement, the resulting permutation will have the property that one card can be removed so that the remaining cards are in ascending order. This accounts for <math>n\cdot n = n^2</math> permutations. However, the original ascending order has been counted <math>n</math> times, and each order that arises by switching two neighboring cards has been counted twice. Hence the number of arrangements where one card can be removed resulting in the remaining cards' being in ascending order is <math>n^2-(n-1)-(n-1)=(n-1)^2+1.</math> When <math>n = 6</math>, this is <math>(6-1)^2+1 = 26</math>, and the final answer is <math>2\cdot26 = 52</math>. | ||
+ | |||
+ | ==Solution 7 (Casework)== | ||
+ | For ascending, if the <math>1</math> goes in anything but the first two slots, the rest of the numbers have to go in ascending from <math>2</math>, which are <math>4</math> cases if there are <math>6</math> cards. If <math>1</math> goes in the second spot, then you can put any of the rest in the first slot but then the rest are determined, so in the case of <math>6</math> cards, that gives <math>5</math> more. If <math>1</math> goes in the first slot, that means that you are doing the same problem with <math>n-1</math> cards. So the recursion is <math>a_n=(n-2)+(n-1)+a_{n-1}</math>. There's <math>a_1=1</math> and <math>a_2=2</math>, so you get <math>a_3=2+3=5</math>, <math>a_4=5+5=10</math>, <math>a_5=7+10=17</math>, and <math>a_6=9+17=26</math>. Or you can see that <math>a_n=(n-1)^2+1</math>. We double to account for descending and get <math>\boxed{052}</math>. ~ahclark11 | ||
+ | |||
+ | == Video Solution == | ||
+ | https://www.youtube.com/watch?v=5iwdFd2OLKM&list=PLLCzevlMcsWN9y8YI4KNPZlhdsjPTlRrb&index=5 ~ MathEx | ||
==See Also== | ==See Also== | ||
{{AIME box|year=2020|n=I|num-b=4|num-a=6}} | {{AIME box|year=2020|n=I|num-b=4|num-a=6}} | ||
+ | |||
+ | [[Category: Intermediate Combinatorics Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 16:52, 4 January 2021
Contents
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
Video Solution:
https://www.youtube.com/watch?v=E6YJh7vsLPU
Video solution
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
Solution 3
Similarly to above, we find the number of ascending arrangements and multiply by 2.
We can choose cards to be the ascending cards, therefore leaving places to place the remaining card. There are to do this. However, since the problem is asking for the number of arrangements, we overcount cases such as . Notice that the only arrangements that overcount are (case 1) or if two adjacent numbers of are switched (case 2).
This arrangement is counted times. Each time it is counted for any of the numbers selected. Therefore we need to subtract cases of overcounting.
Each time adjacent numbers of switched, there is one overcount. For example, if we have , both or could be removed. Since there are possible switches, we need to subtract cases of overcounting.
Therefore, we have total arrangements of ascending numbers. We multiply by two (for descending) to get the answer of -PCChess
Solution 4 (No overcounting)
Like in previous solutions, we will count the number of ascending arrangements and multiply by 2.
First, consider the arrangement 1-2-3-4-5-6. That gives us 1 arrangement which works.
Next, we can switch two adjacent cards. There are 5 ways to pick two adjacent cards, so this gives us 5 arrangements.
Now, we can "cycle" 3 adjacent cards. For example, 1-2-3 becomes 2-3-1 which becomes 3-1-2. There are 4 ways to pick a set of 3 adjacent cards, so this gives us 4x2=8 arrangements.
Cycling 4 adjacent cards, we get the new arrangements 2-3-4-1 (which works,) 3-4-1-2 (which doesn't work,) and 4-1-2-3 (which does work.) We get 6 arrangements.
Similarly, when cycling 5 cards, we find 2x2=4 arrangements, and when cycling 6 cards, we find 2x1=2 arrangements.
Adding, we figure out that there are 1+5+8+6+4+2=26 ascending arrangements. Multiplying by 2, we get the answer -i8Pie
Solution 5 (Official MAA 1)
First count the number of permutations of the cards such that if one card is removed, the remaining cards will be in ascending order. There is such permutation where all the cards appear in order: There are such permutations where two adjacent cards are interchanged, as in The other such permutations arise from removing one card from and placing it in a position at least two away from its starting location. There are such positions to place each of the cards numbered and and such positions for each of the cards numbered and This accounts for permutations. Thus there are permutations where one card can be removed so that the remaining cards are in ascending order. There is an equal number of permutations that result in the cards' being in descending order. This gives the total .
Solution 6 (Official MAA 2)
More generally, suppose there are cards numbered arranged in ascending order. If any one of the cards is removed and placed in one of the positions in the arrangement, the resulting permutation will have the property that one card can be removed so that the remaining cards are in ascending order. This accounts for permutations. However, the original ascending order has been counted times, and each order that arises by switching two neighboring cards has been counted twice. Hence the number of arrangements where one card can be removed resulting in the remaining cards' being in ascending order is When , this is , and the final answer is .
Solution 7 (Casework)
For ascending, if the goes in anything but the first two slots, the rest of the numbers have to go in ascending from , which are cases if there are cards. If goes in the second spot, then you can put any of the rest in the first slot but then the rest are determined, so in the case of cards, that gives more. If goes in the first slot, that means that you are doing the same problem with cards. So the recursion is . There's and , so you get , , , and . Or you can see that . We double to account for descending and get . ~ahclark11
Video Solution
https://www.youtube.com/watch?v=5iwdFd2OLKM&list=PLLCzevlMcsWN9y8YI4KNPZlhdsjPTlRrb&index=5 ~ MathEx
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.