olymmath

CL-MO 2016 Problem 3

    The giraffe is a chess piece that moves 44 squares in one direction and then a box in a perpendicular direction. What is the smallest value of nn such that the giraffe that starts from a corner on an n×nn \times n board can visit all the squares of said board?

    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 cl-mo/2016/p3 · Tag 59M1FZTTB1 · Edit this page on GitHub · Keys: j next, k previous