Let $a_i,b_i,c_i$ be $>0$ ($1 \leq i \leq n$). Then we have $$ \sum (a_i+b_i+c_i) \sum \frac{a_i b_i + b_i c_i + c_i a_i}{a_i+b_i+c_i} \sum \frac{a_i b_i c_i}{a_i b_i+b_i c_i + c_i a_i} \leq \sum a_i \sum b_i \sum c_i $$
This is problem #68 in Hardy, Polya and Littlewood's Inequality. It can be proved by using convexity (see e.g. http://www.win.tue.nl/~gwoegi/papers/cauchy.pdf) but I would like to see an elementary proof of this inequality. The problem is found in the chapter which deals with elementary means and associated inequality (such as arithmetic-geometric mean, Hölder and Minkowski's inequalities, ...). So there should be an elementary derivation of this inequality from some other well-known result. Of course we can rewrite the proof which relies on convexity but this is cheating. For example it is easy to prove by induction that $$ \sum \frac{a_i b_i + b_i c_i + c_i a_i}{a_i+b_i+c_i} \leq \frac{\sum a_i \sum b_i+ \sum b_i \sum c_i + \sum c_i \sum a_i}{\sum a_i+b_i+c_i}$$ and $$ \sum \frac{a_i b_i c_i}{a_i b_i+b_i c_i+c_i a_i} \leq \frac{\sum a_i \sum b_i \sum c_i}{\sum a_i \sum b_i+ \sum b_i \sum c_i + \sum c_i \sum a_i}$$ so we get the result, but we knew these inequalities were true in the first place thanks to convexity.