Imo 2010

This is the wiki page for the mini-polymath2 project, which seeks solutions to Question 5 of the 2010 International Mathematical Olympiad.

The project will start at 16:00 UTC July 8, and is hosted at the polymath blog. A discussion thread is hosted at Terry Tao's blog.

Rules

This project will follow the usual polymath rules. In particular:

• Everyone is welcome to participate, though people who have already seen an external solution to the problem should probably refrain from giving spoilers throughout the experiment.
• This is a team effort, not a race between individuals. Rather than work for extended periods of time in isolation from the rest of the project, the idea is to come up with short observations (or to carry an observation of another participant further) and then report back what one gets to the rest of the team. Partial results or even failures can be worth reporting.
• Participants are encouraged to update the wiki, or to summarise progress within threads, for the benefit of others.

Threads

Discussion and planning:

• Future mini-polymath project: 2010 IMO Q6? June 12, 2010.
• Organising mini-polymath2 June 21, 2010.
• Mini-polymath2 start time, June 27, 2010.
• Mini-polymath2 discussion thread, July 8 2010.

Research:

• Minipolymath2 project: IMO 2010 Q5, July 8 2010.

The question

The question to be solved is Question 5 of the 2010 International Mathematical Olympiad:

Problem In each of six boxes [math]\displaystyle{ B_1, B_2, B_3, B_4, B_5, B_6 }[/math] there is initially one coin. There are two types of operation allowed:

Type 1: Choose a nonempty box [math]\displaystyle{ B_j }[/math] with [math]\displaystyle{ 1 \leq j \leq 5 }[/math]. Remove one coin from [math]\displaystyle{ B_j }[/math] and add two coins to [math]\displaystyle{ B_{j+1} }[/math].

Type 2: Choose a nonempty box [math]\displaystyle{ B_k }[/math] with [math]\displaystyle{ 1 \leq k �\leq 4 }[/math]. Remove one coin from [math]\displaystyle{ B_k }[/math] and exchange the contents of (possibly empty) boxes [math]\displaystyle{ B_{k+1} }[/math] and [math]\displaystyle{ B_{k+2} }[/math].

Determine whether there is a finite sequence of such operations that results in boxes [math]\displaystyle{ B_1, B_2, B_3, B_4, B_5 }[/math] being empty and box [math]\displaystyle{ B_6 }[/math] containing exactly [math]\displaystyle{ 2010^{2010^{2010}} }[/math] coins. (Note that [math]\displaystyle{ a^{b^c} := a^{(b^c)} }[/math].)

Observations and partial results

• If the left-most box [math]\displaystyle{ B_1 }[/math] becomes empty, then it cannot ever become non-empty again.

Possible strategies

• Define the worth W of a state to be [math]\displaystyle{ W = B_6 + 2 B_5 + 4 B_4 + 8 B_3 + 16 B_2 + 32 B_1 }[/math]. Then the initial worth is 63, the final desired worth is [math]\displaystyle{ 2010^{2010^{2010}} }[/math], and the Type 1 move does not affect the worth. On the other hand, the Type 2 move increases the worth when [math]\displaystyle{ B_{j+2} - B_{j+1} \geq 4 }[/math].

• Try to use Type 1 and Type 2 as primitives to create more advanced moves. For instance, calling the Type 1 move [math]\displaystyle{ [X,Y] \mapsto [X-1,Y+2] }[/math] and the Type 2 move [math]\displaystyle{ [X,Y,Z] \mapsto [X-1,Z,Y] }[/math], we can create the move [math]\displaystyle{ [1,X,Y] \mapsto [0,0,X+2Y] }[/math] by applying Type 2 once and then Type 1 Y times.