AIME 2000 I · 第 15 题

Solution 1

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 $512 - 48 = 464^\text{th}$ card on the deck. Since every other card was removed during the first round, it goes to show that 1999 was in position $464 \times 2 = 928$, meaning that there were $\boxed{927}$ cards are above the one labeled $1999$.

Solution 2

To simplify matters, we want a power of $2$. Hence, we will add $48$ 'fake' cards which we must discard in our actual count. Using similar logic as Solution 1, we find that 1999 has position $1024$ in a $2048$ card stack, where the fake cards towards the front.

Let the fake cards have positions $1, 3, 5, \cdots, 95$. 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 $2000$ card case, where all of them are below $1999$. From this, we know that the cards from positions $1$ to $96$ alternate in fake-real-fake-real, where we have the correct order of cards once the first $96$ have moved and we can start putting real cards on the table. Hence, $1999$ is in position $1024 - 96 = 928$, so $\boxed{927}$ cards are above it. - Spacesam

Solution 3 (Recursion on number of cards below 1999)

We work backwards. To reverse the process, we must move the bottom card to the top, and add a new number to the top. Let $d_n$ equal the number of cards below 1999 after $n$ process reversals. Reversing one process, our deck only has $2000$, so we reverse again to obtain $1999, 2000$. So, $d_2 = 1$. When $d_{n-1} > 0$, after a process reversal, the bottom card is moved to the top (it goes above $1999$), so we subtract by one to account for this (the addition of the new card doesn't matter since it goes above $1999$), giving us $d_n = d_{n-1} - 1$. So, $d_3 = 0$. Then, when $d_{n-1} = 0$, after a process reversal, $1999$ moves to the top and one more card is added above $1999$. Since at $d_{n}$, $n$ cards have been added, there must be $n - 2$ cards below $1999$. So, $d_4 = 2$. Then, consider all $d_{n-1} = 0$. Then, $d_n = n-2$ as previously stated. After $n-2$ process reversals, we go back to $d_{2n - 2} = n - 2 - (n - 2) = 0$. Then, $d_{2n-1} = 2n - 3$. Next, we can simply calculate $2 \cdot 4 - 1 = 7$, $2 \cdot 7 - 1 = 13$, and so on (which is a very simple bash, as $2000$ is a small number. If you don't want to do this, define sequence $a_n = 2a_{n-1} - 1$, and solve for the closed form, which is very easy). Consequently, we derive $d_{1537} = 1537 - 2 = 1535$. $2000 - 1537 = 463$ steps remain. So, $d_{2000} = d_{1537} - 463 = 1072$. Finally, there are $2000 - 1 - 1072 = \boxed{\textbf{927}}$ numbers above $1999$.

~CrazyVideoGamez

Solution 4 (Recursion)

Consider the general problem: with a stack of $n$ cards such that they will be laid out $1, 2, 3, ..., n$ from left to right, how many cards are above the card labeled $n-1$?

Let $a_n$ be the answer to the above problem.

As a base case, consider $n=2$. Clearly, the stack, from top to bottom, must be $(1, 2)$, so $a_2=0$.

Next, let's think about how we can construct a stack of $n+1$ cards from a stack of $n$ cards. First, let us renumber the current stack of $n$ by adding $1$ to the label of each of the cards. Then we must add a card labeled "$1$" somewhere in the new deck.

Working backwards, we find that we must move the bottom card to the top, then add "$1$" to the top of the deck. This is because after one move, the number "$1$" will be laid out and the top card will be moved to the bottom, so the deck becomes the same as what we had before, but with everything renumbered correctly such that $2, 3, 4, ...$ will then be laid out in order.

Therefore, if $a_n \ne n-1$ (meaning the card $n-1$ is not at the bottom of the deck and so it won't be moved to the top), then $a_{n+1} = a_n + 2$, since a card from the bottom is moved to be above the $n-1$ card, and the new card "$1$" is added to the top. If $a_n = n-1$ (meaning the card $n-1$ is the bottom card), then $a_{n+1}=1$ because the $n-1$ card will move to the top and the card "$1$" will be added on top of it.

With these recursions and the base case we found earlier, we calculate $a_{2000} = \boxed{927}$. To calculate this by hand, a helpful trick is finding that if $a_n=1$, then $a_{2n-1}=1$ as well. Once we find $a_{1537}=1$, the answer is just $1+(2000-1537)\cdot2$. - Frestho

Solution 5 (very bashy)

Let us treat each run through the deck as a separate "round". For example, in round one, you would go through all of the $2000$ cards initially in the deck once, in round two, you would go through all $1000$ cards initially in the deck once, so on and so forth. For each round, let us record what the initial and final actions are ($r$ for moving the card to the right, $b$ for moving the card to the bottom), the number of cards moved to the right, the number of cards left, and what the position of the cards moved to the right were in the original $2000$ card deck (as $n = a + ck$ where $n$ is the position, $c$ is the spacing of the cards moved, $a$ is an integer such that the correct first card is moved, and $k$ is an integer greater than or equal to $1$ which represents which card out of all the cards moved to the right you are finding the position of). Then,

Round 1: $r$ to $b$, $1000$ to right, $1000$ left in deck, $n = -1 + 2k$,

Round 2: $r$ to $b$, $500$ to right, $500$ left in deck, $n = -2 + 4k$,

Round 3: $r$ to $b$, $250$ to right, $250$ left in deck, $n = -4 + 8k$,

Round 4: $r$ to $b$, $125$ to right, $125$ left in deck, $n = -8 + 16k$.

Let us treat the remaining deck of $125$ cards as a totally independent deck, note that the positions of card in this deck are $n = 16k$. Also note that the first action of a new round is never the same action as the last action of the previous round because actions alternate. Also note that for every new round, the spacing between cards moved doubles, and that the cards remaining in the beginning of a new round have position $n = a + c/2 + ck$ for the values $a, c$ of the previous round. Also note that if there are an odd number of cards in an initial deck, the first and last actions are the same. Then,

Round 5: $r$ to $r$, $63$ to right, $62$ left in deck, $n = -1 + 2k$,

Round 6: $b$ to $r$, $31$ to right, $31$ left in deck, $n = 4k$, because $n = 2k$ positioned cards are left at the beginning of this round and the first card is sent to the bottom, only every second card is sent to the right, and because spacing doubles every round,

Round 7: $b$ to $b$, $15$ to right, $16$ left in deck, $n = -2 + 8k$, because $n = 2 + 4k$ positioned cards are left at the beginning and only every second card is sent to the right, and because spacing doubles every round,

Round 8: $r$ to $b$, $8$ to right, $8$ left in deck, $n = -14 + 16k$, by similar reasoning, since the cards $n = 2 + 8k$ are left and spacing doubles every round, from here on things get real easy,

Round 9: $r$ to $b$, $4$ to right, $4$ left in deck, $n = -22 + 32k$,

Round 10: $r$ to $b$, $2$ to right, $2$ left in deck, $n = -38 + 64k$,

Round 11: $r$ to $b$, $1$ to right, $1$ left in deck, $n = 58$, since $58 = -38 + 64/2 + 64$.

This card must be labeled 1999 since it is second to last. Then, since it is the $58th$ in the deck of $125$, it must be the $58 * 8 = 928th$ card in the original deck, and because we've been numbering from the top of the deck to the bottom (also because AIME answers are 000-999), there were $928 - 1 = \boxed{927}$ cards above it in the deck - Romulus and minimaxweii

Solution 6 (Bashing with Modular Arithmetic)

Similar to Solution 5, we treat each run-through of the deck from the lowest-indexed card to the highest-indexed card as a separate round. Notice that after each round, approximately half the deck will remain, with the other half having been cast aside to the right in sorted order. Then, we can model each round as if we are running a "Sieve" through the deck with powers of 2s, filtering out the cards to put to the right and the cards to be pushed to the bottom.

At the beginning, when all $2000$ cards are still in the deck, notice that the first run-through of the deck consists of removing all the cards such that their index $I\equiv 1\pmod{2}$, while we leave behind all the cards such that their index $I\equiv 2\pmod{2}$. (Since the cards are not $0$-indexed, using $2$ instead of $0\pmod{2}$ is simpler to keep track of the cards. This will appear again later.) The remaining $1000$ cards, then, will all share the attribute that their index numbers are even. To split this further for round 2, we look more specifically at each index, categorizing them further as $I\equiv 2\pmod 4$ or $I\equiv 4\pmod 4$ in that order (The card with the smaller remainder will always be the card on the top of the new deck). Then, in Round 2, we will remove all the cards with index values that leave a remainder of $2$ when divided by $4$, while leaving the multiples of $4$ behind. Notice that each time, in each new deck, we are removing all the cards with an odd position in that specific deck, and leaving behind all the cards with an even position in that specific deck.

This process will continue until we reach Round 5, where the number of cards that remain ($125$) is no longer a multiple of 2. Therefore, when we remove all the cards with indices $I\equiv 16\pmod{32}$ and leave behind all the cards with indices $I\equiv 32\pmod{32}$, the last card in the deck will be removed instead of being placed to the bottom, with $125-63=62$ cards remaining. Because of this, when Round 6 begins, we cannot follow our normal procedure, since the top card of the Round 6 deck would have been moved to the bottom! Therefore, when we are using our sieve with $I\equiv 32\pmod{64}$ and $I\equiv 64\pmod{64}$, the order at which the remainders are presented have flipped, so all the cards with indices that are multiples of 64 will be removed, while all the cards with indices that are 32 more than a multiple of 64 will remain. The $62$ cards from Round 6 will be reduced to $31$, and the last card in the deck will be removed just like in Round 5, which means Round 7 will be affected the same way. Of the choices of $I\equiv 32\pmod{128}$ and $I\equiv 32+64=96\pmod{128}$, we will remove the latter, leaving behind the cards with indices that are 32 more than a multiple of 128. However, since 31 is an odd number, the last card of the deck will NOT be removed, which means our sieving process will return to normal after Round 7, with $31-15=16$ cards remaining. Since $16$ is a perfect power of $2$, we will not need to worry about this scenario again in the following rounds.

Round 8: $I\equiv 32\pmod{256}$ removed; $I\equiv 32+128=160\pmod{256}$ remains; $16-8=8$ cards left.

Round 9: $I\equiv 160\pmod{512}$ removed; $I\equiv 160+256=416\pmod{512}$ remains; $8-4=4$ cards left.

Round 10: $I\equiv 416\pmod{1024}$ removed; $I\equiv 416+512=928\pmod{1024}$ remains; $4-2=2$ cards left.

Round 11: $I\equiv 928\pmod{2048}$ removed; $I\equiv 928+1024=1952\pmod{2048}$ remains; $2-1=1$ card left.

Round 12: The last card in position $1952$ is sorted into place (This is card #$2000$!).

It is obvious that the single card put into place in Round 11 is the second-to-last card in the deck, which is our target #$1999$. Then, its position in the original deck leaves a remainder of $928$ when divided by $2056$. It is easy to see that $928$ is the only index that satisfies this, so there will be $928-1=\boxed{927}$ cards above card #$1999$.

~chz3369