The fields of the 8×8 chessboard are numbered from 1 to 64 in the following manner: For i=1,2,⋯,63 the field numbered by i+1 can be reached from the field numbered by i by one move of the knight. Let us choose positive real numbers x1,x2,⋯,x64. For each white field numbered by i define the number yi=1+xi2−3xi−12xi+1 and for each black field numbered by j define the number yj=1+xj2−3xj−1xj+12 where x0=x64 and x1=x65. Prove that i=1∑64yi≥48 inequalitiesrearrangement inequalitycombinatorics unsolvedcombinatorics