olymmath

SE-SKOLORNAS 2004 Problem 5

    A square of side n≥2n \ge 2 is divided into n2n^2 unit squares ( n∈Nn \in N ). One draws n−1n-1 lines so that the interior of each of the unit squares is cut by at least one of these lines. (a) Give an example of such a configuration for some nn . (b) Show that some two of the lines must meet inside the square.

    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 se-skolornas/2004/p5 · Tag W8RV11XX96 · Edit this page on GitHub · Keys: j next, k previous