let $x_{i}\in R,i=1,2,\cdots,n$,and $p_{i}\ge 0,i=1,2,\cdots,n$,such $$p_{1}+p_{2}+\cdots+p_{n}=1$$ and define $$S_{k}=\sum_{i=1}^{n}p_{i}x^k_{i}-\left(\sum_{i=1}^{n}p_{i}x_{i}\right)^k$$
show that $$S_{2m}S_{2m+2}\ge\left(1-\dfrac{1}{m(2m+1)}\right)S^2_{2m+1},m\in N^{+}$$
This problem is my student ask me,and I don't prove it.
when I see this $$p_{1}+p_{2}+\cdots+p_{n}=1$$ and define $$S_{k}=\sum_{i=1}^{n}p_{i}x^k_{i}-\left(\sum_{i=1}^{n}p_{i}x_{i}\right)^k$$ I can consider this probability theory:the Univariate discrete random variable $$E(X^k)-(E(X))^k=S_{k}$$ then prove $$\left(E(X^{2m})-(E(X))^{2m}\right)\left(E(x^{2m+2})-(E(X))^{2m+2}\right)\ge\left(1-\dfrac{1}{m(2m+1)}\right)\left(E(X^{2m+1})-(E(X))^{2m+1}\right)^2$$
But also I can't prove this ,Thank you