MathDB
Prove that there are at least three squares - [ILL 1977]

Source:

January 11, 2011
combinatorics unsolvedcombinatorics

Problem Statement

The numbers 1,2,3,…,641, 2, 3,\ldots , 64 are placed on a chessboard, one number in each square. Consider all squares on the chessboard of size 2×2.2 \times 2. Prove that there are at least three such squares for which the sum of the 44 numbers contained exceeds 100.100.
Back to ProblemsView on AoPS