Let be given r1,r2,…,rn∈R. Show that there exists a subset I of {1,2,…,n} which which has one or two elements in common with the sets {i,i+1,i+2},(1≤i≤n−2) such that
\left| {\mathop \sum \limits_{i \in I} {r_i}} \right| \geqslant \frac{1}{6}\mathop \sum \limits_{i = 1}^n \left| {{r_i}} \right|. combinatoricscombinatorics proposed