olymmath

BY-MO 2001 Problem 6

    Let nn be a positive integer. Each square of a (2n−1)×(2n−1)(2n-1) \times (2n - 1) square board contains an arrow, either pointing up, down,to the left, or to the right. A beetle sits in one of the cells. Each year it creeps from one square in the direction of the arrow in that square, either reaching another square or leaving the board. Each time the beetle moves, the arrow in the square it leaves turns π2\frac{\pi}{2} clockwise. Prove that the beetle leaves the board in at most 23n−1(n−1)!−42^{3n-1}(n-1)!-4 years after it first moves.

    Dataset text AI-MO AoPS. Quoted with source.

    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 by-mo/2001/p6 · Tag 8QR9C2YNFN · Edit this page on GitHub · Keys: j next, k previous