Hosted on GitHub Pages using the Dinky theme
Given an m x n array of real numbers. You may change the sign of all numbers in a row or of all numbers in a column. Prove that by repeated changes you can obtain an array with all row and column sums non-negative.
This puzzle is the problem 7 in 1st All Russian Mathematical Olympiad Problems 1961.