Given a table with 2nān 1*1 squares ( 2n rows and n column). In any square we put a number in {1, -1} such that no two rows are the same. Then we change numbers in some squares by 0. Prove that in new table we can choose some rows such that sum of all numbers in these rows equal to 0. vectorcombinatorics proposedcombinatorics