MathDB
Turkish NMO First Round - 2012 Problem - 16 {Combinatorics}

Source:

July 1, 2012

Problem Statement

Every cell of 8×88\times8 chessboard contains either 11 or 1-1. It is known that there are at least four rows such that the sum of numbers inside the cells of those rows is positive. At most how many columns are there such that the sum of numbers inside the cells of those columns is less than 3-3?
<spanclass=latexbold>(A)</span> 6<spanclass=latexbold>(B)</span> 5<spanclass=latexbold>(C)</span> 4<spanclass=latexbold>(D)</span> 3<spanclass=latexbold>(E)</span> 2 <span class='latex-bold'>(A)</span>\ 6 \qquad <span class='latex-bold'>(B)</span>\ 5 \qquad <span class='latex-bold'>(C)</span>\ 4 \qquad <span class='latex-bold'>(D)</span>\ 3 \qquad <span class='latex-bold'>(E)</span>\ 2