Let n≥3 be a positive integer. Inside a n×n array there are placed n2 positive numbers with sum n3. Prove that we can find a square 2×2 of 4 elements of the array, having the sides parallel with the sides of the array, and for which the sum of the elements in the square is greater than 3n.
Radu Gologan geometryrectanglecombinatorics proposedcombinatorics