olymmath

HMMT 2005 C10

  • Combinatorics
  • Answer

You start out with a big pile of 320043^{2004} cards, with the numbers 1,2,3,…,320041,2,3, \ldots, 3^{2004} written on them. You arrange the cards into groups of three any way you like; from each group, you keep the card with the largest number and discard the other two. You now again arrange these 320033^{2003} remaining cards into groups of three any way you like, and in each group, keep the card with the smallest number and discard the other two. You now have 320023^{2002} cards, and you again arrange these into groups of three and keep the largest number in each group. You proceed in this manner, alternating between keeping the largest number and keeping the smallest number in each group, until you have just one card left.

How many different values are possible for the number on this final card?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

3^{2004}-2 \cdot 3^{1002}+2

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2005/c10 · Tag 4CJ0YXSEQX · Edit this page on GitHub · Keys: j next, k previous