olymmath

INMO 1996 Problem 6

    There is a 2n×2n2n \times 2n array (matrix) consisting of 0′s0's and 1′s1's and there are exactly 3n3n zeroes. Show that it is possible to remove all the zeroes by deleting some nn rows and some nn columns.

    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 in-inmo/1996/p6 · Tag MEQBSCMAGW · Edit this page on GitHub · Keys: j next, k previous