不等式讲义-The inequality of Suranyi.pdfVIP

About Sur´anyi’s Inequality Mih´aly Bencze Str. Harmanului 6, 505600 Sacele, Jud Brasov, Romania Abstract. In the Mikl´os Schweitzer Mathematical Competition (Hungary) Professor J´anos Sur´anyi proposed the following problem, which is interesting and presents an aspect of a theorem. In this paper we present a new demonstration, some interesting applications and a generalization. Theorem 1. (J´anos Sur´anyi). If xk 0 (k = 1, 2, ..., n) then the following inequality holds: n n n n (n − 1) xn + n xk ≥ xk xn−1 . k k k=1 k=1 k=1 k=1 . Proof. Using mathematical induction, for n = 2 we obtain x2 + x2 + 2x x ≥ 1 2 1 2 (x + x )2 , which is true. 1 2 We suppose that is true for n and we prove for n + 1. Because the inequality is symmetric and homogeneous we can suppose that x1 ≥ x2 ≥ ... ≥ xn+1 and x1 +x2 + ...+xn = 1, so we must prove the following inequality: n+1 n+1 n+1 n+1 n xn+1 + (n + 1) xk ≥ xk xn k k k=1 k=1 k=1 k=1 which can be written in the form n n n n n xn+1 +nxn+1 +nxn+1 xk +xn+1 xk − (1 + xn+1) xn + xn ≥ 0 k n+1 k n+1 k=1 k=1 k=1 k=1 From the inductive condition holds