Difference between revisions of "2000 AIME I Problems/Problem 15"
m (→Solution 3 (Recursion)) |
(→Solution 3 (Recursion)) |
||
Line 15: | Line 15: | ||
Let <math>a_n</math> be the answer to the above problem. | Let <math>a_n</math> be the answer to the above problem. | ||
− | As a base case, consider <math>n=2</math>. Clearly, the stack | + | As a base case, consider <math>n=2</math>. Clearly, the stack, from top to bottom, must be <math>(1, 2)</math>, so <math>a_n=0</math>. |
Next, let's think about how we can construct a stack of <math>n+1</math> cards from a stack of <math>n</math> cards. First, let us renumber the current stack of <math>n</math> by adding <math>1</math> to the label of each of the cards. Then we must add a card labeled "<math>1</math>". | Next, let's think about how we can construct a stack of <math>n+1</math> cards from a stack of <math>n</math> cards. First, let us renumber the current stack of <math>n</math> by adding <math>1</math> to the label of each of the cards. Then we must add a card labeled "<math>1</math>". |
Revision as of 21:26, 20 December 2019
Problem
A stack of cards is labelled with the integers from to with different integers on different cards. The cards in the stack are not in numerical order. The top card is removed from the stack and placed on the table, and the next card is moved to the bottom of the stack. The new top card is removed from the stack and placed on the table, to the right of the card already there, and the next card in the stack is moved to the bottom of the stack. The process - placing the top card to the right of the cards already on the table and moving the next card in the stack to the bottom of the stack - is repeated until all cards are on the table. It is found that, reading from left to right, the labels on the cards are now in ascending order: In the original stack of cards, how many cards were above the card labeled ?
Solution
We try to work backwards from when there are 2 cards left, since this is when the 1999 card is laid onto the table. When there are 2 cards left, the 1999 card is on the top of the deck. In order for this to occur, it must be 2nd on the deck when there are 4 cards remaining, and this means it must be the 4th card when there are 8 cards remaining. This pattern continues until it is the 512th card on the deck when there are 1024 cards remaining. Since there are over 1000 cards remaining, some cards have not even made one trip through yet, 2(1024 - 1000) = 48, to be exact. Once these cards go through, 1999 will be the card on the deck. Since every other card was removed during the first round, it goes to show that 1999 was in position , meaning that there were cards are above the one labeled .
Solution 2
To simplify matters, we want a power of . Hence, we will add 'fake' cards which we must discard in our actual count. Using similar logic as Solution 1, we find that 1999 has position in a card stack, where the fake cards towards the front.
Let the fake cards have positions . Then, we know that the real cards filling the gaps between the fake cards must be the cards such that they go to their correct starting positions in the card case, where all of them are below . From this, we know that the cards from positions to alternate in fake-real-fake-real, where we have the correct order of cards once the first have moved and we can start putting real cards on the table. Hence, is in position , so cards are above it. - Spacesam
Solution 3 (Recursion)
Consider the general problem: with a stack of cards such that they will be laid out from left to right, how many cards are above the card labeled ?
Let be the answer to the above problem.
As a base case, consider . Clearly, the stack, from top to bottom, must be , so .
Next, let's think about how we can construct a stack of cards from a stack of cards. First, let us renumber the current stack of by adding to the label of each of the cards. Then we must add a card labeled "".
Working backwards, we find that we must move the bottom card to the top, then add "" to the top of the deck.
Therefore, if (meaning the card is not at the bottom of the deck and so it won't be moved to the top), then , since a card from the bottom is moved to be above the card, and the new card "" is added to the top. If (meaning the card is the bottom card), then because it will move to the top and the card "" will be added on top of it.
With these recursions and the base case we found earlier, we calculate . To calculate this by hand, a helpful trick is finding that if , then as well. Once we find , the answer is just . - Frestho
See also
2000 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last Question | |
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.