MathDB
sum of products not zero

Source: Greek MO 2007

March 5, 2007
combinatorics unsolvedcombinatorics

Problem Statement

Given a 2007×20072007\times 2007 array of numbers 11 and 1-1, let AiA_{i} denote the product of the entries in the iith row, and BjB_{j} denote the product of the entries in the jjth column. Show that A1+A2++A2007+B1+B2++B20070.A_{1}+A_{2}+\cdots +A_{2007}+B_{1}+B_{2}+\cdots +B_{2007}\neq 0.