olymmath

KURSCHAK 1979 Problem 3

    An n×nn \times n array of letters is such that no two rows are the same. Show that it must be possible to omit a column, so that the remaining table has no two rows the same.

    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 kurschak/1979/p3 · Tag 6AEMPESXN4 · Edit this page on GitHub · Keys: j next, k previous