2001 Austrian-Polish Mathematics Competition
Source: problem 5
September 19, 2006
inequalitiesrearrangement inequalitycombinatorics unsolvedcombinatorics
Problem Statement
The fields of the chessboard are numbered from to in the following manner: For the field numbered by can be reached from the field numbered by by one move of the knight. Let us choose positive real numbers . For each white field numbered by define the number and for each black field numbered by define the number where and . Prove that