MathDB
2001 Austrian-Polish Mathematics Competition

Source: problem 5

September 19, 2006
inequalitiesrearrangement inequalitycombinatorics unsolvedcombinatorics

Problem Statement

The fields of the 8×88\times 8 chessboard are numbered from 11 to 6464 in the following manner: For i=1,2,,63i=1,2,\cdots,63 the field numbered by i+1i+1 can be reached from the field numbered by ii by one move of the knight. Let us choose positive real numbers x1,x2,,x64x_{1},x_{2},\cdots,x_{64}. For each white field numbered by ii define the number yi=1+xi2xi12xi+13y_{i}=1+x_{i}^{2}-\sqrt[3]{x_{i-1}^{2}x_{i+1}} and for each black field numbered by jj define the number yj=1+xj2xj1xj+123y_{j}=1+x_{j}^{2}-\sqrt[3]{x_{j-1}x_{j+1}^{2}} where x0=x64x_{0}=x_{64} and x1=x65x_{1}=x_{65}. Prove that i=164yi48\sum_{i=1}^{64}y_{i}\geq 48