In what follows, indices are reduced modulo n. Consider the n differences xk+1−xk, k=1,…,n. Since n is odd, there exists an index j such that (xj+1−xj)(xj+2−xj+1)≥0. Without loss of generality, we may and will assume both factors non-negative, so xj≤xj+1≤xj+2. Consequently,
k=1,…,nmin(xk2+xk+12)≤xj2+xj+12≤2xj+12≤2xj+1xj+2≤k=1,…,nmax(2xkxk+1).