olymmath

OMM 2004 Problem 6

    What is the maximum number of possible change of directions in a path traveling on the edges of a rectangular array of 2004×20042004 \times 2004 , if the path does not cross the same place twice?.

    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 mx-omm/2004/p6 · Tag G13QCBQPEX · Edit this page on GitHub · Keys: j next, k previous