olymmath

OBM 2004 Problem 4

    Consider all the ways of writing exactly ten times each of the numbers 0,1,2,…,90, 1, 2, \ldots , 9 in the squares of a 10×1010 \times 10 board. Find the greatest integer nn with the property that there is always a row or a column with nn different numbers.

    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 br-obm/2004/p4 · Tag 9ME76T3WK8 · Edit this page on GitHub · Keys: j next, k previous