This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1

2012 Tournament of Towns, 4
Each entry in an $n\times n$ table is either $+$ or $-$. At each step, one can choose a row or a column and reverse all signs in it. From the initial position, it is possible to obtain the table in which all signs are $+$. Prove that this can be accomplished in at most $n$ steps.
square table signs table combinatorics