olymmath

XK-MO 2012 Problem 5

    The following square table is given with seven raws and seven columns: a11,a12,a13,a14,a15,a16,a17a_{11},a_{12},a_{13},a_{14},a_{15},a_{16},a_{17} a21,a22,a23,a24,a25,a26,a27a_{21},a_{22},a_{23},a_{24},a_{25},a_{26},a_{27} a31,a32,a33,a34,a35,a36,a37a_{31},a_{32},a_{33},a_{34},a_{35},a_{36},a_{37} a41,a42,a43,a44,a45,a46,a47a_{41},a_{42},a_{43},a_{44},a_{45},a_{46},a_{47} a51,a52,a53,a54,a55,a56,a57a_{51},a_{52},a_{53},a_{54},a_{55},a_{56},a_{57} a61,a62,a63,a64,a65,a66,a67a_{61},a_{62},a_{63},a_{64},a_{65},a_{66},a_{67} a71,a72,a73,a74,a75,a76,a77a_{71},a_{72},a_{73},a_{74},a_{75},a_{76},a_{77} Suppose aij∈{0,1},∀i,j∈{1,...,7}a_{ij}\in\{0,1\},\forall i,j\in\{1,...,7\} . Prove that there exists at least one combination of the numbers 11 and 00 so that the following conditions hold: (i)(i) Each raw and each column has exactly three 11 's. (ii)(ii) ∑j=17aljaij=1,∀l,i∈{1,...,7}\sum_{j=1}^7a_{lj}a_{ij}=1,\forall l,i\in\{1,...,7\} and l≠il\neq i .(so for any two distinct raws there is exactly one rr so that the both raws have 11 in the rr -th place). (iii)(iii) ∑i=17aijaik=1,∀j,k∈{1,...,7}\sum_{i=1}^7a_{ij}a_{ik}=1,\forall j,k\in\{1,...,7\} and j≠kj\neq k .(so for any two distinct columns there is exactly one ss so that the both columns have 11 in the ss -th place).

    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 xk-mo/2012/p5 · Tag TAX7ASYWPC · Edit this page on GitHub · Keys: j next, k previous